fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r536-tall-171690533300873
Last Updated
July 7, 2024

About the Execution of LTSMin+red for Szymanski-PT-b06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
14863.191 279303.00 362509.00 779.80 ??F????TT?TT?FFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 15:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 11 15:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.7M 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 Szymanski-PT-b06-CTLCardinality-2024-00
FORMULA_NAME Szymanski-PT-b06-CTLCardinality-2024-01
FORMULA_NAME Szymanski-PT-b06-CTLCardinality-2024-02
FORMULA_NAME Szymanski-PT-b06-CTLCardinality-2024-03
FORMULA_NAME Szymanski-PT-b06-CTLCardinality-2024-04
FORMULA_NAME Szymanski-PT-b06-CTLCardinality-2024-05
FORMULA_NAME Szymanski-PT-b06-CTLCardinality-2024-06
FORMULA_NAME Szymanski-PT-b06-CTLCardinality-2024-07
FORMULA_NAME Szymanski-PT-b06-CTLCardinality-2024-08
FORMULA_NAME Szymanski-PT-b06-CTLCardinality-2024-09
FORMULA_NAME Szymanski-PT-b06-CTLCardinality-2024-10
FORMULA_NAME Szymanski-PT-b06-CTLCardinality-2024-11
FORMULA_NAME Szymanski-PT-b06-CTLCardinality-2023-12
FORMULA_NAME Szymanski-PT-b06-CTLCardinality-2023-13
FORMULA_NAME Szymanski-PT-b06-CTLCardinality-2023-14
FORMULA_NAME Szymanski-PT-b06-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717283010010

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 23:03:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 23:03:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 23:03:31] [INFO ] Load time of PNML (sax parser for PT used): 466 ms
[2024-06-01 23:03:31] [INFO ] Transformed 568 places.
[2024-06-01 23:03:31] [INFO ] Transformed 8320 transitions.
[2024-06-01 23:03:31] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 608 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Deduced a syphon composed of 260 places in 19 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b06-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 306 transition count 8064
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 305 transition count 7936
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 305 transition count 7936
Applied a total of 4 rules in 192 ms. Remains 305 /308 variables (removed 3) and now considering 7936/8064 (removed 128) transitions.
[2024-06-01 23:03:32] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-06-01 23:03:32] [INFO ] Computed 1 invariants in 63 ms
[2024-06-01 23:03:32] [INFO ] Implicit Places using invariants in 664 ms returned []
[2024-06-01 23:03:32] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:03:32] [INFO ] Invariant cache hit.
[2024-06-01 23:03:33] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:04:01] [INFO ] Implicit Places using invariants and state equation in 28466 ms returned []
Implicit Place search using SMT with State Equation took 29174 ms to find 0 implicit places.
Running 7934 sub problems to find dead transitions.
[2024-06-01 23:04:01] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:04:01] [INFO ] Invariant cache hit.
[2024-06-01 23:04:01] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30179 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30087 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints]
After SMT, in 85740ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 85842ms
Starting structural reductions in LTL mode, iteration 1 : 305/308 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115269 ms. Remains : 305/308 places, 7936/8064 transitions.
Support contains 43 out of 305 places after structural reductions.
[2024-06-01 23:05:27] [INFO ] Flatten gal took : 439 ms
[2024-06-01 23:05:27] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Szymanski-PT-b06-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 23:05:28] [INFO ] Flatten gal took : 304 ms
[2024-06-01 23:05:28] [INFO ] Input system was already deterministic with 7936 transitions.
Support contains 33 out of 305 places (down from 43) after GAL structural reductions.
RANDOM walk for 40007 steps (8 resets) in 1966 ms. (20 steps per ms) remains 17/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
[2024-06-01 23:05:29] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-06-01 23:05:29] [INFO ] Invariant cache hit.
[2024-06-01 23:05:29] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 285/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3037 variables, 147/453 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 10 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 10 solved, 5 unsolved in 1126 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 299/305 variables, 1/1 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3037 variables, 147/453 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3037 variables, 5/458 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3037 variables, 0/458 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/3037 variables, 0/458 constraints. Problems are: Problem set: 10 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3037/3037 variables, and 458 constraints, problems are : Problem set: 10 solved, 5 unsolved in 4405 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 5/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 5577ms problems are : Problem set: 10 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1219 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 305 transition count 7808
Applied a total of 128 rules in 417 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7936 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 418 ms. Remains : 305/305 places, 7808/7936 transitions.
RANDOM walk for 40012 steps (8 resets) in 180 ms. (221 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 91 ms. (434 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
[2024-06-01 23:05:36] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-06-01 23:05:36] [INFO ] Computed 3 invariants in 27 ms
[2024-06-01 23:05:37] [INFO ] State equation strengthened by 147 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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 281/286 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 19/305 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2604/2909 variables, 305/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2909 variables, 147/455 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2909 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/2909 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 455 constraints, problems are : Problem set: 0 solved, 4 unsolved in 933 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 281/286 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 23:05:38] [INFO ] Deduced a trap composed of 75 places in 480 ms of which 20 ms to minimize.
[2024-06-01 23:05:38] [INFO ] Deduced a trap composed of 129 places in 416 ms of which 3 ms to minimize.
[2024-06-01 23:05:39] [INFO ] Deduced a trap composed of 129 places in 392 ms of which 2 ms to minimize.
[2024-06-01 23:05:39] [INFO ] Deduced a trap composed of 31 places in 415 ms of which 16 ms to minimize.
[2024-06-01 23:05:40] [INFO ] Deduced a trap composed of 89 places in 435 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 23:05:40] [INFO ] Deduced a trap composed of 138 places in 366 ms of which 13 ms to minimize.
[2024-06-01 23:05:41] [INFO ] Deduced a trap composed of 58 places in 326 ms of which 2 ms to minimize.
[2024-06-01 23:05:41] [INFO ] Deduced a trap composed of 103 places in 374 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 19/305 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2604/2909 variables, 305/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2909 variables, 147/463 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 4/467 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 23:05:49] [INFO ] Deduced a trap composed of 119 places in 528 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/2909 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 23:05:50] [INFO ] Deduced a trap composed of 81 places in 517 ms of which 2 ms to minimize.
[2024-06-01 23:05:51] [INFO ] Deduced a trap composed of 114 places in 521 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 2/470 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 23:05:51] [INFO ] Deduced a trap composed of 134 places in 246 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2909 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2909 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/2909 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 471 constraints, problems are : Problem set: 0 solved, 4 unsolved in 14915 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 12/12 constraints]
After SMT, in 15909ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 5 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 205 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40009 steps (8 resets) in 236 ms. (168 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 105 ms. (377 steps per ms) remains 3/3 properties
[2024-06-01 23:05:53] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:05:53] [INFO ] Invariant cache hit.
[2024-06-01 23:05:53] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 252/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 19/305 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2604/2909 variables, 305/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2909 variables, 147/455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/2909 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 455 constraints, problems are : Problem set: 0 solved, 3 unsolved in 797 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 252/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 23:05:54] [INFO ] Deduced a trap composed of 75 places in 457 ms of which 2 ms to minimize.
[2024-06-01 23:05:55] [INFO ] Deduced a trap composed of 131 places in 449 ms of which 2 ms to minimize.
[2024-06-01 23:05:55] [INFO ] Deduced a trap composed of 78 places in 459 ms of which 4 ms to minimize.
[2024-06-01 23:05:56] [INFO ] Deduced a trap composed of 137 places in 451 ms of which 2 ms to minimize.
[2024-06-01 23:05:56] [INFO ] Deduced a trap composed of 130 places in 405 ms of which 2 ms to minimize.
[2024-06-01 23:05:56] [INFO ] Deduced a trap composed of 103 places in 416 ms of which 2 ms to minimize.
[2024-06-01 23:05:57] [INFO ] Deduced a trap composed of 134 places in 259 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2604/2909 variables, 305/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 147/462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 3/465 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/2909 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 465 constraints, problems are : Problem set: 0 solved, 3 unsolved in 7258 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 7/7 constraints]
After SMT, in 8085ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 921 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 322 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 322 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40006 steps (8 resets) in 170 ms. (233 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 142366 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 3
Probabilistic random walk after 142366 steps, saw 73841 distinct states, run finished after 3004 ms. (steps per millisecond=47 ) properties seen :0
[2024-06-01 23:06:05] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:06:05] [INFO ] Invariant cache hit.
[2024-06-01 23:06:05] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 252/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 19/305 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2604/2909 variables, 305/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2909 variables, 147/455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/2909 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 455 constraints, problems are : Problem set: 0 solved, 3 unsolved in 773 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 252/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 23:06:07] [INFO ] Deduced a trap composed of 75 places in 418 ms of which 2 ms to minimize.
[2024-06-01 23:06:07] [INFO ] Deduced a trap composed of 131 places in 456 ms of which 2 ms to minimize.
[2024-06-01 23:06:08] [INFO ] Deduced a trap composed of 78 places in 442 ms of which 2 ms to minimize.
[2024-06-01 23:06:08] [INFO ] Deduced a trap composed of 137 places in 426 ms of which 2 ms to minimize.
[2024-06-01 23:06:08] [INFO ] Deduced a trap composed of 130 places in 440 ms of which 2 ms to minimize.
[2024-06-01 23:06:09] [INFO ] Deduced a trap composed of 103 places in 410 ms of which 2 ms to minimize.
[2024-06-01 23:06:09] [INFO ] Deduced a trap composed of 134 places in 254 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2604/2909 variables, 305/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 147/462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 3/465 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/2909 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 465 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6960 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 7/7 constraints]
After SMT, in 7761ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 812 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 182 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 180 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-06-01 23:06:14] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:06:14] [INFO ] Invariant cache hit.
[2024-06-01 23:06:15] [INFO ] Implicit Places using invariants in 623 ms returned []
[2024-06-01 23:06:15] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:06:15] [INFO ] Invariant cache hit.
[2024-06-01 23:06:15] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:06:30] [INFO ] Implicit Places using invariants and state equation in 15631 ms returned []
Implicit Place search using SMT with State Equation took 16256 ms to find 0 implicit places.
[2024-06-01 23:06:31] [INFO ] Redundant transitions in 889 ms returned []
Running 7806 sub problems to find dead transitions.
[2024-06-01 23:06:31] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:06:31] [INFO ] Invariant cache hit.
[2024-06-01 23:06:31] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30119 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7806/7806 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7806 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-06-01 23:07:34] [INFO ] Deduced a trap composed of 138 places in 373 ms of which 2 ms to minimize.
[2024-06-01 23:07:35] [INFO ] Deduced a trap composed of 36 places in 389 ms of which 2 ms to minimize.
[2024-06-01 23:07:36] [INFO ] Deduced a trap composed of 49 places in 371 ms of which 2 ms to minimize.
[2024-06-01 23:07:36] [INFO ] Deduced a trap composed of 42 places in 298 ms of which 1 ms to minimize.
[2024-06-01 23:07:36] [INFO ] Deduced a trap composed of 42 places in 298 ms of which 2 ms to minimize.
[2024-06-01 23:07:37] [INFO ] Deduced a trap composed of 42 places in 294 ms of which 2 ms to minimize.
[2024-06-01 23:07:37] [INFO ] Deduced a trap composed of 47 places in 263 ms of which 2 ms to minimize.
[2024-06-01 23:07:38] [INFO ] Deduced a trap composed of 57 places in 388 ms of which 2 ms to minimize.
[2024-06-01 23:07:38] [INFO ] Deduced a trap composed of 57 places in 404 ms of which 4 ms to minimize.
[2024-06-01 23:07:38] [INFO ] Deduced a trap composed of 62 places in 398 ms of which 2 ms to minimize.
[2024-06-01 23:07:39] [INFO ] Deduced a trap composed of 70 places in 404 ms of which 2 ms to minimize.
[2024-06-01 23:07:39] [INFO ] Deduced a trap composed of 75 places in 361 ms of which 2 ms to minimize.
[2024-06-01 23:07:40] [INFO ] Deduced a trap composed of 102 places in 408 ms of which 2 ms to minimize.
[2024-06-01 23:07:40] [INFO ] Deduced a trap composed of 72 places in 269 ms of which 5 ms to minimize.
[2024-06-01 23:07:40] [INFO ] Deduced a trap composed of 101 places in 379 ms of which 2 ms to minimize.
[2024-06-01 23:07:41] [INFO ] Deduced a trap composed of 114 places in 364 ms of which 2 ms to minimize.
[2024-06-01 23:07:41] [INFO ] Deduced a trap composed of 78 places in 300 ms of which 1 ms to minimize.
[2024-06-01 23:07:42] [INFO ] Deduced a trap composed of 134 places in 265 ms of which 2 ms to minimize.
[2024-06-01 23:07:42] [INFO ] Deduced a trap composed of 137 places in 276 ms of which 2 ms to minimize.
[2024-06-01 23:07:42] [INFO ] Deduced a trap composed of 195 places in 232 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-06-01 23:07:47] [INFO ] Deduced a trap composed of 111 places in 339 ms of which 1 ms to minimize.
[2024-06-01 23:07:50] [INFO ] Deduced a trap composed of 195 places in 453 ms of which 2 ms to minimize.
[2024-06-01 23:07:50] [INFO ] Deduced a trap composed of 204 places in 421 ms of which 2 ms to minimize.
[2024-06-01 23:07:51] [INFO ] Deduced a trap composed of 209 places in 427 ms of which 2 ms to minimize.
[2024-06-01 23:07:51] [INFO ] Deduced a trap composed of 116 places in 441 ms of which 2 ms to minimize.
[2024-06-01 23:07:52] [INFO ] Deduced a trap composed of 136 places in 421 ms of which 2 ms to minimize.
[2024-06-01 23:07:52] [INFO ] Deduced a trap composed of 139 places in 420 ms of which 2 ms to minimize.
[2024-06-01 23:07:53] [INFO ] Deduced a trap composed of 208 places in 364 ms of which 2 ms to minimize.
[2024-06-01 23:07:54] [INFO ] Deduced a trap composed of 116 places in 307 ms of which 2 ms to minimize.
[2024-06-01 23:07:55] [INFO ] Deduced a trap composed of 146 places in 301 ms of which 1 ms to minimize.
[2024-06-01 23:07:55] [INFO ] Deduced a trap composed of 209 places in 305 ms of which 4 ms to minimize.
[2024-06-01 23:07:56] [INFO ] Deduced a trap composed of 208 places in 308 ms of which 1 ms to minimize.
[2024-06-01 23:07:56] [INFO ] Deduced a trap composed of 144 places in 211 ms of which 2 ms to minimize.
[2024-06-01 23:07:58] [INFO ] Deduced a trap composed of 64 places in 309 ms of which 2 ms to minimize.
[2024-06-01 23:07:59] [INFO ] Deduced a trap composed of 77 places in 370 ms of which 2 ms to minimize.
[2024-06-01 23:07:59] [INFO ] Deduced a trap composed of 72 places in 364 ms of which 2 ms to minimize.
[2024-06-01 23:07:59] [INFO ] Deduced a trap composed of 85 places in 347 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/2909 variables, and 40 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30095 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7806 constraints, Known Traps: 37/37 constraints]
After SMT, in 88780ms problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 88846ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106192 ms. Remains : 305/305 places, 7808/7808 transitions.
Successfully simplified 10 atomic propositions for a total of 9 simplifications.
[2024-06-01 23:08:00] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-01 23:08:00] [INFO ] Flatten gal took : 232 ms
FORMULA Szymanski-PT-b06-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 23:08:01] [INFO ] Flatten gal took : 225 ms
[2024-06-01 23:08:01] [INFO ] Input system was already deterministic with 7936 transitions.
Support contains 16 out of 305 places (down from 18) after GAL structural reductions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 46 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 305/305 places, 7936/7936 transitions.
[2024-06-01 23:08:02] [INFO ] Flatten gal took : 197 ms
[2024-06-01 23:08:02] [INFO ] Flatten gal took : 223 ms
[2024-06-01 23:08:02] [INFO ] Input system was already deterministic with 7936 transitions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 32 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 305/305 places, 7936/7936 transitions.
[2024-06-01 23:08:02] [INFO ] Flatten gal took : 171 ms
[2024-06-01 23:08:03] [INFO ] Flatten gal took : 196 ms
[2024-06-01 23:08:03] [INFO ] Input system was already deterministic with 7936 transitions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 31 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 305/305 places, 7936/7936 transitions.
[2024-06-01 23:08:03] [INFO ] Flatten gal took : 170 ms
[2024-06-01 23:08:03] [INFO ] Flatten gal took : 198 ms
[2024-06-01 23:08:04] [INFO ] Input system was already deterministic with 7936 transitions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 32 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 305/305 places, 7936/7936 transitions.
[2024-06-01 23:08:04] [INFO ] Flatten gal took : 172 ms
[2024-06-01 23:08:04] [INFO ] Flatten gal took : 194 ms
[2024-06-01 23:08:04] [INFO ] Input system was already deterministic with 7936 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 510 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 510 ms. Remains : 305/305 places, 7936/7936 transitions.
[2024-06-01 23:08:05] [INFO ] Flatten gal took : 162 ms
[2024-06-01 23:08:05] [INFO ] Flatten gal took : 186 ms
[2024-06-01 23:08:06] [INFO ] Input system was already deterministic with 7936 transitions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 30 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 305/305 places, 7936/7936 transitions.
[2024-06-01 23:08:06] [INFO ] Flatten gal took : 162 ms
[2024-06-01 23:08:06] [INFO ] Flatten gal took : 188 ms
[2024-06-01 23:08:06] [INFO ] Input system was already deterministic with 7936 transitions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 31 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 305/305 places, 7936/7936 transitions.
[2024-06-01 23:08:07] [INFO ] Flatten gal took : 180 ms
[2024-06-01 23:08:07] [INFO ] Flatten gal took : 211 ms
[2024-06-01 23:08:07] [INFO ] Input system was already deterministic with 7936 transitions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 31 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 305/305 places, 7936/7936 transitions.
[2024-06-01 23:08:08] [INFO ] Flatten gal took : 163 ms
[2024-06-01 23:08:08] [INFO ] Flatten gal took : 186 ms
[2024-06-01 23:08:08] [INFO ] Input system was already deterministic with 7936 transitions.
[2024-06-01 23:08:08] [INFO ] Flatten gal took : 174 ms
[2024-06-01 23:08:08] [INFO ] Flatten gal took : 186 ms
[2024-06-01 23:08:08] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2024-06-01 23:08:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 305 places, 7936 transitions and 31616 arcs took 35 ms.
Total runtime 277886 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 : Szymanski-PT-b06-CTLCardinality-2024-00
Could not compute solution for formula : Szymanski-PT-b06-CTLCardinality-2024-01
Could not compute solution for formula : Szymanski-PT-b06-CTLCardinality-2024-03
Could not compute solution for formula : Szymanski-PT-b06-CTLCardinality-2024-04
Could not compute solution for formula : Szymanski-PT-b06-CTLCardinality-2024-05
Could not compute solution for formula : Szymanski-PT-b06-CTLCardinality-2024-06
Could not compute solution for formula : Szymanski-PT-b06-CTLCardinality-2024-09
Could not compute solution for formula : Szymanski-PT-b06-CTLCardinality-2023-12

BK_STOP 1717283289313

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name Szymanski-PT-b06-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/768/ctl_0_
ctl formula name Szymanski-PT-b06-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/768/ctl_1_
ctl formula name Szymanski-PT-b06-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/768/ctl_2_
ctl formula name Szymanski-PT-b06-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/768/ctl_3_
ctl formula name Szymanski-PT-b06-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/768/ctl_4_
ctl formula name Szymanski-PT-b06-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/768/ctl_5_
ctl formula name Szymanski-PT-b06-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/768/ctl_6_
ctl formula name Szymanski-PT-b06-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/768/ctl_7_
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="Szymanski-PT-b06"
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 Szymanski-PT-b06, 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 r536-tall-171690533300873"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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