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-171654445100081.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-S02J04T08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445100081
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 7.4K Apr 11 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 11 16:52 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.6K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K 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 9.0K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Apr 11 17:01 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-S02J04T08-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716844397974

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-S02J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 21:13:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-27 21:13:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 21:13:19] [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 21:13:19] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 21:13:20] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 658 ms
[2024-05-27 21:13:20] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 614 PT places and 1300.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
[2024-05-27 21:13:20] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-27 21:13:20] [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 (18 resets) in 1909 ms. (20 steps per ms) remains 47/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 194 ms. (20 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (8 resets) in 227 ms. (17 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (8 resets) in 49 ms. (80 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (9 resets) in 33 ms. (117 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 47 ms. (83 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (8 resets) in 30 ms. (129 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 69 ms. (57 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (8 resets) in 35 ms. (111 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (9 resets) in 27 ms. (142 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (9 resets) in 29 ms. (133 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (8 resets) in 38 ms. (102 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 51 ms. (76 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (8 resets) in 37 ms. (105 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (8 resets) in 40 ms. (97 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 48 ms. (81 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (9 resets) in 35 ms. (111 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (8 resets) in 40 ms. (97 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
[2024-05-27 21:13:21] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 21:13:21] [INFO ] Computed 26 invariants in 8 ms
[2024-05-27 21:13:21] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem AtomicPropp26 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 46 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp64 is UNSAT
At refinement iteration 3 (OVERLAPS) 16/73 variables, 9/11 constraints. Problems are: Problem set: 25 solved, 22 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp53 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 3/14 constraints. Problems are: Problem set: 29 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/14 constraints. Problems are: Problem set: 29 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 1/74 variables, 1/15 constraints. Problems are: Problem set: 29 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/15 constraints. Problems are: Problem set: 29 solved, 18 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp63 is UNSAT
At refinement iteration 8 (OVERLAPS) 7/81 variables, 11/26 constraints. Problems are: Problem set: 43 solved, 4 unsolved
[2024-05-27 21:13:22] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 15 ms to minimize.
[2024-05-27 21:13:22] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-27 21:13:22] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-27 21:13:22] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
Problem AtomicPropp50 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 4/30 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 0/30 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 64/145 variables, 81/111 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/145 variables, 8/119 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/145 variables, 0/119 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/145 variables, 0/119 constraints. Problems are: Problem set: 44 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 119 constraints, problems are : Problem set: 44 solved, 3 unsolved in 1149 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: 47/47 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 44 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 38/46 variables, 4/4 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/52 variables, 4/8 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/8 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/53 variables, 1/9 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 44 solved, 3 unsolved
Problem AtomicPropp17 is UNSAT
At refinement iteration 7 (OVERLAPS) 23/76 variables, 13/22 constraints. Problems are: Problem set: 45 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 4/26 constraints. Problems are: Problem set: 45 solved, 2 unsolved
[2024-05-27 21:13:23] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 1/27 constraints. Problems are: Problem set: 45 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/76 variables, 0/27 constraints. Problems are: Problem set: 45 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/77 variables, 1/28 constraints. Problems are: Problem set: 45 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/77 variables, 0/28 constraints. Problems are: Problem set: 45 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/79 variables, 2/30 constraints. Problems are: Problem set: 45 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/79 variables, 0/30 constraints. Problems are: Problem set: 45 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 64/143 variables, 79/109 constraints. Problems are: Problem set: 45 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/143 variables, 8/117 constraints. Problems are: Problem set: 45 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 2/119 constraints. Problems are: Problem set: 45 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 0/119 constraints. Problems are: Problem set: 45 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/145 variables, 2/121 constraints. Problems are: Problem set: 45 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/145 variables, 1/122 constraints. Problems are: Problem set: 45 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 0/122 constraints. Problems are: Problem set: 45 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/145 variables, 0/122 constraints. Problems are: Problem set: 45 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 122 constraints, problems are : Problem set: 45 solved, 2 unsolved in 290 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: 2/47 constraints, Known Traps: 5/5 constraints]
After SMT, in 1495ms problems are : Problem set: 45 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 122 ms.
Support contains 4 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 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 80 transition count 57
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 72 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 71 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 19 place count 71 transition count 53
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 25 place count 68 transition count 53
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 37 place count 62 transition count 47
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 62 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 61 transition count 46
Applied a total of 39 rules in 32 ms. Remains 61 /81 variables (removed 20) and now considering 46/65 (removed 19) transitions.
Running 45 sub problems to find dead transitions.
[2024-05-27 21:13:23] [INFO ] Flow matrix only has 45 transitions (discarded 1 similar events)
// Phase 1: matrix 45 rows 61 cols
[2024-05-27 21:13:23] [INFO ] Computed 25 invariants in 4 ms
[2024-05-27 21:13:23] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-27 21:13:23] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/61 variables, 1/26 constraints. Problems are: Problem set: 2 solved, 43 unsolved
[2024-05-27 21:13:24] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-27 21:13:24] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 2 ms to minimize.
[2024-05-27 21:13:24] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-27 21:13:24] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 4/30 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/30 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 45/106 variables, 61/91 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 8/99 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 0/99 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 0/106 variables, 0/99 constraints. Problems are: Problem set: 2 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 99 constraints, problems are : Problem set: 2 solved, 43 unsolved in 3913 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 61/61 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 2 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 4/28 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/28 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 1/61 variables, 1/29 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 1/30 constraints. Problems are: Problem set: 2 solved, 43 unsolved
[2024-05-27 21:13:27] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 1/31 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/31 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 45/106 variables, 61/92 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 8/100 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 43/143 constraints. Problems are: Problem set: 2 solved, 43 unsolved
[2024-05-27 21:13:28] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 1/144 constraints. Problems are: Problem set: 2 solved, 43 unsolved
[2024-05-27 21:13:28] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/106 variables, 1/145 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/106 variables, 0/145 constraints. Problems are: Problem set: 2 solved, 43 unsolved
[2024-05-27 21:13:29] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/106 variables, 1/146 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/106 variables, 0/146 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 16 (OVERLAPS) 0/106 variables, 0/146 constraints. Problems are: Problem set: 2 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 146 constraints, problems are : Problem set: 2 solved, 43 unsolved in 2537 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 61/61 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 43/45 constraints, Known Traps: 9/9 constraints]
After SMT, in 6490ms problems are : Problem set: 2 solved, 43 unsolved
Search for dead transitions found 2 dead transitions in 6492ms
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 : 61/81 places, 44/65 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 60 transition count 42
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 59 transition count 40
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 8 ms. Remains 59 /61 variables (removed 2) and now considering 40/44 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6546 ms. Remains : 59/81 places, 40/65 transitions.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Successfully simplified 47 atomic propositions for a total of 15 simplifications.
FORMULA PolyORBLF-COL-S02J04T08-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 21:13:29] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2024-05-27 21:13:29] [INFO ] Flatten gal took : 40 ms
[2024-05-27 21:13:29] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-COL-S02J04T08-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 21:13:30] [INFO ] Flatten gal took : 15 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 21:13:30] [INFO ] Unfolded HLPN to a Petri net with 614 places and 1242 transitions 5732 arcs in 37 ms.
[2024-05-27 21:13:30] [INFO ] Unfolded 5 HLPN properties in 0 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 151 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 612 transition count 1114
Applied a total of 2 rules in 42 ms. Remains 612 /614 variables (removed 2) and now considering 1114/1114 (removed 0) transitions.
Running 1112 sub problems to find dead transitions.
[2024-05-27 21:13:30] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 612 cols
[2024-05-27 21:13:30] [INFO ] Computed 48 invariants in 53 ms
[2024-05-27 21:13:30] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-27 21:13:44] [INFO ] Deduced a trap composed of 65 places in 185 ms of which 4 ms to minimize.
[2024-05-27 21:13:44] [INFO ] Deduced a trap composed of 65 places in 166 ms of which 3 ms to minimize.
[2024-05-27 21:13:45] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 1 ms to minimize.
[2024-05-27 21:13:45] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 1 ms to minimize.
[2024-05-27 21:13:45] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 2 ms to minimize.
[2024-05-27 21:13:45] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 2 ms to minimize.
[2024-05-27 21:13:45] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 1 ms to minimize.
[2024-05-27 21:13:45] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 2 ms to minimize.
[2024-05-27 21:13:48] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
[2024-05-27 21:13:49] [INFO ] Deduced a trap composed of 300 places in 321 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 610/1710 variables, and 56 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/612 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1112/1112 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-27 21:13:54] [INFO ] Deduced a trap composed of 139 places in 269 ms of which 4 ms to minimize.
[2024-05-27 21:13:55] [INFO ] Deduced a trap composed of 184 places in 263 ms of which 4 ms to minimize.
[2024-05-27 21:13:55] [INFO ] Deduced a trap composed of 198 places in 245 ms of which 4 ms to minimize.
[2024-05-27 21:13:55] [INFO ] Deduced a trap composed of 317 places in 243 ms of which 4 ms to minimize.
[2024-05-27 21:13:56] [INFO ] Deduced a trap composed of 371 places in 231 ms of which 4 ms to minimize.
[2024-05-27 21:14:04] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 6 ms to minimize.
[2024-05-27 21:14:04] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 3 ms to minimize.
[2024-05-27 21:14:05] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 3 ms to minimize.
[2024-05-27 21:14:08] [INFO ] Deduced a trap composed of 284 places in 251 ms of which 3 ms to minimize.
[2024-05-27 21:14:08] [INFO ] Deduced a trap composed of 324 places in 242 ms of which 4 ms to minimize.
[2024-05-27 21:14:09] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 2 ms to minimize.
[2024-05-27 21:14:10] [INFO ] Deduced a trap composed of 327 places in 262 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 610/1710 variables, and 68 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/612 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1112 constraints, Known Traps: 22/22 constraints]
After SMT, in 41670ms problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 41690ms
[2024-05-27 21:14:11] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-05-27 21:14:11] [INFO ] Invariant cache hit.
[2024-05-27 21:14:12] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-27 21:14:12] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-05-27 21:14:12] [INFO ] Invariant cache hit.
[2024-05-27 21:14:12] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 21:14:19] [INFO ] Implicit Places using invariants and state equation in 6987 ms returned []
Implicit Place search using SMT with State Equation took 7341 ms to find 0 implicit places.
Running 1112 sub problems to find dead transitions.
[2024-05-27 21:14:19] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-05-27 21:14:19] [INFO ] Invariant cache hit.
[2024-05-27 21:14:19] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-27 21:14:31] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 1 ms to minimize.
[2024-05-27 21:14:33] [INFO ] Deduced a trap composed of 65 places in 152 ms of which 2 ms to minimize.
[2024-05-27 21:14:33] [INFO ] Deduced a trap composed of 66 places in 45 ms of which 1 ms to minimize.
[2024-05-27 21:14:33] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 1 ms to minimize.
[2024-05-27 21:14:33] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 2 ms to minimize.
[2024-05-27 21:14:33] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 1 ms to minimize.
[2024-05-27 21:14:33] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2024-05-27 21:14:33] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 1 ms to minimize.
[2024-05-27 21:14:35] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2024-05-27 21:14:37] [INFO ] Deduced a trap composed of 308 places in 346 ms of which 5 ms to minimize.
[2024-05-27 21:14:37] [INFO ] Deduced a trap composed of 326 places in 330 ms of which 5 ms to minimize.
[2024-05-27 21:14:38] [INFO ] Deduced a trap composed of 340 places in 319 ms of which 5 ms to minimize.
[2024-05-27 21:14:38] [INFO ] Deduced a trap composed of 338 places in 288 ms of which 5 ms to minimize.
[2024-05-27 21:14:42] [INFO ] Deduced a trap composed of 70 places in 322 ms of which 5 ms to minimize.
[2024-05-27 21:14:42] [INFO ] Deduced a trap composed of 328 places in 319 ms of which 5 ms to minimize.
[2024-05-27 21:14:43] [INFO ] Deduced a trap composed of 344 places in 335 ms of which 5 ms to minimize.
[2024-05-27 21:14:43] [INFO ] Deduced a trap composed of 332 places in 303 ms of which 5 ms to minimize.
[2024-05-27 21:14:43] [INFO ] Deduced a trap composed of 333 places in 265 ms of which 4 ms to minimize.
[2024-05-27 21:14:44] [INFO ] Deduced a trap composed of 333 places in 263 ms of which 4 ms to minimize.
[2024-05-27 21:14:44] [INFO ] Deduced a trap composed of 3 places in 300 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-27 21:14:45] [INFO ] Deduced a trap composed of 314 places in 299 ms of which 5 ms to minimize.
[2024-05-27 21:14:46] [INFO ] Deduced a trap composed of 164 places in 255 ms of which 4 ms to minimize.
[2024-05-27 21:14:46] [INFO ] Deduced a trap composed of 183 places in 240 ms of which 4 ms to minimize.
[2024-05-27 21:14:46] [INFO ] Deduced a trap composed of 197 places in 215 ms of which 3 ms to minimize.
[2024-05-27 21:14:47] [INFO ] Deduced a trap composed of 201 places in 265 ms of which 4 ms to minimize.
[2024-05-27 21:14:47] [INFO ] Deduced a trap composed of 369 places in 311 ms of which 5 ms to minimize.
[2024-05-27 21:14:47] [INFO ] Deduced a trap composed of 372 places in 261 ms of which 5 ms to minimize.
[2024-05-27 21:14:48] [INFO ] Deduced a trap composed of 314 places in 290 ms of which 5 ms to minimize.
[2024-05-27 21:14:49] [INFO ] Deduced a trap composed of 331 places in 263 ms of which 4 ms to minimize.
[2024-05-27 21:14:49] [INFO ] Deduced a trap composed of 320 places in 251 ms of which 3 ms to minimize.
[2024-05-27 21:14:49] [INFO ] Deduced a trap composed of 322 places in 287 ms of which 4 ms to minimize.
[2024-05-27 21:14:49] [INFO ] Deduced a trap composed of 329 places in 268 ms of which 3 ms to minimize.
[2024-05-27 21:14:50] [INFO ] Deduced a trap composed of 348 places in 265 ms of which 4 ms to minimize.
[2024-05-27 21:14:50] [INFO ] Deduced a trap composed of 333 places in 277 ms of which 4 ms to minimize.
[2024-05-27 21:14:50] [INFO ] Deduced a trap composed of 332 places in 271 ms of which 3 ms to minimize.
[2024-05-27 21:14:51] [INFO ] Deduced a trap composed of 300 places in 286 ms of which 3 ms to minimize.
SMT process timed out in 31983ms, After SMT, problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 32006ms
Starting structural reductions in LTL mode, iteration 1 : 612/614 places, 1114/1114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81105 ms. Remains : 612/614 places, 1114/1114 transitions.
Support contains 151 out of 612 places after structural reductions.
[2024-05-27 21:14:51] [INFO ] Flatten gal took : 112 ms
[2024-05-27 21:14:51] [INFO ] Flatten gal took : 92 ms
[2024-05-27 21:14:51] [INFO ] Input system was already deterministic with 1114 transitions.
RANDOM walk for 40000 steps (12 resets) in 1026 ms. (38 steps per ms) remains 10/16 properties
BEST_FIRST walk for 40002 steps (8 resets) in 249 ms. (160 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 271 ms. (147 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 241 ms. (165 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (10 resets) in 268 ms. (148 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 292 ms. (136 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (9 resets) in 252 ms. (158 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 246 ms. (161 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (9 resets) in 274 ms. (145 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 185 ms. (215 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (9 resets) in 168 ms. (236 steps per ms) remains 10/10 properties
[2024-05-27 21:14:52] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-05-27 21:14:52] [INFO ] Invariant cache hit.
[2024-05-27 21:14:52] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
At refinement iteration 1 (OVERLAPS) 427/522 variables, 8/8 constraints. Problems are: Problem set: 7 solved, 3 unsolved
[2024-05-27 21:14:53] [INFO ] Deduced a trap composed of 163 places in 113 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/522 variables, 1/9 constraints. Problems are: Problem set: 7 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/522 variables, 0/9 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 11/533 variables, 3/12 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 0/12 constraints. Problems are: Problem set: 7 solved, 3 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
After SMT solving in domain Real declared 610/1710 variables, and 47 constraints, problems are : Problem set: 10 solved, 0 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 11/13 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 0/612 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints]
After SMT, in 384ms problems are : Problem set: 10 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 10 atomic propositions for a total of 5 simplifications.
[2024-05-27 21:14:53] [INFO ] Flatten gal took : 50 ms
[2024-05-27 21:14:53] [INFO ] Flatten gal took : 59 ms
[2024-05-27 21:14:53] [INFO ] Input system was already deterministic with 1114 transitions.
FORMULA PolyORBLF-COL-S02J04T08-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 612 transition count 1042
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 540 transition count 1042
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 144 place count 540 transition count 978
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 272 place count 476 transition count 978
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 400 place count 412 transition count 914
Applied a total of 400 rules in 130 ms. Remains 412 /612 variables (removed 200) and now considering 914/1114 (removed 200) transitions.
Running 912 sub problems to find dead transitions.
[2024-05-27 21:14:53] [INFO ] Flow matrix only has 898 transitions (discarded 16 similar events)
// Phase 1: matrix 898 rows 412 cols
[2024-05-27 21:14:53] [INFO ] Computed 48 invariants in 18 ms
[2024-05-27 21:14:53] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 912 unsolved
[2024-05-27 21:15:00] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-05-27 21:15:00] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-05-27 21:15:00] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
[2024-05-27 21:15:00] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 2 ms to minimize.
[2024-05-27 21:15:00] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-27 21:15:00] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-05-27 21:15:00] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-05-27 21:15:00] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
[2024-05-27 21:15:01] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 4 ms to minimize.
[2024-05-27 21:15:01] [INFO ] Deduced a trap composed of 173 places in 209 ms of which 3 ms to minimize.
[2024-05-27 21:15:01] [INFO ] Deduced a trap composed of 178 places in 212 ms of which 3 ms to minimize.
[2024-05-27 21:15:01] [INFO ] Deduced a trap composed of 155 places in 203 ms of which 3 ms to minimize.
[2024-05-27 21:15:03] [INFO ] Deduced a trap composed of 234 places in 239 ms of which 4 ms to minimize.
[2024-05-27 21:15:04] [INFO ] Deduced a trap composed of 153 places in 240 ms of which 4 ms to minimize.
[2024-05-27 21:15:08] [INFO ] Deduced a trap composed of 47 places in 154 ms of which 2 ms to minimize.
[2024-05-27 21:15:09] [INFO ] Deduced a trap composed of 142 places in 214 ms of which 3 ms to minimize.
[2024-05-27 21:15:10] [INFO ] Deduced a trap composed of 184 places in 230 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 912 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/1310 variables, and 63 constraints, problems are : Problem set: 0 solved, 912 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 912/912 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 912 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 912 unsolved
[2024-05-27 21:15:17] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 912 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/1310 variables, and 64 constraints, problems are : Problem set: 0 solved, 912 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/912 constraints, Known Traps: 18/18 constraints]
After SMT, in 41322ms problems are : Problem set: 0 solved, 912 unsolved
Search for dead transitions found 0 dead transitions in 41331ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41467 ms. Remains : 412/612 places, 914/1114 transitions.
[2024-05-27 21:15:35] [INFO ] Flatten gal took : 37 ms
[2024-05-27 21:15:35] [INFO ] Flatten gal took : 38 ms
[2024-05-27 21:15:35] [INFO ] Input system was already deterministic with 914 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Applied a total of 16 rules in 29 ms. Remains 604 /612 variables (removed 8) and now considering 1106/1114 (removed 8) transitions.
Running 1104 sub problems to find dead transitions.
[2024-05-27 21:15:35] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
// Phase 1: matrix 1090 rows 604 cols
[2024-05-27 21:15:35] [INFO ] Computed 48 invariants in 41 ms
[2024-05-27 21:15:35] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
[2024-05-27 21:15:46] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-27 21:15:49] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2024-05-27 21:15:49] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-05-27 21:15:49] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-05-27 21:15:49] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-27 21:15:49] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-05-27 21:15:49] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 2 ms to minimize.
[2024-05-27 21:15:50] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-27 21:15:52] [INFO ] Deduced a trap composed of 337 places in 317 ms of which 4 ms to minimize.
[2024-05-27 21:15:52] [INFO ] Deduced a trap composed of 299 places in 318 ms of which 5 ms to minimize.
[2024-05-27 21:15:53] [INFO ] Deduced a trap composed of 329 places in 268 ms of which 4 ms to minimize.
[2024-05-27 21:15:53] [INFO ] Deduced a trap composed of 367 places in 304 ms of which 4 ms to minimize.
[2024-05-27 21:15:53] [INFO ] Deduced a trap composed of 19 places in 319 ms of which 5 ms to minimize.
[2024-05-27 21:15:54] [INFO ] Deduced a trap composed of 342 places in 330 ms of which 5 ms to minimize.
[2024-05-27 21:15:54] [INFO ] Deduced a trap composed of 350 places in 318 ms of which 5 ms to minimize.
[2024-05-27 21:15:54] [INFO ] Deduced a trap composed of 333 places in 285 ms of which 4 ms to minimize.
[2024-05-27 21:15:55] [INFO ] Deduced a trap composed of 322 places in 275 ms of which 4 ms to minimize.
[2024-05-27 21:15:55] [INFO ] Deduced a trap composed of 319 places in 298 ms of which 5 ms to minimize.
[2024-05-27 21:15:55] [INFO ] Deduced a trap composed of 316 places in 281 ms of which 4 ms to minimize.
[2024-05-27 21:15:56] [INFO ] Deduced a trap composed of 300 places in 299 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
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 602/1694 variables, and 66 constraints, problems are : Problem set: 0 solved, 1104 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/604 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1104/1104 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
[2024-05-27 21:15:58] [INFO ] Deduced a trap composed of 173 places in 274 ms of which 4 ms to minimize.
[2024-05-27 21:15:59] [INFO ] Deduced a trap composed of 288 places in 313 ms of which 4 ms to minimize.
[2024-05-27 21:16:05] [INFO ] Deduced a trap composed of 406 places in 299 ms of which 4 ms to minimize.
[2024-05-27 21:16:06] [INFO ] Deduced a trap composed of 415 places in 298 ms of which 5 ms to minimize.
[2024-05-27 21:16:06] [INFO ] Deduced a trap composed of 400 places in 289 ms of which 4 ms to minimize.
[2024-05-27 21:16:06] [INFO ] Deduced a trap composed of 330 places in 303 ms of which 5 ms to minimize.
[2024-05-27 21:16:06] [INFO ] Deduced a trap composed of 340 places in 294 ms of which 9 ms to minimize.
[2024-05-27 21:16:07] [INFO ] Deduced a trap composed of 406 places in 279 ms of which 5 ms to minimize.
[2024-05-27 21:16:12] [INFO ] Deduced a trap composed of 315 places in 303 ms of which 4 ms to minimize.
[2024-05-27 21:16:13] [INFO ] Deduced a trap composed of 319 places in 310 ms of which 4 ms to minimize.
[2024-05-27 21:16:13] [INFO ] Deduced a trap composed of 319 places in 275 ms of which 4 ms to minimize.
[2024-05-27 21:16:13] [INFO ] Deduced a trap composed of 47 places in 286 ms of which 4 ms to minimize.
[2024-05-27 21:16:14] [INFO ] Deduced a trap composed of 322 places in 231 ms of which 3 ms to minimize.
[2024-05-27 21:16:14] [INFO ] Deduced a trap composed of 340 places in 296 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/1694 variables, and 80 constraints, problems are : Problem set: 0 solved, 1104 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/604 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1104 constraints, Known Traps: 34/34 constraints]
After SMT, in 41409ms problems are : Problem set: 0 solved, 1104 unsolved
Search for dead transitions found 0 dead transitions in 41424ms
Finished structural reductions in LTL mode , in 1 iterations and 41459 ms. Remains : 604/612 places, 1106/1114 transitions.
[2024-05-27 21:16:16] [INFO ] Flatten gal took : 71 ms
[2024-05-27 21:16:16] [INFO ] Flatten gal took : 72 ms
[2024-05-27 21:16:16] [INFO ] Input system was already deterministic with 1106 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 612 transition count 1058
Reduce places removed 56 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 64 rules applied. Total rules applied 120 place count 556 transition count 1050
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 128 place count 548 transition count 1050
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 128 place count 548 transition count 978
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 272 place count 476 transition count 978
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 352 place count 436 transition count 938
Applied a total of 352 rules in 75 ms. Remains 436 /612 variables (removed 176) and now considering 938/1114 (removed 176) transitions.
Running 936 sub problems to find dead transitions.
[2024-05-27 21:16:17] [INFO ] Flow matrix only has 922 transitions (discarded 16 similar events)
// Phase 1: matrix 922 rows 436 cols
[2024-05-27 21:16:17] [INFO ] Computed 48 invariants in 21 ms
[2024-05-27 21:16:17] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 936 unsolved
[2024-05-27 21:16:24] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 2 ms to minimize.
[2024-05-27 21:16:24] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2024-05-27 21:16:24] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
[2024-05-27 21:16:24] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-27 21:16:25] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-27 21:16:25] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-05-27 21:16:25] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 2 ms to minimize.
[2024-05-27 21:16:25] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-27 21:16:27] [INFO ] Deduced a trap composed of 270 places in 186 ms of which 3 ms to minimize.
[2024-05-27 21:16:30] [INFO ] Deduced a trap composed of 169 places in 236 ms of which 3 ms to minimize.
[2024-05-27 21:16:31] [INFO ] Deduced a trap composed of 202 places in 216 ms of which 3 ms to minimize.
[2024-05-27 21:16:31] [INFO ] Deduced a trap composed of 261 places in 204 ms of which 4 ms to minimize.
[2024-05-27 21:16:31] [INFO ] Deduced a trap composed of 193 places in 196 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 936 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/1358 variables, and 59 constraints, problems are : Problem set: 0 solved, 936 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/436 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 936/936 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 936 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 936 unsolved
[2024-05-27 21:16:42] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 3 ms to minimize.
[2024-05-27 21:16:42] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 2 ms to minimize.
[2024-05-27 21:16:45] [INFO ] Deduced a trap composed of 158 places in 263 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 936 unsolved
[2024-05-27 21:16:52] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 3 ms to minimize.
[2024-05-27 21:16:56] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/1358 variables, and 64 constraints, problems are : Problem set: 0 solved, 936 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/436 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/936 constraints, Known Traps: 18/18 constraints]
After SMT, in 41472ms problems are : Problem set: 0 solved, 936 unsolved
Search for dead transitions found 0 dead transitions in 41486ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41565 ms. Remains : 436/612 places, 938/1114 transitions.
[2024-05-27 21:16:58] [INFO ] Flatten gal took : 30 ms
[2024-05-27 21:16:58] [INFO ] Flatten gal took : 75 ms
[2024-05-27 21:16:58] [INFO ] Input system was already deterministic with 938 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 31 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-27 21:16:58] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 596 cols
[2024-05-27 21:16:58] [INFO ] Computed 48 invariants in 29 ms
[2024-05-27 21:16:58] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:17:09] [INFO ] Deduced a trap composed of 63 places in 127 ms of which 3 ms to minimize.
[2024-05-27 21:17:09] [INFO ] Deduced a trap composed of 63 places in 103 ms of which 3 ms to minimize.
[2024-05-27 21:17:10] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-05-27 21:17:10] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-27 21:17:10] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 1 ms to minimize.
[2024-05-27 21:17:10] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-05-27 21:17:10] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-05-27 21:17:10] [INFO ] Deduced a trap composed of 328 places in 317 ms of which 5 ms to minimize.
[2024-05-27 21:17:11] [INFO ] Deduced a trap composed of 316 places in 290 ms of which 5 ms to minimize.
[2024-05-27 21:17:11] [INFO ] Deduced a trap composed of 327 places in 282 ms of which 5 ms to minimize.
[2024-05-27 21:17:11] [INFO ] Deduced a trap composed of 320 places in 295 ms of which 8 ms to minimize.
[2024-05-27 21:17:12] [INFO ] Deduced a trap composed of 302 places in 240 ms of which 3 ms to minimize.
[2024-05-27 21:17:12] [INFO ] Deduced a trap composed of 183 places in 290 ms of which 4 ms to minimize.
[2024-05-27 21:17:13] [INFO ] Deduced a trap composed of 327 places in 221 ms of which 4 ms to minimize.
[2024-05-27 21:17:14] [INFO ] Deduced a trap composed of 379 places in 285 ms of which 3 ms to minimize.
[2024-05-27 21:17:14] [INFO ] Deduced a trap composed of 313 places in 286 ms of which 3 ms to minimize.
[2024-05-27 21:17:14] [INFO ] Deduced a trap composed of 388 places in 320 ms of which 4 ms to minimize.
[2024-05-27 21:17:15] [INFO ] Deduced a trap composed of 301 places in 296 ms of which 4 ms to minimize.
[2024-05-27 21:17:15] [INFO ] Deduced a trap composed of 314 places in 251 ms of which 4 ms to minimize.
[2024-05-27 21:17:15] [INFO ] Deduced a trap composed of 324 places in 298 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:17:16] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2024-05-27 21:17:17] [INFO ] Deduced a trap composed of 356 places in 275 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 68 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 22/68 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-27 21:17:28] [INFO ] Deduced a trap composed of 306 places in 238 ms of which 3 ms to minimize.
[2024-05-27 21:17:29] [INFO ] Deduced a trap composed of 330 places in 307 ms of which 5 ms to minimize.
[2024-05-27 21:17:30] [INFO ] Deduced a trap composed of 346 places in 272 ms of which 4 ms to minimize.
[2024-05-27 21:17:30] [INFO ] Deduced a trap composed of 343 places in 263 ms of which 3 ms to minimize.
[2024-05-27 21:17:30] [INFO ] Deduced a trap composed of 307 places in 268 ms of which 4 ms to minimize.
[2024-05-27 21:17:34] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 3 ms to minimize.
[2024-05-27 21:17:34] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 3 ms to minimize.
[2024-05-27 21:17:35] [INFO ] Deduced a trap composed of 53 places in 146 ms of which 3 ms to minimize.
[2024-05-27 21:17:37] [INFO ] Deduced a trap composed of 352 places in 293 ms of which 4 ms to minimize.
[2024-05-27 21:17:37] [INFO ] Deduced a trap composed of 353 places in 283 ms of which 4 ms to minimize.
[2024-05-27 21:17:37] [INFO ] Deduced a trap composed of 355 places in 234 ms of which 4 ms to minimize.
[2024-05-27 21:17:38] [INFO ] Deduced a trap composed of 341 places in 319 ms of which 4 ms to minimize.
[2024-05-27 21:17:38] [INFO ] Deduced a trap composed of 421 places in 283 ms of which 4 ms to minimize.
[2024-05-27 21:17:38] [INFO ] Deduced a trap composed of 355 places in 274 ms of which 4 ms to minimize.
[2024-05-27 21:17:38] [INFO ] Deduced a trap composed of 427 places in 255 ms of which 4 ms to minimize.
[2024-05-27 21:17:39] [INFO ] Deduced a trap composed of 353 places in 249 ms of which 4 ms to minimize.
[2024-05-27 21:17:39] [INFO ] Deduced a trap composed of 373 places in 282 ms of which 4 ms to minimize.
[2024-05-27 21:17:39] [INFO ] Deduced a trap composed of 353 places in 257 ms of which 4 ms to minimize.
[2024-05-27 21:17:40] [INFO ] Deduced a trap composed of 354 places in 280 ms of which 4 ms to minimize.
[2024-05-27 21:17:40] [INFO ] Deduced a trap composed of 352 places in 253 ms of which 3 ms to minimize.
SMT process timed out in 41602ms, After SMT, problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41619ms
Finished structural reductions in LTL mode , in 1 iterations and 41655 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-05-27 21:17:40] [INFO ] Flatten gal took : 35 ms
[2024-05-27 21:17:40] [INFO ] Flatten gal took : 68 ms
[2024-05-27 21:17:40] [INFO ] Input system was already deterministic with 1098 transitions.
[2024-05-27 21:17:40] [INFO ] Flatten gal took : 49 ms
[2024-05-27 21:17:40] [INFO ] Flatten gal took : 46 ms
[2024-05-27 21:17:40] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-27 21:17:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 612 places, 1114 transitions and 4818 arcs took 16 ms.
Total runtime 261535 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-COL-S02J04T08

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/418/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 612
TRANSITIONS: 1114
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.030s, Sys 0.003s]


SAVING FILE /home/mcc/execution/418/model (.net / .def) ...
EXPORT TIME: [User 0.005s, 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: 1187
MODEL NAME: /home/mcc/execution/418/model
612 places, 1114 transitions.

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

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-S02J04T08"
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-S02J04T08, 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-171654445100081"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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