MCC'2024- Execution of r468-smll-171620167500322

About the Execution of LTSMin+red for AutonomousCar-PT-07b

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
2220.172	109216.00	187624.00	458.20	??????????????T?	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r468-smll-171620167500322.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 AutonomousCar-PT-07b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167500322
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 17:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 17:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 17:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 17:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 334K 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 AutonomousCar-PT-07b-CTLFireability-2024-00
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2024-01
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2024-02
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2024-03
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2024-04
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2024-05
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2024-06
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2024-07
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2024-08
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2024-09
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2024-10
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2024-11
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2023-12
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2023-13
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2023-14
FORMULA_NAME AutonomousCar-PT-07b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717215390430

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-07b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:16:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 04:16:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:16:33] [INFO ] Load time of PNML (sax parser for PT used): 285 ms
[2024-06-01 04:16:33] [INFO ] Transformed 323 places.
[2024-06-01 04:16:33] [INFO ] Transformed 846 transitions.
[2024-06-01 04:16:33] [INFO ] Found NUPN structural information;
[2024-06-01 04:16:33] [INFO ] Parsed PT model containing 323 places and 846 transitions and 5865 arcs in 653 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
Support contains 75 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 846/846 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 280 transition count 803
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 280 transition count 803
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 282 place count 280 transition count 607
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 287 place count 275 transition count 602
Iterating global reduction 1 with 5 rules applied. Total rules applied 292 place count 275 transition count 602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 293 place count 274 transition count 601
Iterating global reduction 1 with 1 rules applied. Total rules applied 294 place count 274 transition count 601
Applied a total of 294 rules in 211 ms. Remains 274 /323 variables (removed 49) and now considering 601/846 (removed 245) transitions.
// Phase 1: matrix 601 rows 274 cols
[2024-06-01 04:16:34] [INFO ] Computed 12 invariants in 46 ms
[2024-06-01 04:16:34] [INFO ] Implicit Places using invariants in 555 ms returned []
[2024-06-01 04:16:34] [INFO ] Invariant cache hit.
[2024-06-01 04:16:35] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 1291 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-06-01 04:16:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/274 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 04:16:50] [INFO ] Deduced a trap composed of 24 places in 571 ms of which 68 ms to minimize.
[2024-06-01 04:16:51] [INFO ] Deduced a trap composed of 71 places in 460 ms of which 5 ms to minimize.
[2024-06-01 04:16:51] [INFO ] Deduced a trap composed of 39 places in 425 ms of which 4 ms to minimize.
[2024-06-01 04:16:52] [INFO ] Deduced a trap composed of 25 places in 337 ms of which 5 ms to minimize.
[2024-06-01 04:16:52] [INFO ] Deduced a trap composed of 40 places in 346 ms of which 4 ms to minimize.
[2024-06-01 04:16:52] [INFO ] Deduced a trap composed of 41 places in 372 ms of which 6 ms to minimize.
[2024-06-01 04:16:53] [INFO ] Deduced a trap composed of 38 places in 374 ms of which 4 ms to minimize.
[2024-06-01 04:16:53] [INFO ] Deduced a trap composed of 42 places in 410 ms of which 4 ms to minimize.
[2024-06-01 04:16:54] [INFO ] Deduced a trap composed of 40 places in 409 ms of which 4 ms to minimize.
[2024-06-01 04:16:54] [INFO ] Deduced a trap composed of 40 places in 358 ms of which 3 ms to minimize.
[2024-06-01 04:16:54] [INFO ] Deduced a trap composed of 42 places in 434 ms of which 5 ms to minimize.
[2024-06-01 04:16:55] [INFO ] Deduced a trap composed of 38 places in 446 ms of which 4 ms to minimize.
[2024-06-01 04:16:56] [INFO ] Deduced a trap composed of 26 places in 483 ms of which 5 ms to minimize.
[2024-06-01 04:16:56] [INFO ] Deduced a trap composed of 29 places in 418 ms of which 4 ms to minimize.
[2024-06-01 04:16:56] [INFO ] Deduced a trap composed of 28 places in 483 ms of which 4 ms to minimize.
[2024-06-01 04:16:57] [INFO ] Deduced a trap composed of 21 places in 465 ms of which 5 ms to minimize.
[2024-06-01 04:16:57] [INFO ] Deduced a trap composed of 44 places in 422 ms of which 4 ms to minimize.
[2024-06-01 04:16:58] [INFO ] Deduced a trap composed of 47 places in 434 ms of which 5 ms to minimize.
[2024-06-01 04:16:58] [INFO ] Deduced a trap composed of 47 places in 440 ms of which 4 ms to minimize.
[2024-06-01 04:16:59] [INFO ] Deduced a trap composed of 42 places in 328 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 04:17:00] [INFO ] Deduced a trap composed of 25 places in 482 ms of which 5 ms to minimize.
[2024-06-01 04:17:01] [INFO ] Deduced a trap composed of 52 places in 512 ms of which 5 ms to minimize.
[2024-06-01 04:17:02] [INFO ] Deduced a trap composed of 41 places in 437 ms of which 4 ms to minimize.
[2024-06-01 04:17:02] [INFO ] Deduced a trap composed of 43 places in 380 ms of which 3 ms to minimize.
[2024-06-01 04:17:02] [INFO ] Deduced a trap composed of 50 places in 358 ms of which 4 ms to minimize.
[2024-06-01 04:17:03] [INFO ] Deduced a trap composed of 60 places in 397 ms of which 5 ms to minimize.
[2024-06-01 04:17:03] [INFO ] Deduced a trap composed of 42 places in 417 ms of which 5 ms to minimize.
[2024-06-01 04:17:04] [INFO ] Deduced a trap composed of 50 places in 406 ms of which 5 ms to minimize.
[2024-06-01 04:17:04] [INFO ] Deduced a trap composed of 45 places in 356 ms of which 4 ms to minimize.
[2024-06-01 04:17:05] [INFO ] Deduced a trap composed of 50 places in 452 ms of which 4 ms to minimize.
[2024-06-01 04:17:05] [INFO ] Deduced a trap composed of 49 places in 393 ms of which 4 ms to minimize.
[2024-06-01 04:17:06] [INFO ] Deduced a trap composed of 57 places in 385 ms of which 4 ms to minimize.
[2024-06-01 04:17:06] [INFO ] Deduced a trap composed of 31 places in 351 ms of which 4 ms to minimize.
[2024-06-01 04:17:06] [INFO ] Deduced a trap composed of 31 places in 304 ms of which 3 ms to minimize.
[2024-06-01 04:17:07] [INFO ] Deduced a trap composed of 41 places in 365 ms of which 5 ms to minimize.
[2024-06-01 04:17:07] [INFO ] Deduced a trap composed of 53 places in 397 ms of which 5 ms to minimize.
[2024-06-01 04:17:08] [INFO ] Deduced a trap composed of 32 places in 412 ms of which 5 ms to minimize.
[2024-06-01 04:17:08] [INFO ] Deduced a trap composed of 38 places in 418 ms of which 4 ms to minimize.
SMT process timed out in 33324ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 33388ms
Starting structural reductions in LTL mode, iteration 1 : 274/323 places, 601/846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34947 ms. Remains : 274/323 places, 601/846 transitions.
Support contains 75 out of 274 places after structural reductions.
[2024-06-01 04:17:09] [INFO ] Flatten gal took : 237 ms
[2024-06-01 04:17:09] [INFO ] Flatten gal took : 132 ms
[2024-06-01 04:17:09] [INFO ] Input system was already deterministic with 601 transitions.
RANDOM walk for 40000 steps (132 resets) in 3010 ms. (13 steps per ms) remains 41/77 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (9 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 40/40 properties
[2024-06-01 04:17:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp50 is UNSAT
At refinement iteration 1 (OVERLAPS) 223/274 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 601/875 variables, 274/286 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/875 variables, 0/286 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 0/875 variables, 0/286 constraints. Problems are: Problem set: 2 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 875/875 variables, and 286 constraints, problems are : Problem set: 2 solved, 38 unsolved in 2761 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 224/274 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 38 unsolved
[2024-06-01 04:17:14] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 2 ms to minimize.
[2024-06-01 04:17:15] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 3 ms to minimize.
Problem AtomicPropp14 is UNSAT
[2024-06-01 04:17:15] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 2 ms to minimize.
[2024-06-01 04:17:15] [INFO ] Deduced a trap composed of 21 places in 242 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 4/16 constraints. Problems are: Problem set: 3 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/16 constraints. Problems are: Problem set: 3 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 601/875 variables, 274/290 constraints. Problems are: Problem set: 3 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/875 variables, 37/327 constraints. Problems are: Problem set: 3 solved, 37 unsolved
[2024-06-01 04:17:18] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 875/875 variables, and 328 constraints, problems are : Problem set: 3 solved, 37 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 37/40 constraints, Known Traps: 5/5 constraints]
After SMT, in 8272ms problems are : Problem set: 3 solved, 37 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 601/601 transitions.
Graph (trivial) has 199 edges and 274 vertex of which 4 / 274 are part of one of the 2 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1093 edges and 272 vertex of which 269 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.11 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 93 rules applied. Total rules applied 95 place count 269 transition count 503
Reduce places removed 91 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 129 rules applied. Total rules applied 224 place count 178 transition count 465
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 23 rules applied. Total rules applied 247 place count 156 transition count 464
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 250 place count 155 transition count 462
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 251 place count 154 transition count 462
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 251 place count 154 transition count 454
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 267 place count 146 transition count 454
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 274 place count 139 transition count 447
Iterating global reduction 5 with 7 rules applied. Total rules applied 281 place count 139 transition count 447
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 345 place count 107 transition count 415
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 346 place count 107 transition count 414
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 348 place count 106 transition count 413
Free-agglomeration rule applied 19 times.
Iterating global reduction 6 with 19 rules applied. Total rules applied 367 place count 106 transition count 394
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 386 place count 87 transition count 394
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 389 place count 87 transition count 394
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 390 place count 86 transition count 393
Applied a total of 390 rules in 359 ms. Remains 86 /274 variables (removed 188) and now considering 393/601 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 361 ms. Remains : 86/274 places, 393/601 transitions.
RANDOM walk for 40000 steps (1481 resets) in 1118 ms. (35 steps per ms) remains 30/37 properties
BEST_FIRST walk for 4004 steps (14 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (15 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (12 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (13 resets) in 21 ms. (181 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (16 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (13 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (13 resets) in 13 ms. (285 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (16 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (12 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (16 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (15 resets) in 13 ms. (286 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4003 steps (14 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (15 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (11 resets) in 14 ms. (266 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4004 steps (13 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (16 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (16 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (14 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (16 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (16 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (13 resets) in 18 ms. (210 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4002 steps (12 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (14 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (16 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (13 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (13 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (11 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
// Phase 1: matrix 393 rows 86 cols
[2024-06-01 04:17:20] [INFO ] Computed 12 invariants in 5 ms
[2024-06-01 04:17:20] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 44/84 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 392/476 variables, 84/95 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 3/479 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-01 04:17:21] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/479 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 0/479 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 100 constraints, problems are : Problem set: 0 solved, 27 unsolved in 1870 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 86/86 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 44/84 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 392/476 variables, 84/95 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 27/122 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 3/479 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/479 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/479 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 0/479 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 479/479 variables, and 127 constraints, problems are : Problem set: 0 solved, 27 unsolved in 9676 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 86/86 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 1/1 constraints]
After SMT, in 11976ms problems are : Problem set: 0 solved, 27 unsolved
Fused 27 Parikh solutions to 26 different solutions.
Parikh walk visited 0 properties in 10349 ms.
Support contains 40 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 393/393 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 86 transition count 392
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 85 transition count 392
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 84 transition count 391
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 84 transition count 390
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 9 place count 82 transition count 388
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 11 place count 82 transition count 386
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 13 place count 80 transition count 386
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 14 place count 80 transition count 386
Applied a total of 14 rules in 73 ms. Remains 80 /86 variables (removed 6) and now considering 386/393 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 80/86 places, 386/393 transitions.
RANDOM walk for 40000 steps (1577 resets) in 645 ms. (61 steps per ms) remains 25/27 properties
BEST_FIRST walk for 4004 steps (15 resets) in 10 ms. (364 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (16 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (14 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (17 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (16 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (15 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (16 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (15 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (16 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (16 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (16 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (16 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (13 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (14 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (15 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (15 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (16 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (15 resets) in 10 ms. (363 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (13 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (14 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (15 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (11 resets) in 12 ms. (308 steps per ms) remains 24/25 properties
// Phase 1: matrix 386 rows 80 cols
[2024-06-01 04:17:43] [INFO ] Computed 12 invariants in 5 ms
[2024-06-01 04:17:43] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 43/78 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 385/463 variables, 78/89 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 3/466 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-01 04:17:44] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 0/466 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 94 constraints, problems are : Problem set: 0 solved, 24 unsolved in 1604 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 80/80 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 43/78 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-01 04:17:45] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 385/463 variables, 78/90 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 24/114 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 3/466 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/466 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 0/466 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 466/466 variables, and 119 constraints, problems are : Problem set: 0 solved, 24 unsolved in 8316 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 80/80 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 2/2 constraints]
After SMT, in 10101ms problems are : Problem set: 0 solved, 24 unsolved
Fused 24 Parikh solutions to 23 different solutions.
Parikh walk visited 0 properties in 2334 ms.
Support contains 35 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 386/386 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 79 transition count 385
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 75 transition count 381
Applied a total of 10 rules in 33 ms. Remains 75 /80 variables (removed 5) and now considering 381/386 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 75/80 places, 381/386 transitions.
RANDOM walk for 40000 steps (2003 resets) in 756 ms. (52 steps per ms) remains 21/24 properties
BEST_FIRST walk for 4003 steps (19 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (20 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (19 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (16 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (19 resets) in 18 ms. (210 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (16 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (18 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (16 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (19 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (15 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (18 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (16 resets) in 14 ms. (266 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4004 steps (19 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (20 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (18 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (21 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (15 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (16 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
// Phase 1: matrix 381 rows 75 cols
[2024-06-01 04:17:56] [INFO ] Computed 12 invariants in 3 ms
[2024-06-01 04:17:56] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 46/68 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 377/445 variables, 68/78 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/445 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 11/456 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/456 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 88 constraints, problems are : Problem set: 0 solved, 19 unsolved in 944 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 46/68 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 377/445 variables, 68/78 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/445 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 11/456 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 19/107 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 0/456 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 107 constraints, problems are : Problem set: 0 solved, 19 unsolved in 3469 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 4557ms problems are : Problem set: 0 solved, 19 unsolved
Fused 19 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 2747 ms.
Support contains 22 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 381/381 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 75 transition count 380
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 74 transition count 380
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 16 place count 67 transition count 373
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 66 transition count 372
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 66 transition count 372
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 65 transition count 371
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 65 transition count 369
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 31 place count 63 transition count 362
Applied a total of 31 rules in 51 ms. Remains 63 /75 variables (removed 12) and now considering 362/381 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 63/75 places, 362/381 transitions.
RANDOM walk for 40000 steps (2140 resets) in 705 ms. (56 steps per ms) remains 12/19 properties
BEST_FIRST walk for 40004 steps (196 resets) in 74 ms. (533 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (237 resets) in 61 ms. (645 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40003 steps (197 resets) in 72 ms. (547 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (242 resets) in 96 ms. (412 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40004 steps (230 resets) in 82 ms. (481 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (187 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (229 resets) in 114 ms. (347 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (193 resets) in 95 ms. (416 steps per ms) remains 3/4 properties
// Phase 1: matrix 362 rows 63 cols
[2024-06-01 04:18:04] [INFO ] Computed 12 invariants in 4 ms
[2024-06-01 04:18:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 33/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 346/388 variables, 42/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 37/425 variables, 21/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 5/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/425 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 76 constraints, problems are : Problem set: 0 solved, 3 unsolved in 431 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 33/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 346/388 variables, 42/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 37/425 variables, 21/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 5/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/425 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 79 constraints, problems are : Problem set: 0 solved, 3 unsolved in 781 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1257ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1008 ms.
Support contains 9 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 362/362 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 59 transition count 332
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 59 transition count 332
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 59 transition count 330
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 58 transition count 329
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 19 place count 58 transition count 322
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 47 place count 51 transition count 301
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 50 transition count 300
Applied a total of 48 rules in 71 ms. Remains 50 /63 variables (removed 13) and now considering 300/362 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 50/63 places, 300/362 transitions.
RANDOM walk for 40000 steps (384 resets) in 412 ms. (96 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (52 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
// Phase 1: matrix 300 rows 50 cols
[2024-06-01 04:18:06] [INFO ] Computed 12 invariants in 3 ms
[2024-06-01 04:18:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 280/303 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 47/350 variables, 27/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/350 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 63 constraints, problems are : Problem set: 0 solved, 1 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 280/303 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 47/350 variables, 27/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/350 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 350/350 variables, and 64 constraints, problems are : Problem set: 0 solved, 1 unsolved in 396 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 665ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 300/300 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 48 transition count 284
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 48 transition count 284
Applied a total of 4 rules in 20 ms. Remains 48 /50 variables (removed 2) and now considering 284/300 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 48/50 places, 284/300 transitions.
RANDOM walk for 40000 steps (409 resets) in 493 ms. (80 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (52 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1562434 steps, run timeout after 3001 ms. (steps per millisecond=520 ) properties seen :0 out of 1
Probabilistic random walk after 1562434 steps, saw 216844 distinct states, run finished after 3010 ms. (steps per millisecond=519 ) properties seen :0
// Phase 1: matrix 284 rows 48 cols
[2024-06-01 04:18:10] [INFO ] Computed 12 invariants in 2 ms
[2024-06-01 04:18:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 266/289 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 43/332 variables, 25/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/332 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 61 constraints, problems are : Problem set: 0 solved, 1 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 266/289 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 43/332 variables, 25/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/332 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 332/332 variables, and 62 constraints, problems are : Problem set: 0 solved, 1 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 679ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 5 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 284/284 transitions.
Applied a total of 0 rules in 13 ms. Remains 48 /48 variables (removed 0) and now considering 284/284 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 48/48 places, 284/284 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 284/284 transitions.
Applied a total of 0 rules in 13 ms. Remains 48 /48 variables (removed 0) and now considering 284/284 (removed 0) transitions.
[2024-06-01 04:18:11] [INFO ] Invariant cache hit.
[2024-06-01 04:18:11] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-01 04:18:11] [INFO ] Invariant cache hit.
[2024-06-01 04:18:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:18:11] [INFO ] Implicit Places using invariants and state equation in 246 ms returned [43, 47]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 391 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 46/48 places, 283/284 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 45 transition count 282
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 45 transition count 281
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 44 transition count 281
Applied a total of 4 rules in 29 ms. Remains 44 /46 variables (removed 2) and now considering 281/283 (removed 2) transitions.
// Phase 1: matrix 281 rows 44 cols
[2024-06-01 04:18:11] [INFO ] Computed 10 invariants in 6 ms
[2024-06-01 04:18:11] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-06-01 04:18:11] [INFO ] Invariant cache hit.
[2024-06-01 04:18:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 04:18:12] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 44/48 places, 281/284 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 914 ms. Remains : 44/48 places, 281/284 transitions.
RANDOM walk for 40000 steps (255 resets) in 2624 ms. (15 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (52 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 588381 steps, run visited all 1 properties in 1010 ms. (steps per millisecond=582 )
Probabilistic random walk after 588381 steps, saw 90824 distinct states, run finished after 1015 ms. (steps per millisecond=579 ) properties seen :1
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2024-06-01 04:18:14] [INFO ] Flatten gal took : 46 ms
[2024-06-01 04:18:14] [INFO ] Flatten gal took : 47 ms
[2024-06-01 04:18:14] [INFO ] Input system was already deterministic with 601 transitions.
Support contains 69 out of 274 places (down from 70) after GAL structural reductions.
Computed a total of 46 stabilizing places and 47 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Graph (trivial) has 242 edges and 274 vertex of which 4 / 274 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 102 place count 271 transition count 497
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 140 rules applied. Total rules applied 242 place count 170 transition count 458
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 24 rules applied. Total rules applied 266 place count 147 transition count 457
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 269 place count 146 transition count 455
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 270 place count 145 transition count 455
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 270 place count 145 transition count 448
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 284 place count 138 transition count 448
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 292 place count 130 transition count 440
Iterating global reduction 5 with 8 rules applied. Total rules applied 300 place count 130 transition count 440
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 301 place count 129 transition count 433
Iterating global reduction 5 with 1 rules applied. Total rules applied 302 place count 129 transition count 433
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 304 place count 129 transition count 431
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 305 place count 128 transition count 431
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 78 rules applied. Total rules applied 383 place count 89 transition count 392
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 384 place count 89 transition count 391
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 396 place count 77 transition count 308
Iterating global reduction 8 with 12 rules applied. Total rules applied 408 place count 77 transition count 308
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 8 with 10 rules applied. Total rules applied 418 place count 77 transition count 298
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 423 place count 72 transition count 298
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 425 place count 71 transition count 297
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 426 place count 71 transition count 296
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 428 place count 69 transition count 294
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 429 place count 68 transition count 294
Applied a total of 429 rules in 139 ms. Remains 68 /274 variables (removed 206) and now considering 294/601 (removed 307) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 139 ms. Remains : 68/274 places, 294/601 transitions.
[2024-06-01 04:18:14] [INFO ] Flatten gal took : 35 ms
[2024-06-01 04:18:14] [INFO ] Flatten gal took : 35 ms
[2024-06-01 04:18:14] [INFO ] Input system was already deterministic with 294 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Graph (trivial) has 242 edges and 274 vertex of which 4 / 274 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 271 transition count 495
Reduce places removed 103 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 145 rules applied. Total rules applied 249 place count 168 transition count 453
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 274 place count 143 transition count 453
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 274 place count 143 transition count 447
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 286 place count 137 transition count 447
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 294 place count 129 transition count 439
Iterating global reduction 3 with 8 rules applied. Total rules applied 302 place count 129 transition count 439
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 303 place count 128 transition count 432
Iterating global reduction 3 with 1 rules applied. Total rules applied 304 place count 128 transition count 432
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 306 place count 128 transition count 430
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 307 place count 127 transition count 430
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 385 place count 88 transition count 391
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 386 place count 88 transition count 390
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 396 place count 78 transition count 322
Iterating global reduction 6 with 10 rules applied. Total rules applied 406 place count 78 transition count 322
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 6 with 10 rules applied. Total rules applied 416 place count 78 transition count 312
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 421 place count 73 transition count 312
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 423 place count 72 transition count 311
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 424 place count 72 transition count 310
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 425 place count 72 transition count 310
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 427 place count 70 transition count 308
Applied a total of 427 rules in 99 ms. Remains 70 /274 variables (removed 204) and now considering 308/601 (removed 293) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 100 ms. Remains : 70/274 places, 308/601 transitions.
[2024-06-01 04:18:14] [INFO ] Flatten gal took : 35 ms
[2024-06-01 04:18:14] [INFO ] Flatten gal took : 35 ms
[2024-06-01 04:18:14] [INFO ] Input system was already deterministic with 308 transitions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 265 transition count 592
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 265 transition count 592
Applied a total of 18 rules in 12 ms. Remains 265 /274 variables (removed 9) and now considering 592/601 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 265/274 places, 592/601 transitions.
[2024-06-01 04:18:14] [INFO ] Flatten gal took : 36 ms
[2024-06-01 04:18:14] [INFO ] Flatten gal took : 38 ms
[2024-06-01 04:18:15] [INFO ] Input system was already deterministic with 592 transitions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 263 transition count 590
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 263 transition count 590
Applied a total of 22 rules in 13 ms. Remains 263 /274 variables (removed 11) and now considering 590/601 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 263/274 places, 590/601 transitions.
[2024-06-01 04:18:15] [INFO ] Flatten gal took : 34 ms
[2024-06-01 04:18:15] [INFO ] Flatten gal took : 37 ms
[2024-06-01 04:18:15] [INFO ] Input system was already deterministic with 590 transitions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 263 transition count 590
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 263 transition count 590
Applied a total of 22 rules in 12 ms. Remains 263 /274 variables (removed 11) and now considering 590/601 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 263/274 places, 590/601 transitions.
[2024-06-01 04:18:15] [INFO ] Flatten gal took : 33 ms
[2024-06-01 04:18:15] [INFO ] Flatten gal took : 36 ms
[2024-06-01 04:18:15] [INFO ] Input system was already deterministic with 590 transitions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 263 transition count 590
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 263 transition count 590
Applied a total of 22 rules in 12 ms. Remains 263 /274 variables (removed 11) and now considering 590/601 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 263/274 places, 590/601 transitions.
[2024-06-01 04:18:15] [INFO ] Flatten gal took : 34 ms
[2024-06-01 04:18:15] [INFO ] Flatten gal took : 37 ms
[2024-06-01 04:18:15] [INFO ] Input system was already deterministic with 590 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Graph (trivial) has 245 edges and 274 vertex of which 4 / 274 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 271 transition count 495
Reduce places removed 103 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 145 rules applied. Total rules applied 249 place count 168 transition count 453
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 274 place count 143 transition count 453
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 274 place count 143 transition count 446
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 288 place count 136 transition count 446
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 296 place count 128 transition count 438
Iterating global reduction 3 with 8 rules applied. Total rules applied 304 place count 128 transition count 438
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 305 place count 127 transition count 431
Iterating global reduction 3 with 1 rules applied. Total rules applied 306 place count 127 transition count 431
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 308 place count 127 transition count 429
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 309 place count 126 transition count 429
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 387 place count 87 transition count 390
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 388 place count 87 transition count 389
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 401 place count 74 transition count 298
Iterating global reduction 6 with 13 rules applied. Total rules applied 414 place count 74 transition count 298
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 6 with 12 rules applied. Total rules applied 426 place count 74 transition count 286
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 432 place count 68 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 434 place count 67 transition count 285
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 435 place count 67 transition count 284
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 437 place count 65 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 438 place count 64 transition count 282
Applied a total of 438 rules in 86 ms. Remains 64 /274 variables (removed 210) and now considering 282/601 (removed 319) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 86 ms. Remains : 64/274 places, 282/601 transitions.
[2024-06-01 04:18:15] [INFO ] Flatten gal took : 27 ms
[2024-06-01 04:18:15] [INFO ] Flatten gal took : 29 ms
[2024-06-01 04:18:15] [INFO ] Input system was already deterministic with 282 transitions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 265 transition count 592
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 265 transition count 592
Applied a total of 18 rules in 11 ms. Remains 265 /274 variables (removed 9) and now considering 592/601 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 265/274 places, 592/601 transitions.
[2024-06-01 04:18:15] [INFO ] Flatten gal took : 34 ms
[2024-06-01 04:18:15] [INFO ] Flatten gal took : 42 ms
[2024-06-01 04:18:16] [INFO ] Input system was already deterministic with 592 transitions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 264 transition count 591
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 264 transition count 591
Applied a total of 20 rules in 14 ms. Remains 264 /274 variables (removed 10) and now considering 591/601 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 264/274 places, 591/601 transitions.
[2024-06-01 04:18:16] [INFO ] Flatten gal took : 38 ms
[2024-06-01 04:18:16] [INFO ] Flatten gal took : 40 ms
[2024-06-01 04:18:16] [INFO ] Input system was already deterministic with 591 transitions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 264 transition count 591
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 264 transition count 591
Applied a total of 20 rules in 12 ms. Remains 264 /274 variables (removed 10) and now considering 591/601 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 264/274 places, 591/601 transitions.
[2024-06-01 04:18:16] [INFO ] Flatten gal took : 33 ms
[2024-06-01 04:18:16] [INFO ] Flatten gal took : 36 ms
[2024-06-01 04:18:16] [INFO ] Input system was already deterministic with 591 transitions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 264 transition count 591
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 264 transition count 591
Applied a total of 20 rules in 8 ms. Remains 264 /274 variables (removed 10) and now considering 591/601 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 264/274 places, 591/601 transitions.
[2024-06-01 04:18:16] [INFO ] Flatten gal took : 30 ms
[2024-06-01 04:18:16] [INFO ] Flatten gal took : 34 ms
[2024-06-01 04:18:16] [INFO ] Input system was already deterministic with 591 transitions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 264 transition count 591
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 264 transition count 591
Applied a total of 20 rules in 11 ms. Remains 264 /274 variables (removed 10) and now considering 591/601 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 264/274 places, 591/601 transitions.
[2024-06-01 04:18:16] [INFO ] Flatten gal took : 31 ms
[2024-06-01 04:18:16] [INFO ] Flatten gal took : 32 ms
[2024-06-01 04:18:16] [INFO ] Input system was already deterministic with 591 transitions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 264 transition count 591
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 264 transition count 591
Applied a total of 20 rules in 10 ms. Remains 264 /274 variables (removed 10) and now considering 591/601 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 264/274 places, 591/601 transitions.
[2024-06-01 04:18:16] [INFO ] Flatten gal took : 30 ms
[2024-06-01 04:18:16] [INFO ] Flatten gal took : 35 ms
[2024-06-01 04:18:16] [INFO ] Input system was already deterministic with 591 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Graph (trivial) has 257 edges and 274 vertex of which 4 / 274 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 271 transition count 495
Reduce places removed 103 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 145 rules applied. Total rules applied 249 place count 168 transition count 453
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 274 place count 143 transition count 453
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 274 place count 143 transition count 447
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 286 place count 137 transition count 447
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 294 place count 129 transition count 439
Iterating global reduction 3 with 8 rules applied. Total rules applied 302 place count 129 transition count 439
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 303 place count 128 transition count 432
Iterating global reduction 3 with 1 rules applied. Total rules applied 304 place count 128 transition count 432
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 306 place count 128 transition count 430
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 307 place count 127 transition count 430
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 399 place count 81 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 400 place count 81 transition count 383
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 413 place count 68 transition count 291
Iterating global reduction 6 with 13 rules applied. Total rules applied 426 place count 68 transition count 291
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 6 with 10 rules applied. Total rules applied 436 place count 68 transition count 281
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 441 place count 63 transition count 281
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 443 place count 62 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 444 place count 62 transition count 279
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 445 place count 62 transition count 279
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 447 place count 60 transition count 277
Applied a total of 447 rules in 86 ms. Remains 60 /274 variables (removed 214) and now considering 277/601 (removed 324) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 86 ms. Remains : 60/274 places, 277/601 transitions.
[2024-06-01 04:18:17] [INFO ] Flatten gal took : 28 ms
[2024-06-01 04:18:17] [INFO ] Flatten gal took : 29 ms
[2024-06-01 04:18:17] [INFO ] Input system was already deterministic with 277 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Graph (trivial) has 259 edges and 274 vertex of which 4 / 274 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 271 transition count 494
Reduce places removed 104 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 146 rules applied. Total rules applied 251 place count 167 transition count 452
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 276 place count 142 transition count 452
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 276 place count 142 transition count 446
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 288 place count 136 transition count 446
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 296 place count 128 transition count 438
Iterating global reduction 3 with 8 rules applied. Total rules applied 304 place count 128 transition count 438
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 305 place count 127 transition count 431
Iterating global reduction 3 with 1 rules applied. Total rules applied 306 place count 127 transition count 431
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 308 place count 127 transition count 429
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 309 place count 126 transition count 429
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 401 place count 80 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 402 place count 80 transition count 382
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 415 place count 67 transition count 290
Iterating global reduction 6 with 13 rules applied. Total rules applied 428 place count 67 transition count 290
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 6 with 10 rules applied. Total rules applied 438 place count 67 transition count 280
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 443 place count 62 transition count 280
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 445 place count 61 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 446 place count 61 transition count 278
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 447 place count 61 transition count 278
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 449 place count 59 transition count 276
Applied a total of 449 rules in 81 ms. Remains 59 /274 variables (removed 215) and now considering 276/601 (removed 325) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 81 ms. Remains : 59/274 places, 276/601 transitions.
[2024-06-01 04:18:17] [INFO ] Flatten gal took : 27 ms
[2024-06-01 04:18:17] [INFO ] Flatten gal took : 28 ms
[2024-06-01 04:18:17] [INFO ] Input system was already deterministic with 276 transitions.
RANDOM walk for 40000 steps (2264 resets) in 1282 ms. (31 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (182 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 551329 steps, run visited all 1 properties in 1023 ms. (steps per millisecond=538 )
Probabilistic random walk after 551329 steps, saw 84504 distinct states, run finished after 1024 ms. (steps per millisecond=538 ) properties seen :1
FORMULA AutonomousCar-PT-07b-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 601/601 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 264 transition count 591
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 264 transition count 591
Applied a total of 20 rules in 10 ms. Remains 264 /274 variables (removed 10) and now considering 591/601 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 264/274 places, 591/601 transitions.
[2024-06-01 04:18:18] [INFO ] Flatten gal took : 29 ms
[2024-06-01 04:18:18] [INFO ] Flatten gal took : 29 ms
[2024-06-01 04:18:18] [INFO ] Input system was already deterministic with 591 transitions.
[2024-06-01 04:18:18] [INFO ] Flatten gal took : 33 ms
[2024-06-01 04:18:19] [INFO ] Flatten gal took : 33 ms
[2024-06-01 04:18:19] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 8 ms.
[2024-06-01 04:18:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 274 places, 601 transitions and 4199 arcs took 10 ms.
Total runtime 106324 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 : AutonomousCar-PT-07b-CTLFireability-2024-00
Could not compute solution for formula : AutonomousCar-PT-07b-CTLFireability-2024-01
Could not compute solution for formula : AutonomousCar-PT-07b-CTLFireability-2024-02
Could not compute solution for formula : AutonomousCar-PT-07b-CTLFireability-2024-03
Could not compute solution for formula : AutonomousCar-PT-07b-CTLFireability-2024-04
Could not compute solution for formula : AutonomousCar-PT-07b-CTLFireability-2024-05
Could not compute solution for formula : AutonomousCar-PT-07b-CTLFireability-2024-06
Could not compute solution for formula : AutonomousCar-PT-07b-CTLFireability-2024-07
Could not compute solution for formula : AutonomousCar-PT-07b-CTLFireability-2024-08
Could not compute solution for formula : AutonomousCar-PT-07b-CTLFireability-2024-09
Could not compute solution for formula : AutonomousCar-PT-07b-CTLFireability-2024-10
Could not compute solution for formula : AutonomousCar-PT-07b-CTLFireability-2024-11
Could not compute solution for formula : AutonomousCar-PT-07b-CTLFireability-2023-12
Could not compute solution for formula : AutonomousCar-PT-07b-CTLFireability-2023-13
Could not compute solution for formula : AutonomousCar-PT-07b-CTLFireability-2023-15

BK_STOP 1717215499646

--------------------
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
mcc2024
ctl formula name AutonomousCar-PT-07b-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/734/ctl_0_
ctl formula name AutonomousCar-PT-07b-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/734/ctl_1_
ctl formula name AutonomousCar-PT-07b-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/734/ctl_2_
ctl formula name AutonomousCar-PT-07b-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/734/ctl_3_
ctl formula name AutonomousCar-PT-07b-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/734/ctl_4_
ctl formula name AutonomousCar-PT-07b-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/734/ctl_5_
ctl formula name AutonomousCar-PT-07b-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/734/ctl_6_
ctl formula name AutonomousCar-PT-07b-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/734/ctl_7_
ctl formula name AutonomousCar-PT-07b-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/734/ctl_8_
ctl formula name AutonomousCar-PT-07b-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/734/ctl_9_
ctl formula name AutonomousCar-PT-07b-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/734/ctl_10_
ctl formula name AutonomousCar-PT-07b-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/734/ctl_11_
ctl formula name AutonomousCar-PT-07b-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/734/ctl_12_
ctl formula name AutonomousCar-PT-07b-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/734/ctl_13_
ctl formula name AutonomousCar-PT-07b-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/734/ctl_14_
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="AutonomousCar-PT-07b"
export BK_EXAMINATION="CTLFireability"
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 AutonomousCar-PT-07b, 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 r468-smll-171620167500322"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-07b.tgz
mv AutonomousCar-PT-07b 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 ;