fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r048-tajo-171620399300339
Last Updated
July 7, 2024

About the Execution of ITS-Tools for BugTracking-PT-q3m008

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 119230.00 0.00 0.00 FFTFTFTTTTT?T?TT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399300339.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-q3m008, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399300339
=====================================================================

--------------------
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 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 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:23 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-q3m008-LTLCardinality-00
FORMULA_NAME BugTracking-PT-q3m008-LTLCardinality-01
FORMULA_NAME BugTracking-PT-q3m008-LTLCardinality-02
FORMULA_NAME BugTracking-PT-q3m008-LTLCardinality-03
FORMULA_NAME BugTracking-PT-q3m008-LTLCardinality-04
FORMULA_NAME BugTracking-PT-q3m008-LTLCardinality-05
FORMULA_NAME BugTracking-PT-q3m008-LTLCardinality-06
FORMULA_NAME BugTracking-PT-q3m008-LTLCardinality-07
FORMULA_NAME BugTracking-PT-q3m008-LTLCardinality-08
FORMULA_NAME BugTracking-PT-q3m008-LTLCardinality-09
FORMULA_NAME BugTracking-PT-q3m008-LTLCardinality-10
FORMULA_NAME BugTracking-PT-q3m008-LTLCardinality-11
FORMULA_NAME BugTracking-PT-q3m008-LTLCardinality-12
FORMULA_NAME BugTracking-PT-q3m008-LTLCardinality-13
FORMULA_NAME BugTracking-PT-q3m008-LTLCardinality-14
FORMULA_NAME BugTracking-PT-q3m008-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716331463913

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m008
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 22:44:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 22:44:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:44:26] [INFO ] Load time of PNML (sax parser for PT used): 811 ms
[2024-05-21 22:44:26] [INFO ] Transformed 754 places.
[2024-05-21 22:44:26] [INFO ] Transformed 27370 transitions.
[2024-05-21 22:44:26] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1025 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 514 places in 94 ms
Reduce places removed 514 places and 24601 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA BugTracking-PT-q3m008-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 238 transition count 2769
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 237 transition count 2750
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 237 transition count 2750
Applied a total of 4 rules in 75 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2024-05-21 22:44:26] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2024-05-21 22:44:26] [INFO ] Computed 8 invariants in 44 ms
[2024-05-21 22:44:27] [INFO ] Implicit Places using invariants in 555 ms returned []
[2024-05-21 22:44:27] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-21 22:44:27] [INFO ] Invariant cache hit.
[2024-05-21 22:44:27] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-21 22:44:29] [INFO ] Implicit Places using invariants and state equation in 2326 ms returned []
Implicit Place search using SMT with State Equation took 2918 ms to find 0 implicit places.
Running 2748 sub problems to find dead transitions.
[2024-05-21 22:44:29] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-21 22:44:29] [INFO ] Invariant cache hit.
[2024-05-21 22:44:29] [INFO ] State equation strengthened by 240 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2748 unsolved
[2024-05-21 22:45:09] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 15 ms to minimize.
[2024-05-21 22:45:09] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 1 ms to minimize.
[2024-05-21 22:45:09] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 1 ms to minimize.
[2024-05-21 22:45:18] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
Problem TDEAD1005 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD2310 is UNSAT
Problem TDEAD2318 is UNSAT
[2024-05-21 22:45:28] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 1 ms to minimize.
Problem TDEAD2319 is UNSAT
Problem TDEAD2329 is UNSAT
Problem TDEAD2330 is UNSAT
Problem TDEAD2333 is UNSAT
[2024-05-21 22:45:28] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 1 ms to minimize.
Problem TDEAD2334 is UNSAT
Problem TDEAD2335 is UNSAT
Problem TDEAD2336 is UNSAT
Problem TDEAD2337 is UNSAT
Problem TDEAD2338 is UNSAT
Problem TDEAD2339 is UNSAT
Problem TDEAD2340 is UNSAT
Problem TDEAD2341 is UNSAT
[2024-05-21 22:45:28] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 1 ms to minimize.
Problem TDEAD2342 is UNSAT
[2024-05-21 22:45:28] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
SMT process timed out in 58719ms, After SMT, problems are : Problem set: 0 solved, 2748 unsolved
Search for dead transitions found 0 dead transitions in 58853ms
Starting structural reductions in LTL mode, iteration 1 : 237/240 places, 2750/2769 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61907 ms. Remains : 237/240 places, 2750/2769 transitions.
Support contains 5 out of 237 places after structural reductions.
[2024-05-21 22:45:29] [INFO ] Flatten gal took : 308 ms
[2024-05-21 22:45:29] [INFO ] Flatten gal took : 154 ms
[2024-05-21 22:45:29] [INFO ] Input system was already deterministic with 2750 transitions.
RANDOM walk for 40001 steps (240 resets) in 1299 ms. (30 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (50 resets) in 199 ms. (200 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (52 resets) in 240 ms. (165 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (60 resets) in 212 ms. (187 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (52 resets) in 141 ms. (281 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 143078 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 4
Probabilistic random walk after 143078 steps, saw 82512 distinct states, run finished after 3004 ms. (steps per millisecond=47 ) properties seen :0
[2024-05-21 22:45:33] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-21 22:45:33] [INFO ] Invariant cache hit.
[2024-05-21 22:45:33] [INFO ] State equation strengthened by 240 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
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
At refinement iteration 1 (OVERLAPS) 79/84 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2297/2381 variables, 84/88 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2381 variables, 48/136 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2381 variables, 0/136 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 320/2701 variables, 123/259 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2701 variables, 1/260 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2701 variables, 163/423 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2701 variables, 0/423 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/2702 variables, 1/424 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2702 variables, 1/425 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2702 variables, 0/425 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 146/2848 variables, 15/440 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2848 variables, 29/469 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2848 variables, 0/469 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/2850 variables, 1/470 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2850 variables, 0/470 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 13/2863 variables, 14/484 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2863 variables, 1/485 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2863 variables, 0/485 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/2863 variables, 0/485 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2863/2863 variables, and 485 constraints, problems are : Problem set: 2 solved, 2 unsolved in 842 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 237/237 constraints, ReadFeed: 240/240 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 56/59 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1552/1611 variables, 59/61 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1611 variables, 3/64 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1611 variables, 0/64 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 724/2335 variables, 88/152 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2335 variables, 1/153 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2335 variables, 158/311 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2335 variables, 2/313 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-21 22:45:34] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2335 variables, 1/314 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-21 22:45:35] [INFO ] Deduced a trap composed of 27 places in 232 ms of which 1 ms to minimize.
[2024-05-21 22:45:35] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2335 variables, 2/316 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2335 variables, 0/316 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/2339 variables, 1/317 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2339 variables, 0/317 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 483/2822 variables, 53/370 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2822 variables, 77/447 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2822 variables, 0/447 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 6/2828 variables, 2/449 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2828 variables, 0/449 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 35/2863 variables, 37/486 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2863 variables, 2/488 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2863 variables, 2/490 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2863 variables, 0/490 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/2863 variables, 0/490 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2863/2863 variables, and 490 constraints, problems are : Problem set: 2 solved, 2 unsolved in 2287 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 237/237 constraints, ReadFeed: 240/240 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 3173ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2986 ms.
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 229 transition count 2747
Applied a total of 16 rules in 156 ms. Remains 229 /237 variables (removed 8) and now considering 2747/2750 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 229/237 places, 2747/2750 transitions.
RANDOM walk for 40002 steps (10 resets) in 476 ms. (83 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 227 ms. (175 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 161763 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 2
Probabilistic random walk after 161763 steps, saw 73136 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
[2024-05-21 22:45:42] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-21 22:45:42] [INFO ] Computed 8 invariants in 32 ms
[2024-05-21 22:45:43] [INFO ] State equation strengthened by 241 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 56/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1552/1611 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1611 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1611 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 720/2331 variables, 87/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2331 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2331 variables, 160/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2331 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/2333 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2333 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2333 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 478/2811 variables, 47/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2811 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2811 variables, 76/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2811 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 3/2814 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2814 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 33/2847 variables, 34/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2847 variables, 2/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2847 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2847 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/2847 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2847/2847 variables, and 478 constraints, problems are : Problem set: 0 solved, 2 unsolved in 907 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 56/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1552/1611 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1611 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1611 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 720/2331 variables, 87/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2331 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2331 variables, 160/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2331 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 22:45:45] [INFO ] Deduced a trap composed of 21 places in 178 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2331 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2331 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/2333 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2333 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 22:45:45] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 1 ms to minimize.
[2024-05-21 22:45:45] [INFO ] Deduced a trap composed of 27 places in 198 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2333 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2333 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 478/2811 variables, 47/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2811 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2811 variables, 76/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2811 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 3/2814 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2814 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 33/2847 variables, 34/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2847 variables, 2/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2847 variables, 2/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2847 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/2847 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2847/2847 variables, and 483 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2715 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 3696ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2010 ms.
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 44 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 39 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2024-05-21 22:45:48] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-21 22:45:48] [INFO ] Invariant cache hit.
[2024-05-21 22:45:49] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-05-21 22:45:49] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-21 22:45:49] [INFO ] Invariant cache hit.
[2024-05-21 22:45:49] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-21 22:45:50] [INFO ] Implicit Places using invariants and state equation in 1746 ms returned []
Implicit Place search using SMT with State Equation took 2104 ms to find 0 implicit places.
[2024-05-21 22:45:51] [INFO ] Redundant transitions in 201 ms returned []
Running 2746 sub problems to find dead transitions.
[2024-05-21 22:45:51] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-21 22:45:51] [INFO ] Invariant cache hit.
[2024-05-21 22:45:51] [INFO ] State equation strengthened by 241 read => feed constraints.

BK_STOP 1716331583143

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-q3m008"
export BK_EXAMINATION="LTLCardinality"
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-q3m008, examination is LTLCardinality"
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-171620399300339"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m008.tgz
mv BugTracking-PT-q3m008 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;