Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.4K Apr 11 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 11 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 16:47 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.4K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 11 17:00 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-S04J04T08-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-COL-S04J04T08-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717249827695

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:50:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 13:50:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:50:29] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 13:50:29] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 13:50:29] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 584 ms
[2024-06-01 13:50:29] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 712 PT places and 4080.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
[2024-06-01 13:50:29] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 4 ms.
[2024-06-01 13:50:29] [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 40003 steps (12 resets) in 1539 ms. (25 steps per ms) remains 50/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 79 ms. (50 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4000 steps (8 resets) in 44 ms. (88 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (9 resets) in 44 ms. (88 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 49/50 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 51 ms. (76 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (9 resets) in 21 ms. (181 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 49/49 properties
[2024-06-01 13:50:30] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 13:50:30] [INFO ] Computed 26 invariants in 14 ms
[2024-06-01 13:50:30] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp40 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 46 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp74 is UNSAT
At refinement iteration 3 (OVERLAPS) 20/68 variables, 9/11 constraints. Problems are: Problem set: 30 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 3/14 constraints. Problems are: Problem set: 30 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 30 solved, 19 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp71 is UNSAT
At refinement iteration 6 (OVERLAPS) 11/79 variables, 11/25 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/25 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 64/143 variables, 79/104 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 8/112 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/112 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/145 variables, 2/114 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/145 variables, 1/115 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 47 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 47 solved, 2 unsolved in 461 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: 49/49 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 47 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/46 variables, 5/5 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/5 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/51 variables, 4/9 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 47 solved, 2 unsolved
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp49 is UNSAT
After SMT solving in domain Int declared 73/145 variables, and 21 constraints, problems are : Problem set: 49 solved, 0 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 12/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 0/49 constraints, Known Traps: 0/0 constraints]
After SMT, in 580ms problems are : Problem set: 49 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 49 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-COL-S04J04T08-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:50:31] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2024-06-01 13:50:31] [INFO ] Flatten gal took : 25 ms
[2024-06-01 13:50:31] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA PolyORBLF-COL-S04J04T08-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:50:31] [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-06-01 13:50:31] [INFO ] Unfolded HLPN to a Petri net with 712 places and 4012 transitions 27744 arcs in 76 ms.
[2024-06-01 13:50:31] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
Support contains 349 out of 712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 1844/1844 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 708 transition count 1844
Applied a total of 4 rules in 58 ms. Remains 708 /712 variables (removed 4) and now considering 1844/1844 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-06-01 13:50:31] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 708 cols
[2024-06-01 13:50:31] [INFO ] Computed 50 invariants in 73 ms
[2024-06-01 13:50:31] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-06-01 13:50:55] [INFO ] Deduced a trap composed of 75 places in 142 ms of which 25 ms to minimize.
[2024-06-01 13:50:55] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 1 ms to minimize.
[2024-06-01 13:50:55] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 1 ms to minimize.
[2024-06-01 13:50:55] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 2 ms to minimize.
[2024-06-01 13:50:55] [INFO ] Deduced a trap composed of 75 places in 120 ms of which 1 ms to minimize.
[2024-06-01 13:50:55] [INFO ] Deduced a trap composed of 75 places in 127 ms of which 1 ms to minimize.
[2024-06-01 13:50:56] [INFO ] Deduced a trap composed of 75 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:50:56] [INFO ] Deduced a trap composed of 217 places in 361 ms of which 5 ms to minimize.
[2024-06-01 13:50:59] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 704/2520 variables, and 54 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 35/38 constraints, State Equation: 0/708 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1840/1840 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/704 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-06-01 13:51:02] [INFO ] Deduced a trap composed of 360 places in 409 ms of which 5 ms to minimize.
[2024-06-01 13:51:12] [INFO ] Deduced a trap composed of 412 places in 418 ms of which 4 ms to minimize.
[2024-06-01 13:51:13] [INFO ] Deduced a trap composed of 370 places in 400 ms of which 5 ms to minimize.
[2024-06-01 13:51:13] [INFO ] Deduced a trap composed of 428 places in 291 ms of which 3 ms to minimize.
[2024-06-01 13:51:13] [INFO ] Deduced a trap composed of 461 places in 289 ms of which 3 ms to minimize.
[2024-06-01 13:51:14] [INFO ] Deduced a trap composed of 5 places in 393 ms of which 5 ms to minimize.
[2024-06-01 13:51:14] [INFO ] Deduced a trap composed of 381 places in 377 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/2520 variables, and 61 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 35/38 constraints, State Equation: 0/708 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1840 constraints, Known Traps: 16/16 constraints]
After SMT, in 48021ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 48049ms
[2024-06-01 13:51:19] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-06-01 13:51:19] [INFO ] Invariant cache hit.
[2024-06-01 13:51:20] [INFO ] Implicit Places using invariants in 440 ms returned []
[2024-06-01 13:51:20] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-06-01 13:51:20] [INFO ] Invariant cache hit.
[2024-06-01 13:51:20] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 13:51:29] [INFO ] Implicit Places using invariants and state equation in 9713 ms returned []
Implicit Place search using SMT with State Equation took 10159 ms to find 0 implicit places.
Running 1840 sub problems to find dead transitions.
[2024-06-01 13:51:29] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-06-01 13:51:29] [INFO ] Invariant cache hit.
[2024-06-01 13:51:29] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-06-01 13:51:55] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:51:58] [INFO ] Deduced a trap composed of 75 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:51:58] [INFO ] Deduced a trap composed of 75 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:51:58] [INFO ] Deduced a trap composed of 75 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:51:58] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:51:58] [INFO ] Deduced a trap composed of 75 places in 60 ms of which 2 ms to minimize.
[2024-06-01 13:51:58] [INFO ] Deduced a trap composed of 75 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:52:00] [INFO ] Deduced a trap composed of 75 places in 74 ms of which 2 ms to minimize.
[2024-06-01 13:52:03] [INFO ] Deduced a trap composed of 395 places in 318 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 704/2520 variables, and 54 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 35/38 constraints, State Equation: 0/708 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1840/1840 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/704 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-06-01 13:52:09] [INFO ] Deduced a trap composed of 156 places in 458 ms of which 5 ms to minimize.
[2024-06-01 13:52:09] [INFO ] Deduced a trap composed of 212 places in 342 ms of which 3 ms to minimize.
[2024-06-01 13:52:10] [INFO ] Deduced a trap composed of 219 places in 285 ms of which 4 ms to minimize.
[2024-06-01 13:52:10] [INFO ] Deduced a trap composed of 212 places in 298 ms of which 4 ms to minimize.
[2024-06-01 13:52:10] [INFO ] Deduced a trap composed of 214 places in 336 ms of which 4 ms to minimize.
[2024-06-01 13:52:11] [INFO ] Deduced a trap composed of 213 places in 297 ms of which 4 ms to minimize.
[2024-06-01 13:52:12] [INFO ] Deduced a trap composed of 360 places in 313 ms of which 4 ms to minimize.
[2024-06-01 13:52:23] [INFO ] Deduced a trap composed of 351 places in 325 ms of which 4 ms to minimize.
[2024-06-01 13:52:23] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/2520 variables, and 63 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 35/38 constraints, State Equation: 0/708 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1840 constraints, Known Traps: 18/18 constraints]
After SMT, in 67412ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 67433ms
Starting structural reductions in LTL mode, iteration 1 : 708/712 places, 1844/1844 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125733 ms. Remains : 708/712 places, 1844/1844 transitions.
Support contains 349 out of 708 places after structural reductions.
[2024-06-01 13:52:37] [INFO ] Flatten gal took : 143 ms
[2024-06-01 13:52:37] [INFO ] Flatten gal took : 113 ms
[2024-06-01 13:52:37] [INFO ] Input system was already deterministic with 1844 transitions.
RANDOM walk for 40000 steps (8 resets) in 1107 ms. (36 steps per ms) remains 19/31 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 19/19 properties
[2024-06-01 13:52:38] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-06-01 13:52:38] [INFO ] Invariant cache hit.
[2024-06-01 13:52:38] [INFO ] State equation strengthened by 160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 1 (OVERLAPS) 82/297 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 16 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 1/6 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 12/309 variables, 4/10 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 15 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp29 is UNSAT
At refinement iteration 6 (OVERLAPS) 383/692 variables, 28/38 constraints. Problems are: Problem set: 15 solved, 4 unsolved
[2024-06-01 13:52:39] [INFO ] Deduced a trap composed of 75 places in 148 ms of which 3 ms to minimize.
[2024-06-01 13:52:39] [INFO ] Deduced a trap composed of 76 places in 121 ms of which 2 ms to minimize.
[2024-06-01 13:52:39] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 2 ms to minimize.
[2024-06-01 13:52:39] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 1 ms to minimize.
[2024-06-01 13:52:39] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/692 variables, 5/43 constraints. Problems are: Problem set: 15 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/692 variables, 0/43 constraints. Problems are: Problem set: 15 solved, 4 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 9 (OVERLAPS) 2/694 variables, 2/45 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/694 variables, 0/45 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 12/706 variables, 9/54 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/706 variables, 0/54 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1812/2518 variables, 706/760 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2518 variables, 160/920 constraints. Problems are: Problem set: 17 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2518/2520 variables, and 920 constraints, problems are : Problem set: 17 solved, 2 unsolved in 4035 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 706/708 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 17 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/66 variables, 1/1 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 617/683 variables, 28/29 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/683 variables, 5/34 constraints. Problems are: Problem set: 17 solved, 2 unsolved
[2024-06-01 13:52:43] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 2 ms to minimize.
[2024-06-01 13:52:43] [INFO ] Deduced a trap composed of 76 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/683 variables, 2/36 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/683 variables, 0/36 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 10/693 variables, 10/46 constraints. Problems are: Problem set: 17 solved, 2 unsolved
[2024-06-01 13:52:43] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/693 variables, 1/47 constraints. Problems are: Problem set: 17 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/693 variables, 0/47 constraints. Problems are: Problem set: 17 solved, 2 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 10 (OVERLAPS) 13/706 variables, 10/57 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/706 variables, 0/57 constraints. Problems are: Problem set: 18 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1812/2518 variables, 706/763 constraints. Problems are: Problem set: 18 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2518/2520 variables, and 923 constraints, problems are : Problem set: 18 solved, 1 unsolved in 2254 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 706/708 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 0/19 constraints, Known Traps: 8/8 constraints]
After SMT, in 6387ms problems are : Problem set: 18 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 708 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 708/708 places, 1844/1844 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 708 transition count 1772
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 636 transition count 1772
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 144 place count 636 transition count 1692
Deduced a syphon composed of 80 places in 6 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 304 place count 556 transition count 1692
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 448 place count 484 transition count 1620
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 464 place count 484 transition count 1604
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 480 place count 468 transition count 1604
Applied a total of 480 rules in 288 ms. Remains 468 /708 variables (removed 240) and now considering 1604/1844 (removed 240) transitions.
Running 1600 sub problems to find dead transitions.
[2024-06-01 13:52:45] [INFO ] Flow matrix only has 1572 transitions (discarded 32 similar events)
// Phase 1: matrix 1572 rows 468 cols
[2024-06-01 13:52:45] [INFO ] Computed 50 invariants in 38 ms
[2024-06-01 13:52:45] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 13:53:07] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 2 ms to minimize.
[2024-06-01 13:53:07] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 1 ms to minimize.
[2024-06-01 13:53:07] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:53:07] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:53:07] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:53:07] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:53:08] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 0 ms to minimize.
[2024-06-01 13:53:08] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:53:08] [INFO ] Deduced a trap composed of 199 places in 359 ms of which 4 ms to minimize.
[2024-06-01 13:53:09] [INFO ] Deduced a trap composed of 193 places in 290 ms of which 3 ms to minimize.
[2024-06-01 13:53:10] [INFO ] Deduced a trap composed of 33 places in 172 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/2040 variables, and 57 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 32/35 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 13:53:31] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 2 ms to minimize.
[2024-06-01 13:53:31] [INFO ] Deduced a trap composed of 180 places in 280 ms of which 3 ms to minimize.
[2024-06-01 13:53:32] [INFO ] Deduced a trap composed of 170 places in 259 ms of which 3 ms to minimize.
[2024-06-01 13:53:32] [INFO ] Deduced a trap composed of 158 places in 248 ms of which 5 ms to minimize.
[2024-06-01 13:53:33] [INFO ] Deduced a trap composed of 167 places in 293 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 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 9)
(s139 0)
(s140 1)
(s141 1)
(s142 1)
(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 0)
(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 0)
(s180 0)
(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 1)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(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 0)
(s243 0)
(s244 1)
(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 1)
(s283 0)
(s284 1)
(s285 1)
(s286 1)
(s287 0)
(s288 0)
(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 1)
(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 6)
(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 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 1)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 2)
(s393 1)
(s394 0)
(s395 1)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 1)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 8)
(s423 1)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 1)
(s434 0)
(s435 0)
(s436 0)
(s437 1)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/2040 variables, and 62 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 32/35 constraints, State Equation: 0/468 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 16/16 constraints]
After SMT, in 51088ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 51103ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51395 ms. Remains : 468/708 places, 1604/1844 transitions.
RANDOM walk for 40000 steps (8 resets) in 363 ms. (109 steps per ms) remains 1/1 properties
BEST_FIRST walk for 29554 steps (22 resets) in 184 ms. (159 steps per ms) remains 0/1 properties
Successfully simplified 18 atomic propositions for a total of 7 simplifications.
[2024-06-01 13:53:36] [INFO ] Flatten gal took : 97 ms
[2024-06-01 13:53:36] [INFO ] Flatten gal took : 110 ms
[2024-06-01 13:53:37] [INFO ] Input system was already deterministic with 1844 transitions.
Support contains 155 out of 708 places (down from 224) after GAL structural reductions.
FORMULA PolyORBLF-COL-S04J04T08-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 708/708 places, 1844/1844 transitions.
Applied a total of 0 rules in 18 ms. Remains 708 /708 variables (removed 0) and now considering 1844/1844 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-06-01 13:53:37] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 708 cols
[2024-06-01 13:53:37] [INFO ] Computed 50 invariants in 39 ms
[2024-06-01 13:53:37] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-06-01 13:54:00] [INFO ] Deduced a trap composed of 75 places in 131 ms of which 2 ms to minimize.
[2024-06-01 13:54:00] [INFO ] Deduced a trap composed of 75 places in 75 ms of which 2 ms to minimize.
[2024-06-01 13:54:00] [INFO ] Deduced a trap composed of 75 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:54:00] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:54:01] [INFO ] Deduced a trap composed of 75 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:54:01] [INFO ] Deduced a trap composed of 75 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:54:01] [INFO ] Deduced a trap composed of 75 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:54:01] [INFO ] Deduced a trap composed of 217 places in 353 ms of which 4 ms to minimize.
[2024-06-01 13:54:04] [INFO ] Deduced a trap composed of 75 places in 60 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 6.0)
(s1 4.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 9.0)
(s163 0.0)
(s164 1.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 1.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 704/2520 variables, and 54 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 35/38 constraints, State Equation: 0/708 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1840/1840 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/704 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-06-01 13:54:08] [INFO ] Deduced a trap composed of 360 places in 307 ms of which 4 ms to minimize.
[2024-06-01 13:54:17] [INFO ] Deduced a trap composed of 412 places in 385 ms of which 4 ms to minimize.
[2024-06-01 13:54:17] [INFO ] Deduced a trap composed of 370 places in 351 ms of which 4 ms to minimize.
[2024-06-01 13:54:18] [INFO ] Deduced a trap composed of 428 places in 304 ms of which 4 ms to minimize.
[2024-06-01 13:54:18] [INFO ] Deduced a trap composed of 461 places in 297 ms of which 4 ms to minimize.
[2024-06-01 13:54:18] [INFO ] Deduced a trap composed of 5 places in 321 ms of which 3 ms to minimize.
[2024-06-01 13:54:19] [INFO ] Deduced a trap composed of 381 places in 300 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/2520 variables, and 61 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 35/38 constraints, State Equation: 0/708 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1840 constraints, Known Traps: 16/16 constraints]
After SMT, in 48016ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 48032ms
Finished structural reductions in LTL mode , in 1 iterations and 48056 ms. Remains : 708/708 places, 1844/1844 transitions.
[2024-06-01 13:54:25] [INFO ] Flatten gal took : 63 ms
[2024-06-01 13:54:25] [INFO ] Flatten gal took : 72 ms
[2024-06-01 13:54:25] [INFO ] Input system was already deterministic with 1844 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 708/708 places, 1844/1844 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 708 transition count 1772
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 636 transition count 1772
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 144 place count 636 transition count 1724
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 240 place count 588 transition count 1724
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 400 place count 508 transition count 1644
Applied a total of 400 rules in 106 ms. Remains 508 /708 variables (removed 200) and now considering 1644/1844 (removed 200) transitions.
Running 1640 sub problems to find dead transitions.
[2024-06-01 13:54:25] [INFO ] Flow matrix only has 1612 transitions (discarded 32 similar events)
// Phase 1: matrix 1612 rows 508 cols
[2024-06-01 13:54:25] [INFO ] Computed 50 invariants in 23 ms
[2024-06-01 13:54:25] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/504 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-06-01 13:54:45] [INFO ] Deduced a trap composed of 50 places in 172 ms of which 2 ms to minimize.
[2024-06-01 13:54:46] [INFO ] Deduced a trap composed of 33 places in 213 ms of which 2 ms to minimize.
[2024-06-01 13:54:46] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:54:46] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:54:46] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:54:46] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:54:46] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:54:46] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:54:47] [INFO ] Deduced a trap composed of 237 places in 341 ms of which 4 ms to minimize.
[2024-06-01 13:54:47] [INFO ] Deduced a trap composed of 247 places in 322 ms of which 3 ms to minimize.
[2024-06-01 13:54:48] [INFO ] Deduced a trap composed of 238 places in 292 ms of which 3 ms to minimize.
[2024-06-01 13:54:48] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:54:50] [INFO ] Deduced a trap composed of 40 places in 343 ms of which 4 ms to minimize.
[2024-06-01 13:54:50] [INFO ] Deduced a trap composed of 73 places in 327 ms of which 3 ms to minimize.
[2024-06-01 13:54:52] [INFO ] Deduced a trap composed of 202 places in 263 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/2120 variables, and 61 constraints, problems are : Problem set: 0 solved, 1640 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/508 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1640/1640 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1640 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/504 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-06-01 13:55:01] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/2120 variables, and 62 constraints, problems are : Problem set: 0 solved, 1640 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/508 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1640 constraints, Known Traps: 16/16 constraints]
After SMT, in 48278ms problems are : Problem set: 0 solved, 1640 unsolved
Search for dead transitions found 0 dead transitions in 48293ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 48404 ms. Remains : 508/708 places, 1644/1844 transitions.
[2024-06-01 13:55:14] [INFO ] Flatten gal took : 77 ms
[2024-06-01 13:55:14] [INFO ] Flatten gal took : 84 ms
[2024-06-01 13:55:14] [INFO ] Input system was already deterministic with 1644 transitions.
Starting structural reductions in LTL mode, iteration 0 : 708/708 places, 1844/1844 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 700 transition count 1836
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 700 transition count 1836
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 692 transition count 1828
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 692 transition count 1828
Applied a total of 32 rules in 65 ms. Remains 692 /708 variables (removed 16) and now considering 1828/1844 (removed 16) transitions.
Running 1824 sub problems to find dead transitions.
[2024-06-01 13:55:14] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
// Phase 1: matrix 1796 rows 692 cols
[2024-06-01 13:55:14] [INFO ] Computed 50 invariants in 30 ms
[2024-06-01 13:55:14] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 13:55:38] [INFO ] Deduced a trap composed of 73 places in 145 ms of which 6 ms to minimize.
[2024-06-01 13:55:38] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 2 ms to minimize.
[2024-06-01 13:55:38] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:55:38] [INFO ] Deduced a trap composed of 73 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:55:38] [INFO ] Deduced a trap composed of 73 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:55:39] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:55:39] [INFO ] Deduced a trap composed of 73 places in 59 ms of which 0 ms to minimize.
[2024-06-01 13:55:39] [INFO ] Deduced a trap composed of 401 places in 365 ms of which 4 ms to minimize.
[2024-06-01 13:55:40] [INFO ] Deduced a trap composed of 394 places in 447 ms of which 29 ms to minimize.
[2024-06-01 13:55:40] [INFO ] Deduced a trap composed of 205 places in 307 ms of which 4 ms to minimize.
[2024-06-01 13:55:41] [INFO ] Deduced a trap composed of 192 places in 311 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 688/2488 variables, and 56 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 35/38 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/688 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 13:55:44] [INFO ] Deduced a trap composed of 73 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:55:45] [INFO ] Deduced a trap composed of 352 places in 467 ms of which 9 ms to minimize.
[2024-06-01 13:55:57] [INFO ] Deduced a trap composed of 43 places in 188 ms of which 2 ms to minimize.
[2024-06-01 13:55:58] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 3 ms to minimize.
[2024-06-01 13:55:58] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 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 0)
(s161 0)
(s162 9)
(s163 1)
(s164 0)
(s165 1)
(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 0)
(s180 0)
(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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/2488 variables, and 61 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 35/38 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 16/16 constraints]
After SMT, in 47925ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 47946ms
Finished structural reductions in LTL mode , in 1 iterations and 48016 ms. Remains : 692/708 places, 1828/1844 transitions.
[2024-06-01 13:56:02] [INFO ] Flatten gal took : 54 ms
[2024-06-01 13:56:02] [INFO ] Flatten gal took : 55 ms
[2024-06-01 13:56:02] [INFO ] Input system was already deterministic with 1828 transitions.
Starting structural reductions in LTL mode, iteration 0 : 708/708 places, 1844/1844 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 700 transition count 1836
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 700 transition count 1836
Applied a total of 16 rules in 23 ms. Remains 700 /708 variables (removed 8) and now considering 1836/1844 (removed 8) transitions.
Running 1832 sub problems to find dead transitions.
[2024-06-01 13:56:02] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
// Phase 1: matrix 1804 rows 700 cols
[2024-06-01 13:56:02] [INFO ] Computed 50 invariants in 26 ms
[2024-06-01 13:56:02] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/696 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/696 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-06-01 13:56:26] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 2 ms to minimize.
[2024-06-01 13:56:26] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:56:26] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:56:26] [INFO ] Deduced a trap composed of 74 places in 49 ms of which 0 ms to minimize.
[2024-06-01 13:56:26] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:56:26] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:56:26] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:56:27] [INFO ] Deduced a trap composed of 387 places in 366 ms of which 5 ms to minimize.
[2024-06-01 13:56:27] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:56:27] [INFO ] Deduced a trap composed of 183 places in 364 ms of which 4 ms to minimize.
[2024-06-01 13:56:30] [INFO ] Deduced a trap composed of 412 places in 330 ms of which 3 ms to minimize.
[2024-06-01 13:56:30] [INFO ] Deduced a trap composed of 394 places in 348 ms of which 4 ms to minimize.
[2024-06-01 13:56:31] [INFO ] Deduced a trap composed of 379 places in 434 ms of which 5 ms to minimize.
SMT process timed out in 28514ms, After SMT, problems are : Problem set: 0 solved, 1832 unsolved
Search for dead transitions found 0 dead transitions in 28531ms
Finished structural reductions in LTL mode , in 1 iterations and 28557 ms. Remains : 700/708 places, 1836/1844 transitions.
[2024-06-01 13:56:31] [INFO ] Flatten gal took : 60 ms
[2024-06-01 13:56:31] [INFO ] Flatten gal took : 105 ms
[2024-06-01 13:56:31] [INFO ] Input system was already deterministic with 1836 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 708/708 places, 1844/1844 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 708 transition count 1780
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 644 transition count 1780
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 128 place count 644 transition count 1700
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 288 place count 564 transition count 1700
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 448 place count 484 transition count 1620
Applied a total of 448 rules in 101 ms. Remains 484 /708 variables (removed 224) and now considering 1620/1844 (removed 224) transitions.
Running 1616 sub problems to find dead transitions.
[2024-06-01 13:56:31] [INFO ] Flow matrix only has 1588 transitions (discarded 32 similar events)
// Phase 1: matrix 1588 rows 484 cols
[2024-06-01 13:56:31] [INFO ] Computed 50 invariants in 25 ms
[2024-06-01 13:56:31] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
[2024-06-01 13:56:50] [INFO ] Deduced a trap composed of 47 places in 199 ms of which 2 ms to minimize.
[2024-06-01 13:56:51] [INFO ] Deduced a trap composed of 48 places in 202 ms of which 3 ms to minimize.
[2024-06-01 13:56:51] [INFO ] Deduced a trap composed of 48 places in 217 ms of which 2 ms to minimize.
[2024-06-01 13:56:51] [INFO ] Deduced a trap composed of 33 places in 186 ms of which 3 ms to minimize.
[2024-06-01 13:56:51] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:56:51] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:56:51] [INFO ] Deduced a trap composed of 47 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:56:51] [INFO ] Deduced a trap composed of 48 places in 33 ms of which 3 ms to minimize.
[2024-06-01 13:56:52] [INFO ] Deduced a trap composed of 199 places in 299 ms of which 3 ms to minimize.
[2024-06-01 13:56:53] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 480/2072 variables, and 56 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/484 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1616/1616 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
[2024-06-01 13:57:01] [INFO ] Deduced a trap composed of 19 places in 332 ms of which 4 ms to minimize.
[2024-06-01 13:57:01] [INFO ] Deduced a trap composed of 248 places in 278 ms of which 3 ms to minimize.
[2024-06-01 13:57:02] [INFO ] Deduced a trap composed of 216 places in 328 ms of which 2 ms to minimize.
[2024-06-01 13:57:02] [INFO ] Deduced a trap composed of 187 places in 297 ms of which 3 ms to minimize.
[2024-06-01 13:57:05] [INFO ] Deduced a trap composed of 242 places in 287 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/2072 variables, and 61 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/484 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1616 constraints, Known Traps: 15/15 constraints]
After SMT, in 48268ms problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 48289ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 48395 ms. Remains : 484/708 places, 1620/1844 transitions.
[2024-06-01 13:57:19] [INFO ] Flatten gal took : 52 ms
[2024-06-01 13:57:19] [INFO ] Flatten gal took : 56 ms
[2024-06-01 13:57:20] [INFO ] Input system was already deterministic with 1620 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 708/708 places, 1844/1844 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 708 transition count 1804
Reduce places removed 40 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 48 rules applied. Total rules applied 88 place count 668 transition count 1796
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 660 transition count 1796
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 96 place count 660 transition count 1708
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 272 place count 572 transition count 1708
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 416 place count 500 transition count 1636
Applied a total of 416 rules in 70 ms. Remains 500 /708 variables (removed 208) and now considering 1636/1844 (removed 208) transitions.
Running 1632 sub problems to find dead transitions.
[2024-06-01 13:57:20] [INFO ] Flow matrix only has 1604 transitions (discarded 32 similar events)
// Phase 1: matrix 1604 rows 500 cols
[2024-06-01 13:57:20] [INFO ] Computed 50 invariants in 22 ms
[2024-06-01 13:57:20] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/496 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
[2024-06-01 13:57:39] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 2 ms to minimize.
[2024-06-01 13:57:39] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 1 ms to minimize.
[2024-06-01 13:57:39] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 2 ms to minimize.
[2024-06-01 13:57:39] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:57:39] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:57:39] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:57:39] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:57:40] [INFO ] Deduced a trap composed of 237 places in 370 ms of which 3 ms to minimize.
[2024-06-01 13:57:40] [INFO ] Deduced a trap composed of 224 places in 376 ms of which 5 ms to minimize.
[2024-06-01 13:57:40] [INFO ] Deduced a trap composed of 240 places in 360 ms of which 3 ms to minimize.
[2024-06-01 13:57:41] [INFO ] Deduced a trap composed of 222 places in 381 ms of which 4 ms to minimize.
[2024-06-01 13:57:41] [INFO ] Deduced a trap composed of 235 places in 365 ms of which 3 ms to minimize.
[2024-06-01 13:57:42] [INFO ] Deduced a trap composed of 230 places in 431 ms of which 4 ms to minimize.
[2024-06-01 13:57:42] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 496/2104 variables, and 60 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/500 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1632/1632 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1632 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/496 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
[2024-06-01 13:57:53] [INFO ] Deduced a trap composed of 33 places in 225 ms of which 2 ms to minimize.
[2024-06-01 13:58:07] [INFO ] Deduced a trap composed of 42 places in 230 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/2104 variables, and 62 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/500 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1632 constraints, Known Traps: 16/16 constraints]
After SMT, in 48804ms problems are : Problem set: 0 solved, 1632 unsolved
Search for dead transitions found 0 dead transitions in 48818ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 48891 ms. Remains : 500/708 places, 1636/1844 transitions.
[2024-06-01 13:58:08] [INFO ] Flatten gal took : 77 ms
[2024-06-01 13:58:09] [INFO ] Flatten gal took : 76 ms
[2024-06-01 13:58:09] [INFO ] Input system was already deterministic with 1636 transitions.
[2024-06-01 13:58:09] [INFO ] Flatten gal took : 79 ms
[2024-06-01 13:58:09] [INFO ] Flatten gal took : 80 ms
[2024-06-01 13:58:09] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2024-06-01 13:58:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 708 places, 1844 transitions and 9364 arcs took 17 ms.
Total runtime 460515 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBLF-COL-S04J04T08-CTLCardinality-2024-01
Could not compute solution for formula : PolyORBLF-COL-S04J04T08-CTLCardinality-2024-02
Could not compute solution for formula : PolyORBLF-COL-S04J04T08-CTLCardinality-2024-05
Could not compute solution for formula : PolyORBLF-COL-S04J04T08-CTLCardinality-2024-09
Could not compute solution for formula : PolyORBLF-COL-S04J04T08-CTLCardinality-2024-10
Could not compute solution for formula : PolyORBLF-COL-S04J04T08-CTLCardinality-2024-12

BK_STOP 1717250289821

--------------------
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
mcc2024
ctl formula name PolyORBLF-COL-S04J04T08-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1068/ctl_0_
ctl formula name PolyORBLF-COL-S04J04T08-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1068/ctl_1_
ctl formula name PolyORBLF-COL-S04J04T08-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1068/ctl_2_
ctl formula name PolyORBLF-COL-S04J04T08-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1068/ctl_3_
ctl formula name PolyORBLF-COL-S04J04T08-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1068/ctl_4_
ctl formula name PolyORBLF-COL-S04J04T08-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/1068/ctl_5_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-COL-S04J04T08, 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 r516-tajo-171654446400129"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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