Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.5M
-rw-r--r-- 1 mcc users 22K Apr 11 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 11 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 127K Apr 11 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 570K Apr 11 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 41K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 205K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 138K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 670K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.5M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717254706833

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:11:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:11:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:11:48] [INFO ] Load time of PNML (sax parser for PT used): 235 ms
[2024-06-01 15:11:48] [INFO ] Transformed 792 places.
[2024-06-01 15:11:48] [INFO ] Transformed 4268 transitions.
[2024-06-01 15:11:48] [INFO ] Parsed PT model containing 792 places and 4268 transitions and 28832 arcs in 393 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 38 ms.
[2024-06-01 15:11:48] [INFO ] Reduced 48 identical enabling conditions.
[2024-06-01 15:11:48] [INFO ] Reduced 352 identical enabling conditions.
[2024-06-01 15:11:48] [INFO ] Reduced 1768 identical enabling conditions.
[2024-06-01 15:11:48] [INFO ] Reduced 352 identical enabling conditions.
[2024-06-01 15:11:48] [INFO ] Reduced 1768 identical enabling conditions.
[2024-06-01 15:11:48] [INFO ] Reduced 48 identical enabling conditions.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
FORMULA PolyORBLF-PT-S04J06T08-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 514 out of 792 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 789 transition count 2100
Applied a total of 3 rules in 67 ms. Remains 789 /792 variables (removed 3) and now considering 2100/2100 (removed 0) transitions.
Running 2096 sub problems to find dead transitions.
[2024-06-01 15:11:48] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
// Phase 1: matrix 2068 rows 789 cols
[2024-06-01 15:11:49] [INFO ] Computed 55 invariants in 115 ms
[2024-06-01 15:11:49] [INFO ] State equation strengthened by 160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/784 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
SMT process timed out in 28505ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 28560ms
[2024-06-01 15:12:17] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
[2024-06-01 15:12:17] [INFO ] Invariant cache hit.
[2024-06-01 15:12:17] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-06-01 15:12:17] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
[2024-06-01 15:12:17] [INFO ] Invariant cache hit.
[2024-06-01 15:12:19] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 15:12:40] [INFO ] Implicit Places using invariants and state equation in 22405 ms returned []
Implicit Place search using SMT with State Equation took 22801 ms to find 0 implicit places.
Running 2096 sub problems to find dead transitions.
[2024-06-01 15:12:40] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
[2024-06-01 15:12:40] [INFO ] Invariant cache hit.
[2024-06-01 15:12:40] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/784 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/784 variables, 29/49 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 15:13:12] [INFO ] Deduced a trap composed of 176 places in 469 ms of which 35 ms to minimize.
[2024-06-01 15:13:13] [INFO ] Deduced a trap composed of 191 places in 425 ms of which 6 ms to minimize.
[2024-06-01 15:13:15] [INFO ] Deduced a trap composed of 396 places in 388 ms of which 4 ms to minimize.
[2024-06-01 15:13:15] [INFO ] Deduced a trap composed of 390 places in 321 ms of which 5 ms to minimize.
[2024-06-01 15:13:16] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 784/2857 variables, and 54 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30095 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 29/35 constraints, State Equation: 0/789 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/784 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/784 variables, 29/49 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/784 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 15:13:34] [INFO ] Deduced a trap composed of 83 places in 129 ms of which 2 ms to minimize.
[2024-06-01 15:13:34] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 2 ms to minimize.
[2024-06-01 15:13:34] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-06-01 15:13:35] [INFO ] Deduced a trap composed of 49 places in 329 ms of which 3 ms to minimize.
[2024-06-01 15:13:36] [INFO ] Deduced a trap composed of 375 places in 488 ms of which 5 ms to minimize.
[2024-06-01 15:13:37] [INFO ] Deduced a trap composed of 83 places in 82 ms of which 1 ms to minimize.
[2024-06-01 15:13:39] [INFO ] Deduced a trap composed of 391 places in 324 ms of which 3 ms to minimize.
[2024-06-01 15:13:41] [INFO ] Deduced a trap composed of 85 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:13:41] [INFO ] Deduced a trap composed of 84 places in 112 ms of which 2 ms to minimize.
[2024-06-01 15:13:41] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2024-06-01 15:13:46] [INFO ] Deduced a trap composed of 402 places in 510 ms of which 6 ms to minimize.
[2024-06-01 15:13:46] [INFO ] Deduced a trap composed of 399 places in 482 ms of which 4 ms to minimize.
[2024-06-01 15:13:47] [INFO ] Deduced a trap composed of 394 places in 535 ms of which 5 ms to minimize.
[2024-06-01 15:13:47] [INFO ] Deduced a trap composed of 394 places in 492 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 784/2857 variables, and 68 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 29/35 constraints, State Equation: 0/789 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2096 constraints, Known Traps: 19/19 constraints]
After SMT, in 69087ms problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 69115ms
Starting structural reductions in LTL mode, iteration 1 : 789/792 places, 2100/2100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120602 ms. Remains : 789/792 places, 2100/2100 transitions.
Support contains 514 out of 789 places after structural reductions.
[2024-06-01 15:13:49] [INFO ] Flatten gal took : 306 ms
[2024-06-01 15:13:50] [INFO ] Flatten gal took : 163 ms
[2024-06-01 15:13:50] [INFO ] Input system was already deterministic with 2100 transitions.
Reduction of identical properties reduced properties to check from 89 to 87
RANDOM walk for 40000 steps (8 resets) in 2983 ms. (13 steps per ms) remains 30/87 properties
BEST_FIRST walk for 4003 steps (8 resets) in 296 ms. (13 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 67 ms. (58 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 63 ms. (62 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 30/30 properties
[2024-06-01 15:13:52] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
[2024-06-01 15:13:52] [INFO ] Invariant cache hit.
[2024-06-01 15:13:52] [INFO ] State equation strengthened by 160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Problem AtomicPropp63 is UNSAT
At refinement iteration 2 (OVERLAPS) 208/411 variables, 16/17 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 8/419 variables, 2/19 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/419 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 29 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp81 is UNSAT
At refinement iteration 6 (OVERLAPS) 356/775 variables, 26/45 constraints. Problems are: Problem set: 25 solved, 5 unsolved
[2024-06-01 15:13:55] [INFO ] Deduced a trap composed of 83 places in 345 ms of which 4 ms to minimize.
[2024-06-01 15:13:55] [INFO ] Deduced a trap composed of 83 places in 243 ms of which 4 ms to minimize.
[2024-06-01 15:13:55] [INFO ] Deduced a trap composed of 84 places in 235 ms of which 3 ms to minimize.
[2024-06-01 15:13:55] [INFO ] Deduced a trap composed of 84 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:13:56] [INFO ] Deduced a trap composed of 83 places in 133 ms of which 3 ms to minimize.
[2024-06-01 15:13:56] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-06-01 15:13:56] [INFO ] Deduced a trap composed of 83 places in 76 ms of which 2 ms to minimize.
[2024-06-01 15:13:56] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 1 ms to minimize.
[2024-06-01 15:13:56] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/775 variables, 9/54 constraints. Problems are: Problem set: 25 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/775 variables, 0/54 constraints. Problems are: Problem set: 25 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 2/777 variables, 2/56 constraints. Problems are: Problem set: 25 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/777 variables, 0/56 constraints. Problems are: Problem set: 25 solved, 5 unsolved
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp57 is UNSAT
At refinement iteration 11 (OVERLAPS) 12/789 variables, 8/64 constraints. Problems are: Problem set: 27 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/789 variables, 0/64 constraints. Problems are: Problem set: 27 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2857/2857 variables, and 853 constraints, problems are : Problem set: 27 solved, 3 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 789/789 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 30/29 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 27 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 27 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 184/272 variables, 7/7 constraints. Problems are: Problem set: 27 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/7 constraints. Problems are: Problem set: 27 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 12/284 variables, 3/10 constraints. Problems are: Problem set: 27 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 0/10 constraints. Problems are: Problem set: 27 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 462/746 variables, 16/26 constraints. Problems are: Problem set: 27 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/746 variables, 0/26 constraints. Problems are: Problem set: 27 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 18/764 variables, 9/35 constraints. Problems are: Problem set: 27 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/764 variables, 1/36 constraints. Problems are: Problem set: 27 solved, 3 unsolved
[2024-06-01 15:13:59] [INFO ] Deduced a trap composed of 85 places in 245 ms of which 3 ms to minimize.
[2024-06-01 15:13:59] [INFO ] Deduced a trap composed of 84 places in 179 ms of which 2 ms to minimize.
[2024-06-01 15:13:59] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 1 ms to minimize.
[2024-06-01 15:13:59] [INFO ] Deduced a trap composed of 85 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:13:59] [INFO ] Deduced a trap composed of 83 places in 250 ms of which 3 ms to minimize.
[2024-06-01 15:14:00] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/764 variables, 6/42 constraints. Problems are: Problem set: 27 solved, 3 unsolved
[2024-06-01 15:14:00] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/764 variables, 1/43 constraints. Problems are: Problem set: 27 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/764 variables, 0/43 constraints. Problems are: Problem set: 27 solved, 3 unsolved
Problem AtomicPropp21 is UNSAT
At refinement iteration 12 (OVERLAPS) 23/787 variables, 19/62 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/787 variables, 8/70 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/787 variables, 0/70 constraints. Problems are: Problem set: 28 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2855/2857 variables, and 857 constraints, problems are : Problem set: 28 solved, 2 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 787/789 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1/29 constraints, Known Traps: 16/16 constraints]
After SMT, in 11039ms problems are : Problem set: 28 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 11 out of 789 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 789/789 places, 2100/2100 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 788 transition count 2036
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 129 place count 724 transition count 2036
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 129 place count 724 transition count 1942
Deduced a syphon composed of 94 places in 2 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 188 rules applied. Total rules applied 317 place count 630 transition count 1942
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 477 place count 550 transition count 1862
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 2 with 21 rules applied. Total rules applied 498 place count 550 transition count 1841
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 519 place count 529 transition count 1841
Applied a total of 519 rules in 308 ms. Remains 529 /789 variables (removed 260) and now considering 1841/2100 (removed 259) transitions.
Running 1837 sub problems to find dead transitions.
[2024-06-01 15:14:03] [INFO ] Flow matrix only has 1809 transitions (discarded 32 similar events)
// Phase 1: matrix 1809 rows 529 cols
[2024-06-01 15:14:03] [INFO ] Computed 54 invariants in 122 ms
[2024-06-01 15:14:03] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1837 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 1837 unsolved
[2024-06-01 15:14:27] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 2 ms to minimize.
[2024-06-01 15:14:27] [INFO ] Deduced a trap composed of 53 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:14:27] [INFO ] Deduced a trap composed of 52 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:14:27] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 0 ms to minimize.
[2024-06-01 15:14:27] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:14:28] [INFO ] Deduced a trap composed of 171 places in 460 ms of which 3 ms to minimize.
[2024-06-01 15:14:28] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:14:29] [INFO ] Deduced a trap composed of 33 places in 352 ms of which 3 ms to minimize.
[2024-06-01 15:14:29] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 2 ms to minimize.
[2024-06-01 15:14:29] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
[2024-06-01 15:14:31] [INFO ] Deduced a trap composed of 66 places in 390 ms of which 4 ms to minimize.
[2024-06-01 15:14:32] [INFO ] Deduced a trap composed of 19 places in 263 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/2338 variables, and 62 constraints, problems are : Problem set: 0 solved, 1837 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 33/36 constraints, State Equation: 0/529 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1837/1837 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1837 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1837 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 1837 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 1837 unsolved
[2024-06-01 15:14:50] [INFO ] Deduced a trap composed of 304 places in 393 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/2338 variables, and 63 constraints, problems are : Problem set: 0 solved, 1837 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 33/36 constraints, State Equation: 0/529 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1837 constraints, Known Traps: 13/13 constraints]
After SMT, in 51084ms problems are : Problem set: 0 solved, 1837 unsolved
Search for dead transitions found 0 dead transitions in 51111ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51425 ms. Remains : 529/789 places, 1841/2100 transitions.
RANDOM walk for 31021 steps (6 resets) in 731 ms. (42 steps per ms) remains 0/2 properties
Successfully simplified 28 atomic propositions for a total of 15 simplifications.
FORMULA PolyORBLF-PT-S04J06T08-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:14:55] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-06-01 15:14:55] [INFO ] Flatten gal took : 124 ms
FORMULA PolyORBLF-PT-S04J06T08-CTLFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T08-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T08-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T08-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:14:55] [INFO ] Flatten gal took : 121 ms
[2024-06-01 15:14:55] [INFO ] Input system was already deterministic with 2100 transitions.
Support contains 261 out of 789 places (down from 375) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 789/789 places, 2100/2100 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 788 transition count 2100
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 780 transition count 2092
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 780 transition count 2092
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 25 place count 772 transition count 2084
Iterating global reduction 1 with 8 rules applied. Total rules applied 33 place count 772 transition count 2084
Applied a total of 33 rules in 72 ms. Remains 772 /789 variables (removed 17) and now considering 2084/2100 (removed 16) transitions.
Running 2080 sub problems to find dead transitions.
[2024-06-01 15:14:56] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
// Phase 1: matrix 2052 rows 772 cols
[2024-06-01 15:14:56] [INFO ] Computed 54 invariants in 109 ms
[2024-06-01 15:14:56] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 31/49 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 768/2824 variables, and 49 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 31/36 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 31/49 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:15:30] [INFO ] Deduced a trap composed of 374 places in 367 ms of which 3 ms to minimize.
[2024-06-01 15:15:31] [INFO ] Deduced a trap composed of 130 places in 418 ms of which 6 ms to minimize.
[2024-06-01 15:15:32] [INFO ] Deduced a trap composed of 187 places in 386 ms of which 6 ms to minimize.
[2024-06-01 15:15:32] [INFO ] Deduced a trap composed of 175 places in 307 ms of which 3 ms to minimize.
[2024-06-01 15:15:35] [INFO ] Deduced a trap composed of 383 places in 377 ms of which 5 ms to minimize.
[2024-06-01 15:15:35] [INFO ] Deduced a trap composed of 375 places in 345 ms of which 4 ms to minimize.
[2024-06-01 15:15:35] [INFO ] Deduced a trap composed of 70 places in 227 ms of which 3 ms to minimize.
[2024-06-01 15:15:35] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 3 ms to minimize.
[2024-06-01 15:15:36] [INFO ] Deduced a trap composed of 19 places in 200 ms of which 6 ms to minimize.
[2024-06-01 15:15:40] [INFO ] Deduced a trap composed of 81 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:15:40] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 2 ms to minimize.
[2024-06-01 15:15:40] [INFO ] Deduced a trap composed of 81 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:15:41] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:15:41] [INFO ] Deduced a trap composed of 83 places in 57 ms of which 0 ms to minimize.
[2024-06-01 15:15:41] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/2824 variables, and 64 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 31/36 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 15/15 constraints]
After SMT, in 49957ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 49978ms
Finished structural reductions in LTL mode , in 1 iterations and 50055 ms. Remains : 772/789 places, 2084/2100 transitions.
[2024-06-01 15:15:46] [INFO ] Flatten gal took : 71 ms
[2024-06-01 15:15:46] [INFO ] Flatten gal took : 78 ms
[2024-06-01 15:15:46] [INFO ] Input system was already deterministic with 2084 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 789/789 places, 2100/2100 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 788 transition count 2028
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 716 transition count 2028
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 144 place count 716 transition count 1988
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 224 place count 676 transition count 1988
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 384 place count 596 transition count 1908
Applied a total of 384 rules in 119 ms. Remains 596 /789 variables (removed 193) and now considering 1908/2100 (removed 192) transitions.
Running 1904 sub problems to find dead transitions.
[2024-06-01 15:15:46] [INFO ] Flow matrix only has 1876 transitions (discarded 32 similar events)
// Phase 1: matrix 1876 rows 596 cols
[2024-06-01 15:15:46] [INFO ] Computed 54 invariants in 82 ms
[2024-06-01 15:15:46] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1904 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 30/45 constraints. Problems are: Problem set: 0 solved, 1904 unsolved
[2024-06-01 15:16:16] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2472 variables, and 46 constraints, problems are : Problem set: 0 solved, 1904 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 30/38 constraints, State Equation: 0/596 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1904/1904 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1904 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1904 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 30/45 constraints. Problems are: Problem set: 0 solved, 1904 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1904 unsolved
[2024-06-01 15:16:21] [INFO ] Deduced a trap composed of 46 places in 590 ms of which 4 ms to minimize.
[2024-06-01 15:16:21] [INFO ] Deduced a trap composed of 59 places in 307 ms of which 3 ms to minimize.
[2024-06-01 15:16:22] [INFO ] Deduced a trap composed of 40 places in 287 ms of which 3 ms to minimize.
[2024-06-01 15:16:22] [INFO ] Deduced a trap composed of 60 places in 315 ms of which 5 ms to minimize.
[2024-06-01 15:16:22] [INFO ] Deduced a trap composed of 46 places in 298 ms of which 3 ms to minimize.
[2024-06-01 15:16:23] [INFO ] Deduced a trap composed of 40 places in 320 ms of which 5 ms to minimize.
[2024-06-01 15:16:23] [INFO ] Deduced a trap composed of 34 places in 224 ms of which 3 ms to minimize.
[2024-06-01 15:16:23] [INFO ] Deduced a trap composed of 33 places in 353 ms of which 15 ms to minimize.
[2024-06-01 15:16:24] [INFO ] Deduced a trap composed of 45 places in 330 ms of which 2 ms to minimize.
[2024-06-01 15:16:24] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:16:24] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
[2024-06-01 15:16:24] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:16:25] [INFO ] Deduced a trap composed of 41 places in 439 ms of which 4 ms to minimize.
[2024-06-01 15:16:25] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2472 variables, and 60 constraints, problems are : Problem set: 0 solved, 1904 unsolved in 20058 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 30/38 constraints, State Equation: 0/596 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1904 constraints, Known Traps: 15/15 constraints]
After SMT, in 50675ms problems are : Problem set: 0 solved, 1904 unsolved
Search for dead transitions found 0 dead transitions in 50703ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 50828 ms. Remains : 596/789 places, 1908/2100 transitions.
[2024-06-01 15:16:37] [INFO ] Flatten gal took : 167 ms
[2024-06-01 15:16:37] [INFO ] Flatten gal took : 167 ms
[2024-06-01 15:16:37] [INFO ] Input system was already deterministic with 1908 transitions.
RANDOM walk for 106 steps (0 resets) in 18 ms. (5 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S04J06T08-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 789/789 places, 2100/2100 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 788 transition count 2100
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 780 transition count 2092
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 780 transition count 2092
Applied a total of 17 rules in 66 ms. Remains 780 /789 variables (removed 9) and now considering 2092/2100 (removed 8) transitions.
Running 2088 sub problems to find dead transitions.
[2024-06-01 15:16:38] [INFO ] Flow matrix only has 2060 transitions (discarded 32 similar events)
// Phase 1: matrix 2060 rows 780 cols
[2024-06-01 15:16:38] [INFO ] Computed 54 invariants in 82 ms
[2024-06-01 15:16:38] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/776 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/776 variables, 27/45 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
[2024-06-01 15:17:08] [INFO ] Deduced a trap composed of 3 places in 227 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 776/2840 variables, and 46 constraints, problems are : Problem set: 0 solved, 2088 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 27/36 constraints, State Equation: 0/780 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2088/2088 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2088 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/776 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/776 variables, 27/45 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/776 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2088 unsolved
[2024-06-01 15:17:16] [INFO ] Deduced a trap composed of 138 places in 222 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 776/2840 variables, and 47 constraints, problems are : Problem set: 0 solved, 2088 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 27/36 constraints, State Equation: 0/780 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2088 constraints, Known Traps: 2/2 constraints]
After SMT, in 50178ms problems are : Problem set: 0 solved, 2088 unsolved
Search for dead transitions found 0 dead transitions in 50234ms
Finished structural reductions in LTL mode , in 1 iterations and 50315 ms. Remains : 780/789 places, 2092/2100 transitions.
[2024-06-01 15:17:28] [INFO ] Flatten gal took : 70 ms
[2024-06-01 15:17:28] [INFO ] Flatten gal took : 69 ms
[2024-06-01 15:17:28] [INFO ] Input system was already deterministic with 2092 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 789/789 places, 2100/2100 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 788 transition count 2068
Reduce places removed 32 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 756 transition count 2060
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 80 place count 748 transition count 2060
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 80 place count 748 transition count 1980
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 240 place count 668 transition count 1980
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 248 place count 660 transition count 1972
Iterating global reduction 3 with 8 rules applied. Total rules applied 256 place count 660 transition count 1972
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 352 place count 612 transition count 1924
Applied a total of 352 rules in 120 ms. Remains 612 /789 variables (removed 177) and now considering 1924/2100 (removed 176) transitions.
Running 1920 sub problems to find dead transitions.
[2024-06-01 15:17:28] [INFO ] Flow matrix only has 1892 transitions (discarded 32 similar events)
// Phase 1: matrix 1892 rows 612 cols
[2024-06-01 15:17:28] [INFO ] Computed 54 invariants in 30 ms
[2024-06-01 15:17:28] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 24/43 constraints. Problems are: Problem set: 0 solved, 1920 unsolved
[2024-06-01 15:17:57] [INFO ] Deduced a trap composed of 49 places in 295 ms of which 3 ms to minimize.
[2024-06-01 15:18:00] [INFO ] Deduced a trap composed of 31 places in 300 ms of which 3 ms to minimize.
SMT process timed out in 31493ms, After SMT, problems are : Problem set: 0 solved, 1920 unsolved
Search for dead transitions found 0 dead transitions in 31517ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 31643 ms. Remains : 612/789 places, 1924/2100 transitions.
[2024-06-01 15:18:00] [INFO ] Flatten gal took : 57 ms
[2024-06-01 15:18:00] [INFO ] Flatten gal took : 62 ms
[2024-06-01 15:18:00] [INFO ] Input system was already deterministic with 1924 transitions.
Starting structural reductions in LTL mode, iteration 0 : 789/789 places, 2100/2100 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 788 transition count 2100
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 780 transition count 2092
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 780 transition count 2092
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 25 place count 772 transition count 2084
Iterating global reduction 1 with 8 rules applied. Total rules applied 33 place count 772 transition count 2084
Applied a total of 33 rules in 36 ms. Remains 772 /789 variables (removed 17) and now considering 2084/2100 (removed 16) transitions.
Running 2080 sub problems to find dead transitions.
[2024-06-01 15:18:00] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
// Phase 1: matrix 2052 rows 772 cols
[2024-06-01 15:18:00] [INFO ] Computed 54 invariants in 37 ms
[2024-06-01 15:18:00] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 31/49 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 768/2824 variables, and 49 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 31/36 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 31/49 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:18:35] [INFO ] Deduced a trap composed of 374 places in 282 ms of which 3 ms to minimize.
[2024-06-01 15:18:36] [INFO ] Deduced a trap composed of 130 places in 334 ms of which 3 ms to minimize.
[2024-06-01 15:18:36] [INFO ] Deduced a trap composed of 187 places in 401 ms of which 4 ms to minimize.
[2024-06-01 15:18:36] [INFO ] Deduced a trap composed of 175 places in 295 ms of which 13 ms to minimize.
[2024-06-01 15:18:38] [INFO ] Deduced a trap composed of 383 places in 270 ms of which 3 ms to minimize.
[2024-06-01 15:18:39] [INFO ] Deduced a trap composed of 375 places in 307 ms of which 3 ms to minimize.
[2024-06-01 15:18:39] [INFO ] Deduced a trap composed of 70 places in 196 ms of which 1 ms to minimize.
[2024-06-01 15:18:39] [INFO ] Deduced a trap composed of 25 places in 197 ms of which 2 ms to minimize.
[2024-06-01 15:18:39] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 2 ms to minimize.
[2024-06-01 15:18:44] [INFO ] Deduced a trap composed of 81 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:18:44] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 1 ms to minimize.
[2024-06-01 15:18:44] [INFO ] Deduced a trap composed of 81 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:18:44] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 1 ms to minimize.
[2024-06-01 15:18:45] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 1 ms to minimize.
[2024-06-01 15:18:45] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/2824 variables, and 64 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 31/36 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 15/15 constraints]
After SMT, in 50197ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 50217ms
Finished structural reductions in LTL mode , in 1 iterations and 50257 ms. Remains : 772/789 places, 2084/2100 transitions.
[2024-06-01 15:18:50] [INFO ] Flatten gal took : 94 ms
[2024-06-01 15:18:51] [INFO ] Flatten gal took : 97 ms
[2024-06-01 15:18:51] [INFO ] Input system was already deterministic with 2084 transitions.
Starting structural reductions in LTL mode, iteration 0 : 789/789 places, 2100/2100 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 788 transition count 2100
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 780 transition count 2092
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 780 transition count 2092
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 25 place count 772 transition count 2084
Iterating global reduction 1 with 8 rules applied. Total rules applied 33 place count 772 transition count 2084
Applied a total of 33 rules in 55 ms. Remains 772 /789 variables (removed 17) and now considering 2084/2100 (removed 16) transitions.
Running 2080 sub problems to find dead transitions.
[2024-06-01 15:18:51] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:18:51] [INFO ] Invariant cache hit.
[2024-06-01 15:18:51] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 31/49 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:19:19] [INFO ] Deduced a trap composed of 375 places in 247 ms of which 3 ms to minimize.
[2024-06-01 15:19:19] [INFO ] Deduced a trap composed of 382 places in 272 ms of which 3 ms to minimize.
[2024-06-01 15:19:20] [INFO ] Deduced a trap composed of 374 places in 269 ms of which 3 ms to minimize.
[2024-06-01 15:19:20] [INFO ] Deduced a trap composed of 138 places in 288 ms of which 3 ms to minimize.
[2024-06-01 15:19:20] [INFO ] Deduced a trap composed of 175 places in 282 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 768/2824 variables, and 54 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 31/36 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 31/49 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/768 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:19:32] [INFO ] Deduced a trap composed of 19 places in 447 ms of which 5 ms to minimize.
[2024-06-01 15:19:33] [INFO ] Deduced a trap composed of 82 places in 178 ms of which 3 ms to minimize.
[2024-06-01 15:19:33] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 2 ms to minimize.
[2024-06-01 15:19:33] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 1 ms to minimize.
[2024-06-01 15:19:33] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 1 ms to minimize.
[2024-06-01 15:19:33] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 1 ms to minimize.
[2024-06-01 15:19:37] [INFO ] Deduced a trap composed of 382 places in 389 ms of which 5 ms to minimize.
[2024-06-01 15:19:40] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 2 ms to minimize.
[2024-06-01 15:19:40] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/2824 variables, and 63 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 31/36 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 14/14 constraints]
After SMT, in 49883ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 49907ms
Finished structural reductions in LTL mode , in 1 iterations and 49968 ms. Remains : 772/789 places, 2084/2100 transitions.
[2024-06-01 15:19:41] [INFO ] Flatten gal took : 81 ms
[2024-06-01 15:19:41] [INFO ] Flatten gal took : 82 ms
[2024-06-01 15:19:41] [INFO ] Input system was already deterministic with 2084 transitions.
Starting structural reductions in LTL mode, iteration 0 : 789/789 places, 2100/2100 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 788 transition count 2100
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 780 transition count 2092
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 780 transition count 2092
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 25 place count 772 transition count 2084
Iterating global reduction 1 with 8 rules applied. Total rules applied 33 place count 772 transition count 2084
Applied a total of 33 rules in 45 ms. Remains 772 /789 variables (removed 17) and now considering 2084/2100 (removed 16) transitions.
Running 2080 sub problems to find dead transitions.
[2024-06-01 15:19:41] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:19:41] [INFO ] Invariant cache hit.
[2024-06-01 15:19:41] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 31/49 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 768/2824 variables, and 49 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 31/36 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 31/49 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:20:15] [INFO ] Deduced a trap composed of 175 places in 319 ms of which 4 ms to minimize.
[2024-06-01 15:20:15] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:20:16] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 1 ms to minimize.
[2024-06-01 15:20:16] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 2 ms to minimize.
[2024-06-01 15:20:16] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:20:16] [INFO ] Deduced a trap composed of 81 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:20:16] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:20:16] [INFO ] Deduced a trap composed of 82 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:20:17] [INFO ] Deduced a trap composed of 385 places in 353 ms of which 3 ms to minimize.
[2024-06-01 15:20:17] [INFO ] Deduced a trap composed of 374 places in 419 ms of which 4 ms to minimize.
[2024-06-01 15:20:18] [INFO ] Deduced a trap composed of 101 places in 241 ms of which 2 ms to minimize.
[2024-06-01 15:20:19] [INFO ] Deduced a trap composed of 101 places in 236 ms of which 2 ms to minimize.
[2024-06-01 15:20:19] [INFO ] Deduced a trap composed of 49 places in 253 ms of which 2 ms to minimize.
[2024-06-01 15:20:21] [INFO ] Deduced a trap composed of 383 places in 428 ms of which 5 ms to minimize.
[2024-06-01 15:20:21] [INFO ] Deduced a trap composed of 385 places in 358 ms of which 4 ms to minimize.
[2024-06-01 15:20:21] [INFO ] Deduced a trap composed of 367 places in 419 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 1)
(s61 0)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/2824 variables, and 65 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 31/36 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 16/16 constraints]
After SMT, in 50727ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 50748ms
Finished structural reductions in LTL mode , in 1 iterations and 50799 ms. Remains : 772/789 places, 2084/2100 transitions.
[2024-06-01 15:20:32] [INFO ] Flatten gal took : 57 ms
[2024-06-01 15:20:32] [INFO ] Flatten gal took : 64 ms
[2024-06-01 15:20:32] [INFO ] Input system was already deterministic with 2084 transitions.
Starting structural reductions in LTL mode, iteration 0 : 789/789 places, 2100/2100 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 788 transition count 2100
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 780 transition count 2092
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 780 transition count 2092
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 25 place count 772 transition count 2084
Iterating global reduction 1 with 8 rules applied. Total rules applied 33 place count 772 transition count 2084
Applied a total of 33 rules in 37 ms. Remains 772 /789 variables (removed 17) and now considering 2084/2100 (removed 16) transitions.
Running 2080 sub problems to find dead transitions.
[2024-06-01 15:20:32] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:20:32] [INFO ] Invariant cache hit.
[2024-06-01 15:20:32] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 31/49 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:21:00] [INFO ] Deduced a trap composed of 375 places in 251 ms of which 3 ms to minimize.
[2024-06-01 15:21:00] [INFO ] Deduced a trap composed of 382 places in 290 ms of which 3 ms to minimize.
[2024-06-01 15:21:00] [INFO ] Deduced a trap composed of 374 places in 279 ms of which 3 ms to minimize.
[2024-06-01 15:21:01] [INFO ] Deduced a trap composed of 138 places in 291 ms of which 3 ms to minimize.
[2024-06-01 15:21:01] [INFO ] Deduced a trap composed of 175 places in 312 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 768/2824 variables, and 54 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 31/36 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 31/49 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/768 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:21:12] [INFO ] Deduced a trap composed of 19 places in 395 ms of which 4 ms to minimize.
[2024-06-01 15:21:13] [INFO ] Deduced a trap composed of 82 places in 222 ms of which 3 ms to minimize.
[2024-06-01 15:21:13] [INFO ] Deduced a trap composed of 81 places in 199 ms of which 3 ms to minimize.
[2024-06-01 15:21:13] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 1 ms to minimize.
[2024-06-01 15:21:13] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:21:13] [INFO ] Deduced a trap composed of 81 places in 73 ms of which 1 ms to minimize.
[2024-06-01 15:21:17] [INFO ] Deduced a trap composed of 382 places in 417 ms of which 4 ms to minimize.
[2024-06-01 15:21:20] [INFO ] Deduced a trap composed of 82 places in 73 ms of which 1 ms to minimize.
[2024-06-01 15:21:21] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/2824 variables, and 63 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 31/36 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 14/14 constraints]
After SMT, in 49440ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 49460ms
Finished structural reductions in LTL mode , in 1 iterations and 49501 ms. Remains : 772/789 places, 2084/2100 transitions.
[2024-06-01 15:21:22] [INFO ] Flatten gal took : 56 ms
[2024-06-01 15:21:22] [INFO ] Flatten gal took : 59 ms
[2024-06-01 15:21:22] [INFO ] Input system was already deterministic with 2084 transitions.
Starting structural reductions in LTL mode, iteration 0 : 789/789 places, 2100/2100 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 788 transition count 2100
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 780 transition count 2092
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 780 transition count 2092
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 25 place count 772 transition count 2084
Iterating global reduction 1 with 8 rules applied. Total rules applied 33 place count 772 transition count 2084
Applied a total of 33 rules in 38 ms. Remains 772 /789 variables (removed 17) and now considering 2084/2100 (removed 16) transitions.
Running 2080 sub problems to find dead transitions.
[2024-06-01 15:21:22] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-06-01 15:21:22] [INFO ] Invariant cache hit.
[2024-06-01 15:21:22] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 31/49 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 768/2824 variables, and 49 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 31/36 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 31/49 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-06-01 15:21:54] [INFO ] Deduced a trap composed of 175 places in 273 ms of which 3 ms to minimize.
[2024-06-01 15:21:55] [INFO ] Deduced a trap composed of 83 places in 163 ms of which 3 ms to minimize.
[2024-06-01 15:21:55] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 1 ms to minimize.
[2024-06-01 15:21:55] [INFO ] Deduced a trap composed of 81 places in 80 ms of which 1 ms to minimize.
[2024-06-01 15:21:55] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:21:55] [INFO ] Deduced a trap composed of 81 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:21:55] [INFO ] Deduced a trap composed of 19 places in 204 ms of which 2 ms to minimize.
[2024-06-01 15:21:55] [INFO ] Deduced a trap composed of 82 places in 53 ms of which 0 ms to minimize.
[2024-06-01 15:21:56] [INFO ] Deduced a trap composed of 385 places in 321 ms of which 3 ms to minimize.
[2024-06-01 15:21:56] [INFO ] Deduced a trap composed of 374 places in 300 ms of which 3 ms to minimize.
[2024-06-01 15:21:58] [INFO ] Deduced a trap composed of 101 places in 186 ms of which 2 ms to minimize.
[2024-06-01 15:21:58] [INFO ] Deduced a trap composed of 101 places in 255 ms of which 2 ms to minimize.
[2024-06-01 15:21:58] [INFO ] Deduced a trap composed of 49 places in 223 ms of which 3 ms to minimize.
[2024-06-01 15:22:00] [INFO ] Deduced a trap composed of 383 places in 401 ms of which 5 ms to minimize.
[2024-06-01 15:22:00] [INFO ] Deduced a trap composed of 385 places in 340 ms of which 4 ms to minimize.
[2024-06-01 15:22:00] [INFO ] Deduced a trap composed of 367 places in 305 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/2824 variables, and 65 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 31/36 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 16/16 constraints]
After SMT, in 49314ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 49333ms
Finished structural reductions in LTL mode , in 1 iterations and 49376 ms. Remains : 772/789 places, 2084/2100 transitions.
[2024-06-01 15:22:11] [INFO ] Flatten gal took : 59 ms
[2024-06-01 15:22:11] [INFO ] Flatten gal took : 59 ms
[2024-06-01 15:22:11] [INFO ] Input system was already deterministic with 2084 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 789/789 places, 2100/2100 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 788 transition count 2028
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 716 transition count 2028
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 144 place count 716 transition count 1932
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 336 place count 620 transition count 1932
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 496 place count 540 transition count 1852
Applied a total of 496 rules in 133 ms. Remains 540 /789 variables (removed 249) and now considering 1852/2100 (removed 248) transitions.
Running 1848 sub problems to find dead transitions.
[2024-06-01 15:22:12] [INFO ] Flow matrix only has 1820 transitions (discarded 32 similar events)
// Phase 1: matrix 1820 rows 540 cols
[2024-06-01 15:22:12] [INFO ] Computed 54 invariants in 25 ms
[2024-06-01 15:22:12] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1848 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 26/45 constraints. Problems are: Problem set: 0 solved, 1848 unsolved
[2024-06-01 15:22:33] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:22:35] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 536/2360 variables, and 47 constraints, problems are : Problem set: 0 solved, 1848 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 26/34 constraints, State Equation: 0/540 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1848/1848 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1848 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1848 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 26/45 constraints. Problems are: Problem set: 0 solved, 1848 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/536 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1848 unsolved
[2024-06-01 15:22:44] [INFO ] Deduced a trap composed of 52 places in 386 ms of which 4 ms to minimize.
[2024-06-01 15:22:44] [INFO ] Deduced a trap composed of 54 places in 326 ms of which 4 ms to minimize.
[2024-06-01 15:22:45] [INFO ] Deduced a trap composed of 53 places in 266 ms of which 3 ms to minimize.
[2024-06-01 15:22:45] [INFO ] Deduced a trap composed of 53 places in 246 ms of which 2 ms to minimize.
[2024-06-01 15:22:45] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 2 ms to minimize.
[2024-06-01 15:22:45] [INFO ] Deduced a trap composed of 52 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:22:45] [INFO ] Deduced a trap composed of 33 places in 236 ms of which 2 ms to minimize.
[2024-06-01 15:22:46] [INFO ] Deduced a trap composed of 73 places in 255 ms of which 2 ms to minimize.
[2024-06-01 15:22:49] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:22:49] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:22:50] [INFO ] Deduced a trap composed of 72 places in 361 ms of which 3 ms to minimize.
[2024-06-01 15:22:51] [INFO ] Deduced a trap composed of 45 places in 187 ms of which 2 ms to minimize.
[2024-06-01 15:22:52] [INFO ] Deduced a trap composed of 33 places in 296 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 536/2360 variables, and 60 constraints, problems are : Problem set: 0 solved, 1848 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 26/34 constraints, State Equation: 0/540 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1848 constraints, Known Traps: 15/15 constraints]
After SMT, in 50495ms problems are : Problem set: 0 solved, 1848 unsolved
Search for dead transitions found 0 dead transitions in 50512ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 50662 ms. Remains : 540/789 places, 1852/2100 transitions.
[2024-06-01 15:23:02] [INFO ] Flatten gal took : 68 ms
[2024-06-01 15:23:02] [INFO ] Flatten gal took : 97 ms
[2024-06-01 15:23:02] [INFO ] Input system was already deterministic with 1852 transitions.
RANDOM walk for 7100 steps (2 resets) in 68 ms. (102 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S04J06T08-CTLFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-01 15:23:03] [INFO ] Flatten gal took : 112 ms
[2024-06-01 15:23:03] [INFO ] Flatten gal took : 105 ms
[2024-06-01 15:23:03] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLFireability.sr.xml took 21 ms.
[2024-06-01 15:23:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 789 places, 2100 transitions and 10461 arcs took 17 ms.
Total runtime 675276 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 : PolyORBLF-PT-S04J06T08-CTLFireability-2024-00
Could not compute solution for formula : PolyORBLF-PT-S04J06T08-CTLFireability-2024-02
Could not compute solution for formula : PolyORBLF-PT-S04J06T08-CTLFireability-2024-03
Could not compute solution for formula : PolyORBLF-PT-S04J06T08-CTLFireability-2024-04
Could not compute solution for formula : PolyORBLF-PT-S04J06T08-CTLFireability-2024-09
Could not compute solution for formula : PolyORBLF-PT-S04J06T08-CTLFireability-2024-11
Could not compute solution for formula : PolyORBLF-PT-S04J06T08-CTLFireability-2024-12
Could not compute solution for formula : PolyORBLF-PT-S04J06T08-CTLFireability-2024-13

BK_STOP 1717255383954

--------------------
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 PolyORBLF-PT-S04J06T08-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1170/ctl_0_
ctl formula name PolyORBLF-PT-S04J06T08-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1170/ctl_1_
ctl formula name PolyORBLF-PT-S04J06T08-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1170/ctl_2_
ctl formula name PolyORBLF-PT-S04J06T08-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1170/ctl_3_
ctl formula name PolyORBLF-PT-S04J06T08-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1170/ctl_4_
ctl formula name PolyORBLF-PT-S04J06T08-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1170/ctl_5_
ctl formula name PolyORBLF-PT-S04J06T08-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/1170/ctl_6_
ctl formula name PolyORBLF-PT-S04J06T08-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/1170/ctl_7_
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="PolyORBLF-PT-S04J06T08"
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 PolyORBLF-PT-S04J06T08, 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 r516-tajo-171654446800298"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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