Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r476-tall-171620505000033.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is CANConstruction-PT-040, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505000033
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 18:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 12 18:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 18:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Apr 12 18:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.5M May 18 16:42 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 CANConstruction-PT-040-CTLCardinality-2024-00
FORMULA_NAME CANConstruction-PT-040-CTLCardinality-2024-01
FORMULA_NAME CANConstruction-PT-040-CTLCardinality-2024-02
FORMULA_NAME CANConstruction-PT-040-CTLCardinality-2024-03
FORMULA_NAME CANConstruction-PT-040-CTLCardinality-2024-04
FORMULA_NAME CANConstruction-PT-040-CTLCardinality-2024-05
FORMULA_NAME CANConstruction-PT-040-CTLCardinality-2024-06
FORMULA_NAME CANConstruction-PT-040-CTLCardinality-2024-07
FORMULA_NAME CANConstruction-PT-040-CTLCardinality-2024-08
FORMULA_NAME CANConstruction-PT-040-CTLCardinality-2024-09
FORMULA_NAME CANConstruction-PT-040-CTLCardinality-2024-10
FORMULA_NAME CANConstruction-PT-040-CTLCardinality-2024-11
FORMULA_NAME CANConstruction-PT-040-CTLCardinality-2023-12
FORMULA_NAME CANConstruction-PT-040-CTLCardinality-2023-13
FORMULA_NAME CANConstruction-PT-040-CTLCardinality-2023-14
FORMULA_NAME CANConstruction-PT-040-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717178495142

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-040
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:01:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 18:01:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:01:36] [INFO ] Load time of PNML (sax parser for PT used): 233 ms
[2024-05-31 18:01:36] [INFO ] Transformed 3682 places.
[2024-05-31 18:01:36] [INFO ] Transformed 6720 transitions.
[2024-05-31 18:01:36] [INFO ] Parsed PT model containing 3682 places and 6720 transitions and 20000 arcs in 377 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Support contains 192 out of 3682 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3682/3682 places, 6720/6720 transitions.
Discarding 1438 places :
Symmetric choice reduction at 0 with 1438 rule applications. Total rules 1438 place count 2244 transition count 3844
Iterating global reduction 0 with 1438 rules applied. Total rules applied 2876 place count 2244 transition count 3844
Applied a total of 2876 rules in 423 ms. Remains 2244 /3682 variables (removed 1438) and now considering 3844/6720 (removed 2876) transitions.
// Phase 1: matrix 3844 rows 2244 cols
[2024-05-31 18:01:37] [INFO ] Computed 81 invariants in 70 ms
[2024-05-31 18:01:39] [INFO ] Implicit Places using invariants in 1782 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278, 292, 306, 320, 334, 348, 362, 376, 404, 418, 432, 446, 460, 474, 488, 502, 530, 544, 558]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 1811 ms to find 38 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2206/3682 places, 3844/6720 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 2172 transition count 3810
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 2172 transition count 3810
Applied a total of 68 rules in 513 ms. Remains 2172 /2206 variables (removed 34) and now considering 3810/3844 (removed 34) transitions.
// Phase 1: matrix 3810 rows 2172 cols
[2024-05-31 18:01:39] [INFO ] Computed 43 invariants in 30 ms
[2024-05-31 18:01:40] [INFO ] Implicit Places using invariants in 1050 ms returned []
[2024-05-31 18:01:40] [INFO ] Invariant cache hit.
[2024-05-31 18:01:41] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:02:08] [INFO ] Implicit Places using invariants and state equation in 27413 ms returned []
Implicit Place search using SMT with State Equation took 28467 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2172/3682 places, 3810/6720 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31230 ms. Remains : 2172/3682 places, 3810/6720 transitions.
Support contains 192 out of 2172 places after structural reductions.
[2024-05-31 18:02:08] [INFO ] Flatten gal took : 221 ms
[2024-05-31 18:02:08] [INFO ] Flatten gal took : 153 ms
[2024-05-31 18:02:08] [INFO ] Input system was already deterministic with 3810 transitions.
Support contains 183 out of 2172 places (down from 192) after GAL structural reductions.
RANDOM walk for 40000 steps (56 resets) in 2812 ms. (14 steps per ms) remains 27/99 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
[2024-05-31 18:02:09] [INFO ] Invariant cache hit.
[2024-05-31 18:02:09] [INFO ] State equation strengthened by 3160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp96 is UNSAT
At refinement iteration 1 (OVERLAPS) 2097/2163 variables, 34/34 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2163 variables, 1/35 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2163 variables, 0/35 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 7/2170 variables, 7/42 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2170 variables, 0/42 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 1/2171 variables, 1/43 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2171 variables, 0/43 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 3810/5981 variables, 2171/2214 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5981 variables, 3160/5374 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5981 variables, 0/5374 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 1/5982 variables, 1/5375 constraints. Problems are: Problem set: 14 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5982/5982 variables, and 5375 constraints, problems are : Problem set: 14 solved, 12 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2172/2172 constraints, ReadFeed: 3160/3160 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 14 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 14 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 2115/2155 variables, 27/27 constraints. Problems are: Problem set: 14 solved, 12 unsolved
[2024-05-31 18:02:16] [INFO ] Deduced a trap composed of 5 places in 1171 ms of which 91 ms to minimize.
[2024-05-31 18:02:16] [INFO ] Deduced a trap composed of 58 places in 378 ms of which 6 ms to minimize.
[2024-05-31 18:02:17] [INFO ] Deduced a trap composed of 53 places in 314 ms of which 6 ms to minimize.
[2024-05-31 18:02:17] [INFO ] Deduced a trap composed of 54 places in 296 ms of which 5 ms to minimize.
[2024-05-31 18:02:17] [INFO ] Deduced a trap composed of 55 places in 258 ms of which 5 ms to minimize.
[2024-05-31 18:02:18] [INFO ] Deduced a trap composed of 57 places in 257 ms of which 5 ms to minimize.
[2024-05-31 18:02:18] [INFO ] Deduced a trap composed of 54 places in 226 ms of which 4 ms to minimize.
[2024-05-31 18:02:18] [INFO ] Deduced a trap composed of 56 places in 260 ms of which 6 ms to minimize.
[2024-05-31 18:02:19] [INFO ] Deduced a trap composed of 57 places in 245 ms of which 5 ms to minimize.
[2024-05-31 18:02:19] [INFO ] Deduced a trap composed of 56 places in 246 ms of which 6 ms to minimize.
[2024-05-31 18:02:19] [INFO ] Deduced a trap composed of 57 places in 248 ms of which 5 ms to minimize.
[2024-05-31 18:02:19] [INFO ] Deduced a trap composed of 54 places in 231 ms of which 5 ms to minimize.
[2024-05-31 18:02:20] [INFO ] Deduced a trap composed of 58 places in 275 ms of which 6 ms to minimize.
SMT process timed out in 10214ms, After SMT, problems are : Problem set: 14 solved, 12 unsolved
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 40 out of 2172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2172/2172 places, 3810/3810 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 247 transitions
Trivial Post-agglo rules discarded 247 transitions
Performed 247 trivial Post agglomeration. Transition count delta: 247
Iterating post reduction 0 with 247 rules applied. Total rules applied 247 place count 2172 transition count 3563
Reduce places removed 247 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 248 rules applied. Total rules applied 495 place count 1925 transition count 3562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 496 place count 1924 transition count 3562
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 496 place count 1924 transition count 3524
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 572 place count 1886 transition count 3524
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 635 place count 1823 transition count 3398
Iterating global reduction 3 with 63 rules applied. Total rules applied 698 place count 1823 transition count 3398
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 3 with 18 rules applied. Total rules applied 716 place count 1823 transition count 3380
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 734 place count 1805 transition count 3380
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 5 with 106 rules applied. Total rules applied 840 place count 1752 transition count 3327
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 844 place count 1752 transition count 3323
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 848 place count 1748 transition count 3323
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 849 place count 1748 transition count 3322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 850 place count 1747 transition count 3322
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 851 place count 1747 transition count 3322
Applied a total of 851 rules in 1308 ms. Remains 1747 /2172 variables (removed 425) and now considering 3322/3810 (removed 488) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1308 ms. Remains : 1747/2172 places, 3322/3810 transitions.
RANDOM walk for 40000 steps (139 resets) in 868 ms. (46 steps per ms) remains 7/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 7/7 properties
// Phase 1: matrix 3322 rows 1747 cols
[2024-05-31 18:02:21] [INFO ] Computed 43 invariants in 26 ms
[2024-05-31 18:02:22] [INFO ] State equation strengthened by 3162 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1692/1725 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1725 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 19/1744 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1744 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/1746 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1746 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 3322/5068 variables, 1746/1789 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5068 variables, 3162/4951 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5068 variables, 0/4951 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1/5069 variables, 1/4952 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5069 variables, 0/4952 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/5069 variables, 0/4952 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5069/5069 variables, and 4952 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4027 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1747/1747 constraints, ReadFeed: 3162/3162 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1692/1725 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 18:02:27] [INFO ] Deduced a trap composed of 2 places in 959 ms of which 10 ms to minimize.
[2024-05-31 18:02:27] [INFO ] Deduced a trap composed of 43 places in 176 ms of which 3 ms to minimize.
[2024-05-31 18:02:27] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 3 ms to minimize.
[2024-05-31 18:02:27] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 3 ms to minimize.
[2024-05-31 18:02:27] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 3 ms to minimize.
[2024-05-31 18:02:28] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 3 ms to minimize.
[2024-05-31 18:02:28] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 2 ms to minimize.
[2024-05-31 18:02:28] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 3 ms to minimize.
[2024-05-31 18:02:28] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 2 ms to minimize.
[2024-05-31 18:02:28] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
[2024-05-31 18:02:28] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 3 ms to minimize.
[2024-05-31 18:02:29] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 3 ms to minimize.
[2024-05-31 18:02:29] [INFO ] Deduced a trap composed of 43 places in 158 ms of which 3 ms to minimize.
[2024-05-31 18:02:29] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 3 ms to minimize.
[2024-05-31 18:02:29] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 3 ms to minimize.
[2024-05-31 18:02:29] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 3 ms to minimize.
[2024-05-31 18:02:29] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 3 ms to minimize.
[2024-05-31 18:02:30] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 2 ms to minimize.
[2024-05-31 18:02:30] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 2 ms to minimize.
[2024-05-31 18:02:30] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1725 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 18:02:30] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 4 ms to minimize.
[2024-05-31 18:02:30] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 6 ms to minimize.
[2024-05-31 18:02:30] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 3 ms to minimize.
[2024-05-31 18:02:30] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 2 ms to minimize.
[2024-05-31 18:02:31] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2024-05-31 18:02:31] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 2 ms to minimize.
[2024-05-31 18:02:31] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 3 ms to minimize.
[2024-05-31 18:02:31] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 2 ms to minimize.
[2024-05-31 18:02:31] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 1 ms to minimize.
[2024-05-31 18:02:31] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 2 ms to minimize.
[2024-05-31 18:02:31] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
[2024-05-31 18:02:31] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 2 ms to minimize.
[2024-05-31 18:02:31] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 2 ms to minimize.
[2024-05-31 18:02:32] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 2 ms to minimize.
[2024-05-31 18:02:32] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 2 ms to minimize.
[2024-05-31 18:02:32] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 2 ms to minimize.
[2024-05-31 18:02:32] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 1 ms to minimize.
Problem AtomicPropp50 is UNSAT
[2024-05-31 18:02:32] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 4 ms to minimize.
[2024-05-31 18:02:32] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 3 ms to minimize.
[2024-05-31 18:02:32] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 3 ms to minimize.
Problem AtomicPropp50 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/1725 variables, 20/62 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-31 18:02:33] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 3 ms to minimize.
[2024-05-31 18:02:33] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 3 ms to minimize.
[2024-05-31 18:02:33] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 3 ms to minimize.
[2024-05-31 18:02:33] [INFO ] Deduced a trap composed of 46 places in 133 ms of which 6 ms to minimize.
[2024-05-31 18:02:33] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 2 ms to minimize.
[2024-05-31 18:02:33] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 2 ms to minimize.
[2024-05-31 18:02:33] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1725 variables, 7/69 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-31 18:02:34] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 3 ms to minimize.
[2024-05-31 18:02:34] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 2 ms to minimize.
[2024-05-31 18:02:34] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 2 ms to minimize.
[2024-05-31 18:02:34] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 3 ms to minimize.
[2024-05-31 18:02:34] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 2 ms to minimize.
[2024-05-31 18:02:34] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 2 ms to minimize.
[2024-05-31 18:02:34] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1725 variables, 7/76 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1725 variables, 0/76 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 19/1744 variables, 19/95 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-31 18:02:36] [INFO ] Deduced a trap composed of 50 places in 984 ms of which 11 ms to minimize.
[2024-05-31 18:02:37] [INFO ] Deduced a trap composed of 44 places in 975 ms of which 11 ms to minimize.
[2024-05-31 18:02:38] [INFO ] Deduced a trap composed of 44 places in 985 ms of which 10 ms to minimize.
[2024-05-31 18:02:39] [INFO ] Deduced a trap composed of 43 places in 951 ms of which 11 ms to minimize.
[2024-05-31 18:02:40] [INFO ] Deduced a trap composed of 43 places in 964 ms of which 11 ms to minimize.
[2024-05-31 18:02:41] [INFO ] Deduced a trap composed of 43 places in 884 ms of which 10 ms to minimize.
[2024-05-31 18:02:42] [INFO ] Deduced a trap composed of 43 places in 962 ms of which 10 ms to minimize.
[2024-05-31 18:02:43] [INFO ] Deduced a trap composed of 43 places in 951 ms of which 11 ms to minimize.
[2024-05-31 18:02:44] [INFO ] Deduced a trap composed of 43 places in 868 ms of which 10 ms to minimize.
[2024-05-31 18:02:44] [INFO ] Deduced a trap composed of 46 places in 887 ms of which 11 ms to minimize.
[2024-05-31 18:02:45] [INFO ] Deduced a trap composed of 43 places in 888 ms of which 11 ms to minimize.
[2024-05-31 18:02:46] [INFO ] Deduced a trap composed of 48 places in 818 ms of which 9 ms to minimize.
[2024-05-31 18:02:47] [INFO ] Deduced a trap composed of 49 places in 877 ms of which 10 ms to minimize.
[2024-05-31 18:02:48] [INFO ] Deduced a trap composed of 43 places in 841 ms of which 10 ms to minimize.
[2024-05-31 18:02:49] [INFO ] Deduced a trap composed of 46 places in 834 ms of which 10 ms to minimize.
[2024-05-31 18:02:50] [INFO ] Deduced a trap composed of 43 places in 826 ms of which 9 ms to minimize.
[2024-05-31 18:02:51] [INFO ] Deduced a trap composed of 43 places in 797 ms of which 9 ms to minimize.
[2024-05-31 18:02:51] [INFO ] Deduced a trap composed of 43 places in 788 ms of which 9 ms to minimize.
[2024-05-31 18:02:52] [INFO ] Deduced a trap composed of 43 places in 791 ms of which 10 ms to minimize.
[2024-05-31 18:02:53] [INFO ] Deduced a trap composed of 46 places in 773 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1744 variables, 20/115 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-31 18:02:54] [INFO ] Deduced a trap composed of 50 places in 804 ms of which 9 ms to minimize.
[2024-05-31 18:02:55] [INFO ] Deduced a trap composed of 48 places in 804 ms of which 9 ms to minimize.
[2024-05-31 18:02:56] [INFO ] Deduced a trap composed of 49 places in 796 ms of which 10 ms to minimize.
[2024-05-31 18:02:56] [INFO ] Deduced a trap composed of 44 places in 773 ms of which 10 ms to minimize.
[2024-05-31 18:02:57] [INFO ] Deduced a trap composed of 49 places in 744 ms of which 9 ms to minimize.
[2024-05-31 18:02:58] [INFO ] Deduced a trap composed of 48 places in 752 ms of which 9 ms to minimize.
[2024-05-31 18:02:59] [INFO ] Deduced a trap composed of 44 places in 753 ms of which 10 ms to minimize.
[2024-05-31 18:02:59] [INFO ] Deduced a trap composed of 44 places in 761 ms of which 10 ms to minimize.
[2024-05-31 18:03:00] [INFO ] Deduced a trap composed of 44 places in 784 ms of which 14 ms to minimize.
[2024-05-31 18:03:01] [INFO ] Deduced a trap composed of 43 places in 731 ms of which 10 ms to minimize.
[2024-05-31 18:03:02] [INFO ] Deduced a trap composed of 43 places in 698 ms of which 11 ms to minimize.
[2024-05-31 18:03:03] [INFO ] Deduced a trap composed of 43 places in 781 ms of which 10 ms to minimize.
[2024-05-31 18:03:03] [INFO ] Deduced a trap composed of 43 places in 778 ms of which 10 ms to minimize.
[2024-05-31 18:03:04] [INFO ] Deduced a trap composed of 43 places in 789 ms of which 9 ms to minimize.
[2024-05-31 18:03:05] [INFO ] Deduced a trap composed of 43 places in 722 ms of which 10 ms to minimize.
[2024-05-31 18:03:06] [INFO ] Deduced a trap composed of 43 places in 755 ms of which 10 ms to minimize.
[2024-05-31 18:03:06] [INFO ] Deduced a trap composed of 43 places in 745 ms of which 10 ms to minimize.
[2024-05-31 18:03:07] [INFO ] Deduced a trap composed of 47 places in 722 ms of which 9 ms to minimize.
[2024-05-31 18:03:08] [INFO ] Deduced a trap composed of 46 places in 731 ms of which 9 ms to minimize.
[2024-05-31 18:03:09] [INFO ] Deduced a trap composed of 47 places in 764 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1744 variables, 20/135 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-31 18:03:09] [INFO ] Deduced a trap composed of 43 places in 626 ms of which 8 ms to minimize.
[2024-05-31 18:03:10] [INFO ] Deduced a trap composed of 49 places in 627 ms of which 9 ms to minimize.
[2024-05-31 18:03:11] [INFO ] Deduced a trap composed of 49 places in 619 ms of which 8 ms to minimize.
SMT process timed out in 49293ms, After SMT, problems are : Problem set: 1 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 29 out of 1747 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1747/1747 places, 3322/3322 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1741 transition count 3310
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1741 transition count 3310
Applied a total of 12 rules in 169 ms. Remains 1741 /1747 variables (removed 6) and now considering 3310/3322 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 1741/1747 places, 3310/3322 transitions.
RANDOM walk for 40000 steps (143 resets) in 708 ms. (56 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 106898 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 6
Probabilistic random walk after 106898 steps, saw 32369 distinct states, run finished after 3005 ms. (steps per millisecond=35 ) properties seen :0
// Phase 1: matrix 3310 rows 1741 cols
[2024-05-31 18:03:14] [INFO ] Computed 43 invariants in 32 ms
[2024-05-31 18:03:14] [INFO ] State equation strengthened by 3162 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1689/1718 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1718 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 20/1738 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1738 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/1740 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1740 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 3310/5050 variables, 1740/1783 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5050 variables, 3162/4945 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5050 variables, 0/4945 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/5051 variables, 1/4946 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5051 variables, 0/4946 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/5051 variables, 0/4946 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5051/5051 variables, and 4946 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3603 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1741/1741 constraints, ReadFeed: 3162/3162 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1689/1718 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 18:03:19] [INFO ] Deduced a trap composed of 2 places in 964 ms of which 9 ms to minimize.
[2024-05-31 18:03:19] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 3 ms to minimize.
[2024-05-31 18:03:19] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 3 ms to minimize.
[2024-05-31 18:03:20] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 3 ms to minimize.
[2024-05-31 18:03:20] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 3 ms to minimize.
[2024-05-31 18:03:20] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 3 ms to minimize.
[2024-05-31 18:03:20] [INFO ] Deduced a trap composed of 46 places in 166 ms of which 4 ms to minimize.
[2024-05-31 18:03:20] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 3 ms to minimize.
[2024-05-31 18:03:21] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 3 ms to minimize.
[2024-05-31 18:03:21] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1718 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 18:03:21] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 3 ms to minimize.
[2024-05-31 18:03:21] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 3 ms to minimize.
[2024-05-31 18:03:21] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 4 ms to minimize.
[2024-05-31 18:03:21] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 2 ms to minimize.
[2024-05-31 18:03:22] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 2 ms to minimize.
[2024-05-31 18:03:22] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1718 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 18:03:22] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 2 ms to minimize.
[2024-05-31 18:03:22] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 3 ms to minimize.
[2024-05-31 18:03:22] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 3 ms to minimize.
[2024-05-31 18:03:22] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 3 ms to minimize.
[2024-05-31 18:03:23] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 2 ms to minimize.
[2024-05-31 18:03:23] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 2 ms to minimize.
[2024-05-31 18:03:23] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1718 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 18:03:23] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 2 ms to minimize.
[2024-05-31 18:03:23] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 2 ms to minimize.
[2024-05-31 18:03:23] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1718 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1718 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 20/1738 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 18:03:25] [INFO ] Deduced a trap composed of 53 places in 1193 ms of which 11 ms to minimize.
[2024-05-31 18:03:26] [INFO ] Deduced a trap composed of 50 places in 1227 ms of which 11 ms to minimize.
[2024-05-31 18:03:27] [INFO ] Deduced a trap composed of 55 places in 1238 ms of which 11 ms to minimize.
[2024-05-31 18:03:29] [INFO ] Deduced a trap composed of 55 places in 1190 ms of which 11 ms to minimize.
[2024-05-31 18:03:30] [INFO ] Deduced a trap composed of 55 places in 1213 ms of which 11 ms to minimize.
[2024-05-31 18:03:31] [INFO ] Deduced a trap composed of 53 places in 1234 ms of which 12 ms to minimize.
[2024-05-31 18:03:32] [INFO ] Deduced a trap composed of 50 places in 1221 ms of which 11 ms to minimize.
[2024-05-31 18:03:34] [INFO ] Deduced a trap composed of 50 places in 1200 ms of which 11 ms to minimize.
[2024-05-31 18:03:35] [INFO ] Deduced a trap composed of 43 places in 1189 ms of which 11 ms to minimize.
[2024-05-31 18:03:36] [INFO ] Deduced a trap composed of 49 places in 1277 ms of which 11 ms to minimize.
[2024-05-31 18:03:37] [INFO ] Deduced a trap composed of 48 places in 1243 ms of which 11 ms to minimize.
[2024-05-31 18:03:39] [INFO ] Deduced a trap composed of 43 places in 1086 ms of which 10 ms to minimize.
[2024-05-31 18:03:40] [INFO ] Deduced a trap composed of 43 places in 1137 ms of which 10 ms to minimize.
[2024-05-31 18:03:41] [INFO ] Deduced a trap composed of 43 places in 1122 ms of which 11 ms to minimize.
[2024-05-31 18:03:42] [INFO ] Deduced a trap composed of 43 places in 1155 ms of which 11 ms to minimize.
[2024-05-31 18:03:43] [INFO ] Deduced a trap composed of 46 places in 1057 ms of which 11 ms to minimize.
[2024-05-31 18:03:44] [INFO ] Deduced a trap composed of 43 places in 1046 ms of which 10 ms to minimize.
[2024-05-31 18:03:45] [INFO ] Deduced a trap composed of 51 places in 1069 ms of which 11 ms to minimize.
[2024-05-31 18:03:46] [INFO ] Deduced a trap composed of 43 places in 1046 ms of which 10 ms to minimize.
[2024-05-31 18:03:47] [INFO ] Deduced a trap composed of 43 places in 1078 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1738 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 18:03:49] [INFO ] Deduced a trap composed of 44 places in 1153 ms of which 10 ms to minimize.
[2024-05-31 18:03:50] [INFO ] Deduced a trap composed of 43 places in 1120 ms of which 10 ms to minimize.
[2024-05-31 18:03:51] [INFO ] Deduced a trap composed of 48 places in 1120 ms of which 11 ms to minimize.
[2024-05-31 18:03:52] [INFO ] Deduced a trap composed of 49 places in 1119 ms of which 10 ms to minimize.
[2024-05-31 18:03:53] [INFO ] Deduced a trap composed of 43 places in 1098 ms of which 11 ms to minimize.
[2024-05-31 18:03:54] [INFO ] Deduced a trap composed of 44 places in 1080 ms of which 11 ms to minimize.
[2024-05-31 18:03:55] [INFO ] Deduced a trap composed of 46 places in 1004 ms of which 10 ms to minimize.
[2024-05-31 18:03:56] [INFO ] Deduced a trap composed of 48 places in 1026 ms of which 9 ms to minimize.
[2024-05-31 18:03:57] [INFO ] Deduced a trap composed of 43 places in 1012 ms of which 10 ms to minimize.
[2024-05-31 18:03:59] [INFO ] Deduced a trap composed of 43 places in 997 ms of which 10 ms to minimize.
[2024-05-31 18:04:00] [INFO ] Deduced a trap composed of 47 places in 1035 ms of which 10 ms to minimize.
[2024-05-31 18:04:01] [INFO ] Deduced a trap composed of 43 places in 1027 ms of which 10 ms to minimize.
[2024-05-31 18:04:02] [INFO ] Deduced a trap composed of 43 places in 1067 ms of which 11 ms to minimize.
[2024-05-31 18:04:03] [INFO ] Deduced a trap composed of 44 places in 1021 ms of which 10 ms to minimize.
[2024-05-31 18:04:04] [INFO ] Deduced a trap composed of 43 places in 999 ms of which 10 ms to minimize.
[2024-05-31 18:04:05] [INFO ] Deduced a trap composed of 43 places in 998 ms of which 10 ms to minimize.
[2024-05-31 18:04:06] [INFO ] Deduced a trap composed of 48 places in 1033 ms of which 12 ms to minimize.
[2024-05-31 18:04:07] [INFO ] Deduced a trap composed of 43 places in 976 ms of which 11 ms to minimize.
[2024-05-31 18:04:08] [INFO ] Deduced a trap composed of 43 places in 1003 ms of which 10 ms to minimize.
[2024-05-31 18:04:09] [INFO ] Deduced a trap composed of 43 places in 991 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1738 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 18:04:10] [INFO ] Deduced a trap composed of 47 places in 935 ms of which 10 ms to minimize.
[2024-05-31 18:04:11] [INFO ] Deduced a trap composed of 43 places in 934 ms of which 10 ms to minimize.
[2024-05-31 18:04:12] [INFO ] Deduced a trap composed of 43 places in 914 ms of which 10 ms to minimize.
[2024-05-31 18:04:13] [INFO ] Deduced a trap composed of 43 places in 876 ms of which 10 ms to minimize.
[2024-05-31 18:04:14] [INFO ] Deduced a trap composed of 43 places in 872 ms of which 9 ms to minimize.
[2024-05-31 18:04:15] [INFO ] Deduced a trap composed of 43 places in 916 ms of which 10 ms to minimize.
[2024-05-31 18:04:15] [INFO ] Deduced a trap composed of 43 places in 888 ms of which 10 ms to minimize.
[2024-05-31 18:04:16] [INFO ] Deduced a trap composed of 43 places in 887 ms of which 11 ms to minimize.
[2024-05-31 18:04:17] [INFO ] Deduced a trap composed of 43 places in 908 ms of which 10 ms to minimize.
[2024-05-31 18:04:18] [INFO ] Deduced a trap composed of 44 places in 967 ms of which 10 ms to minimize.
[2024-05-31 18:04:19] [INFO ] Deduced a trap composed of 43 places in 905 ms of which 10 ms to minimize.
[2024-05-31 18:04:20] [INFO ] Deduced a trap composed of 47 places in 929 ms of which 10 ms to minimize.
[2024-05-31 18:04:21] [INFO ] Deduced a trap composed of 43 places in 912 ms of which 9 ms to minimize.
[2024-05-31 18:04:22] [INFO ] Deduced a trap composed of 43 places in 906 ms of which 9 ms to minimize.
[2024-05-31 18:04:23] [INFO ] Deduced a trap composed of 43 places in 962 ms of which 10 ms to minimize.
[2024-05-31 18:04:24] [INFO ] Deduced a trap composed of 44 places in 945 ms of which 9 ms to minimize.
[2024-05-31 18:04:25] [INFO ] Deduced a trap composed of 44 places in 897 ms of which 10 ms to minimize.
[2024-05-31 18:04:26] [INFO ] Deduced a trap composed of 43 places in 970 ms of which 11 ms to minimize.
[2024-05-31 18:04:27] [INFO ] Deduced a trap composed of 43 places in 895 ms of which 11 ms to minimize.
[2024-05-31 18:04:28] [INFO ] Deduced a trap composed of 43 places in 936 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1738 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 18:04:29] [INFO ] Deduced a trap composed of 43 places in 973 ms of which 11 ms to minimize.
[2024-05-31 18:04:30] [INFO ] Deduced a trap composed of 44 places in 997 ms of which 10 ms to minimize.
[2024-05-31 18:04:31] [INFO ] Deduced a trap composed of 43 places in 919 ms of which 10 ms to minimize.
[2024-05-31 18:04:32] [INFO ] Deduced a trap composed of 48 places in 963 ms of which 11 ms to minimize.
[2024-05-31 18:04:33] [INFO ] Deduced a trap composed of 48 places in 965 ms of which 10 ms to minimize.
[2024-05-31 18:04:34] [INFO ] Deduced a trap composed of 43 places in 928 ms of which 10 ms to minimize.
SMT process timed out in 79572ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 29 out of 1741 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1741/1741 places, 3310/3310 transitions.
Applied a total of 0 rules in 99 ms. Remains 1741 /1741 variables (removed 0) and now considering 3310/3310 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 1741/1741 places, 3310/3310 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1741/1741 places, 3310/3310 transitions.
Applied a total of 0 rules in 98 ms. Remains 1741 /1741 variables (removed 0) and now considering 3310/3310 (removed 0) transitions.
[2024-05-31 18:04:34] [INFO ] Invariant cache hit.
[2024-05-31 18:04:35] [INFO ] Implicit Places using invariants in 918 ms returned [89, 118]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 926 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1739/1741 places, 3310/3310 transitions.
Applied a total of 0 rules in 94 ms. Remains 1739 /1739 variables (removed 0) and now considering 3310/3310 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1121 ms. Remains : 1739/1741 places, 3310/3310 transitions.
Successfully simplified 15 atomic propositions for a total of 16 simplifications.
[2024-05-31 18:04:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-31 18:04:35] [INFO ] Flatten gal took : 96 ms
[2024-05-31 18:04:35] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA CANConstruction-PT-040-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-040-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-040-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 18:04:35] [INFO ] Flatten gal took : 100 ms
[2024-05-31 18:04:35] [INFO ] Input system was already deterministic with 3810 transitions.
Support contains 129 out of 2172 places (down from 139) after GAL structural reductions.
Computed a total of 127 stabilizing places and 166 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 2172/2172 places, 3810/3810 transitions.
Discarding 85 places :
Symmetric choice reduction at 0 with 85 rule applications. Total rules 85 place count 2087 transition count 3643
Iterating global reduction 0 with 85 rules applied. Total rules applied 170 place count 2087 transition count 3643
Applied a total of 170 rules in 170 ms. Remains 2087 /2172 variables (removed 85) and now considering 3643/3810 (removed 167) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 171 ms. Remains : 2087/2172 places, 3643/3810 transitions.
[2024-05-31 18:04:36] [INFO ] Flatten gal took : 83 ms
[2024-05-31 18:04:36] [INFO ] Flatten gal took : 93 ms
[2024-05-31 18:04:36] [INFO ] Input system was already deterministic with 3643 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2172/2172 places, 3810/3810 transitions.
Discarding 84 places :
Symmetric choice reduction at 0 with 84 rule applications. Total rules 84 place count 2088 transition count 3646
Iterating global reduction 0 with 84 rules applied. Total rules applied 168 place count 2088 transition count 3646
Applied a total of 168 rules in 172 ms. Remains 2088 /2172 variables (removed 84) and now considering 3646/3810 (removed 164) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 173 ms. Remains : 2088/2172 places, 3646/3810 transitions.
[2024-05-31 18:04:36] [INFO ] Flatten gal took : 71 ms
[2024-05-31 18:04:36] [INFO ] Flatten gal took : 81 ms
[2024-05-31 18:04:36] [INFO ] Input system was already deterministic with 3646 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2172/2172 places, 3810/3810 transitions.
Discarding 84 places :
Symmetric choice reduction at 0 with 84 rule applications. Total rules 84 place count 2088 transition count 3646
Iterating global reduction 0 with 84 rules applied. Total rules applied 168 place count 2088 transition count 3646
Applied a total of 168 rules in 172 ms. Remains 2088 /2172 variables (removed 84) and now considering 3646/3810 (removed 164) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 172 ms. Remains : 2088/2172 places, 3646/3810 transitions.
[2024-05-31 18:04:37] [INFO ] Flatten gal took : 79 ms
[2024-05-31 18:04:37] [INFO ] Flatten gal took : 86 ms
[2024-05-31 18:04:37] [INFO ] Input system was already deterministic with 3646 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2172/2172 places, 3810/3810 transitions.
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 80 place count 2092 transition count 3654
Iterating global reduction 0 with 80 rules applied. Total rules applied 160 place count 2092 transition count 3654
Applied a total of 160 rules in 168 ms. Remains 2092 /2172 variables (removed 80) and now considering 3654/3810 (removed 156) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 169 ms. Remains : 2092/2172 places, 3654/3810 transitions.
[2024-05-31 18:04:37] [INFO ] Flatten gal took : 70 ms
[2024-05-31 18:04:37] [INFO ] Flatten gal took : 79 ms
[2024-05-31 18:04:37] [INFO ] Input system was already deterministic with 3654 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2172/2172 places, 3810/3810 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 2108 transition count 3686
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 2108 transition count 3686
Applied a total of 128 rules in 233 ms. Remains 2108 /2172 variables (removed 64) and now considering 3686/3810 (removed 124) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 234 ms. Remains : 2108/2172 places, 3686/3810 transitions.
[2024-05-31 18:04:38] [INFO ] Flatten gal took : 71 ms
[2024-05-31 18:04:38] [INFO ] Flatten gal took : 80 ms
[2024-05-31 18:04:38] [INFO ] Input system was already deterministic with 3686 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2172/2172 places, 3810/3810 transitions.
Discarding 83 places :
Symmetric choice reduction at 0 with 83 rule applications. Total rules 83 place count 2089 transition count 3648
Iterating global reduction 0 with 83 rules applied. Total rules applied 166 place count 2089 transition count 3648
Applied a total of 166 rules in 166 ms. Remains 2089 /2172 variables (removed 83) and now considering 3648/3810 (removed 162) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 166 ms. Remains : 2089/2172 places, 3648/3810 transitions.
[2024-05-31 18:04:38] [INFO ] Flatten gal took : 72 ms
[2024-05-31 18:04:38] [INFO ] Flatten gal took : 94 ms
[2024-05-31 18:04:39] [INFO ] Input system was already deterministic with 3648 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2172/2172 places, 3810/3810 transitions.
Discarding 81 places :
Symmetric choice reduction at 0 with 81 rule applications. Total rules 81 place count 2091 transition count 3651
Iterating global reduction 0 with 81 rules applied. Total rules applied 162 place count 2091 transition count 3651
Applied a total of 162 rules in 256 ms. Remains 2091 /2172 variables (removed 81) and now considering 3651/3810 (removed 159) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 256 ms. Remains : 2091/2172 places, 3651/3810 transitions.
[2024-05-31 18:04:39] [INFO ] Flatten gal took : 90 ms
[2024-05-31 18:04:39] [INFO ] Flatten gal took : 104 ms
[2024-05-31 18:04:39] [INFO ] Input system was already deterministic with 3651 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2172/2172 places, 3810/3810 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2172 transition count 3559
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 1921 transition count 3559
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 502 place count 1921 transition count 3521
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 578 place count 1883 transition count 3521
Discarding 82 places :
Symmetric choice reduction at 2 with 82 rule applications. Total rules 660 place count 1801 transition count 3357
Iterating global reduction 2 with 82 rules applied. Total rules applied 742 place count 1801 transition count 3357
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 2 with 37 rules applied. Total rules applied 779 place count 1801 transition count 3320
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 3 with 37 rules applied. Total rules applied 816 place count 1764 transition count 3320
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 888 place count 1728 transition count 3284
Applied a total of 888 rules in 443 ms. Remains 1728 /2172 variables (removed 444) and now considering 3284/3810 (removed 526) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 445 ms. Remains : 1728/2172 places, 3284/3810 transitions.
[2024-05-31 18:04:40] [INFO ] Flatten gal took : 66 ms
[2024-05-31 18:04:40] [INFO ] Flatten gal took : 77 ms
[2024-05-31 18:04:40] [INFO ] Input system was already deterministic with 3284 transitions.
RANDOM walk for 3599 steps (12 resets) in 63 ms. (56 steps per ms) remains 0/1 properties
FORMULA CANConstruction-PT-040-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 2172/2172 places, 3810/3810 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2172 transition count 3559
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 1921 transition count 3559
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 502 place count 1921 transition count 3521
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 578 place count 1883 transition count 3521
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 657 place count 1804 transition count 3363
Iterating global reduction 2 with 79 rules applied. Total rules applied 736 place count 1804 transition count 3363
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 2 with 34 rules applied. Total rules applied 770 place count 1804 transition count 3329
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 804 place count 1770 transition count 3329
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 882 place count 1731 transition count 3290
Applied a total of 882 rules in 332 ms. Remains 1731 /2172 variables (removed 441) and now considering 3290/3810 (removed 520) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 332 ms. Remains : 1731/2172 places, 3290/3810 transitions.
[2024-05-31 18:04:40] [INFO ] Flatten gal took : 59 ms
[2024-05-31 18:04:40] [INFO ] Flatten gal took : 67 ms
[2024-05-31 18:04:41] [INFO ] Input system was already deterministic with 3290 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2172/2172 places, 3810/3810 transitions.
Discarding 83 places :
Symmetric choice reduction at 0 with 83 rule applications. Total rules 83 place count 2089 transition count 3648
Iterating global reduction 0 with 83 rules applied. Total rules applied 166 place count 2089 transition count 3648
Applied a total of 166 rules in 163 ms. Remains 2089 /2172 variables (removed 83) and now considering 3648/3810 (removed 162) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165 ms. Remains : 2089/2172 places, 3648/3810 transitions.
[2024-05-31 18:04:41] [INFO ] Flatten gal took : 62 ms
[2024-05-31 18:04:41] [INFO ] Flatten gal took : 69 ms
[2024-05-31 18:04:41] [INFO ] Input system was already deterministic with 3648 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2172/2172 places, 3810/3810 transitions.
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 80 place count 2092 transition count 3653
Iterating global reduction 0 with 80 rules applied. Total rules applied 160 place count 2092 transition count 3653
Applied a total of 160 rules in 165 ms. Remains 2092 /2172 variables (removed 80) and now considering 3653/3810 (removed 157) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 166 ms. Remains : 2092/2172 places, 3653/3810 transitions.
[2024-05-31 18:04:41] [INFO ] Flatten gal took : 61 ms
[2024-05-31 18:04:41] [INFO ] Flatten gal took : 69 ms
[2024-05-31 18:04:41] [INFO ] Input system was already deterministic with 3653 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2172/2172 places, 3810/3810 transitions.
Discarding 82 places :
Symmetric choice reduction at 0 with 82 rule applications. Total rules 82 place count 2090 transition count 3650
Iterating global reduction 0 with 82 rules applied. Total rules applied 164 place count 2090 transition count 3650
Applied a total of 164 rules in 191 ms. Remains 2090 /2172 variables (removed 82) and now considering 3650/3810 (removed 160) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 191 ms. Remains : 2090/2172 places, 3650/3810 transitions.
[2024-05-31 18:04:42] [INFO ] Flatten gal took : 63 ms
[2024-05-31 18:04:42] [INFO ] Flatten gal took : 68 ms
[2024-05-31 18:04:42] [INFO ] Input system was already deterministic with 3650 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2172/2172 places, 3810/3810 transitions.
Discarding 85 places :
Symmetric choice reduction at 0 with 85 rule applications. Total rules 85 place count 2087 transition count 3643
Iterating global reduction 0 with 85 rules applied. Total rules applied 170 place count 2087 transition count 3643
Applied a total of 170 rules in 195 ms. Remains 2087 /2172 variables (removed 85) and now considering 3643/3810 (removed 167) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 195 ms. Remains : 2087/2172 places, 3643/3810 transitions.
[2024-05-31 18:04:42] [INFO ] Flatten gal took : 66 ms
[2024-05-31 18:04:42] [INFO ] Flatten gal took : 77 ms
[2024-05-31 18:04:42] [INFO ] Input system was already deterministic with 3643 transitions.
[2024-05-31 18:04:43] [INFO ] Flatten gal took : 87 ms
[2024-05-31 18:04:43] [INFO ] Flatten gal took : 90 ms
[2024-05-31 18:04:43] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-31 18:04:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2172 places, 3810 transitions and 14032 arcs took 16 ms.
Total runtime 186898 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 : CANConstruction-PT-040-CTLCardinality-2024-01
Could not compute solution for formula : CANConstruction-PT-040-CTLCardinality-2024-02
Could not compute solution for formula : CANConstruction-PT-040-CTLCardinality-2024-03
Could not compute solution for formula : CANConstruction-PT-040-CTLCardinality-2024-04
Could not compute solution for formula : CANConstruction-PT-040-CTLCardinality-2024-05
Could not compute solution for formula : CANConstruction-PT-040-CTLCardinality-2024-06
Could not compute solution for formula : CANConstruction-PT-040-CTLCardinality-2024-07
Could not compute solution for formula : CANConstruction-PT-040-CTLCardinality-2024-09
Could not compute solution for formula : CANConstruction-PT-040-CTLCardinality-2024-11
Could not compute solution for formula : CANConstruction-PT-040-CTLCardinality-2023-12
Could not compute solution for formula : CANConstruction-PT-040-CTLCardinality-2023-13
Could not compute solution for formula : CANConstruction-PT-040-CTLCardinality-2023-15

BK_STOP 1717178683530

--------------------
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
mcc2024
ctl formula name CANConstruction-PT-040-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1203/ctl_0_
ctl formula name CANConstruction-PT-040-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1203/ctl_1_
ctl formula name CANConstruction-PT-040-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1203/ctl_2_
ctl formula name CANConstruction-PT-040-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1203/ctl_3_
ctl formula name CANConstruction-PT-040-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1203/ctl_4_
ctl formula name CANConstruction-PT-040-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1203/ctl_5_
ctl formula name CANConstruction-PT-040-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1203/ctl_6_
ctl formula name CANConstruction-PT-040-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1203/ctl_7_
ctl formula name CANConstruction-PT-040-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1203/ctl_8_
ctl formula name CANConstruction-PT-040-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/1203/ctl_9_
ctl formula name CANConstruction-PT-040-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/1203/ctl_10_
ctl formula name CANConstruction-PT-040-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/1203/ctl_11_
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="CANConstruction-PT-040"
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 CANConstruction-PT-040, 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 r476-tall-171620505000033"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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