fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r268-smll-171654407300263
Last Updated
July 7, 2024

About the Execution of ITS-Tools for Peterson-PT-3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
784.235 27532.00 77006.00 180.60 FTTTFFFTTTFTFFFT 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.r268-smll-171654407300263.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 itstools
Input is Peterson-PT-3, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654407300263
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 27K Apr 12 02:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 12 02:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 12 02:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 134K Apr 12 02:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 108K Apr 12 02:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 511K Apr 12 02:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 71K Apr 12 02:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 344K Apr 12 02:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.5K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 143K 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 Peterson-PT-3-ReachabilityFireability-2024-00
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-2024-01
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-2024-02
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-2024-03
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-2024-04
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-2024-05
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-2024-06
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-2024-07
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-2024-08
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-2024-09
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-2024-10
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-2024-11
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-2024-12
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-2024-13
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-2024-14
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716762911999

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-26 22:35:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 22:35:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 22:35:14] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2024-05-26 22:35:14] [INFO ] Transformed 244 places.
[2024-05-26 22:35:14] [INFO ] Transformed 332 transitions.
[2024-05-26 22:35:14] [INFO ] Found NUPN structural information;
[2024-05-26 22:35:14] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 431 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 81 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-3-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 3141 ms. (12 steps per ms) remains 9/13 properties
FORMULA Peterson-PT-3-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-26 22:35:16] [INFO ] Flatten gal took : 207 ms
[2024-05-26 22:35:16] [INFO ] Flatten gal took : 125 ms
[2024-05-26 22:35:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12448207742325559376.gal : 56 ms
[2024-05-26 22:35:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15717170845586391474.prop : 16 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12448207742325559376.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15717170845586391474.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality15717170845586391474.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 2130 ms. (18 steps per ms) remains 9/9 properties
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :8 after 9
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :9 after 39
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :39 after 53
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :53 after 116
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :116 after 213
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :213 after 1126
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :1126 after 4159
BEST_FIRST walk for 40004 steps (8 resets) in 2443 ms. (16 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 9/9 properties
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :4159 after 8058
BEST_FIRST walk for 40004 steps (8 resets) in 345 ms. (115 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 9/9 properties
[2024-05-26 22:35:18] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-26 22:35:18] [INFO ] Computed 15 invariants in 36 ms
[2024-05-26 22:35:18] [INFO ] State equation strengthened by 57 read => feed constraints.
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :8058 after 33592
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 244/244 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem Peterson-PT-3-ReachabilityFireability-2024-04 is UNSAT
FORMULA Peterson-PT-3-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem Peterson-PT-3-ReachabilityFireability-2024-14 is UNSAT
FORMULA Peterson-PT-3-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/244 variables, 11/255 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 4/259 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 0/259 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 308/552 variables, 244/503 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 57/560 constraints. Problems are: Problem set: 2 solved, 7 unsolved
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :33592 after 136278
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 0/560 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/552 variables, 0/560 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 560 constraints, problems are : Problem set: 2 solved, 7 unsolved in 2289 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 217/217 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/217 variables, 4/221 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 1/222 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/222 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem Peterson-PT-3-ReachabilityFireability-2024-08 is UNSAT
FORMULA Peterson-PT-3-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (OVERLAPS) 27/244 variables, 7/229 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 27/256 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 3/259 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-05-26 22:35:22] [INFO ] Deduced a trap composed of 30 places in 247 ms of which 47 ms to minimize.
[2024-05-26 22:35:22] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 4 ms to minimize.
[2024-05-26 22:35:22] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 4 ms to minimize.
[2024-05-26 22:35:22] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 4 ms to minimize.
[2024-05-26 22:35:23] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 4 ms to minimize.
[2024-05-26 22:35:23] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 4 ms to minimize.
[2024-05-26 22:35:23] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 4 ms to minimize.
[2024-05-26 22:35:23] [INFO ] Deduced a trap composed of 31 places in 262 ms of which 4 ms to minimize.
[2024-05-26 22:35:24] [INFO ] Deduced a trap composed of 30 places in 176 ms of which 4 ms to minimize.
[2024-05-26 22:35:24] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 3 ms to minimize.
[2024-05-26 22:35:24] [INFO ] Deduced a trap composed of 34 places in 201 ms of which 3 ms to minimize.
[2024-05-26 22:35:24] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 3 ms to minimize.
[2024-05-26 22:35:24] [INFO ] Deduced a trap composed of 45 places in 158 ms of which 3 ms to minimize.
Invariant property Peterson-PT-3-ReachabilityFireability-2024-12 does not hold.
FORMULA Peterson-PT-3-ReachabilityFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
[2024-05-26 22:35:25] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 3 ms to minimize.
[2024-05-26 22:35:25] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 3 ms to minimize.
[2024-05-26 22:35:25] [INFO ] Deduced a trap composed of 58 places in 145 ms of which 3 ms to minimize.
[2024-05-26 22:35:25] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 3 ms to minimize.
[2024-05-26 22:35:25] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 3 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :136278 after 341876
[2024-05-26 22:35:25] [INFO ] Deduced a trap composed of 61 places in 136 ms of which 3 ms to minimize.
[2024-05-26 22:35:26] [INFO ] Deduced a trap composed of 73 places in 127 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 20/279 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-05-26 22:35:26] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 2 ms to minimize.
[2024-05-26 22:35:26] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 2 ms to minimize.
[2024-05-26 22:35:26] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 1 ms to minimize.
SMT process timed out in 8255ms, After SMT, problems are : Problem set: 4 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 211 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 244 transition count 331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 243 transition count 331
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 243 transition count 327
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 239 transition count 327
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 237 transition count 325
Applied a total of 14 rules in 66 ms. Remains 237 /244 variables (removed 7) and now considering 325/332 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 237/244 places, 325/332 transitions.
RANDOM walk for 40000 steps (8 resets) in 521 ms. (76 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 967 ms. (41 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 417320 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :0 out of 5
Probabilistic random walk after 417320 steps, saw 86083 distinct states, run finished after 3029 ms. (steps per millisecond=137 ) properties seen :0
[2024-05-26 22:35:30] [INFO ] Flow matrix only has 301 transitions (discarded 24 similar events)
// Phase 1: matrix 301 rows 237 cols
[2024-05-26 22:35:30] [INFO ] Computed 15 invariants in 9 ms
[2024-05-26 22:35:30] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 211/211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 4/215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 24/235 variables, 7/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 24/247 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2/237 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 301/538 variables, 237/489 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/538 variables, 57/546 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/538 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Invariant property Peterson-PT-3-ReachabilityFireability-2024-10 does not hold.
FORMULA Peterson-PT-3-ReachabilityFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
At refinement iteration 14 (OVERLAPS) 0/538 variables, 0/546 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 538/538 variables, and 546 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1187 ms.
Refiners :[Domain max(s): 237/237 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 237/237 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 211/211 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 4/215 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 1/216 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/216 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem Peterson-PT-3-ReachabilityFireability-2024-07 is UNSAT
FORMULA Peterson-PT-3-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (OVERLAPS) 24/235 variables, 7/223 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 24/247 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 1/248 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-26 22:35:33] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 3 ms to minimize.
[2024-05-26 22:35:33] [INFO ] Deduced a trap composed of 49 places in 179 ms of which 4 ms to minimize.
[2024-05-26 22:35:33] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 4 ms to minimize.
[2024-05-26 22:35:33] [INFO ] Deduced a trap composed of 45 places in 148 ms of which 4 ms to minimize.
[2024-05-26 22:35:33] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-26 22:35:33] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 2 ms to minimize.
[2024-05-26 22:35:33] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
[2024-05-26 22:35:34] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
[2024-05-26 22:35:34] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 3 ms to minimize.
[2024-05-26 22:35:34] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 2 ms to minimize.
[2024-05-26 22:35:34] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 7 ms to minimize.
[2024-05-26 22:35:34] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 2 ms to minimize.
[2024-05-26 22:35:34] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 3 ms to minimize.
[2024-05-26 22:35:34] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 2 ms to minimize.
[2024-05-26 22:35:34] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 2 ms to minimize.
[2024-05-26 22:35:34] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 2 ms to minimize.
[2024-05-26 22:35:34] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 3 ms to minimize.
[2024-05-26 22:35:34] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 3 ms to minimize.
[2024-05-26 22:35:35] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2024-05-26 22:35:35] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 20/268 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-26 22:35:35] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 1/269 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 0/269 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/237 variables, 2/271 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 2/273 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-26 22:35:35] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
[2024-05-26 22:35:35] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-05-26 22:35:35] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
[2024-05-26 22:35:35] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
[2024-05-26 22:35:35] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
Problem Peterson-PT-3-ReachabilityFireability-2024-13 is UNSAT
FORMULA Peterson-PT-3-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 5/278 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 0/278 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 301/538 variables, 237/515 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/538 variables, 57/572 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/538 variables, 2/574 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-26 22:35:36] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 2 ms to minimize.
[2024-05-26 22:35:36] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 3 ms to minimize.
[2024-05-26 22:35:36] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 2 ms to minimize.
[2024-05-26 22:35:36] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 2 ms to minimize.
[2024-05-26 22:35:36] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 3 ms to minimize.
[2024-05-26 22:35:36] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/538 variables, 6/580 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/538 variables, 0/580 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-26 22:35:37] [INFO ] Deduced a trap composed of 20 places in 170 ms of which 16 ms to minimize.
[2024-05-26 22:35:37] [INFO ] Deduced a trap composed of 70 places in 126 ms of which 3 ms to minimize.
[2024-05-26 22:35:37] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 3 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/538 variables, 3/583 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-26 22:35:37] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/538 variables, 1/584 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/538 variables, 0/584 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-26 22:35:38] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 2 ms to minimize.
[2024-05-26 22:35:38] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 3 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/538 variables, 2/586 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/538 variables, 0/586 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/538 variables, 0/586 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 538/538 variables, and 586 constraints, problems are : Problem set: 3 solved, 2 unsolved in 7152 ms.
Refiners :[Domain max(s): 237/237 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 237/237 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 38/38 constraints]
After SMT, in 8589ms problems are : Problem set: 3 solved, 2 unsolved
FORMULA Peterson-PT-3-ReachabilityFireability-2024-09 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 359 ms.
Support contains 1 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 325/325 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 237 transition count 233
Reduce places removed 92 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 93 rules applied. Total rules applied 185 place count 145 transition count 232
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 186 place count 144 transition count 232
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 186 place count 144 transition count 188
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 274 place count 100 transition count 188
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 294 place count 90 transition count 178
Applied a total of 294 rules in 49 ms. Remains 90 /237 variables (removed 147) and now considering 178/325 (removed 147) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 90/237 places, 178/325 transitions.
RANDOM walk for 40000 steps (8 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 50572 steps, run visited all 1 properties in 133 ms. (steps per millisecond=380 )
Probabilistic random walk after 50572 steps, saw 10253 distinct states, run finished after 142 ms. (steps per millisecond=356 ) properties seen :1
FORMULA Peterson-PT-3-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 24994 ms.

BK_STOP 1716762939531

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="Peterson-PT-3"
export BK_EXAMINATION="ReachabilityFireability"
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 Peterson-PT-3, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r268-smll-171654407300263"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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