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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.3K Apr 11 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 16K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 11 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 11 16:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 11 16:59 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-S02J04T06-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717248193363

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-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:23:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 13:23:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:23:14] [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:23:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 13:23:15] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 724 ms
[2024-06-01 13:23:15] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 476 PT places and 952.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
[2024-06-01 13:23:15] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-06-01 13:23:15] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (20 resets) in 2245 ms. (17 steps per ms) remains 60/82 properties
BEST_FIRST walk for 4000 steps (9 resets) in 214 ms. (18 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (9 resets) in 26 ms. (148 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 131 ms. (30 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 47 ms. (83 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (9 resets) in 27 ms. (142 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 40 ms. (97 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (9 resets) in 31 ms. (125 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 71 ms. (55 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (11 resets) in 28 ms. (137 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 41 ms. (95 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 36 ms. (108 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 48 ms. (81 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (9 resets) in 38 ms. (102 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 35 ms. (111 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (9 resets) in 47 ms. (83 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 28 ms. (137 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 31 ms. (125 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 54 ms. (72 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 52 ms. (75 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 35 ms. (111 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (9 resets) in 24 ms. (160 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (9 resets) in 23 ms. (166 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 60/60 properties
[2024-06-01 13:23:17] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 13:23:17] [INFO ] Computed 26 invariants in 11 ms
[2024-06-01 13:23:17] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp62 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 3/3 constraints. Problems are: Problem set: 8 solved, 52 unsolved
Problem AtomicPropp44 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 2/5 constraints. Problems are: Problem set: 9 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 9 solved, 51 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp81 is UNSAT
At refinement iteration 3 (OVERLAPS) 16/66 variables, 8/13 constraints. Problems are: Problem set: 41 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/13 constraints. Problems are: Problem set: 41 solved, 19 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp80 is UNSAT
At refinement iteration 5 (OVERLAPS) 15/81 variables, 13/26 constraints. Problems are: Problem set: 58 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 58 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 58 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 58 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 58 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 58 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 58 solved, 2 unsolved in 557 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: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 58 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 58 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/45 variables, 6/6 constraints. Problems are: Problem set: 58 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 58 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/49 variables, 3/9 constraints. Problems are: Problem set: 58 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 58 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 24/73 variables, 12/21 constraints. Problems are: Problem set: 58 solved, 2 unsolved
[2024-06-01 13:23:17] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 12 ms to minimize.
Problem AtomicPropp8 is UNSAT
[2024-06-01 13:23:17] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 2/23 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/78 variables, 3/26 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 0/26 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/79 variables, 1/27 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 0/27 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 64/143 variables, 79/106 constraints. Problems are: Problem set: 59 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/143 variables, 8/114 constraints. Problems are: Problem set: 59 solved, 1 unsolved
Problem AtomicPropp49 is UNSAT
After SMT solving in domain Int declared 143/145 variables, and 115 constraints, problems are : Problem set: 60 solved, 0 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 79/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/60 constraints, Known Traps: 2/2 constraints]
After SMT, in 893ms problems are : Problem set: 60 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 60 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:23:18] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2024-06-01 13:23:18] [INFO ] Flatten gal took : 39 ms
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:23:18] [INFO ] Flatten gal took : 10 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:23:18] [INFO ] Unfolded HLPN to a Petri net with 476 places and 920 transitions 4242 arcs in 33 ms.
[2024-06-01 13:23:18] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Support contains 313 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 468 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 468 transition count 818
Applied a total of 14 rules in 36 ms. Remains 468 /476 variables (removed 8) and now considering 818/824 (removed 6) transitions.
Running 816 sub problems to find dead transitions.
[2024-06-01 13:23:18] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 468 cols
[2024-06-01 13:23:18] [INFO ] Computed 44 invariants in 40 ms
[2024-06-01 13:23:18] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 13:23:25] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2024-06-01 13:23:25] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 2 ms to minimize.
[2024-06-01 13:23:26] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 2 ms to minimize.
[2024-06-01 13:23:26] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:23:26] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 2 ms to minimize.
[2024-06-01 13:23:26] [INFO ] Deduced a trap composed of 269 places in 228 ms of which 4 ms to minimize.
[2024-06-01 13:23:26] [INFO ] Deduced a trap composed of 92 places in 179 ms of which 3 ms to minimize.
[2024-06-01 13:23:27] [INFO ] Deduced a trap composed of 144 places in 177 ms of which 3 ms to minimize.
[2024-06-01 13:23:27] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 2 ms to minimize.
[2024-06-01 13:23:27] [INFO ] Deduced a trap composed of 277 places in 246 ms of which 3 ms to minimize.
[2024-06-01 13:23:27] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 2 ms to minimize.
[2024-06-01 13:23:28] [INFO ] Deduced a trap composed of 251 places in 258 ms of which 4 ms to minimize.
[2024-06-01 13:23:28] [INFO ] Deduced a trap composed of 211 places in 276 ms of which 4 ms to minimize.
[2024-06-01 13:23:29] [INFO ] Deduced a trap composed of 257 places in 238 ms of which 4 ms to minimize.
[2024-06-01 13:23:29] [INFO ] Deduced a trap composed of 245 places in 205 ms of which 3 ms to minimize.
[2024-06-01 13:23:29] [INFO ] Deduced a trap composed of 248 places in 194 ms of which 3 ms to minimize.
[2024-06-01 13:23:29] [INFO ] Deduced a trap composed of 243 places in 190 ms of which 3 ms to minimize.
[2024-06-01 13:23:35] [INFO ] Deduced a trap composed of 223 places in 212 ms of which 4 ms to minimize.
[2024-06-01 13:23:35] [INFO ] Deduced a trap composed of 245 places in 259 ms of which 4 ms to minimize.
[2024-06-01 13:23:36] [INFO ] Deduced a trap composed of 261 places in 245 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/1274 variables, and 62 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20058 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/468 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 13:23:44] [INFO ] Deduced a trap composed of 300 places in 230 ms of which 4 ms to minimize.
[2024-06-01 13:23:45] [INFO ] Deduced a trap composed of 253 places in 246 ms of which 5 ms to minimize.
[2024-06-01 13:23:45] [INFO ] Deduced a trap composed of 250 places in 247 ms of which 4 ms to minimize.
[2024-06-01 13:23:46] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-06-01 13:23:48] [INFO ] Deduced a trap composed of 238 places in 192 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 13:23:59] [INFO ] Deduced a trap composed of 318 places in 220 ms of which 3 ms to minimize.
SMT process timed out in 41482ms, After SMT, problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 41495ms
[2024-06-01 13:23:59] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-06-01 13:23:59] [INFO ] Invariant cache hit.
[2024-06-01 13:24:00] [INFO ] Implicit Places using invariants in 236 ms returned [366, 367, 368, 369, 370, 371]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 256 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 462/476 places, 818/824 transitions.
Applied a total of 0 rules in 12 ms. Remains 462 /462 variables (removed 0) and now considering 818/818 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41815 ms. Remains : 462/476 places, 818/824 transitions.
Support contains 313 out of 462 places after structural reductions.
[2024-06-01 13:24:00] [INFO ] Flatten gal took : 81 ms
[2024-06-01 13:24:00] [INFO ] Flatten gal took : 93 ms
[2024-06-01 13:24:00] [INFO ] Input system was already deterministic with 818 transitions.
RANDOM walk for 40001 steps (17 resets) in 1770 ms. (22 steps per ms) remains 30/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (8 resets) in 67 ms. (58 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4000 steps (8 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (9 resets) in 27 ms. (142 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (8 resets) in 51 ms. (76 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (9 resets) in 53 ms. (74 steps per ms) remains 30/30 properties
[2024-06-01 13:24:01] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 462 cols
[2024-06-01 13:24:01] [INFO ] Computed 38 invariants in 16 ms
[2024-06-01 13:24:01] [INFO ] State equation strengthened by 72 read => feed constraints.
Problem AtomicPropp28 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 29 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp38 is UNSAT
At refinement iteration 2 (OVERLAPS) 25/204 variables, 8/9 constraints. Problems are: Problem set: 6 solved, 24 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 2/11 constraints. Problems are: Problem set: 7 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/11 constraints. Problems are: Problem set: 7 solved, 23 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp45 is UNSAT
At refinement iteration 5 (OVERLAPS) 256/460 variables, 26/37 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 0/37 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 806/1266 variables, 460/497 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1266 variables, 72/569 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1266 variables, 0/569 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/1268 variables, 2/571 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1268 variables, 1/572 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1268 variables, 0/572 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1268 variables, 0/572 constraints. Problems are: Problem set: 29 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1268/1268 variables, and 572 constraints, problems are : Problem set: 29 solved, 1 unsolved in 979 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 462/462 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 29 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 315/318 variables, 5/5 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 0/5 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/330 variables, 8/13 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 0/13 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 129/459 variables, 23/36 constraints. Problems are: Problem set: 29 solved, 1 unsolved
[2024-06-01 13:24:02] [INFO ] Deduced a trap composed of 65 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:24:03] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 3 ms to minimize.
[2024-06-01 13:24:03] [INFO ] Deduced a trap composed of 65 places in 356 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 3/39 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 0/39 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/460 variables, 1/40 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 0/40 constraints. Problems are: Problem set: 29 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 806/1266 variables, 460/500 constraints. Problems are: Problem set: 29 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1266/1268 variables, and 572 constraints, problems are : Problem set: 29 solved, 1 unsolved in 2125 ms.
Refiners :[Positive P Invariants (semi-flows): 9/10 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 460/462 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 0/30 constraints, Known Traps: 3/3 constraints]
After SMT, in 3176ms problems are : Problem set: 29 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 3 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 818/818 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 462 transition count 776
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 420 transition count 776
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 84 place count 420 transition count 728
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 180 place count 372 transition count 728
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 288 place count 318 transition count 674
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 294 place count 312 transition count 668
Iterating global reduction 2 with 6 rules applied. Total rules applied 300 place count 312 transition count 668
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 312 place count 312 transition count 656
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 324 place count 300 transition count 656
Applied a total of 324 rules in 188 ms. Remains 300 /462 variables (removed 162) and now considering 656/818 (removed 162) transitions.
Running 654 sub problems to find dead transitions.
[2024-06-01 13:24:04] [INFO ] Flow matrix only has 644 transitions (discarded 12 similar events)
// Phase 1: matrix 644 rows 300 cols
[2024-06-01 13:24:04] [INFO ] Computed 38 invariants in 33 ms
[2024-06-01 13:24:04] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/298 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 654 unsolved
[2024-06-01 13:24:09] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:24:09] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:24:09] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:24:09] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 5 ms to minimize.
[2024-06-01 13:24:09] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:24:09] [INFO ] Deduced a trap composed of 112 places in 198 ms of which 2 ms to minimize.
[2024-06-01 13:24:10] [INFO ] Deduced a trap composed of 103 places in 198 ms of which 2 ms to minimize.
[2024-06-01 13:24:10] [INFO ] Deduced a trap composed of 108 places in 165 ms of which 2 ms to minimize.
[2024-06-01 13:24:10] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2024-06-01 13:24:10] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:24:12] [INFO ] Deduced a trap composed of 102 places in 174 ms of which 2 ms to minimize.
[2024-06-01 13:24:12] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 2 ms to minimize.
[2024-06-01 13:24:13] [INFO ] Deduced a trap composed of 128 places in 120 ms of which 2 ms to minimize.
[2024-06-01 13:24:13] [INFO ] Deduced a trap composed of 123 places in 155 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 654 unsolved
[2024-06-01 13:24:15] [INFO ] Deduced a trap composed of 166 places in 108 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 654 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 654 unsolved
Problem TDEAD574 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/300 variables, 2/53 constraints. Problems are: Problem set: 66 solved, 588 unsolved
[2024-06-01 13:24:26] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 3 ms to minimize.
SMT process timed out in 21240ms, After SMT, problems are : Problem set: 66 solved, 588 unsolved
Search for dead transitions found 66 dead transitions in 21248ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 300/462 places, 590/818 transitions.
Reduce places removed 1 places and 12 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 299 transition count 578
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 13 place count 287 transition count 566
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 13 rules in 27 ms. Remains 287 /300 variables (removed 13) and now considering 566/590 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 21466 ms. Remains : 287/462 places, 566/818 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
RANDOM walk for 40000 steps (25 resets) in 866 ms. (46 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (20 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 487108 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :0 out of 1
Probabilistic random walk after 487108 steps, saw 224895 distinct states, run finished after 3005 ms. (steps per millisecond=162 ) properties seen :0
[2024-06-01 13:24:29] [INFO ] Flow matrix only has 554 transitions (discarded 12 similar events)
// Phase 1: matrix 554 rows 286 cols
[2024-06-01 13:24:29] [INFO ] Computed 38 invariants in 34 ms
[2024-06-01 13:24:29] [INFO ] State equation strengthened by 72 read => feed constraints.
Problem AtomicPropp17 is UNSAT
After SMT solving in domain Real declared 2/840 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 0/11 constraints, Generalized P Invariants (flows): 0/27 constraints, State Equation: 0/286 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 97ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 30 atomic propositions for a total of 8 simplifications.
[2024-06-01 13:24:29] [INFO ] Flatten gal took : 42 ms
[2024-06-01 13:24:29] [INFO ] Flatten gal took : 43 ms
[2024-06-01 13:24:29] [INFO ] Input system was already deterministic with 818 transitions.
Support contains 73 out of 462 places (down from 128) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 462 transition count 776
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 420 transition count 776
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 84 place count 420 transition count 728
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 180 place count 372 transition count 728
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 288 place count 318 transition count 674
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 294 place count 312 transition count 668
Iterating global reduction 2 with 6 rules applied. Total rules applied 300 place count 312 transition count 668
Applied a total of 300 rules in 54 ms. Remains 312 /462 variables (removed 150) and now considering 668/818 (removed 150) transitions.
Running 666 sub problems to find dead transitions.
[2024-06-01 13:24:29] [INFO ] Flow matrix only has 656 transitions (discarded 12 similar events)
// Phase 1: matrix 656 rows 312 cols
[2024-06-01 13:24:29] [INFO ] Computed 38 invariants in 12 ms
[2024-06-01 13:24:29] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:24:34] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-06-01 13:24:34] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2024-06-01 13:24:34] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 2 ms to minimize.
[2024-06-01 13:24:34] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 2 ms to minimize.
[2024-06-01 13:24:34] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 3 ms to minimize.
[2024-06-01 13:24:34] [INFO ] Deduced a trap composed of 115 places in 137 ms of which 3 ms to minimize.
[2024-06-01 13:24:35] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:24:36] [INFO ] Deduced a trap composed of 178 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:24:38] [INFO ] Deduced a trap composed of 108 places in 166 ms of which 2 ms to minimize.
[2024-06-01 13:24:38] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 5 ms to minimize.
[2024-06-01 13:24:39] [INFO ] Deduced a trap composed of 101 places in 118 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:24:41] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:24:41] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/311 variables, 1/50 constraints. Problems are: Problem set: 36 solved, 630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 311/968 variables, and 50 constraints, problems are : Problem set: 36 solved, 630 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 36 solved, 630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 14/14 constraints. Problems are: Problem set: 36 solved, 630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 22/36 constraints. Problems are: Problem set: 36 solved, 630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 13/49 constraints. Problems are: Problem set: 36 solved, 630 unsolved
[2024-06-01 13:24:56] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 1/50 constraints. Problems are: Problem set: 36 solved, 630 unsolved
[2024-06-01 13:25:01] [INFO ] Deduced a trap composed of 108 places in 135 ms of which 1 ms to minimize.
[2024-06-01 13:25:02] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 1 ms to minimize.
[2024-06-01 13:25:02] [INFO ] Deduced a trap composed of 59 places in 111 ms of which 3 ms to minimize.
[2024-06-01 13:25:02] [INFO ] Deduced a trap composed of 103 places in 131 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 4/54 constraints. Problems are: Problem set: 36 solved, 630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/968 variables, and 54 constraints, problems are : Problem set: 36 solved, 630 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/666 constraints, Known Traps: 18/18 constraints]
After SMT, in 40950ms problems are : Problem set: 36 solved, 630 unsolved
Search for dead transitions found 36 dead transitions in 40960ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 36 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 312/462 places, 632/818 transitions.
Applied a total of 0 rules in 29 ms. Remains 312 /312 variables (removed 0) and now considering 632/632 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41047 ms. Remains : 312/462 places, 632/818 transitions.
[2024-06-01 13:25:10] [INFO ] Flatten gal took : 70 ms
[2024-06-01 13:25:10] [INFO ] Flatten gal took : 51 ms
[2024-06-01 13:25:11] [INFO ] Input system was already deterministic with 632 transitions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 31 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-06-01 13:25:11] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2024-06-01 13:25:11] [INFO ] Computed 38 invariants in 10 ms
[2024-06-01 13:25:11] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:25:17] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2024-06-01 13:25:17] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:25:17] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:25:17] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:25:17] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:25:17] [INFO ] Deduced a trap composed of 240 places in 225 ms of which 3 ms to minimize.
[2024-06-01 13:25:17] [INFO ] Deduced a trap composed of 139 places in 153 ms of which 3 ms to minimize.
[2024-06-01 13:25:17] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:25:18] [INFO ] Deduced a trap composed of 271 places in 256 ms of which 4 ms to minimize.
[2024-06-01 13:25:18] [INFO ] Deduced a trap composed of 55 places in 159 ms of which 2 ms to minimize.
[2024-06-01 13:25:18] [INFO ] Deduced a trap composed of 265 places in 285 ms of which 4 ms to minimize.
[2024-06-01 13:25:21] [INFO ] Deduced a trap composed of 248 places in 174 ms of which 3 ms to minimize.
[2024-06-01 13:25:23] [INFO ] Deduced a trap composed of 223 places in 243 ms of which 4 ms to minimize.
[2024-06-01 13:25:23] [INFO ] Deduced a trap composed of 241 places in 207 ms of which 4 ms to minimize.
[2024-06-01 13:25:24] [INFO ] Deduced a trap composed of 110 places in 171 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:25:26] [INFO ] Deduced a trap composed of 262 places in 229 ms of which 4 ms to minimize.
[2024-06-01 13:25:26] [INFO ] Deduced a trap composed of 269 places in 205 ms of which 3 ms to minimize.
[2024-06-01 13:25:31] [INFO ] Deduced a trap composed of 59 places in 243 ms of which 4 ms to minimize.
[2024-06-01 13:25:31] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:25:37] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 3 ms to minimize.
[2024-06-01 13:25:39] [INFO ] Deduced a trap composed of 226 places in 148 ms of which 3 ms to minimize.
[2024-06-01 13:25:39] [INFO ] Deduced a trap composed of 275 places in 193 ms of which 3 ms to minimize.
[2024-06-01 13:25:39] [INFO ] Deduced a trap composed of 240 places in 227 ms of which 4 ms to minimize.
[2024-06-01 13:25:41] [INFO ] Deduced a trap composed of 241 places in 177 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:25:45] [INFO ] Deduced a trap composed of 289 places in 184 ms of which 4 ms to minimize.
[2024-06-01 13:25:45] [INFO ] Deduced a trap composed of 299 places in 184 ms of which 2 ms to minimize.
[2024-06-01 13:25:46] [INFO ] Deduced a trap composed of 276 places in 147 ms of which 3 ms to minimize.
[2024-06-01 13:25:46] [INFO ] Deduced a trap composed of 252 places in 164 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 64 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 28/28 constraints]
After SMT, in 40964ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40973ms
Finished structural reductions in LTL mode , in 1 iterations and 41005 ms. Remains : 456/462 places, 812/818 transitions.
[2024-06-01 13:25:52] [INFO ] Flatten gal took : 29 ms
[2024-06-01 13:25:52] [INFO ] Flatten gal took : 27 ms
[2024-06-01 13:25:52] [INFO ] Input system was already deterministic with 812 transitions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 10 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-06-01 13:25:52] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:25:52] [INFO ] Invariant cache hit.
[2024-06-01 13:25:52] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:25:58] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 2 ms to minimize.
[2024-06-01 13:25:58] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 1 ms to minimize.
[2024-06-01 13:25:59] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:25:59] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:25:59] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:25:59] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 2 ms to minimize.
[2024-06-01 13:26:01] [INFO ] Deduced a trap composed of 270 places in 248 ms of which 3 ms to minimize.
[2024-06-01 13:26:01] [INFO ] Deduced a trap composed of 286 places in 215 ms of which 3 ms to minimize.
[2024-06-01 13:26:02] [INFO ] Deduced a trap composed of 256 places in 209 ms of which 3 ms to minimize.
[2024-06-01 13:26:02] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 2 ms to minimize.
[2024-06-01 13:26:02] [INFO ] Deduced a trap composed of 268 places in 174 ms of which 2 ms to minimize.
[2024-06-01 13:26:02] [INFO ] Deduced a trap composed of 245 places in 157 ms of which 2 ms to minimize.
[2024-06-01 13:26:02] [INFO ] Deduced a trap composed of 241 places in 160 ms of which 2 ms to minimize.
[2024-06-01 13:26:03] [INFO ] Deduced a trap composed of 288 places in 202 ms of which 4 ms to minimize.
[2024-06-01 13:26:03] [INFO ] Deduced a trap composed of 232 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:26:03] [INFO ] Deduced a trap composed of 248 places in 182 ms of which 2 ms to minimize.
[2024-06-01 13:26:05] [INFO ] Deduced a trap composed of 42 places in 237 ms of which 3 ms to minimize.
[2024-06-01 13:26:06] [INFO ] Deduced a trap composed of 144 places in 218 ms of which 3 ms to minimize.
[2024-06-01 13:26:07] [INFO ] Deduced a trap composed of 302 places in 212 ms of which 4 ms to minimize.
[2024-06-01 13:26:07] [INFO ] Deduced a trap composed of 278 places in 192 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:26:07] [INFO ] Deduced a trap composed of 296 places in 182 ms of which 3 ms to minimize.
[2024-06-01 13:26:08] [INFO ] Deduced a trap composed of 249 places in 211 ms of which 3 ms to minimize.
[2024-06-01 13:26:08] [INFO ] Deduced a trap composed of 261 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:26:08] [INFO ] Deduced a trap composed of 247 places in 166 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 60 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:26:16] [INFO ] Deduced a trap composed of 297 places in 167 ms of which 3 ms to minimize.
[2024-06-01 13:26:21] [INFO ] Deduced a trap composed of 276 places in 223 ms of which 4 ms to minimize.
[2024-06-01 13:26:21] [INFO ] Deduced a trap composed of 246 places in 186 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:26:28] [INFO ] Deduced a trap composed of 239 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:26:28] [INFO ] Deduced a trap composed of 129 places in 119 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 810 unsolved
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 1)
(s9 0)
(s10 0)
(s11 1)
(s12 1)
(s13 1)
(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 1)
(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 1)
(s100 0)
(s101 1)
(s102 0)
(s103 1)
(s104 0)
(s105 1)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(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 9)
(s123 0)
(s124 1)
(s125 1)
(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 1)
(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 1)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 1)
(s267 1)
(s268 1)
(s269 0)
(s270 1)
(s271 0)
(s272 0)
(s273 0)
(s274 4)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 1)
(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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 65 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 29/29 constraints]
After SMT, in 40830ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40838ms
Finished structural reductions in LTL mode , in 1 iterations and 40850 ms. Remains : 456/462 places, 812/818 transitions.
[2024-06-01 13:26:33] [INFO ] Flatten gal took : 44 ms
[2024-06-01 13:26:33] [INFO ] Flatten gal took : 69 ms
[2024-06-01 13:26:33] [INFO ] Input system was already deterministic with 812 transitions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 9 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-06-01 13:26:33] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:26:33] [INFO ] Invariant cache hit.
[2024-06-01 13:26:33] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:26:39] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 2 ms to minimize.
[2024-06-01 13:26:39] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:26:40] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 0 ms to minimize.
[2024-06-01 13:26:40] [INFO ] Deduced a trap composed of 64 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:26:41] [INFO ] Deduced a trap composed of 64 places in 160 ms of which 2 ms to minimize.
[2024-06-01 13:26:41] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:26:42] [INFO ] Deduced a trap composed of 270 places in 215 ms of which 2 ms to minimize.
[2024-06-01 13:26:43] [INFO ] Deduced a trap composed of 286 places in 240 ms of which 3 ms to minimize.
[2024-06-01 13:26:43] [INFO ] Deduced a trap composed of 256 places in 191 ms of which 2 ms to minimize.
[2024-06-01 13:26:43] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 3 ms to minimize.
[2024-06-01 13:26:43] [INFO ] Deduced a trap composed of 268 places in 163 ms of which 3 ms to minimize.
[2024-06-01 13:26:44] [INFO ] Deduced a trap composed of 245 places in 179 ms of which 2 ms to minimize.
[2024-06-01 13:26:44] [INFO ] Deduced a trap composed of 241 places in 171 ms of which 2 ms to minimize.
[2024-06-01 13:26:44] [INFO ] Deduced a trap composed of 288 places in 159 ms of which 2 ms to minimize.
[2024-06-01 13:26:44] [INFO ] Deduced a trap composed of 232 places in 176 ms of which 3 ms to minimize.
[2024-06-01 13:26:44] [INFO ] Deduced a trap composed of 248 places in 167 ms of which 2 ms to minimize.
[2024-06-01 13:26:46] [INFO ] Deduced a trap composed of 42 places in 187 ms of which 3 ms to minimize.
[2024-06-01 13:26:47] [INFO ] Deduced a trap composed of 144 places in 199 ms of which 2 ms to minimize.
[2024-06-01 13:26:48] [INFO ] Deduced a trap composed of 302 places in 215 ms of which 2 ms to minimize.
[2024-06-01 13:26:48] [INFO ] Deduced a trap composed of 278 places in 173 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:26:48] [INFO ] Deduced a trap composed of 296 places in 158 ms of which 4 ms to minimize.
[2024-06-01 13:26:49] [INFO ] Deduced a trap composed of 249 places in 186 ms of which 3 ms to minimize.
[2024-06-01 13:26:49] [INFO ] Deduced a trap composed of 261 places in 173 ms of which 3 ms to minimize.
[2024-06-01 13:26:49] [INFO ] Deduced a trap composed of 247 places in 159 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 60 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:26:58] [INFO ] Deduced a trap composed of 297 places in 165 ms of which 3 ms to minimize.
[2024-06-01 13:27:01] [INFO ] Deduced a trap composed of 276 places in 184 ms of which 2 ms to minimize.
[2024-06-01 13:27:02] [INFO ] Deduced a trap composed of 246 places in 147 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:27:08] [INFO ] Deduced a trap composed of 239 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:27:08] [INFO ] Deduced a trap composed of 129 places in 96 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 65 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 29/29 constraints]
After SMT, in 40760ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40781ms
Finished structural reductions in LTL mode , in 1 iterations and 40792 ms. Remains : 456/462 places, 812/818 transitions.
[2024-06-01 13:27:14] [INFO ] Flatten gal took : 23 ms
[2024-06-01 13:27:14] [INFO ] Flatten gal took : 23 ms
[2024-06-01 13:27:14] [INFO ] Input system was already deterministic with 812 transitions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 21 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-06-01 13:27:14] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:27:14] [INFO ] Invariant cache hit.
[2024-06-01 13:27:14] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:27:19] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 2 ms to minimize.
[2024-06-01 13:27:20] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:27:20] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:27:20] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:27:20] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:27:20] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:27:22] [INFO ] Deduced a trap composed of 270 places in 176 ms of which 3 ms to minimize.
[2024-06-01 13:27:22] [INFO ] Deduced a trap composed of 286 places in 164 ms of which 2 ms to minimize.
[2024-06-01 13:27:22] [INFO ] Deduced a trap composed of 256 places in 173 ms of which 2 ms to minimize.
[2024-06-01 13:27:23] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 2 ms to minimize.
[2024-06-01 13:27:23] [INFO ] Deduced a trap composed of 268 places in 177 ms of which 3 ms to minimize.
[2024-06-01 13:27:23] [INFO ] Deduced a trap composed of 245 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:27:23] [INFO ] Deduced a trap composed of 241 places in 180 ms of which 2 ms to minimize.
[2024-06-01 13:27:23] [INFO ] Deduced a trap composed of 288 places in 231 ms of which 3 ms to minimize.
[2024-06-01 13:27:24] [INFO ] Deduced a trap composed of 232 places in 170 ms of which 2 ms to minimize.
[2024-06-01 13:27:24] [INFO ] Deduced a trap composed of 248 places in 153 ms of which 2 ms to minimize.
[2024-06-01 13:27:26] [INFO ] Deduced a trap composed of 42 places in 176 ms of which 2 ms to minimize.
[2024-06-01 13:27:26] [INFO ] Deduced a trap composed of 144 places in 222 ms of which 2 ms to minimize.
[2024-06-01 13:27:27] [INFO ] Deduced a trap composed of 302 places in 191 ms of which 2 ms to minimize.
[2024-06-01 13:27:27] [INFO ] Deduced a trap composed of 278 places in 172 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:27:28] [INFO ] Deduced a trap composed of 296 places in 191 ms of which 2 ms to minimize.
[2024-06-01 13:27:28] [INFO ] Deduced a trap composed of 249 places in 160 ms of which 3 ms to minimize.
[2024-06-01 13:27:28] [INFO ] Deduced a trap composed of 261 places in 163 ms of which 2 ms to minimize.
[2024-06-01 13:27:28] [INFO ] Deduced a trap composed of 247 places in 172 ms of which 2 ms to minimize.
[2024-06-01 13:27:33] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 3 ms to minimize.
[2024-06-01 13:27:34] [INFO ] Deduced a trap composed of 242 places in 146 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 62 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 26/62 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:27:36] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:27:47] [INFO ] Deduced a trap composed of 244 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:27:47] [INFO ] Deduced a trap composed of 288 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:27:47] [INFO ] Deduced a trap composed of 222 places in 167 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 66 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 30/30 constraints]
After SMT, in 40726ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40733ms
Finished structural reductions in LTL mode , in 1 iterations and 40756 ms. Remains : 456/462 places, 812/818 transitions.
[2024-06-01 13:27:55] [INFO ] Flatten gal took : 21 ms
[2024-06-01 13:27:55] [INFO ] Flatten gal took : 24 ms
[2024-06-01 13:27:55] [INFO ] Input system was already deterministic with 812 transitions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Applied a total of 0 rules in 14 ms. Remains 462 /462 variables (removed 0) and now considering 818/818 (removed 0) transitions.
Running 816 sub problems to find dead transitions.
[2024-06-01 13:27:55] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 462 cols
[2024-06-01 13:27:55] [INFO ] Computed 38 invariants in 7 ms
[2024-06-01 13:27:55] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 13:28:00] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:28:00] [INFO ] Deduced a trap composed of 130 places in 153 ms of which 3 ms to minimize.
[2024-06-01 13:28:00] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:28:00] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:28:01] [INFO ] Deduced a trap composed of 65 places in 171 ms of which 2 ms to minimize.
[2024-06-01 13:28:01] [INFO ] Deduced a trap composed of 235 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:28:01] [INFO ] Deduced a trap composed of 277 places in 177 ms of which 2 ms to minimize.
[2024-06-01 13:28:01] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 2 ms to minimize.
[2024-06-01 13:28:03] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:28:03] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:28:04] [INFO ] Deduced a trap composed of 228 places in 164 ms of which 6 ms to minimize.
[2024-06-01 13:28:05] [INFO ] Deduced a trap composed of 223 places in 144 ms of which 3 ms to minimize.
[2024-06-01 13:28:06] [INFO ] Deduced a trap composed of 264 places in 155 ms of which 3 ms to minimize.
[2024-06-01 13:28:06] [INFO ] Deduced a trap composed of 256 places in 166 ms of which 2 ms to minimize.
[2024-06-01 13:28:06] [INFO ] Deduced a trap composed of 214 places in 168 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 816 unsolved
SMT process timed out in 20684ms, After SMT, problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 20692ms
Finished structural reductions in LTL mode , in 1 iterations and 20707 ms. Remains : 462/462 places, 818/818 transitions.
[2024-06-01 13:28:15] [INFO ] Flatten gal took : 23 ms
[2024-06-01 13:28:15] [INFO ] Flatten gal took : 24 ms
[2024-06-01 13:28:15] [INFO ] Input system was already deterministic with 818 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 462 transition count 788
Reduce places removed 30 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 66 place count 432 transition count 782
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 426 transition count 782
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 72 place count 426 transition count 734
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 168 place count 378 transition count 734
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 276 place count 324 transition count 680
Applied a total of 276 rules in 33 ms. Remains 324 /462 variables (removed 138) and now considering 680/818 (removed 138) transitions.
Running 678 sub problems to find dead transitions.
[2024-06-01 13:28:15] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
// Phase 1: matrix 668 rows 324 cols
[2024-06-01 13:28:15] [INFO ] Computed 38 invariants in 8 ms
[2024-06-01 13:28:16] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-06-01 13:28:20] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:28:20] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:28:20] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:28:20] [INFO ] Deduced a trap composed of 42 places in 25 ms of which 1 ms to minimize.
[2024-06-01 13:28:20] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:28:20] [INFO ] Deduced a trap composed of 152 places in 177 ms of which 2 ms to minimize.
[2024-06-01 13:28:20] [INFO ] Deduced a trap composed of 121 places in 147 ms of which 2 ms to minimize.
[2024-06-01 13:28:20] [INFO ] Deduced a trap composed of 125 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:28:21] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-06-01 13:28:21] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:28:24] [INFO ] Deduced a trap composed of 109 places in 133 ms of which 1 ms to minimize.
[2024-06-01 13:28:24] [INFO ] Deduced a trap composed of 123 places in 134 ms of which 1 ms to minimize.
[2024-06-01 13:28:24] [INFO ] Deduced a trap composed of 137 places in 126 ms of which 2 ms to minimize.
[2024-06-01 13:28:25] [INFO ] Deduced a trap composed of 147 places in 134 ms of which 1 ms to minimize.
[2024-06-01 13:28:25] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-06-01 13:28:27] [INFO ] Deduced a trap composed of 184 places in 148 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/992 variables, and 52 constraints, problems are : Problem set: 0 solved, 678 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 678/678 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 678 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-06-01 13:28:42] [INFO ] Deduced a trap composed of 114 places in 124 ms of which 2 ms to minimize.
[2024-06-01 13:28:42] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2024-06-01 13:28:43] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-06-01 13:28:50] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 678 unsolved
[2024-06-01 13:28:55] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/992 variables, and 57 constraints, problems are : Problem set: 0 solved, 678 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/324 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/678 constraints, Known Traps: 21/21 constraints]
After SMT, in 40830ms problems are : Problem set: 0 solved, 678 unsolved
Search for dead transitions found 0 dead transitions in 40837ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 40874 ms. Remains : 324/462 places, 680/818 transitions.
[2024-06-01 13:28:56] [INFO ] Flatten gal took : 18 ms
[2024-06-01 13:28:56] [INFO ] Flatten gal took : 20 ms
[2024-06-01 13:28:56] [INFO ] Input system was already deterministic with 680 transitions.
RANDOM walk for 357 steps (0 resets) in 13 ms. (25 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 818/818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 456 transition count 812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 812
Applied a total of 12 rules in 16 ms. Remains 456 /462 variables (removed 6) and now considering 812/818 (removed 6) transitions.
Running 810 sub problems to find dead transitions.
[2024-06-01 13:28:56] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 456 cols
[2024-06-01 13:28:56] [INFO ] Computed 38 invariants in 7 ms
[2024-06-01 13:28:56] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:29:01] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:29:02] [INFO ] Deduced a trap composed of 64 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:29:02] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 0 ms to minimize.
[2024-06-01 13:29:02] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 0 ms to minimize.
[2024-06-01 13:29:02] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:29:02] [INFO ] Deduced a trap composed of 240 places in 193 ms of which 2 ms to minimize.
[2024-06-01 13:29:02] [INFO ] Deduced a trap composed of 139 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:29:02] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:29:03] [INFO ] Deduced a trap composed of 271 places in 161 ms of which 3 ms to minimize.
[2024-06-01 13:29:03] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 1 ms to minimize.
[2024-06-01 13:29:03] [INFO ] Deduced a trap composed of 265 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:29:06] [INFO ] Deduced a trap composed of 248 places in 176 ms of which 3 ms to minimize.
[2024-06-01 13:29:07] [INFO ] Deduced a trap composed of 223 places in 179 ms of which 3 ms to minimize.
[2024-06-01 13:29:07] [INFO ] Deduced a trap composed of 241 places in 179 ms of which 2 ms to minimize.
[2024-06-01 13:29:09] [INFO ] Deduced a trap composed of 110 places in 178 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:29:10] [INFO ] Deduced a trap composed of 262 places in 172 ms of which 2 ms to minimize.
[2024-06-01 13:29:11] [INFO ] Deduced a trap composed of 269 places in 162 ms of which 2 ms to minimize.
[2024-06-01 13:29:15] [INFO ] Deduced a trap composed of 59 places in 194 ms of which 3 ms to minimize.
[2024-06-01 13:29:16] [INFO ] Deduced a trap composed of 48 places in 185 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1256 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:29:22] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-06-01 13:29:23] [INFO ] Deduced a trap composed of 226 places in 162 ms of which 3 ms to minimize.
[2024-06-01 13:29:23] [INFO ] Deduced a trap composed of 275 places in 171 ms of which 2 ms to minimize.
[2024-06-01 13:29:23] [INFO ] Deduced a trap composed of 240 places in 173 ms of which 2 ms to minimize.
[2024-06-01 13:29:25] [INFO ] Deduced a trap composed of 241 places in 145 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:29:29] [INFO ] Deduced a trap composed of 289 places in 178 ms of which 2 ms to minimize.
[2024-06-01 13:29:29] [INFO ] Deduced a trap composed of 299 places in 179 ms of which 2 ms to minimize.
[2024-06-01 13:29:30] [INFO ] Deduced a trap composed of 276 places in 177 ms of which 2 ms to minimize.
[2024-06-01 13:29:30] [INFO ] Deduced a trap composed of 252 places in 160 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1256 variables, and 64 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20012 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/456 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 28/28 constraints]
After SMT, in 40717ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40726ms
Finished structural reductions in LTL mode , in 1 iterations and 40744 ms. Remains : 456/462 places, 812/818 transitions.
[2024-06-01 13:29:37] [INFO ] Flatten gal took : 28 ms
[2024-06-01 13:29:37] [INFO ] Flatten gal took : 22 ms
[2024-06-01 13:29:37] [INFO ] Input system was already deterministic with 812 transitions.
[2024-06-01 13:29:37] [INFO ] Flatten gal took : 21 ms
[2024-06-01 13:29:37] [INFO ] Flatten gal took : 22 ms
[2024-06-01 13:29:37] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 13:29:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 462 places, 818 transitions and 3532 arcs took 8 ms.
Total runtime 383174 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-S02J04T06-CTLCardinality-2024-02
Could not compute solution for formula : PolyORBLF-COL-S02J04T06-CTLCardinality-2024-03
Could not compute solution for formula : PolyORBLF-COL-S02J04T06-CTLCardinality-2024-05
Could not compute solution for formula : PolyORBLF-COL-S02J04T06-CTLCardinality-2024-06
Could not compute solution for formula : PolyORBLF-COL-S02J04T06-CTLCardinality-2024-10
Could not compute solution for formula : PolyORBLF-COL-S02J04T06-CTLCardinality-2024-11
Could not compute solution for formula : PolyORBLF-COL-S02J04T06-CTLCardinality-2024-14

BK_STOP 1717248578071

--------------------
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-S02J04T06-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1365/ctl_0_
ctl formula name PolyORBLF-COL-S02J04T06-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1365/ctl_1_
ctl formula name PolyORBLF-COL-S02J04T06-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1365/ctl_2_
ctl formula name PolyORBLF-COL-S02J04T06-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1365/ctl_3_
ctl formula name PolyORBLF-COL-S02J04T06-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1365/ctl_4_
ctl formula name PolyORBLF-COL-S02J04T06-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1365/ctl_5_
ctl formula name PolyORBLF-COL-S02J04T06-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/1365/ctl_6_
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-S02J04T06"
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-S02J04T06, 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-171654446300073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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