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-171654446500178.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-COL-S06J04T06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446500178
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 9.3K Apr 11 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 11 16:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 11 16:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 11 16:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 17:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 11 17:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 17:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 17:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717251025071

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:10:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:10:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:10:26] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 14:10:26] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 14:10:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 612 ms
[2024-06-01 14:10:27] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 632 PT places and 10560.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
[2024-06-01 14:10:27] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 4 ms.
[2024-06-01 14:10:27] [INFO ] Skeletonized 14 HLPN properties in 2 ms. Removed 2 properties that had guard overlaps.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 48 to 47
RANDOM walk for 40000 steps (3903 resets) in 1079 ms. (37 steps per ms) remains 24/47 properties
BEST_FIRST walk for 4003 steps (17 resets) in 61 ms. (64 steps per ms) remains 8/24 properties
BEST_FIRST walk for 4002 steps (17 resets) in 44 ms. (88 steps per ms) remains 6/8 properties
BEST_FIRST walk for 4003 steps (14 resets) in 29 ms. (133 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000 steps (24 resets) in 23 ms. (166 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4002 steps (12 resets) in 35 ms. (111 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4001 steps (23 resets) in 40 ms. (97 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4001 steps (10 resets) in 24 ms. (160 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4002 steps (12 resets) in 30 ms. (129 steps per ms) remains 6/6 properties
[2024-06-01 14:10:27] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 14:10:27] [INFO ] Computed 26 invariants in 8 ms
[2024-06-01 14:10:27] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 36/62 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/64 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
After SMT solving in domain Real declared 79/145 variables, and 25 constraints, problems are : Problem set: 6 solved, 0 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 320ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 12 simplifications.
[2024-06-01 14:10:28] [INFO ] Flatten gal took : 27 ms
[2024-06-01 14:10:28] [INFO ] Flatten gal took : 8 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
[2024-06-01 14:10:28] [INFO ] Unfolded HLPN to a Petri net with 632 places and 10500 transitions 88770 arcs in 218 ms.
[2024-06-01 14:10:28] [INFO ] Unfolded 16 HLPN properties in 2 ms.
[2024-06-01 14:10:28] [INFO ] Reduced 960 identical enabling conditions.
[2024-06-01 14:10:28] [INFO ] Reduced 960 identical enabling conditions.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
Support contains 512 out of 632 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Applied a total of 0 rules in 61 ms. Remains 632 /632 variables (removed 0) and now considering 2430/2430 (removed 0) transitions.
Running 2424 sub problems to find dead transitions.
[2024-06-01 14:10:28] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
// Phase 1: matrix 2394 rows 632 cols
[2024-06-01 14:10:28] [INFO ] Computed 54 invariants in 198 ms
[2024-06-01 14:10:28] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
SMT process timed out in 40241ms, After SMT, problems are : Problem set: 0 solved, 2424 unsolved
Search for dead transitions found 0 dead transitions in 40283ms
[2024-06-01 14:11:08] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
[2024-06-01 14:11:08] [INFO ] Invariant cache hit.
[2024-06-01 14:11:09] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-06-01 14:11:09] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
[2024-06-01 14:11:09] [INFO ] Invariant cache hit.
[2024-06-01 14:11:09] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 14:11:10] [INFO ] Implicit Places using invariants and state equation in 1748 ms returned []
Implicit Place search using SMT with State Equation took 2009 ms to find 0 implicit places.
Running 2424 sub problems to find dead transitions.
[2024-06-01 14:11:10] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
[2024-06-01 14:11:10] [INFO ] Invariant cache hit.
[2024-06-01 14:11:10] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 32/42 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
[2024-06-01 14:11:54] [INFO ] Deduced a trap composed of 85 places in 147 ms of which 17 ms to minimize.
[2024-06-01 14:11:54] [INFO ] Deduced a trap composed of 85 places in 79 ms of which 1 ms to minimize.
[2024-06-01 14:11:54] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:11:54] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 1 ms to minimize.
[2024-06-01 14:11:54] [INFO ] Deduced a trap composed of 85 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:11:55] [INFO ] Deduced a trap composed of 347 places in 399 ms of which 4 ms to minimize.
[2024-06-01 14:11:55] [INFO ] Deduced a trap composed of 334 places in 424 ms of which 5 ms to minimize.
[2024-06-01 14:11:56] [INFO ] Deduced a trap composed of 153 places in 463 ms of which 5 ms to minimize.
[2024-06-01 14:11:56] [INFO ] Deduced a trap composed of 169 places in 454 ms of which 3 ms to minimize.
[2024-06-01 14:11:57] [INFO ] Deduced a trap composed of 181 places in 406 ms of which 3 ms to minimize.
[2024-06-01 14:12:00] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 5 ms to minimize.
[2024-06-01 14:12:01] [INFO ] Deduced a trap composed of 427 places in 620 ms of which 4 ms to minimize.
[2024-06-01 14:12:02] [INFO ] Deduced a trap composed of 349 places in 634 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/3026 variables, and 55 constraints, problems are : Problem set: 0 solved, 2424 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 10/18 constraints, Generalized P Invariants (flows): 32/36 constraints, State Equation: 0/632 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2424/1170 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2424 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 32/42 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
[2024-06-01 14:12:09] [INFO ] Deduced a trap composed of 317 places in 515 ms of which 4 ms to minimize.
[2024-06-01 14:12:10] [INFO ] Deduced a trap composed of 382 places in 466 ms of which 4 ms to minimize.
[2024-06-01 14:12:20] [INFO ] Deduced a trap composed of 15 places in 261 ms of which 3 ms to minimize.
[2024-06-01 14:12:21] [INFO ] Deduced a trap composed of 307 places in 533 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/3026 variables, and 59 constraints, problems are : Problem set: 0 solved, 2424 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 10/18 constraints, Generalized P Invariants (flows): 32/36 constraints, State Equation: 0/632 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1170 constraints, Known Traps: 17/17 constraints]
After SMT, in 84463ms problems are : Problem set: 0 solved, 2424 unsolved
Search for dead transitions found 0 dead transitions in 84509ms
Finished structural reductions in LTL mode , in 1 iterations and 126902 ms. Remains : 632/632 places, 2430/2430 transitions.
Support contains 512 out of 632 places after structural reductions.
[2024-06-01 14:12:35] [INFO ] Flatten gal took : 288 ms
[2024-06-01 14:12:36] [INFO ] Flatten gal took : 211 ms
[2024-06-01 14:12:36] [INFO ] Input system was already deterministic with 2430 transitions.
Reduction of identical properties reduced properties to check from 67 to 63
RANDOM walk for 40000 steps (278 resets) in 1275 ms. (31 steps per ms) remains 9/63 properties
BEST_FIRST walk for 40003 steps (10 resets) in 532 ms. (75 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (98 resets) in 467 ms. (85 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (77 resets) in 1975 ms. (20 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (110 resets) in 591 ms. (67 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (108 resets) in 254 ms. (156 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (98 resets) in 321 ms. (124 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (84 resets) in 456 ms. (87 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (110 resets) in 364 ms. (109 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (123 resets) in 465 ms. (85 steps per ms) remains 9/9 properties
[2024-06-01 14:12:39] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
[2024-06-01 14:12:39] [INFO ] Invariant cache hit.
[2024-06-01 14:12:39] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 159/379 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 9/388 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
After SMT solving in domain Real declared 630/3026 variables, and 53 constraints, problems are : Problem set: 9 solved, 0 unsolved in 892 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 0/632 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 9/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 2172ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-COL-S06J04T06-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:12:41] [INFO ] Flatten gal took : 256 ms
[2024-06-01 14:12:41] [INFO ] Flatten gal took : 144 ms
[2024-06-01 14:12:42] [INFO ] Input system was already deterministic with 2430 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 626 transition count 2382
Reduce places removed 48 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 54 rules applied. Total rules applied 102 place count 578 transition count 2376
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 108 place count 572 transition count 2376
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 108 place count 572 transition count 2304
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 252 place count 500 transition count 2304
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 6 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 384 place count 434 transition count 2238
Applied a total of 384 rules in 288 ms. Remains 434 /632 variables (removed 198) and now considering 2238/2430 (removed 192) transitions.
Running 2232 sub problems to find dead transitions.
[2024-06-01 14:12:42] [INFO ] Flow matrix only has 2202 transitions (discarded 36 similar events)
// Phase 1: matrix 2202 rows 434 cols
[2024-06-01 14:12:42] [INFO ] Computed 48 invariants in 43 ms
[2024-06-01 14:12:42] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-06-01 14:13:19] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 2 ms to minimize.
[2024-06-01 14:13:19] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:13:19] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 0 ms to minimize.
[2024-06-01 14:13:19] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 0 ms to minimize.
[2024-06-01 14:13:19] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 5 ms to minimize.
[2024-06-01 14:13:19] [INFO ] Deduced a trap composed of 206 places in 435 ms of which 3 ms to minimize.
[2024-06-01 14:13:20] [INFO ] Deduced a trap composed of 188 places in 435 ms of which 2 ms to minimize.
[2024-06-01 14:13:20] [INFO ] Deduced a trap composed of 15 places in 370 ms of which 2 ms to minimize.
[2024-06-01 14:13:20] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:13:21] [INFO ] Deduced a trap composed of 195 places in 383 ms of which 2 ms to minimize.
[2024-06-01 14:13:21] [INFO ] Deduced a trap composed of 207 places in 376 ms of which 4 ms to minimize.
[2024-06-01 14:13:22] [INFO ] Deduced a trap composed of 188 places in 474 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/2636 variables, and 54 constraints, problems are : Problem set: 0 solved, 2232 unsolved in 20054 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 29/30 constraints, State Equation: 0/434 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2232/978 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/2636 variables, and 54 constraints, problems are : Problem set: 0 solved, 2232 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 29/30 constraints, State Equation: 0/434 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/978 constraints, Known Traps: 12/12 constraints]
After SMT, in 61429ms problems are : Problem set: 0 solved, 2232 unsolved
Search for dead transitions found 0 dead transitions in 61457ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 61754 ms. Remains : 434/632 places, 2238/2430 transitions.
[2024-06-01 14:13:44] [INFO ] Flatten gal took : 139 ms
[2024-06-01 14:13:44] [INFO ] Flatten gal took : 127 ms
[2024-06-01 14:13:44] [INFO ] Input system was already deterministic with 2238 transitions.
RANDOM walk for 81 steps (4 resets) in 12 ms. (6 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-COL-S06J04T06-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 2430
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 620 transition count 2424
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 620 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 614 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 614 transition count 2418
Applied a total of 30 rules in 99 ms. Remains 614 /632 variables (removed 18) and now considering 2418/2430 (removed 12) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 14:13:44] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 614 cols
[2024-06-01 14:13:44] [INFO ] Computed 48 invariants in 65 ms
[2024-06-01 14:13:44] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 14:14:24] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 2 ms to minimize.
[2024-06-01 14:14:24] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:14:24] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:14:25] [INFO ] Deduced a trap composed of 83 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:14:25] [INFO ] Deduced a trap composed of 83 places in 65 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/2996 variables, and 47 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20056 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 31/34 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 14:14:27] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 5 ms to minimize.
[2024-06-01 14:14:28] [INFO ] Deduced a trap composed of 263 places in 456 ms of which 5 ms to minimize.
[2024-06-01 14:14:29] [INFO ] Deduced a trap composed of 178 places in 459 ms of which 4 ms to minimize.
[2024-06-01 14:14:29] [INFO ] Deduced a trap composed of 169 places in 395 ms of which 4 ms to minimize.
[2024-06-01 14:14:29] [INFO ] Deduced a trap composed of 159 places in 388 ms of which 4 ms to minimize.
[2024-06-01 14:14:30] [INFO ] Deduced a trap composed of 172 places in 431 ms of which 5 ms to minimize.
[2024-06-01 14:14:31] [INFO ] Deduced a trap composed of 288 places in 465 ms of which 4 ms to minimize.
[2024-06-01 14:14:32] [INFO ] Deduced a trap composed of 310 places in 468 ms of which 4 ms to minimize.
[2024-06-01 14:14:32] [INFO ] Deduced a trap composed of 347 places in 390 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/2996 variables, and 56 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 31/34 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 14/14 constraints]
After SMT, in 60764ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 60797ms
Finished structural reductions in LTL mode , in 1 iterations and 60904 ms. Remains : 614/632 places, 2418/2430 transitions.
[2024-06-01 14:14:45] [INFO ] Flatten gal took : 130 ms
[2024-06-01 14:14:45] [INFO ] Flatten gal took : 139 ms
[2024-06-01 14:14:46] [INFO ] Input system was already deterministic with 2418 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 626 transition count 2376
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 572 transition count 2376
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 108 place count 572 transition count 2304
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 252 place count 500 transition count 2304
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 324 place count 464 transition count 2268
Applied a total of 324 rules in 101 ms. Remains 464 /632 variables (removed 168) and now considering 2268/2430 (removed 162) transitions.
Running 2262 sub problems to find dead transitions.
[2024-06-01 14:14:46] [INFO ] Flow matrix only has 2232 transitions (discarded 36 similar events)
// Phase 1: matrix 2232 rows 464 cols
[2024-06-01 14:14:46] [INFO ] Computed 48 invariants in 55 ms
[2024-06-01 14:14:46] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
[2024-06-01 14:15:21] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 1 ms to minimize.
[2024-06-01 14:15:22] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 2 ms to minimize.
[2024-06-01 14:15:22] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:15:22] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:15:22] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 1 ms to minimize.
[2024-06-01 14:15:23] [INFO ] Deduced a trap composed of 202 places in 473 ms of which 3 ms to minimize.
[2024-06-01 14:15:24] [INFO ] Deduced a trap composed of 229 places in 503 ms of which 3 ms to minimize.
[2024-06-01 14:15:24] [INFO ] Deduced a trap composed of 216 places in 497 ms of which 3 ms to minimize.
[2024-06-01 14:15:25] [INFO ] Deduced a trap composed of 15 places in 456 ms of which 3 ms to minimize.
[2024-06-01 14:15:25] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:15:27] [INFO ] Deduced a trap composed of 214 places in 416 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/2696 variables, and 53 constraints, problems are : Problem set: 0 solved, 2262 unsolved in 20073 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 29/30 constraints, State Equation: 0/464 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2262/1008 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/2696 variables, and 53 constraints, problems are : Problem set: 0 solved, 2262 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 29/30 constraints, State Equation: 0/464 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1008 constraints, Known Traps: 11/11 constraints]
After SMT, in 62235ms problems are : Problem set: 0 solved, 2262 unsolved
Search for dead transitions found 0 dead transitions in 62262ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 62369 ms. Remains : 464/632 places, 2268/2430 transitions.
[2024-06-01 14:15:48] [INFO ] Flatten gal took : 137 ms
[2024-06-01 14:15:48] [INFO ] Flatten gal took : 94 ms
[2024-06-01 14:15:48] [INFO ] Input system was already deterministic with 2268 transitions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 2430
Applied a total of 6 rules in 23 ms. Remains 626 /632 variables (removed 6) and now considering 2430/2430 (removed 0) transitions.
Running 2424 sub problems to find dead transitions.
[2024-06-01 14:15:48] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
// Phase 1: matrix 2394 rows 626 cols
[2024-06-01 14:15:49] [INFO ] Computed 48 invariants in 42 ms
[2024-06-01 14:15:49] [INFO ] State equation strengthened by 168 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/620 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
SMT process timed out in 40669ms, After SMT, problems are : Problem set: 0 solved, 2424 unsolved
Search for dead transitions found 0 dead transitions in 40694ms
Finished structural reductions in LTL mode , in 1 iterations and 40723 ms. Remains : 626/632 places, 2430/2430 transitions.
[2024-06-01 14:16:29] [INFO ] Flatten gal took : 157 ms
[2024-06-01 14:16:29] [INFO ] Flatten gal took : 132 ms
[2024-06-01 14:16:30] [INFO ] Input system was already deterministic with 2430 transitions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Applied a total of 0 rules in 22 ms. Remains 632 /632 variables (removed 0) and now considering 2430/2430 (removed 0) transitions.
Running 2424 sub problems to find dead transitions.
[2024-06-01 14:16:30] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
// Phase 1: matrix 2394 rows 632 cols
[2024-06-01 14:16:30] [INFO ] Computed 54 invariants in 76 ms
[2024-06-01 14:16:30] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 32/42 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
[2024-06-01 14:17:10] [INFO ] Deduced a trap composed of 85 places in 154 ms of which 2 ms to minimize.
[2024-06-01 14:17:10] [INFO ] Deduced a trap composed of 85 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:17:10] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 2 ms to minimize.
[2024-06-01 14:17:11] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 1 ms to minimize.
[2024-06-01 14:17:11] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 2 ms to minimize.
SMT process timed out in 40887ms, After SMT, problems are : Problem set: 0 solved, 2424 unsolved
Search for dead transitions found 0 dead transitions in 40916ms
Finished structural reductions in LTL mode , in 1 iterations and 40945 ms. Remains : 632/632 places, 2430/2430 transitions.
[2024-06-01 14:17:11] [INFO ] Flatten gal took : 127 ms
[2024-06-01 14:17:11] [INFO ] Flatten gal took : 132 ms
[2024-06-01 14:17:11] [INFO ] Input system was already deterministic with 2430 transitions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 2430
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 620 transition count 2424
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 620 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 614 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 614 transition count 2418
Applied a total of 30 rules in 60 ms. Remains 614 /632 variables (removed 18) and now considering 2418/2430 (removed 12) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 14:17:11] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 614 cols
[2024-06-01 14:17:11] [INFO ] Computed 48 invariants in 86 ms
[2024-06-01 14:17:11] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 14:17:49] [INFO ] Deduced a trap composed of 83 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:17:49] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 1 ms to minimize.
[2024-06-01 14:17:49] [INFO ] Deduced a trap composed of 83 places in 79 ms of which 2 ms to minimize.
[2024-06-01 14:17:49] [INFO ] Deduced a trap composed of 83 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:17:49] [INFO ] Deduced a trap composed of 83 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:17:50] [INFO ] Deduced a trap composed of 163 places in 511 ms of which 4 ms to minimize.
[2024-06-01 14:17:50] [INFO ] Deduced a trap composed of 175 places in 456 ms of which 4 ms to minimize.
[2024-06-01 14:17:51] [INFO ] Deduced a trap composed of 157 places in 460 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/2996 variables, and 50 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20056 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 31/34 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 14:17:54] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:17:55] [INFO ] Deduced a trap composed of 304 places in 520 ms of which 4 ms to minimize.
[2024-06-01 14:17:56] [INFO ] Deduced a trap composed of 63 places in 379 ms of which 2 ms to minimize.
[2024-06-01 14:18:03] [INFO ] Deduced a trap composed of 41 places in 378 ms of which 2 ms to minimize.
[2024-06-01 14:18:07] [INFO ] Deduced a trap composed of 331 places in 521 ms of which 4 ms to minimize.
[2024-06-01 14:18:08] [INFO ] Deduced a trap composed of 325 places in 495 ms of which 4 ms to minimize.
[2024-06-01 14:18:08] [INFO ] Deduced a trap composed of 325 places in 477 ms of which 3 ms to minimize.
[2024-06-01 14:18:09] [INFO ] Deduced a trap composed of 326 places in 491 ms of which 5 ms to minimize.
[2024-06-01 14:18:09] [INFO ] Deduced a trap composed of 322 places in 480 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/2996 variables, and 59 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 31/34 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 17/17 constraints]
After SMT, in 59888ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 59917ms
Finished structural reductions in LTL mode , in 1 iterations and 59983 ms. Remains : 614/632 places, 2418/2430 transitions.
[2024-06-01 14:18:11] [INFO ] Flatten gal took : 121 ms
[2024-06-01 14:18:11] [INFO ] Flatten gal took : 112 ms
[2024-06-01 14:18:12] [INFO ] Input system was already deterministic with 2418 transitions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 2430
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 620 transition count 2424
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 620 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 614 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 614 transition count 2418
Applied a total of 30 rules in 83 ms. Remains 614 /632 variables (removed 18) and now considering 2418/2430 (removed 12) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 14:18:12] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 14:18:12] [INFO ] Invariant cache hit.
[2024-06-01 14:18:12] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 14:18:52] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 1 ms to minimize.
[2024-06-01 14:18:52] [INFO ] Deduced a trap composed of 83 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:18:52] [INFO ] Deduced a trap composed of 83 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:18:52] [INFO ] Deduced a trap composed of 83 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:18:52] [INFO ] Deduced a trap composed of 83 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:18:53] [INFO ] Deduced a trap composed of 365 places in 508 ms of which 3 ms to minimize.
SMT process timed out in 41184ms, After SMT, problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 41216ms
Finished structural reductions in LTL mode , in 1 iterations and 41306 ms. Remains : 614/632 places, 2418/2430 transitions.
[2024-06-01 14:18:53] [INFO ] Flatten gal took : 135 ms
[2024-06-01 14:18:53] [INFO ] Flatten gal took : 127 ms
[2024-06-01 14:18:53] [INFO ] Input system was already deterministic with 2418 transitions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 2430
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 620 transition count 2424
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 620 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 614 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 614 transition count 2418
Applied a total of 30 rules in 55 ms. Remains 614 /632 variables (removed 18) and now considering 2418/2430 (removed 12) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 14:18:53] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 14:18:53] [INFO ] Invariant cache hit.
[2024-06-01 14:18:53] [INFO ] State equation strengthened by 168 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 1.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 1.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 1.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 1.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 1.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 1.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 10.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 1.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 1.0)
(s211 1.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 1.0)
(s216 1.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 1.0)
(s221 1.0)
(s222 0.0)
(s223 1.0)
(s224 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
SMT process timed out in 40844ms, After SMT, problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 40871ms
Finished structural reductions in LTL mode , in 1 iterations and 40932 ms. Remains : 614/632 places, 2418/2430 transitions.
[2024-06-01 14:19:34] [INFO ] Flatten gal took : 119 ms
[2024-06-01 14:19:35] [INFO ] Flatten gal took : 117 ms
[2024-06-01 14:19:35] [INFO ] Input system was already deterministic with 2418 transitions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 2430
Applied a total of 6 rules in 19 ms. Remains 626 /632 variables (removed 6) and now considering 2430/2430 (removed 0) transitions.
Running 2424 sub problems to find dead transitions.
[2024-06-01 14:19:35] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
// Phase 1: matrix 2394 rows 626 cols
[2024-06-01 14:19:35] [INFO ] Computed 48 invariants in 178 ms
[2024-06-01 14:19:35] [INFO ] State equation strengthened by 168 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
SMT process timed out in 40670ms, After SMT, problems are : Problem set: 0 solved, 2424 unsolved
Search for dead transitions found 0 dead transitions in 40695ms
Finished structural reductions in LTL mode , in 1 iterations and 40721 ms. Remains : 626/632 places, 2430/2430 transitions.
[2024-06-01 14:20:16] [INFO ] Flatten gal took : 87 ms
[2024-06-01 14:20:16] [INFO ] Flatten gal took : 132 ms
[2024-06-01 14:20:16] [INFO ] Input system was already deterministic with 2430 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 626 transition count 2376
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 572 transition count 2376
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 108 place count 572 transition count 2340
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 180 place count 536 transition count 2340
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 324 place count 464 transition count 2268
Applied a total of 324 rules in 148 ms. Remains 464 /632 variables (removed 168) and now considering 2268/2430 (removed 162) transitions.
Running 2262 sub problems to find dead transitions.
[2024-06-01 14:20:16] [INFO ] Flow matrix only has 2232 transitions (discarded 36 similar events)
// Phase 1: matrix 2232 rows 464 cols
[2024-06-01 14:20:16] [INFO ] Computed 48 invariants in 59 ms
[2024-06-01 14:20:16] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
[2024-06-01 14:20:51] [INFO ] Deduced a trap composed of 59 places in 407 ms of which 2 ms to minimize.
[2024-06-01 14:20:51] [INFO ] Deduced a trap composed of 58 places in 359 ms of which 2 ms to minimize.
[2024-06-01 14:20:52] [INFO ] Deduced a trap composed of 49 places in 319 ms of which 2 ms to minimize.
[2024-06-01 14:20:52] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:20:52] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 0 ms to minimize.
[2024-06-01 14:20:52] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:20:53] [INFO ] Deduced a trap composed of 219 places in 557 ms of which 4 ms to minimize.
[2024-06-01 14:20:54] [INFO ] Deduced a trap composed of 223 places in 507 ms of which 2 ms to minimize.
[2024-06-01 14:20:54] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/2696 variables, and 51 constraints, problems are : Problem set: 0 solved, 2262 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 15/19 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/464 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2262/1008 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
[2024-06-01 14:21:07] [INFO ] Deduced a trap composed of 69 places in 216 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/2696 variables, and 52 constraints, problems are : Problem set: 0 solved, 2262 unsolved in 20054 ms.
Refiners :[Positive P Invariants (semi-flows): 15/19 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/464 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1008 constraints, Known Traps: 10/10 constraints]
After SMT, in 59339ms problems are : Problem set: 0 solved, 2262 unsolved
Search for dead transitions found 0 dead transitions in 59366ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 59520 ms. Remains : 464/632 places, 2268/2430 transitions.
[2024-06-01 14:21:16] [INFO ] Flatten gal took : 206 ms
[2024-06-01 14:21:16] [INFO ] Flatten gal took : 124 ms
[2024-06-01 14:21:16] [INFO ] Input system was already deterministic with 2268 transitions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 2430
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 620 transition count 2424
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 620 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 614 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 614 transition count 2418
Applied a total of 30 rules in 53 ms. Remains 614 /632 variables (removed 18) and now considering 2418/2430 (removed 12) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 14:21:16] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 614 cols
[2024-06-01 14:21:16] [INFO ] Computed 48 invariants in 51 ms
[2024-06-01 14:21:16] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/2996 variables, and 42 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 31/34 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 14:22:01] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 2 ms to minimize.
[2024-06-01 14:22:01] [INFO ] Deduced a trap composed of 83 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:22:01] [INFO ] Deduced a trap composed of 83 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:22:01] [INFO ] Deduced a trap composed of 83 places in 71 ms of which 2 ms to minimize.
[2024-06-01 14:22:01] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 1 ms to minimize.
[2024-06-01 14:22:02] [INFO ] Deduced a trap composed of 177 places in 528 ms of which 4 ms to minimize.
[2024-06-01 14:22:03] [INFO ] Deduced a trap composed of 152 places in 489 ms of which 5 ms to minimize.
[2024-06-01 14:22:03] [INFO ] Deduced a trap composed of 201 places in 447 ms of which 3 ms to minimize.
[2024-06-01 14:22:04] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 1 ms to minimize.
[2024-06-01 14:22:05] [INFO ] Deduced a trap composed of 341 places in 496 ms of which 5 ms to minimize.
[2024-06-01 14:22:06] [INFO ] Deduced a trap composed of 347 places in 482 ms of which 5 ms to minimize.
[2024-06-01 14:22:19] [INFO ] Deduced a trap composed of 327 places in 623 ms of which 4 ms to minimize.
[2024-06-01 14:22:20] [INFO ] Deduced a trap composed of 366 places in 634 ms of which 5 ms to minimize.
SMT process timed out in 63603ms, After SMT, problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 63633ms
Finished structural reductions in LTL mode , in 1 iterations and 63692 ms. Remains : 614/632 places, 2418/2430 transitions.
[2024-06-01 14:22:20] [INFO ] Flatten gal took : 120 ms
[2024-06-01 14:22:20] [INFO ] Flatten gal took : 200 ms
[2024-06-01 14:22:20] [INFO ] Input system was already deterministic with 2418 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 626 transition count 2400
Reduce places removed 30 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 66 place count 596 transition count 2394
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 590 transition count 2394
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 72 place count 590 transition count 2352
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 156 place count 548 transition count 2352
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 162 place count 542 transition count 2346
Iterating global reduction 3 with 6 rules applied. Total rules applied 168 place count 542 transition count 2346
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 192 place count 530 transition count 2334
Applied a total of 192 rules in 99 ms. Remains 530 /632 variables (removed 102) and now considering 2334/2430 (removed 96) transitions.
Running 2328 sub problems to find dead transitions.
[2024-06-01 14:22:20] [INFO ] Flow matrix only has 2298 transitions (discarded 36 similar events)
// Phase 1: matrix 2298 rows 530 cols
[2024-06-01 14:22:20] [INFO ] Computed 48 invariants in 66 ms
[2024-06-01 14:22:20] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/524 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/524 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 2328 unsolved
[2024-06-01 14:22:59] [INFO ] Deduced a trap composed of 69 places in 84 ms of which 1 ms to minimize.
[2024-06-01 14:22:59] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:22:59] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:22:59] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:22:59] [INFO ] Deduced a trap composed of 69 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:23:00] [INFO ] Deduced a trap composed of 105 places in 471 ms of which 4 ms to minimize.
[2024-06-01 14:23:01] [INFO ] Deduced a trap composed of 234 places in 432 ms of which 3 ms to minimize.
[2024-06-01 14:23:01] [INFO ] Deduced a trap composed of 242 places in 331 ms of which 3 ms to minimize.
[2024-06-01 14:23:01] [INFO ] Deduced a trap composed of 69 places in 339 ms of which 2 ms to minimize.
SMT process timed out in 41042ms, After SMT, problems are : Problem set: 0 solved, 2328 unsolved
Search for dead transitions found 0 dead transitions in 41067ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41171 ms. Remains : 530/632 places, 2334/2430 transitions.
[2024-06-01 14:23:01] [INFO ] Flatten gal took : 82 ms
[2024-06-01 14:23:02] [INFO ] Flatten gal took : 88 ms
[2024-06-01 14:23:02] [INFO ] Input system was already deterministic with 2334 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 626 transition count 2388
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 584 transition count 2388
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 84 place count 584 transition count 2340
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 180 place count 536 transition count 2340
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 186 place count 530 transition count 2334
Iterating global reduction 2 with 6 rules applied. Total rules applied 192 place count 530 transition count 2334
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 324 place count 464 transition count 2268
Applied a total of 324 rules in 106 ms. Remains 464 /632 variables (removed 168) and now considering 2268/2430 (removed 162) transitions.
Running 2262 sub problems to find dead transitions.
[2024-06-01 14:23:02] [INFO ] Flow matrix only has 2232 transitions (discarded 36 similar events)
// Phase 1: matrix 2232 rows 464 cols
[2024-06-01 14:23:02] [INFO ] Computed 48 invariants in 50 ms
[2024-06-01 14:23:02] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
[2024-06-01 14:23:37] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 1 ms to minimize.
[2024-06-01 14:23:37] [INFO ] Deduced a trap composed of 58 places in 138 ms of which 1 ms to minimize.
[2024-06-01 14:23:37] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 1 ms to minimize.
[2024-06-01 14:23:37] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:23:37] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:23:38] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:23:38] [INFO ] Deduced a trap composed of 225 places in 361 ms of which 2 ms to minimize.
[2024-06-01 14:23:38] [INFO ] Deduced a trap composed of 214 places in 358 ms of which 3 ms to minimize.
[2024-06-01 14:23:39] [INFO ] Deduced a trap composed of 224 places in 454 ms of which 2 ms to minimize.
[2024-06-01 14:23:40] [INFO ] Deduced a trap composed of 219 places in 532 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/2696 variables, and 52 constraints, problems are : Problem set: 0 solved, 2262 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 30/33 constraints, State Equation: 0/464 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2262/1008 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
[2024-06-01 14:23:53] [INFO ] Deduced a trap composed of 215 places in 381 ms of which 3 ms to minimize.
[2024-06-01 14:23:53] [INFO ] Deduced a trap composed of 246 places in 421 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/2696 variables, and 54 constraints, problems are : Problem set: 0 solved, 2262 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 30/33 constraints, State Equation: 0/464 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1008 constraints, Known Traps: 12/12 constraints]
After SMT, in 61711ms problems are : Problem set: 0 solved, 2262 unsolved
Search for dead transitions found 0 dead transitions in 61732ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 61843 ms. Remains : 464/632 places, 2268/2430 transitions.
[2024-06-01 14:24:04] [INFO ] Flatten gal took : 144 ms
[2024-06-01 14:24:04] [INFO ] Flatten gal took : 147 ms
[2024-06-01 14:24:04] [INFO ] Input system was already deterministic with 2268 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 626 transition count 2388
Reduce places removed 42 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 90 place count 584 transition count 2382
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 578 transition count 2382
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 96 place count 578 transition count 2304
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 252 place count 500 transition count 2304
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 2 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 360 place count 446 transition count 2250
Applied a total of 360 rules in 118 ms. Remains 446 /632 variables (removed 186) and now considering 2250/2430 (removed 180) transitions.
Running 2244 sub problems to find dead transitions.
[2024-06-01 14:24:04] [INFO ] Flow matrix only has 2214 transitions (discarded 36 similar events)
// Phase 1: matrix 2214 rows 446 cols
[2024-06-01 14:24:04] [INFO ] Computed 48 invariants in 85 ms
[2024-06-01 14:24:04] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 32/42 constraints. Problems are: Problem set: 0 solved, 2244 unsolved
[2024-06-01 14:24:40] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:24:40] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:24:40] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:24:40] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:24:40] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:24:41] [INFO ] Deduced a trap composed of 201 places in 552 ms of which 3 ms to minimize.
[2024-06-01 14:24:41] [INFO ] Deduced a trap composed of 214 places in 514 ms of which 2 ms to minimize.
[2024-06-01 14:24:41] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:24:44] [INFO ] Deduced a trap composed of 229 places in 404 ms of which 3 ms to minimize.
[2024-06-01 14:24:44] [INFO ] Deduced a trap composed of 202 places in 394 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 440/2660 variables, and 52 constraints, problems are : Problem set: 0 solved, 2244 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 10/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/446 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2244/990 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 32/42 constraints. Problems are: Problem set: 0 solved, 2244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 2244 unsolved
[2024-06-01 14:24:51] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/2660 variables, and 53 constraints, problems are : Problem set: 0 solved, 2244 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 10/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/446 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/990 constraints, Known Traps: 11/11 constraints]
After SMT, in 60638ms problems are : Problem set: 0 solved, 2244 unsolved
Search for dead transitions found 0 dead transitions in 60667ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 60792 ms. Remains : 446/632 places, 2250/2430 transitions.
[2024-06-01 14:25:05] [INFO ] Flatten gal took : 113 ms
[2024-06-01 14:25:05] [INFO ] Flatten gal took : 122 ms
[2024-06-01 14:25:05] [INFO ] Input system was already deterministic with 2250 transitions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 2430
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 620 transition count 2424
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 620 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 614 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 614 transition count 2418
Applied a total of 30 rules in 52 ms. Remains 614 /632 variables (removed 18) and now considering 2418/2430 (removed 12) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 14:25:05] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 614 cols
[2024-06-01 14:25:06] [INFO ] Computed 48 invariants in 85 ms
[2024-06-01 14:25:06] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
SMT process timed out in 40529ms, After SMT, problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 40557ms
Finished structural reductions in LTL mode , in 1 iterations and 40617 ms. Remains : 614/632 places, 2418/2430 transitions.
[2024-06-01 14:25:46] [INFO ] Flatten gal took : 118 ms
[2024-06-01 14:25:46] [INFO ] Flatten gal took : 125 ms
[2024-06-01 14:25:46] [INFO ] Input system was already deterministic with 2418 transitions.
[2024-06-01 14:25:47] [INFO ] Flatten gal took : 108 ms
[2024-06-01 14:25:47] [INFO ] Flatten gal took : 114 ms
[2024-06-01 14:25:47] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 16 ms.
[2024-06-01 14:25:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 632 places, 2430 transitions and 14880 arcs took 16 ms.
Total runtime 921124 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-COL-S06J04T06-CTLFireability-2024-01
Could not compute solution for formula : PolyORBLF-COL-S06J04T06-CTLFireability-2024-02
Could not compute solution for formula : PolyORBLF-COL-S06J04T06-CTLFireability-2024-03
Could not compute solution for formula : PolyORBLF-COL-S06J04T06-CTLFireability-2024-04
Could not compute solution for formula : PolyORBLF-COL-S06J04T06-CTLFireability-2024-05
Could not compute solution for formula : PolyORBLF-COL-S06J04T06-CTLFireability-2024-06
Could not compute solution for formula : PolyORBLF-COL-S06J04T06-CTLFireability-2024-07
Could not compute solution for formula : PolyORBLF-COL-S06J04T06-CTLFireability-2024-08
Could not compute solution for formula : PolyORBLF-COL-S06J04T06-CTLFireability-2024-09
Could not compute solution for formula : PolyORBLF-COL-S06J04T06-CTLFireability-2024-10
Could not compute solution for formula : PolyORBLF-COL-S06J04T06-CTLFireability-2024-12
Could not compute solution for formula : PolyORBLF-COL-S06J04T06-CTLFireability-2024-13
Could not compute solution for formula : PolyORBLF-COL-S06J04T06-CTLFireability-2024-14
Could not compute solution for formula : PolyORBLF-COL-S06J04T06-CTLFireability-2024-15

BK_STOP 1717251947951

--------------------
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-COL-S06J04T06-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1173/ctl_0_
ctl formula name PolyORBLF-COL-S06J04T06-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1173/ctl_1_
ctl formula name PolyORBLF-COL-S06J04T06-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1173/ctl_2_
ctl formula name PolyORBLF-COL-S06J04T06-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1173/ctl_3_
ctl formula name PolyORBLF-COL-S06J04T06-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1173/ctl_4_
ctl formula name PolyORBLF-COL-S06J04T06-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1173/ctl_5_
ctl formula name PolyORBLF-COL-S06J04T06-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1173/ctl_6_
ctl formula name PolyORBLF-COL-S06J04T06-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1173/ctl_7_
ctl formula name PolyORBLF-COL-S06J04T06-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1173/ctl_8_
ctl formula name PolyORBLF-COL-S06J04T06-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1173/ctl_9_
ctl formula name PolyORBLF-COL-S06J04T06-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/1173/ctl_10_
ctl formula name PolyORBLF-COL-S06J04T06-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/1173/ctl_11_
ctl formula name PolyORBLF-COL-S06J04T06-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/1173/ctl_12_
ctl formula name PolyORBLF-COL-S06J04T06-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/1173/ctl_13_
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-COL-S06J04T06"
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-COL-S06J04T06, 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-171654446500178"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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