Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399400409.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 itstools
Input is BugTracking-PT-q8m016, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399400409
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 12 02:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 02:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716332917584

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m016
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 23:08:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:08:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:08:40] [INFO ] Load time of PNML (sax parser for PT used): 839 ms
[2024-05-21 23:08:40] [INFO ] Transformed 754 places.
[2024-05-21 23:08:40] [INFO ] Transformed 27370 transitions.
[2024-05-21 23:08:40] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1083 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
Deduced a syphon composed of 474 places in 109 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m016-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 278 transition count 3904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 277 transition count 3871
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 277 transition count 3871
Applied a total of 4 rules in 96 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2024-05-21 23:08:40] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2024-05-21 23:08:40] [INFO ] Computed 8 invariants in 55 ms
[2024-05-21 23:08:41] [INFO ] Implicit Places using invariants in 664 ms returned []
[2024-05-21 23:08:41] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-21 23:08:41] [INFO ] Invariant cache hit.
[2024-05-21 23:08:42] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-21 23:08:43] [INFO ] Implicit Places using invariants and state equation in 2449 ms returned []
Implicit Place search using SMT with State Equation took 3151 ms to find 0 implicit places.
Running 3869 sub problems to find dead transitions.
[2024-05-21 23:08:43] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-21 23:08:43] [INFO ] Invariant cache hit.
[2024-05-21 23:08:44] [INFO ] State equation strengthened by 282 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3869 unsolved
[2024-05-21 23:09:45] [INFO ] Deduced a trap composed of 10 places in 280 ms of which 16 ms to minimize.
[2024-05-21 23:09:45] [INFO ] Deduced a trap composed of 7 places in 195 ms of which 4 ms to minimize.
[2024-05-21 23:09:45] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:09:54] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
Problem TDEAD784 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 276/3984 variables, and 12 constraints, problems are : Problem set: 14 solved, 3855 unsolved in 30086 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/277 constraints, ReadFeed: 0/282 constraints, PredecessorRefiner: 3869/2672 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 14 solved, 3855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 14 solved, 3855 unsolved
Problem TDEAD2706 is UNSAT
Problem TDEAD2715 is UNSAT
Problem TDEAD2727 is UNSAT
Problem TDEAD2731 is UNSAT
Problem TDEAD2740 is UNSAT
Problem TDEAD2752 is UNSAT
Problem TDEAD2756 is UNSAT
Problem TDEAD2765 is UNSAT
Problem TDEAD2777 is UNSAT
Problem TDEAD2781 is UNSAT
Problem TDEAD2782 is UNSAT
Problem TDEAD2783 is UNSAT
Problem TDEAD2784 is UNSAT
Problem TDEAD2785 is UNSAT
Problem TDEAD2786 is UNSAT
Problem TDEAD2787 is UNSAT
Problem TDEAD2788 is UNSAT
Problem TDEAD2789 is UNSAT
Problem TDEAD2790 is UNSAT
Problem TDEAD2794 is UNSAT
Problem TDEAD2795 is UNSAT
Problem TDEAD2796 is UNSAT
Problem TDEAD2797 is UNSAT
Problem TDEAD2798 is UNSAT
Problem TDEAD2799 is UNSAT
Problem TDEAD2800 is UNSAT
Problem TDEAD2801 is UNSAT
Problem TDEAD2802 is UNSAT
Problem TDEAD2803 is UNSAT
Problem TDEAD2804 is UNSAT
Problem TDEAD2805 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 4/12 constraints. Problems are: Problem set: 45 solved, 3824 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 276/3984 variables, and 12 constraints, problems are : Problem set: 45 solved, 3824 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/277 constraints, ReadFeed: 0/282 constraints, PredecessorRefiner: 1197/2672 constraints, Known Traps: 4/4 constraints]
After SMT, in 103632ms problems are : Problem set: 45 solved, 3824 unsolved
Search for dead transitions found 45 dead transitions in 103701ms
Found 45 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 45 transitions
Dead transitions reduction (with SMT) removed 45 transitions
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3826/3904 transitions.
Reduce places removed 11 places and 334 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 266 transition count 3492
Reduce places removed 5 places and 152 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 16 place count 261 transition count 3340
Reduce places removed 2 places and 56 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 259 transition count 3284
Reduce places removed 1 places and 32 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 19 place count 258 transition count 3252
Applied a total of 19 rules in 34 ms. Remains 258 /277 variables (removed 19) and now considering 3252/3826 (removed 574) transitions.
[2024-05-21 23:10:27] [INFO ] Flow matrix only has 3123 transitions (discarded 129 similar events)
// Phase 1: matrix 3123 rows 258 cols
[2024-05-21 23:10:27] [INFO ] Computed 8 invariants in 14 ms
[2024-05-21 23:10:28] [INFO ] Implicit Places using invariants in 696 ms returned []
[2024-05-21 23:10:28] [INFO ] Flow matrix only has 3123 transitions (discarded 129 similar events)
[2024-05-21 23:10:28] [INFO ] Invariant cache hit.
[2024-05-21 23:10:28] [INFO ] State equation strengthened by 251 read => feed constraints.
[2024-05-21 23:10:30] [INFO ] Implicit Places using invariants and state equation in 1789 ms returned []
Implicit Place search using SMT with State Equation took 2490 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 258/280 places, 3252/3904 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 109526 ms. Remains : 258/280 places, 3252/3904 transitions.
Support contains 26 out of 258 places after structural reductions.
[2024-05-21 23:10:31] [INFO ] Flatten gal took : 498 ms
[2024-05-21 23:10:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BugTracking-PT-q8m016-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:10:31] [INFO ] Flatten gal took : 209 ms
[2024-05-21 23:10:31] [INFO ] Input system was already deterministic with 3252 transitions.
Support contains 17 out of 258 places (down from 26) after GAL structural reductions.
FORMULA BugTracking-PT-q8m016-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40011 steps (132 resets) in 1534 ms. (26 steps per ms) remains 12/16 properties
BEST_FIRST walk for 40004 steps (26 resets) in 484 ms. (82 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (27 resets) in 162 ms. (245 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (23 resets) in 172 ms. (231 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (23 resets) in 424 ms. (94 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (25 resets) in 240 ms. (165 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (23 resets) in 177 ms. (224 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (27 resets) in 145 ms. (274 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (27 resets) in 165 ms. (240 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (22 resets) in 126 ms. (314 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (25 resets) in 186 ms. (213 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (25 resets) in 96 ms. (412 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (26 resets) in 104 ms. (380 steps per ms) remains 12/12 properties
[2024-05-21 23:10:33] [INFO ] Flow matrix only has 3123 transitions (discarded 129 similar events)
[2024-05-21 23:10:33] [INFO ] Invariant cache hit.
[2024-05-21 23:10:33] [INFO ] State equation strengthened by 251 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
At refinement iteration 1 (OVERLAPS) 122/135 variables, 6/6 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/6 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2939/3074 variables, 135/141 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3074 variables, 81/222 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3074 variables, 0/222 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 304/3378 variables, 120/342 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3378 variables, 1/343 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3378 variables, 170/513 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3378 variables, 0/513 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/3379 variables, 1/514 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3379 variables, 1/515 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3379 variables, 0/515 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 2/3381 variables, 2/517 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3381 variables, 0/517 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/3381 variables, 0/517 constraints. Problems are: Problem set: 6 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3381/3381 variables, and 517 constraints, problems are : Problem set: 6 solved, 6 unsolved in 2538 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 258/258 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 72/80 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1861/1941 variables, 80/83 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1941 variables, 7/90 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1941 variables, 0/90 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1326/3267 variables, 105/195 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3267 variables, 1/196 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3267 variables, 219/415 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3267 variables, 4/419 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3267 variables, 0/419 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 6/3273 variables, 3/422 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3273 variables, 2/424 constraints. Problems are: Problem set: 6 solved, 6 unsolved
[2024-05-21 23:10:37] [INFO ] Deduced a trap composed of 17 places in 388 ms of which 2 ms to minimize.
[2024-05-21 23:10:37] [INFO ] Deduced a trap composed of 63 places in 251 ms of which 2 ms to minimize.
Problem AtomicPropp15 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/3273 variables, 2/426 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3273 variables, 0/426 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 108/3381 variables, 71/497 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3381 variables, 1/498 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3381 variables, 25/523 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3381 variables, 2/525 constraints. Problems are: Problem set: 7 solved, 5 unsolved
[2024-05-21 23:10:39] [INFO ] Deduced a trap composed of 7 places in 322 ms of which 10 ms to minimize.
[2024-05-21 23:10:39] [INFO ] Deduced a trap composed of 40 places in 304 ms of which 1 ms to minimize.
[2024-05-21 23:10:40] [INFO ] Deduced a trap composed of 10 places in 337 ms of which 1 ms to minimize.
Problem AtomicPropp14 is UNSAT
At refinement iteration 19 (INCLUDED_ONLY) 0/3381 variables, 3/528 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3381 variables, 0/528 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/3381 variables, 0/528 constraints. Problems are: Problem set: 8 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3381/3381 variables, and 528 constraints, problems are : Problem set: 8 solved, 4 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 258/258 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 6/12 constraints, Known Traps: 5/5 constraints]
After SMT, in 7596ms problems are : Problem set: 8 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2658 ms.
Support contains 6 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 3252/3252 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 257 transition count 3227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 257 transition count 3227
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 255 transition count 3232
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 255 transition count 3226
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 18 place count 249 transition count 3226
Applied a total of 18 rules in 237 ms. Remains 249 /258 variables (removed 9) and now considering 3226/3252 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 237 ms. Remains : 249/258 places, 3226/3252 transitions.
RANDOM walk for 40025 steps (8 resets) in 309 ms. (129 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 166 ms. (239 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 184 ms. (216 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 139578 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 4
Probabilistic random walk after 139578 steps, saw 54405 distinct states, run finished after 3004 ms. (steps per millisecond=46 ) properties seen :0
[2024-05-21 23:10:47] [INFO ] Flow matrix only has 3092 transitions (discarded 134 similar events)
// Phase 1: matrix 3092 rows 249 cols
[2024-05-21 23:10:47] [INFO ] Computed 8 invariants in 14 ms
[2024-05-21 23:10:47] [INFO ] State equation strengthened by 252 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 72/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1833/1911 variables, 78/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1911 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1911 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1297/3208 variables, 78/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3208 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3208 variables, 222/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3208 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/3210 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3210 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 131/3341 variables, 93/481 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3341 variables, 2/483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3341 variables, 26/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3341 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/3341 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3341/3341 variables, and 509 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1461 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 249/249 constraints, ReadFeed: 252/252 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 72/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1833/1911 variables, 78/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1911 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1911 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1297/3208 variables, 78/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3208 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3208 variables, 222/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3208 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:10:50] [INFO ] Deduced a trap composed of 30 places in 220 ms of which 2 ms to minimize.
Problem AtomicPropp3 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/3208 variables, 1/389 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3208 variables, 0/389 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/3210 variables, 1/390 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3210 variables, 0/390 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 131/3341 variables, 93/483 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3341 variables, 2/485 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3341 variables, 26/511 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3341 variables, 3/514 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-21 23:10:51] [INFO ] Deduced a trap composed of 37 places in 472 ms of which 1 ms to minimize.
[2024-05-21 23:10:51] [INFO ] Deduced a trap composed of 36 places in 429 ms of which 3 ms to minimize.
[2024-05-21 23:10:52] [INFO ] Deduced a trap composed of 39 places in 442 ms of which 2 ms to minimize.
[2024-05-21 23:10:52] [INFO ] Deduced a trap composed of 20 places in 407 ms of which 2 ms to minimize.
[2024-05-21 23:10:53] [INFO ] Deduced a trap composed of 13 places in 418 ms of which 2 ms to minimize.
[2024-05-21 23:10:53] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/3341 variables, 6/520 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3341 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/3341 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3341/3341 variables, and 520 constraints, problems are : Problem set: 1 solved, 3 unsolved in 5854 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 249/249 constraints, ReadFeed: 252/252 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
After SMT, in 7354ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 0 properties in 4329 ms.
Support contains 5 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 3226/3226 transitions.
Applied a total of 0 rules in 88 ms. Remains 249 /249 variables (removed 0) and now considering 3226/3226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 249/249 places, 3226/3226 transitions.
RANDOM walk for 40029 steps (8 resets) in 327 ms. (122 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 371 ms. (107 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 254 ms. (156 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 131482 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 3
Probabilistic random walk after 131482 steps, saw 49152 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
[2024-05-21 23:11:02] [INFO ] Flow matrix only has 3092 transitions (discarded 134 similar events)
[2024-05-21 23:11:02] [INFO ] Invariant cache hit.
[2024-05-21 23:11:02] [INFO ] State equation strengthened by 252 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 41/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1006/1052 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1052 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1052 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2065/3117 variables, 49/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3117 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3117 variables, 212/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3117 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/3119 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3119 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 220/3339 variables, 152/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3339 variables, 3/470 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3339 variables, 37/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3339 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/3341 variables, 2/509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3341 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/3341 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3341/3341 variables, and 509 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1453 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 249/249 constraints, ReadFeed: 252/252 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 41/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1006/1052 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1052 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1052 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2065/3117 variables, 49/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3117 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3117 variables, 212/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3117 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/3119 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3119 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 220/3339 variables, 152/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3339 variables, 3/470 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3339 variables, 37/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3339 variables, 3/510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:11:05] [INFO ] Deduced a trap composed of 31 places in 347 ms of which 1 ms to minimize.
[2024-05-21 23:11:05] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/3339 variables, 2/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3339 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/3341 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:11:06] [INFO ] Deduced a trap composed of 6 places in 264 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/3341 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3341 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/3341 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3341/3341 variables, and 515 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3553 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 249/249 constraints, ReadFeed: 252/252 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 5043ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2353 ms.
Support contains 5 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 3226/3226 transitions.
Applied a total of 0 rules in 54 ms. Remains 249 /249 variables (removed 0) and now considering 3226/3226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 249/249 places, 3226/3226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 3226/3226 transitions.
Applied a total of 0 rules in 59 ms. Remains 249 /249 variables (removed 0) and now considering 3226/3226 (removed 0) transitions.
[2024-05-21 23:11:09] [INFO ] Flow matrix only has 3092 transitions (discarded 134 similar events)
[2024-05-21 23:11:09] [INFO ] Invariant cache hit.
[2024-05-21 23:11:10] [INFO ] Implicit Places using invariants in 503 ms returned []
[2024-05-21 23:11:10] [INFO ] Flow matrix only has 3092 transitions (discarded 134 similar events)
[2024-05-21 23:11:10] [INFO ] Invariant cache hit.
[2024-05-21 23:11:10] [INFO ] State equation strengthened by 252 read => feed constraints.
[2024-05-21 23:11:12] [INFO ] Implicit Places using invariants and state equation in 1652 ms returned []
Implicit Place search using SMT with State Equation took 2162 ms to find 0 implicit places.
[2024-05-21 23:11:12] [INFO ] Redundant transitions in 213 ms returned []
Running 3225 sub problems to find dead transitions.
[2024-05-21 23:11:12] [INFO ] Flow matrix only has 3092 transitions (discarded 134 similar events)
[2024-05-21 23:11:12] [INFO ] Invariant cache hit.
[2024-05-21 23:11:12] [INFO ] State equation strengthened by 252 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3225 unsolved
[2024-05-21 23:12:23] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
[2024-05-21 23:12:23] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1648 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1653 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1669 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1673 is UNSAT
Problem TDEAD1674 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1676 is UNSAT
Problem TDEAD1677 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1684 is UNSAT
Problem TDEAD1685 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1687 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1690 is UNSAT
Problem TDEAD1691 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1695 is UNSAT
Problem TDEAD1696 is UNSAT
Problem TDEAD1697 is UNSAT
Problem TDEAD1698 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1703 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1706 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1846 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1848 is UNSAT
Problem TDEAD1849 is UNSAT
Problem TDEAD1850 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1852 is UNSAT
Problem TDEAD1853 is UNSAT
Problem TDEAD1854 is UNSAT
Problem TDEAD1855 is UNSAT
Problem TDEAD1856 is UNSAT
Problem TDEAD1857 is UNSAT
Problem TDEAD1858 is UNSAT
Problem TDEAD1859 is UNSAT
Problem TDEAD1860 is UNSAT
Problem TDEAD1861 is UNSAT
Problem TDEAD1862 is UNSAT
Problem TDEAD1863 is UNSAT
Problem TDEAD1864 is UNSAT
Problem TDEAD1865 is UNSAT
Problem TDEAD1866 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1868 is UNSAT
Problem TDEAD1869 is UNSAT
Problem TDEAD1870 is UNSAT
Problem TDEAD1871 is UNSAT
Problem TDEAD1872 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1874 is UNSAT
Problem TDEAD1875 is UNSAT
Problem TDEAD1876 is UNSAT
Problem TDEAD1877 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1879 is UNSAT
Problem TDEAD1880 is UNSAT
Problem TDEAD1881 is UNSAT
Problem TDEAD1882 is UNSAT
Problem TDEAD1883 is UNSAT
Problem TDEAD1884 is UNSAT
Problem TDEAD1885 is UNSAT
Problem TDEAD1886 is UNSAT
Problem TDEAD1887 is UNSAT
Problem TDEAD1888 is UNSAT
Problem TDEAD1889 is UNSAT
Problem TDEAD1890 is UNSAT
Problem TDEAD1891 is UNSAT
Problem TDEAD1892 is UNSAT
Problem TDEAD1893 is UNSAT
Problem TDEAD1894 is UNSAT
Problem TDEAD1895 is UNSAT
Problem TDEAD1896 is UNSAT
Problem TDEAD1897 is UNSAT
Problem TDEAD1898 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1901 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1903 is UNSAT
Problem TDEAD1904 is UNSAT
Problem TDEAD1905 is UNSAT
Problem TDEAD1906 is UNSAT
Problem TDEAD1907 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1910 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1912 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1914 is UNSAT
Problem TDEAD1915 is UNSAT
Problem TDEAD1916 is UNSAT
Problem TDEAD1917 is UNSAT
Problem TDEAD1918 is UNSAT
Problem TDEAD1919 is UNSAT
Problem TDEAD1920 is UNSAT
Problem TDEAD1921 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1923 is UNSAT
Problem TDEAD1924 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1926 is UNSAT
Problem TDEAD1927 is UNSAT
Problem TDEAD1928 is UNSAT
Problem TDEAD1929 is UNSAT
Problem TDEAD1930 is UNSAT
Problem TDEAD1931 is UNSAT
Problem TDEAD1932 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1934 is UNSAT
Problem TDEAD1935 is UNSAT
Problem TDEAD1936 is UNSAT
Problem TDEAD1937 is UNSAT
Problem TDEAD1938 is UNSAT
Problem TDEAD1939 is UNSAT
Problem TDEAD1940 is UNSAT
Problem TDEAD1941 is UNSAT
Problem TDEAD1942 is UNSAT
Problem TDEAD1943 is UNSAT
Problem TDEAD1944 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1946 is UNSAT
Problem TDEAD1947 is UNSAT
Problem TDEAD1948 is UNSAT
Problem TDEAD1949 is UNSAT
Problem TDEAD1950 is UNSAT
Problem TDEAD1951 is UNSAT
Problem TDEAD1952 is UNSAT
Problem TDEAD1953 is UNSAT
Problem TDEAD1954 is UNSAT
Problem TDEAD1955 is UNSAT
Problem TDEAD1956 is UNSAT
Problem TDEAD1957 is UNSAT
Problem TDEAD1958 is UNSAT
Problem TDEAD1959 is UNSAT
Problem TDEAD1960 is UNSAT
Problem TDEAD1961 is UNSAT
Problem TDEAD1962 is UNSAT
Problem TDEAD1963 is UNSAT
Problem TDEAD1964 is UNSAT
Problem TDEAD1965 is UNSAT
Problem TDEAD1966 is UNSAT
Problem TDEAD1967 is UNSAT
Problem TDEAD1968 is UNSAT
Problem TDEAD1969 is UNSAT
Problem TDEAD1970 is UNSAT
Problem TDEAD1971 is UNSAT
Problem TDEAD1972 is UNSAT
Problem TDEAD1973 is UNSAT
Problem TDEAD1974 is UNSAT
Problem TDEAD1975 is UNSAT
Problem TDEAD1976 is UNSAT
Problem TDEAD1977 is UNSAT
Problem TDEAD1978 is UNSAT
Problem TDEAD1979 is UNSAT
Problem TDEAD1980 is UNSAT
Problem TDEAD1981 is UNSAT
Problem TDEAD1982 is UNSAT
Problem TDEAD1983 is UNSAT
Problem TDEAD1984 is UNSAT
Problem TDEAD1985 is UNSAT
Problem TDEAD1986 is UNSAT
Problem TDEAD1987 is UNSAT
Problem TDEAD1988 is UNSAT
Problem TDEAD1989 is UNSAT
Problem TDEAD1990 is UNSAT
Problem TDEAD1991 is UNSAT
Problem TDEAD1992 is UNSAT
Problem TDEAD1993 is UNSAT
Problem TDEAD1994 is UNSAT
Problem TDEAD1995 is UNSAT
Problem TDEAD1996 is UNSAT
Problem TDEAD1997 is UNSAT
Problem TDEAD1998 is UNSAT
Problem TDEAD1999 is UNSAT
Problem TDEAD2000 is UNSAT
Problem TDEAD2001 is UNSAT
Problem TDEAD2002 is UNSAT
Problem TDEAD2003 is UNSAT
Problem TDEAD2004 is UNSAT
Problem TDEAD2005 is UNSAT
Problem TDEAD2006 is UNSAT
Problem TDEAD2007 is UNSAT
Problem TDEAD2008 is UNSAT
Problem TDEAD2009 is UNSAT
Problem TDEAD2010 is UNSAT
Problem TDEAD2011 is UNSAT
Problem TDEAD2012 is UNSAT
Problem TDEAD2013 is UNSAT
Problem TDEAD2014 is UNSAT
Problem TDEAD2015 is UNSAT
Problem TDEAD2016 is UNSAT
Problem TDEAD2017 is UNSAT
Problem TDEAD2018 is UNSAT
Problem TDEAD2019 is UNSAT
Problem TDEAD2020 is UNSAT
Problem TDEAD2021 is UNSAT
Problem TDEAD2022 is UNSAT
Problem TDEAD2023 is UNSAT
Problem TDEAD2024 is UNSAT
Problem TDEAD2025 is UNSAT
Problem TDEAD2026 is UNSAT
Problem TDEAD2027 is UNSAT
Problem TDEAD2028 is UNSAT
Problem TDEAD2029 is UNSAT
Problem TDEAD2030 is UNSAT
Problem TDEAD2031 is UNSAT
Problem TDEAD2032 is UNSAT
Problem TDEAD2033 is UNSAT
Problem TDEAD2034 is UNSAT
Problem TDEAD2035 is UNSAT
Problem TDEAD2036 is UNSAT
Problem TDEAD2037 is UNSAT
Problem TDEAD2038 is UNSAT
Problem TDEAD2039 is UNSAT
Problem TDEAD2040 is UNSAT
Problem TDEAD2041 is UNSAT
Problem TDEAD2042 is UNSAT
Problem TDEAD2043 is UNSAT
Problem TDEAD2044 is UNSAT
Problem TDEAD2045 is UNSAT
Problem TDEAD2046 is UNSAT
Problem TDEAD2047 is UNSAT
Problem TDEAD2048 is UNSAT
Problem TDEAD2049 is UNSAT
Problem TDEAD2050 is UNSAT
Problem TDEAD2051 is UNSAT
Problem TDEAD2052 is UNSAT
Problem TDEAD2053 is UNSAT
Problem TDEAD2054 is UNSAT
Problem TDEAD2055 is UNSAT
Problem TDEAD2056 is UNSAT
Problem TDEAD2057 is UNSAT
Problem TDEAD2058 is UNSAT
Problem TDEAD2059 is UNSAT
Problem TDEAD2060 is UNSAT
Problem TDEAD2061 is UNSAT
Problem TDEAD2062 is UNSAT
Problem TDEAD2063 is UNSAT
Problem TDEAD2064 is UNSAT
Problem TDEAD2065 is UNSAT
Problem TDEAD2066 is UNSAT
Problem TDEAD2067 is UNSAT
Problem TDEAD2068 is UNSAT
Problem TDEAD2069 is UNSAT
Problem TDEAD2070 is UNSAT
Problem TDEAD2071 is UNSAT
Problem TDEAD2072 is UNSAT
Problem TDEAD2073 is UNSAT
Problem TDEAD2074 is UNSAT
Problem TDEAD2075 is UNSAT
Problem TDEAD2076 is UNSAT
Problem TDEAD2077 is UNSAT
Problem TDEAD2078 is UNSAT
Problem TDEAD2079 is UNSAT
Problem TDEAD2080 is UNSAT
Problem TDEAD2081 is UNSAT
Problem TDEAD2082 is UNSAT
Problem TDEAD2083 is UNSAT
Problem TDEAD2084 is UNSAT
Problem TDEAD2085 is UNSAT
Problem TDEAD2086 is UNSAT
Problem TDEAD2087 is UNSAT
Problem TDEAD2088 is UNSAT
Problem TDEAD2089 is UNSAT
Problem TDEAD2090 is UNSAT
Problem TDEAD2091 is UNSAT
Problem TDEAD2092 is UNSAT
Problem TDEAD2093 is UNSAT
Problem TDEAD2094 is UNSAT
Problem TDEAD2095 is UNSAT
Problem TDEAD2096 is UNSAT
Problem TDEAD2097 is UNSAT
Problem TDEAD2098 is UNSAT
Problem TDEAD2099 is UNSAT
Problem TDEAD2100 is UNSAT
Problem TDEAD2101 is UNSAT
Problem TDEAD2102 is UNSAT
Problem TDEAD2103 is UNSAT
Problem TDEAD2104 is UNSAT
Problem TDEAD2105 is UNSAT
Problem TDEAD2106 is UNSAT
Problem TDEAD2107 is UNSAT
Problem TDEAD2108 is UNSAT
Problem TDEAD2109 is UNSAT
Problem TDEAD2110 is UNSAT
Problem TDEAD2111 is UNSAT
Problem TDEAD2112 is UNSAT
Problem TDEAD2113 is UNSAT
Problem TDEAD2114 is UNSAT
Problem TDEAD2115 is UNSAT
Problem TDEAD2116 is UNSAT
Problem TDEAD2117 is UNSAT
Problem TDEAD2118 is UNSAT
Problem TDEAD2119 is UNSAT
Problem TDEAD2120 is UNSAT
Problem TDEAD2121 is UNSAT
Problem TDEAD2122 is UNSAT
Problem TDEAD2123 is UNSAT
Problem TDEAD2124 is UNSAT
Problem TDEAD2125 is UNSAT
Problem TDEAD2126 is UNSAT
Problem TDEAD2127 is UNSAT
Problem TDEAD2128 is UNSAT
Problem TDEAD2129 is UNSAT
Problem TDEAD2130 is UNSAT
Problem TDEAD2131 is UNSAT
Problem TDEAD2132 is UNSAT
Problem TDEAD2133 is UNSAT
Problem TDEAD2134 is UNSAT
Problem TDEAD2135 is UNSAT
Problem TDEAD2136 is UNSAT
Problem TDEAD2137 is UNSAT
Problem TDEAD2138 is UNSAT
Problem TDEAD2139 is UNSAT
Problem TDEAD2140 is UNSAT
[2024-05-21 23:12:27] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 13 ms to minimize.
Problem TDEAD2384 is UNSAT
Problem TDEAD2385 is UNSAT
Problem TDEAD2386 is UNSAT
Problem TDEAD2387 is UNSAT
Problem TDEAD2388 is UNSAT
Problem TDEAD2389 is UNSAT
Problem TDEAD2390 is UNSAT
Problem TDEAD2391 is UNSAT
Problem TDEAD2392 is UNSAT
Problem TDEAD2393 is UNSAT
Problem TDEAD2394 is UNSAT
Problem TDEAD2395 is UNSAT
Problem TDEAD2396 is UNSAT
Problem TDEAD2397 is UNSAT
Problem TDEAD2398 is UNSAT
Problem TDEAD2399 is UNSAT
Problem TDEAD2400 is UNSAT
Problem TDEAD2401 is UNSAT
Problem TDEAD2402 is UNSAT
Problem TDEAD2403 is UNSAT
Problem TDEAD2404 is UNSAT
Problem TDEAD2405 is UNSAT
Problem TDEAD2406 is UNSAT
Problem TDEAD2407 is UNSAT
Problem TDEAD2408 is UNSAT
Problem TDEAD2409 is UNSAT
Problem TDEAD2410 is UNSAT
Problem TDEAD2411 is UNSAT
Problem TDEAD2412 is UNSAT
Problem TDEAD2413 is UNSAT
Problem TDEAD2414 is UNSAT
Problem TDEAD2415 is UNSAT
Problem TDEAD2416 is UNSAT
Problem TDEAD2417 is UNSAT
Problem TDEAD2418 is UNSAT
Problem TDEAD2419 is UNSAT
Problem TDEAD2420 is UNSAT
Problem TDEAD2421 is UNSAT
Problem TDEAD2422 is UNSAT
Problem TDEAD2423 is UNSAT
Problem TDEAD2424 is UNSAT
Problem TDEAD2425 is UNSAT
Problem TDEAD2426 is UNSAT
Problem TDEAD2427 is UNSAT
Problem TDEAD2428 is UNSAT
Problem TDEAD2429 is UNSAT
Problem TDEAD2430 is UNSAT
Problem TDEAD2431 is UNSAT
Problem TDEAD2432 is UNSAT
Problem TDEAD2433 is UNSAT
Problem TDEAD2434 is UNSAT
Problem TDEAD2435 is UNSAT
Problem TDEAD2436 is UNSAT
Problem TDEAD2437 is UNSAT
Problem TDEAD2441 is UNSAT
Problem TDEAD2442 is UNSAT
Problem TDEAD2443 is UNSAT
Problem TDEAD2444 is UNSAT
Problem TDEAD2450 is UNSAT
Problem TDEAD2451 is UNSAT
Problem TDEAD2452 is UNSAT
Problem TDEAD2453 is UNSAT
Problem TDEAD2454 is UNSAT
Problem TDEAD2455 is UNSAT
Problem TDEAD2456 is UNSAT
Problem TDEAD2457 is UNSAT
Problem TDEAD2458 is UNSAT
Problem TDEAD2459 is UNSAT
Problem TDEAD2460 is UNSAT
Problem TDEAD2470 is UNSAT
Problem TDEAD2471 is UNSAT
Problem TDEAD2473 is UNSAT
Problem TDEAD2474 is UNSAT
Problem TDEAD2475 is UNSAT
Problem TDEAD2476 is UNSAT
Problem TDEAD2482 is UNSAT
Problem TDEAD2483 is UNSAT
Problem TDEAD2484 is UNSAT
Problem TDEAD2485 is UNSAT
Problem TDEAD2486 is UNSAT
Problem TDEAD2487 is UNSAT
Problem TDEAD2488 is UNSAT
Problem TDEAD2489 is UNSAT
Problem TDEAD2490 is UNSAT
Problem TDEAD2491 is UNSAT
Problem TDEAD2492 is UNSAT
Problem TDEAD2502 is UNSAT
Problem TDEAD2503 is UNSAT
Problem TDEAD2505 is UNSAT
Problem TDEAD2506 is UNSAT
Problem TDEAD2507 is UNSAT
Problem TDEAD2508 is UNSAT
Problem TDEAD2514 is UNSAT
Problem TDEAD2515 is UNSAT
Problem TDEAD2516 is UNSAT
Problem TDEAD2517 is UNSAT
Problem TDEAD2518 is UNSAT
Problem TDEAD2519 is UNSAT
Problem TDEAD2520 is UNSAT
Problem TDEAD2521 is UNSAT
Problem TDEAD2522 is UNSAT
Problem TDEAD2523 is UNSAT
Problem TDEAD2524 is UNSAT
Problem TDEAD2534 is UNSAT
Problem TDEAD2535 is UNSAT
Problem TDEAD2537 is UNSAT
Problem TDEAD2538 is UNSAT
Problem TDEAD2539 is UNSAT
Problem TDEAD2540 is UNSAT
Problem TDEAD2546 is UNSAT
Problem TDEAD2547 is UNSAT
Problem TDEAD2548 is UNSAT
Problem TDEAD2549 is UNSAT
Problem TDEAD2550 is UNSAT
Problem TDEAD2551 is UNSAT
Problem TDEAD2552 is UNSAT
Problem TDEAD2553 is UNSAT
Problem TDEAD2554 is UNSAT
Problem TDEAD2555 is UNSAT
Problem TDEAD2556 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 249/3341 variables, and 11 constraints, problems are : Problem set: 544 solved, 2681 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/249 constraints, ReadFeed: 0/252 constraints, PredecessorRefiner: 3225/3225 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 544 solved, 2681 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 7/7 constraints. Problems are: Problem set: 544 solved, 2681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 3/10 constraints. Problems are: Problem set: 544 solved, 2681 unsolved
[2024-05-21 23:12:46] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
Problem TDEAD3190 is UNSAT
Problem TDEAD3201 is UNSAT
Problem TDEAD3202 is UNSAT
Problem TDEAD3212 is UNSAT
Problem TDEAD3223 is UNSAT
Problem TDEAD3224 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/11 constraints. Problems are: Problem set: 550 solved, 2675 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 234/3341 variables, and 11 constraints, problems are : Problem set: 550 solved, 2675 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 7/8 constraints, State Equation: 0/249 constraints, ReadFeed: 0/252 constraints, PredecessorRefiner: 0/3225 constraints, Known Traps: 4/4 constraints]
After SMT, in 107008ms problems are : Problem set: 550 solved, 2675 unsolved
Search for dead transitions found 550 dead transitions in 107046ms
Found 550 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 550 transitions
Dead transitions reduction (with SMT) removed 550 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 249/249 places, 2676/3226 transitions.
Graph (complete) has 3250 edges and 249 vertex of which 235 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.4 ms
Discarding 14 places :
Also discarding 0 output transitions
Reduce places removed 26 places and 625 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 209 transition count 2051
Reduce places removed 16 places and 291 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 43 place count 193 transition count 1760
Reduce places removed 7 places and 148 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 50 place count 186 transition count 1612
Reduce places removed 6 places and 79 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 56 place count 180 transition count 1533
Reduce places removed 2 places and 52 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 58 place count 178 transition count 1481
Reduce places removed 1 places and 19 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 59 place count 177 transition count 1462
Reduce places removed 1 places and 21 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 60 place count 176 transition count 1441
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 69 place count 167 transition count 1313
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 7 with 9 rules applied. Total rules applied 78 place count 167 transition count 1313
Deduced a syphon composed of 3 places in 1 ms
Applied a total of 78 rules in 96 ms. Remains 167 /249 variables (removed 82) and now considering 1313/2676 (removed 1363) transitions.
[2024-05-21 23:12:59] [INFO ] Flow matrix only has 1222 transitions (discarded 91 similar events)
// Phase 1: matrix 1222 rows 167 cols
[2024-05-21 23:12:59] [INFO ] Computed 10 invariants in 6 ms
[2024-05-21 23:12:59] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-21 23:12:59] [INFO ] Flow matrix only has 1222 transitions (discarded 91 similar events)
[2024-05-21 23:12:59] [INFO ] Invariant cache hit.
[2024-05-21 23:12:59] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-21 23:13:00] [INFO ] Implicit Places using invariants and state equation in 716 ms returned []
Implicit Place search using SMT with State Equation took 1016 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 167/249 places, 1313/3226 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 110616 ms. Remains : 167/249 places, 1313/3226 transitions.
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Successfully simplified 10 atomic propositions for a total of 7 simplifications.
FORMULA BugTracking-PT-q8m016-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:13:00] [INFO ] Flatten gal took : 139 ms
[2024-05-21 23:13:00] [INFO ] Flatten gal took : 150 ms
[2024-05-21 23:13:01] [INFO ] Input system was already deterministic with 3252 transitions.
Support contains 3 out of 258 places (down from 5) after GAL structural reductions.
Computed a total of 5 stabilizing places and 108 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 3252/3252 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 257 transition count 3227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 257 transition count 3227
Applied a total of 2 rules in 32 ms. Remains 257 /258 variables (removed 1) and now considering 3227/3252 (removed 25) transitions.
[2024-05-21 23:13:01] [INFO ] Flow matrix only has 3100 transitions (discarded 127 similar events)
// Phase 1: matrix 3100 rows 257 cols
[2024-05-21 23:13:01] [INFO ] Computed 8 invariants in 13 ms
[2024-05-21 23:13:01] [INFO ] Implicit Places using invariants in 628 ms returned []
[2024-05-21 23:13:01] [INFO ] Flow matrix only has 3100 transitions (discarded 127 similar events)
[2024-05-21 23:13:01] [INFO ] Invariant cache hit.
[2024-05-21 23:13:02] [INFO ] State equation strengthened by 251 read => feed constraints.
[2024-05-21 23:13:03] [INFO ] Implicit Places using invariants and state equation in 1573 ms returned []
Implicit Place search using SMT with State Equation took 2206 ms to find 0 implicit places.
Running 3225 sub problems to find dead transitions.
[2024-05-21 23:13:03] [INFO ] Flow matrix only has 3100 transitions (discarded 127 similar events)
[2024-05-21 23:13:03] [INFO ] Invariant cache hit.
[2024-05-21 23:13:03] [INFO ] State equation strengthened by 251 read => feed constraints.

BK_STOP 1716333190832

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="BugTracking-PT-q8m016"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BugTracking-PT-q8m016, 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 r048-tajo-171620399400409"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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