Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 11K Apr 11 17:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 17:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 11 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 11 17:06 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:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716848162033

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 22:16:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-27 22:16:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 22:16:03] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-27 22:16:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 22:16:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 603 ms
[2024-05-27 22:16:04] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 844 PT places and 1904.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
[2024-05-27 22:16:04] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 4 ms.
[2024-05-27 22:16:04] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (24 resets) in 2897 ms. (13 steps per ms) remains 90/117 properties
BEST_FIRST walk for 4000 steps (8 resets) in 74 ms. (53 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (8 resets) in 56 ms. (70 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (8 resets) in 43 ms. (90 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (8 resets) in 98 ms. (40 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (8 resets) in 42 ms. (93 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (9 resets) in 54 ms. (72 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4001 steps (8 resets) in 51 ms. (76 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (9 resets) in 45 ms. (86 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (8 resets) in 42 ms. (93 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (8 resets) in 30 ms. (129 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4001 steps (8 resets) in 57 ms. (68 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (8 resets) in 42 ms. (93 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (8 resets) in 39 ms. (100 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (8 resets) in 35 ms. (111 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (8 resets) in 38 ms. (102 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4002 steps (9 resets) in 31 ms. (125 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4001 steps (8 resets) in 54 ms. (72 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (8 resets) in 44 ms. (88 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (9 resets) in 48 ms. (81 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4001 steps (9 resets) in 40 ms. (97 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4002 steps (9 resets) in 36 ms. (108 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4002 steps (9 resets) in 45 ms. (87 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (8 resets) in 35 ms. (111 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (8 resets) in 34 ms. (114 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4001 steps (9 resets) in 45 ms. (86 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (8 resets) in 63 ms. (62 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4000 steps (8 resets) in 42 ms. (93 steps per ms) remains 90/90 properties
[2024-05-27 22:16:05] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 22:16:06] [INFO ] Computed 26 invariants in 11 ms
[2024-05-27 22:16:06] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp104 is UNSAT
Problem AtomicPropp106 is UNSAT
Problem AtomicPropp107 is UNSAT
Problem AtomicPropp114 is UNSAT
Problem AtomicPropp116 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 6/6 constraints. Problems are: Problem set: 17 solved, 73 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp93 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 4/10 constraints. Problems are: Problem set: 21 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/10 constraints. Problems are: Problem set: 21 solved, 69 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp86 is UNSAT
Problem AtomicPropp89 is UNSAT
Problem AtomicPropp91 is UNSAT
Problem AtomicPropp96 is UNSAT
Problem AtomicPropp100 is UNSAT
Problem AtomicPropp101 is UNSAT
Problem AtomicPropp102 is UNSAT
Problem AtomicPropp105 is UNSAT
Problem AtomicPropp108 is UNSAT
Problem AtomicPropp111 is UNSAT
At refinement iteration 3 (OVERLAPS) 6/76 variables, 5/15 constraints. Problems are: Problem set: 57 solved, 33 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp90 is UNSAT
Problem AtomicPropp103 is UNSAT
Problem AtomicPropp110 is UNSAT
Problem AtomicPropp113 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 4/19 constraints. Problems are: Problem set: 73 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 73 solved, 17 unsolved
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp92 is UNSAT
Problem AtomicPropp109 is UNSAT
Problem AtomicPropp112 is UNSAT
At refinement iteration 6 (OVERLAPS) 5/81 variables, 7/26 constraints. Problems are: Problem set: 82 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 82 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 82 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 82 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 82 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 82 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 82 solved, 8 unsolved in 852 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 82 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 82 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 82 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 25/55 variables, 7/8 constraints. Problems are: Problem set: 82 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 82 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/57 variables, 2/10 constraints. Problems are: Problem set: 82 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/10 constraints. Problems are: Problem set: 82 solved, 8 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp95 is UNSAT
At refinement iteration 6 (OVERLAPS) 20/77 variables, 13/23 constraints. Problems are: Problem set: 85 solved, 5 unsolved
[2024-05-27 22:16:07] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 10 ms to minimize.
[2024-05-27 22:16:07] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 2 ms to minimize.
[2024-05-27 22:16:07] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-27 22:16:07] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
[2024-05-27 22:16:07] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
Problem AtomicPropp37 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 5/28 constraints. Problems are: Problem set: 86 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/28 constraints. Problems are: Problem set: 86 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/79 variables, 1/29 constraints. Problems are: Problem set: 86 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/29 constraints. Problems are: Problem set: 86 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/81 variables, 2/31 constraints. Problems are: Problem set: 86 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/81 variables, 0/31 constraints. Problems are: Problem set: 86 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 64/145 variables, 81/112 constraints. Problems are: Problem set: 86 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/145 variables, 8/120 constraints. Problems are: Problem set: 86 solved, 4 unsolved
Problem AtomicPropp85 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/145 variables, 4/124 constraints. Problems are: Problem set: 87 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/145 variables, 0/124 constraints. Problems are: Problem set: 87 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/145 variables, 0/124 constraints. Problems are: Problem set: 87 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 124 constraints, problems are : Problem set: 87 solved, 3 unsolved in 524 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 4/90 constraints, Known Traps: 5/5 constraints]
After SMT, in 1456ms problems are : Problem set: 87 solved, 3 unsolved
Parikh walk visited 0 properties in 809 ms.
Support contains 5 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 80 transition count 59
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 74 transition count 57
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17 place count 72 transition count 57
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 17 place count 72 transition count 55
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 21 place count 70 transition count 55
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 33 place count 64 transition count 49
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 64 transition count 47
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 37 place count 62 transition count 47
Applied a total of 37 rules in 28 ms. Remains 62 /81 variables (removed 19) and now considering 47/65 (removed 18) transitions.
Running 46 sub problems to find dead transitions.
[2024-05-27 22:16:08] [INFO ] Flow matrix only has 46 transitions (discarded 1 similar events)
// Phase 1: matrix 46 rows 62 cols
[2024-05-27 22:16:08] [INFO ] Computed 25 invariants in 4 ms
[2024-05-27 22:16:08] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-27 22:16:08] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-27 22:16:08] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-27 22:16:08] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-27 22:16:08] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/62 variables, 1/29 constraints. Problems are: Problem set: 2 solved, 44 unsolved
[2024-05-27 22:16:08] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-27 22:16:08] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 2/31 constraints. Problems are: Problem set: 2 solved, 44 unsolved
[2024-05-27 22:16:08] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 1/32 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 46/108 variables, 62/94 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 8/102 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/108 variables, 0/102 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 11 (OVERLAPS) 0/108 variables, 0/102 constraints. Problems are: Problem set: 2 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 102 constraints, problems are : Problem set: 2 solved, 44 unsolved in 1157 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 62/62 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 2 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 5/29 constraints. Problems are: Problem set: 2 solved, 44 unsolved
[2024-05-27 22:16:09] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/30 constraints. Problems are: Problem set: 2 solved, 44 unsolved
[2024-05-27 22:16:09] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/31 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/31 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 1/62 variables, 1/32 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 2/34 constraints. Problems are: Problem set: 2 solved, 44 unsolved
[2024-05-27 22:16:09] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 1/35 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 10 (OVERLAPS) 46/108 variables, 62/97 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/108 variables, 8/105 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/108 variables, 44/149 constraints. Problems are: Problem set: 2 solved, 44 unsolved
[2024-05-27 22:16:10] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-27 22:16:10] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/108 variables, 2/151 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/108 variables, 0/151 constraints. Problems are: Problem set: 2 solved, 44 unsolved
[2024-05-27 22:16:10] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 2 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/108 variables, 1/152 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/108 variables, 0/152 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 17 (OVERLAPS) 0/108 variables, 0/152 constraints. Problems are: Problem set: 2 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 152 constraints, problems are : Problem set: 2 solved, 44 unsolved in 2028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 62/62 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 44/46 constraints, Known Traps: 13/13 constraints]
After SMT, in 3216ms problems are : Problem set: 2 solved, 44 unsolved
Search for dead transitions found 2 dead transitions in 3217ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 62/81 places, 45/65 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 43
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 59 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 3 rules in 5 ms. Remains 59 /62 variables (removed 3) and now considering 41/45 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3272 ms. Remains : 59/81 places, 41/65 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
RANDOM walk for 40000 steps (23 resets) in 1024 ms. (39 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 84 ms. (470 steps per ms) remains 1/2 properties
BEST_FIRST walk for 2678 steps (0 resets) in 8 ms. (297 steps per ms) remains 0/1 properties
Successfully simplified 88 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 22:16:11] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2024-05-27 22:16:11] [INFO ] Flatten gal took : 35 ms
[2024-05-27 22:16:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 22:16:11] [INFO ] Flatten gal took : 11 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-27 22:16:12] [INFO ] Unfolded HLPN to a Petri net with 844 places and 1812 transitions 8302 arcs in 42 ms.
[2024-05-27 22:16:12] [INFO ] Unfolded 6 HLPN properties in 1 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Support contains 286 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 834 transition count 1642
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 834 transition count 1642
Applied a total of 20 rules in 66 ms. Remains 834 /844 variables (removed 10) and now considering 1642/1652 (removed 10) transitions.
Running 1640 sub problems to find dead transitions.
[2024-05-27 22:16:12] [INFO ] Flow matrix only has 1622 transitions (discarded 20 similar events)
// Phase 1: matrix 1622 rows 834 cols
[2024-05-27 22:16:12] [INFO ] Computed 58 invariants in 96 ms
[2024-05-27 22:16:12] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/830 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/830 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-27 22:16:35] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 2 ms to minimize.
[2024-05-27 22:16:35] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 1 ms to minimize.
[2024-05-27 22:16:35] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 1 ms to minimize.
SMT process timed out in 23091ms, After SMT, problems are : Problem set: 0 solved, 1640 unsolved
Search for dead transitions found 0 dead transitions in 23119ms
[2024-05-27 22:16:35] [INFO ] Flow matrix only has 1622 transitions (discarded 20 similar events)
[2024-05-27 22:16:35] [INFO ] Invariant cache hit.
[2024-05-27 22:16:35] [INFO ] Implicit Places using invariants in 501 ms returned [648, 649, 650, 651, 652, 653, 654, 655, 656, 657]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 509 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 824/844 places, 1642/1652 transitions.
Applied a total of 0 rules in 15 ms. Remains 824 /824 variables (removed 0) and now considering 1642/1642 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 23723 ms. Remains : 824/844 places, 1642/1652 transitions.
Support contains 286 out of 824 places after structural reductions.
[2024-05-27 22:16:35] [INFO ] Flatten gal took : 122 ms
[2024-05-27 22:16:36] [INFO ] Flatten gal took : 105 ms
[2024-05-27 22:16:36] [INFO ] Input system was already deterministic with 1642 transitions.
Support contains 252 out of 824 places (down from 286) after GAL structural reductions.
RANDOM walk for 40000 steps (15 resets) in 1304 ms. (30 steps per ms) remains 22/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (9 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 66 ms. (59 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
[2024-05-27 22:16:37] [INFO ] Flow matrix only has 1622 transitions (discarded 20 similar events)
// Phase 1: matrix 1622 rows 824 cols
[2024-05-27 22:16:37] [INFO ] Computed 48 invariants in 29 ms
[2024-05-27 22:16:37] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 1 (OVERLAPS) 557/747 variables, 18/18 constraints. Problems are: Problem set: 17 solved, 5 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/747 variables, 3/21 constraints. Problems are: Problem set: 18 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/747 variables, 0/21 constraints. Problems are: Problem set: 18 solved, 4 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 4 (OVERLAPS) 77/824 variables, 27/48 constraints. Problems are: Problem set: 21 solved, 1 unsolved
[2024-05-27 22:16:38] [INFO ] Deduced a trap composed of 73 places in 381 ms of which 5 ms to minimize.
[2024-05-27 22:16:38] [INFO ] Deduced a trap composed of 210 places in 460 ms of which 4 ms to minimize.
[2024-05-27 22:16:38] [INFO ] Deduced a trap composed of 73 places in 341 ms of which 5 ms to minimize.
[2024-05-27 22:16:39] [INFO ] Deduced a trap composed of 73 places in 350 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/824 variables, 4/52 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/824 variables, 0/52 constraints. Problems are: Problem set: 21 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2446/2446 variables, and 876 constraints, problems are : Problem set: 21 solved, 1 unsolved in 3336 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 824/824 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 21 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 411/421 variables, 1/1 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/1 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/469 variables, 6/7 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/469 variables, 0/7 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 259/728 variables, 9/16 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/728 variables, 0/16 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 93/821 variables, 30/46 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/821 variables, 4/50 constraints. Problems are: Problem set: 21 solved, 1 unsolved
[2024-05-27 22:16:40] [INFO ] Deduced a trap composed of 73 places in 225 ms of which 3 ms to minimize.
[2024-05-27 22:16:41] [INFO ] Deduced a trap composed of 73 places in 183 ms of which 3 ms to minimize.
[2024-05-27 22:16:41] [INFO ] Deduced a trap composed of 73 places in 141 ms of which 2 ms to minimize.
[2024-05-27 22:16:41] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 2 ms to minimize.
[2024-05-27 22:16:41] [INFO ] Deduced a trap composed of 74 places in 162 ms of which 3 ms to minimize.
[2024-05-27 22:16:41] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/821 variables, 6/56 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/821 variables, 0/56 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/822 variables, 1/57 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/822 variables, 0/57 constraints. Problems are: Problem set: 21 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2444/2446 variables, and 879 constraints, problems are : Problem set: 21 solved, 1 unsolved in 3066 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 822/824 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/22 constraints, Known Traps: 10/10 constraints]
After SMT, in 6493ms problems are : Problem set: 21 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 824 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 824/824 places, 1642/1642 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 822 transition count 1582
Reduce places removed 60 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 70 rules applied. Total rules applied 132 place count 762 transition count 1572
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 142 place count 752 transition count 1572
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 142 place count 752 transition count 1482
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 322 place count 662 transition count 1482
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 2 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 502 place count 572 transition count 1392
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 522 place count 572 transition count 1372
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 542 place count 552 transition count 1372
Applied a total of 542 rules in 265 ms. Remains 552 /824 variables (removed 272) and now considering 1372/1642 (removed 270) transitions.
Running 1370 sub problems to find dead transitions.
[2024-05-27 22:16:43] [INFO ] Flow matrix only has 1352 transitions (discarded 20 similar events)
// Phase 1: matrix 1352 rows 552 cols
[2024-05-27 22:16:43] [INFO ] Computed 46 invariants in 29 ms
[2024-05-27 22:16:43] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2024-05-27 22:16:58] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 3 ms to minimize.
[2024-05-27 22:16:58] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 2 ms to minimize.
[2024-05-27 22:16:58] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 2 ms to minimize.
[2024-05-27 22:16:58] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 5 ms to minimize.
[2024-05-27 22:16:58] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 2 ms to minimize.
[2024-05-27 22:16:58] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-05-27 22:16:58] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-05-27 22:16:58] [INFO ] Deduced a trap composed of 46 places in 31 ms of which 1 ms to minimize.
[2024-05-27 22:16:58] [INFO ] Deduced a trap composed of 46 places in 31 ms of which 2 ms to minimize.
[2024-05-27 22:16:59] [INFO ] Deduced a trap composed of 197 places in 290 ms of which 3 ms to minimize.
[2024-05-27 22:16:59] [INFO ] Deduced a trap composed of 204 places in 268 ms of which 3 ms to minimize.
[2024-05-27 22:17:00] [INFO ] Deduced a trap composed of 203 places in 268 ms of which 3 ms to minimize.
[2024-05-27 22:17:00] [INFO ] Deduced a trap composed of 213 places in 378 ms of which 4 ms to minimize.
[2024-05-27 22:17:01] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 1 ms to minimize.
[2024-05-27 22:17:05] [INFO ] Deduced a trap composed of 348 places in 311 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/1904 variables, and 59 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 20062 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1370/1370 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2024-05-27 22:17:13] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/1904 variables, and 60 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1370 constraints, Known Traps: 16/16 constraints]
After SMT, in 43396ms problems are : Problem set: 0 solved, 1370 unsolved
Search for dead transitions found 0 dead transitions in 43413ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43681 ms. Remains : 552/824 places, 1372/1642 transitions.
RANDOM walk for 40000 steps (14 resets) in 426 ms. (93 steps per ms) remains 1/1 properties
BEST_FIRST walk for 2992 steps (0 resets) in 11 ms. (249 steps per ms) remains 0/1 properties
Successfully simplified 21 atomic propositions for a total of 6 simplifications.
[2024-05-27 22:17:27] [INFO ] Flatten gal took : 91 ms
[2024-05-27 22:17:27] [INFO ] Flatten gal took : 62 ms
[2024-05-27 22:17:27] [INFO ] Input system was already deterministic with 1642 transitions.
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 824/824 places, 1642/1642 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 822 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 812 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 812 transition count 1632
Applied a total of 22 rules in 37 ms. Remains 812 /824 variables (removed 12) and now considering 1632/1642 (removed 10) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:17:27] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 812 cols
[2024-05-27 22:17:27] [INFO ] Computed 46 invariants in 19 ms
[2024-05-27 22:17:27] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-27 22:17:47] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 2 ms to minimize.
[2024-05-27 22:17:47] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-05-27 22:17:47] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 2 ms to minimize.
[2024-05-27 22:17:47] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 2 ms to minimize.
[2024-05-27 22:17:47] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:17:47] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-05-27 22:17:47] [INFO ] Deduced a trap composed of 72 places in 36 ms of which 0 ms to minimize.
[2024-05-27 22:17:47] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 1 ms to minimize.
[2024-05-27 22:17:47] [INFO ] Deduced a trap composed of 72 places in 38 ms of which 1 ms to minimize.
[2024-05-27 22:17:48] [INFO ] Deduced a trap composed of 463 places in 397 ms of which 26 ms to minimize.
[2024-05-27 22:17:49] [INFO ] Deduced a trap composed of 397 places in 331 ms of which 4 ms to minimize.
[2024-05-27 22:17:49] [INFO ] Deduced a trap composed of 208 places in 263 ms of which 4 ms to minimize.
[2024-05-27 22:17:49] [INFO ] Deduced a trap composed of 72 places in 35 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 57 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-27 22:17:53] [INFO ] Deduced a trap composed of 409 places in 307 ms of which 4 ms to minimize.
[2024-05-27 22:18:05] [INFO ] Deduced a trap composed of 51 places in 168 ms of which 4 ms to minimize.
[2024-05-27 22:18:05] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 4 ms to minimize.
[2024-05-27 22:18:05] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 3 ms to minimize.
[2024-05-27 22:18:07] [INFO ] Deduced a trap composed of 410 places in 427 ms of which 5 ms to minimize.
[2024-05-27 22:18:10] [INFO ] Deduced a trap composed of 386 places in 305 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 63 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 19/19 constraints]
After SMT, in 42680ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 42695ms
Finished structural reductions in LTL mode , in 1 iterations and 42748 ms. Remains : 812/824 places, 1632/1642 transitions.
[2024-05-27 22:18:10] [INFO ] Flatten gal took : 53 ms
[2024-05-27 22:18:10] [INFO ] Flatten gal took : 64 ms
[2024-05-27 22:18:10] [INFO ] Input system was already deterministic with 1632 transitions.
Starting structural reductions in LTL mode, iteration 0 : 824/824 places, 1642/1642 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 822 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 812 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 812 transition count 1632
Applied a total of 22 rules in 20 ms. Remains 812 /824 variables (removed 12) and now considering 1632/1642 (removed 10) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:18:10] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:18:10] [INFO ] Invariant cache hit.
[2024-05-27 22:18:10] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 44 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-27 22:18:34] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 2 ms to minimize.
[2024-05-27 22:18:34] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:18:34] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 2 ms to minimize.
[2024-05-27 22:18:34] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:18:34] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 1 ms to minimize.
[2024-05-27 22:18:35] [INFO ] Deduced a trap composed of 73 places in 276 ms of which 4 ms to minimize.
[2024-05-27 22:18:35] [INFO ] Deduced a trap composed of 207 places in 274 ms of which 4 ms to minimize.
[2024-05-27 22:18:38] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2024-05-27 22:18:44] [INFO ] Deduced a trap composed of 117 places in 249 ms of which 3 ms to minimize.
[2024-05-27 22:18:44] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 2 ms to minimize.
[2024-05-27 22:18:48] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 2 ms to minimize.
[2024-05-27 22:18:50] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-05-27 22:18:52] [INFO ] Deduced a trap composed of 424 places in 398 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 57 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 13/13 constraints]
After SMT, in 42768ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 42785ms
Finished structural reductions in LTL mode , in 1 iterations and 42809 ms. Remains : 812/824 places, 1632/1642 transitions.
[2024-05-27 22:18:53] [INFO ] Flatten gal took : 63 ms
[2024-05-27 22:18:53] [INFO ] Flatten gal took : 65 ms
[2024-05-27 22:18:53] [INFO ] Input system was already deterministic with 1632 transitions.
Starting structural reductions in LTL mode, iteration 0 : 824/824 places, 1642/1642 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 822 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 812 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 812 transition count 1632
Applied a total of 22 rules in 24 ms. Remains 812 /824 variables (removed 12) and now considering 1632/1642 (removed 10) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:18:53] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:18:53] [INFO ] Invariant cache hit.
[2024-05-27 22:18:53] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 44 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-27 22:19:17] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 1 ms to minimize.
[2024-05-27 22:19:17] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-05-27 22:19:17] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 2 ms to minimize.
[2024-05-27 22:19:17] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-05-27 22:19:17] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-05-27 22:19:18] [INFO ] Deduced a trap composed of 73 places in 275 ms of which 4 ms to minimize.
[2024-05-27 22:19:18] [INFO ] Deduced a trap composed of 207 places in 326 ms of which 5 ms to minimize.
[2024-05-27 22:19:21] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-05-27 22:19:27] [INFO ] Deduced a trap composed of 117 places in 251 ms of which 4 ms to minimize.
[2024-05-27 22:19:27] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 2 ms to minimize.
[2024-05-27 22:19:32] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 2 ms to minimize.
[2024-05-27 22:19:34] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 56 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 12/12 constraints]
After SMT, in 42459ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 42492ms
Finished structural reductions in LTL mode , in 1 iterations and 42521 ms. Remains : 812/824 places, 1632/1642 transitions.
[2024-05-27 22:19:36] [INFO ] Flatten gal took : 46 ms
[2024-05-27 22:19:36] [INFO ] Flatten gal took : 49 ms
[2024-05-27 22:19:36] [INFO ] Input system was already deterministic with 1632 transitions.
Starting structural reductions in LTL mode, iteration 0 : 824/824 places, 1642/1642 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 822 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 812 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 812 transition count 1632
Applied a total of 22 rules in 20 ms. Remains 812 /824 variables (removed 12) and now considering 1632/1642 (removed 10) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:19:36] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:19:36] [INFO ] Invariant cache hit.
[2024-05-27 22:19:36] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 44 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-27 22:20:00] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 2 ms to minimize.
[2024-05-27 22:20:00] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 2 ms to minimize.
[2024-05-27 22:20:00] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 1 ms to minimize.
[2024-05-27 22:20:00] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 2 ms to minimize.
[2024-05-27 22:20:01] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 1 ms to minimize.
[2024-05-27 22:20:02] [INFO ] Deduced a trap composed of 73 places in 373 ms of which 5 ms to minimize.
[2024-05-27 22:20:02] [INFO ] Deduced a trap composed of 207 places in 356 ms of which 6 ms to minimize.
[2024-05-27 22:20:05] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-05-27 22:20:12] [INFO ] Deduced a trap composed of 117 places in 294 ms of which 4 ms to minimize.
[2024-05-27 22:20:12] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 1 ms to minimize.
[2024-05-27 22:20:17] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 7)
(s1 3)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 1)
(s15 1)
(s16 0)
(s17 1)
(s18 2)
(s19 1)
(s20 1)
(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 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 1)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 1)
(s180 1)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 9)
(s243 0)
(s244 1)
(s245 1)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 1)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 55 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 11/11 constraints]
After SMT, in 42917ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 42932ms
Finished structural reductions in LTL mode , in 1 iterations and 42956 ms. Remains : 812/824 places, 1632/1642 transitions.
[2024-05-27 22:20:19] [INFO ] Flatten gal took : 58 ms
[2024-05-27 22:20:19] [INFO ] Flatten gal took : 61 ms
[2024-05-27 22:20:19] [INFO ] Input system was already deterministic with 1632 transitions.
Starting structural reductions in LTL mode, iteration 0 : 824/824 places, 1642/1642 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 822 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 812 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 812 transition count 1632
Applied a total of 22 rules in 26 ms. Remains 812 /824 variables (removed 12) and now considering 1632/1642 (removed 10) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-27 22:20:19] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-27 22:20:19] [INFO ] Invariant cache hit.
[2024-05-27 22:20:19] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 44 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-27 22:20:43] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 2 ms to minimize.
[2024-05-27 22:20:43] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 1 ms to minimize.
[2024-05-27 22:20:43] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 1 ms to minimize.
[2024-05-27 22:20:43] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 1 ms to minimize.
[2024-05-27 22:20:43] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2024-05-27 22:20:44] [INFO ] Deduced a trap composed of 73 places in 316 ms of which 5 ms to minimize.
[2024-05-27 22:20:45] [INFO ] Deduced a trap composed of 207 places in 340 ms of which 6 ms to minimize.
[2024-05-27 22:20:47] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 1 ms to minimize.
[2024-05-27 22:20:54] [INFO ] Deduced a trap composed of 117 places in 284 ms of which 4 ms to minimize.
[2024-05-27 22:20:54] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 1 ms to minimize.
[2024-05-27 22:20:59] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 2 ms to minimize.
[2024-05-27 22:21:00] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 56 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 12/12 constraints]
After SMT, in 42583ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 42603ms
Finished structural reductions in LTL mode , in 1 iterations and 42633 ms. Remains : 812/824 places, 1632/1642 transitions.
[2024-05-27 22:21:02] [INFO ] Flatten gal took : 86 ms
[2024-05-27 22:21:02] [INFO ] Flatten gal took : 67 ms
[2024-05-27 22:21:02] [INFO ] Input system was already deterministic with 1632 transitions.
[2024-05-27 22:21:02] [INFO ] Flatten gal took : 62 ms
[2024-05-27 22:21:02] [INFO ] Flatten gal took : 64 ms
[2024-05-27 22:21:02] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-27 22:21:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 824 places, 1642 transitions and 7142 arcs took 17 ms.
Total runtime 299387 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-COL-S02J06T10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 824
TRANSITIONS: 1642
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.044s, Sys 0.007s]


SAVING FILE /home/mcc/execution/416/model (.net / .def) ...
EXPORT TIME: [User 0.006s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

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

Process ID: 985
MODEL NAME: /home/mcc/execution/416/model
824 places, 1642 transitions.

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

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S02J06T10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBLF-COL-S02J06T10, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445200113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T10.tgz
mv PolyORBLF-COL-S02J06T10 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;