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

About the Execution of LTSMin+red for HouseConstruction-PT-32000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
517.972 131426.00 257662.00 342.80 TTTTFFTFFTFTFFTT 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.r500-smll-171649587800254.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 HouseConstruction-PT-32000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r500-smll-171649587800254
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 18:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 11 18:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 18:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 13K 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 HouseConstruction-PT-32000-ReachabilityCardinality-2024-00
FORMULA_NAME HouseConstruction-PT-32000-ReachabilityCardinality-2024-01
FORMULA_NAME HouseConstruction-PT-32000-ReachabilityCardinality-2024-02
FORMULA_NAME HouseConstruction-PT-32000-ReachabilityCardinality-2024-03
FORMULA_NAME HouseConstruction-PT-32000-ReachabilityCardinality-2024-04
FORMULA_NAME HouseConstruction-PT-32000-ReachabilityCardinality-2024-05
FORMULA_NAME HouseConstruction-PT-32000-ReachabilityCardinality-2024-06
FORMULA_NAME HouseConstruction-PT-32000-ReachabilityCardinality-2024-07
FORMULA_NAME HouseConstruction-PT-32000-ReachabilityCardinality-2024-08
FORMULA_NAME HouseConstruction-PT-32000-ReachabilityCardinality-2024-09
FORMULA_NAME HouseConstruction-PT-32000-ReachabilityCardinality-2024-10
FORMULA_NAME HouseConstruction-PT-32000-ReachabilityCardinality-2024-11
FORMULA_NAME HouseConstruction-PT-32000-ReachabilityCardinality-2024-12
FORMULA_NAME HouseConstruction-PT-32000-ReachabilityCardinality-2024-13
FORMULA_NAME HouseConstruction-PT-32000-ReachabilityCardinality-2024-14
FORMULA_NAME HouseConstruction-PT-32000-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717261287108

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HouseConstruction-PT-32000
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:01:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 17:01:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:01:29] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2024-06-01 17:01:29] [INFO ] Transformed 26 places.
[2024-06-01 17:01:29] [INFO ] Transformed 18 transitions.
[2024-06-01 17:01:29] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 277 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 55 ms.
Working with output stream class java.io.PrintStream
FORMULA HouseConstruction-PT-32000-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 128004 steps (0 resets) in 394 ms. (324 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 487 ms. (8 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 83 ms. (47 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 86 ms. (46 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 157 ms. (25 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 76 ms. (51 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 199 ms. (20 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 113633 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 15
Probabilistic random walk after 113633 steps, saw 78779 distinct states, run finished after 3014 ms. (steps per millisecond=37 ) properties seen :0
// Phase 1: matrix 18 rows 26 cols
[2024-06-01 17:01:33] [INFO ] Computed 8 invariants in 7 ms
Problem HouseConstruction-PT-32000-ReachabilityCardinality-2024-14 is UNSAT
FORMULA HouseConstruction-PT-32000-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Problem HouseConstruction-PT-32000-ReachabilityCardinality-2024-07 is UNSAT
FORMULA HouseConstruction-PT-32000-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 18/44 variables, 26/34 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/34 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 0/44 variables, 0/34 constraints. Problems are: Problem set: 2 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 34 constraints, problems are : Problem set: 2 solved, 13 unsolved in 1064 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 18/44 variables, 26/34 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 13/47 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/47 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 0/44 variables, 0/47 constraints. Problems are: Problem set: 2 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 47 constraints, problems are : Problem set: 2 solved, 13 unsolved in 1426 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 13/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 2585ms problems are : Problem set: 2 solved, 13 unsolved
FORMULA HouseConstruction-PT-32000-ReachabilityCardinality-2024-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA HouseConstruction-PT-32000-ReachabilityCardinality-2024-12 FALSE TECHNIQUES PARIKH_WALK
FORMULA HouseConstruction-PT-32000-ReachabilityCardinality-2024-08 FALSE TECHNIQUES PARIKH_WALK
FORMULA HouseConstruction-PT-32000-ReachabilityCardinality-2024-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA HouseConstruction-PT-32000-ReachabilityCardinality-2024-02 TRUE TECHNIQUES PARIKH_WALK
FORMULA HouseConstruction-PT-32000-ReachabilityCardinality-2024-01 TRUE TECHNIQUES PARIKH_WALK
FORMULA HouseConstruction-PT-32000-ReachabilityCardinality-2024-00 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 7 properties in 30007 ms.
Support contains 25 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 13 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 26/26 places, 18/18 transitions.
RANDOM walk for 128006 steps (0 resets) in 33 ms. (3764 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 62 ms. (634 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 116 ms. (341 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 385 ms. (103 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 185 ms. (215 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 533 ms. (74 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 223468 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 6
Probabilistic random walk after 223468 steps, saw 141365 distinct states, run finished after 3002 ms. (steps per millisecond=74 ) properties seen :0
[2024-06-01 17:02:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 18/44 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/44 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 34 constraints, problems are : Problem set: 0 solved, 6 unsolved in 178 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 18/44 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/44 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 40 constraints, problems are : Problem set: 0 solved, 6 unsolved in 268 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 461ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
FORMULA HouseConstruction-PT-32000-ReachabilityCardinality-2024-10 FALSE TECHNIQUES PARIKH_WALK
FORMULA HouseConstruction-PT-32000-ReachabilityCardinality-2024-03 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 30000 ms.
Support contains 24 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 26/26 places, 18/18 transitions.
RANDOM walk for 128004 steps (0 resets) in 15 ms. (8000 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 34 ms. (1142 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 265686 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 4
Probabilistic random walk after 265686 steps, saw 171519 distinct states, run finished after 3007 ms. (steps per millisecond=88 ) properties seen :0
[2024-06-01 17:02:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 2/26 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 18/44 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/44 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 34 constraints, problems are : Problem set: 0 solved, 4 unsolved in 145 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 26/26 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/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 2/26 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 18/44 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/44 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 38 constraints, problems are : Problem set: 0 solved, 4 unsolved in 220 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 395ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
FORMULA HouseConstruction-PT-32000-ReachabilityCardinality-2024-05 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 30000 ms.
Support contains 24 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 26/26 places, 18/18 transitions.
RANDOM walk for 128004 steps (0 resets) in 16 ms. (7529 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 367517 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 3
Probabilistic random walk after 367517 steps, saw 244252 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
[2024-06-01 17:03:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2/26 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 18/44 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/44 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 34 constraints, problems are : Problem set: 0 solved, 3 unsolved in 125 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 26/26 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/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2/26 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 18/44 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/44 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 37 constraints, problems are : Problem set: 0 solved, 3 unsolved in 167 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 302ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
FORMULA HouseConstruction-PT-32000-ReachabilityCardinality-2024-11 TRUE TECHNIQUES PARIKH_WALK
FORMULA HouseConstruction-PT-32000-ReachabilityCardinality-2024-09 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 156122 steps, including 0 resets, run visited all 1 properties in 176 ms. (steps per millisecond=887 )
FORMULA HouseConstruction-PT-32000-ReachabilityCardinality-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 21400 ms.
All properties solved without resorting to model-checking.
Total runtime 129114 ms.
ITS solved all properties within timeout

BK_STOP 1717261418534

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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="HouseConstruction-PT-32000"
export BK_EXAMINATION="ReachabilityCardinality"
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 HouseConstruction-PT-32000, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r500-smll-171649587800254"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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