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.r520-tall-171662337600022.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 QuasiCertifProtocol-COL-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337600022
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.7K Apr 13 03:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 13 03:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 13 03:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 13 03:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 04:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 13 04:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 13 04:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 04:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 72K 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 QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-00
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-01
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-02
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-03
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-04
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-05
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-06
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-07
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-08
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-09
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-10
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-11
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-12
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-13
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-14
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717218000175

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:00:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:00:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:00:01] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 05:00:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 05:00:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 587 ms
[2024-06-01 05:00:02] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 550 PT places and 176.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:00:02] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2024-06-01 05:00:02] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
RANDOM walk for 40011 steps (2244 resets) in 1220 ms. (32 steps per ms) remains 13/15 properties
BEST_FIRST walk for 40002 steps (834 resets) in 418 ms. (95 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (906 resets) in 281 ms. (141 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (658 resets) in 500 ms. (79 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (651 resets) in 837 ms. (47 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (839 resets) in 268 ms. (148 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1293 resets) in 196 ms. (203 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (839 resets) in 219 ms. (181 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (835 resets) in 108 ms. (367 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (832 resets) in 109 ms. (363 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (837 resets) in 143 ms. (277 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (836 resets) in 122 ms. (325 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (839 resets) in 80 ms. (493 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (835 resets) in 70 ms. (563 steps per ms) remains 13/13 properties
// Phase 1: matrix 26 rows 30 cols
[2024-06-01 05:00:03] [INFO ] Computed 5 invariants in 7 ms
Problem QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-02 is UNSAT
Problem QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-05 is UNSAT
Problem QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-06 is UNSAT
Problem QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-08 is UNSAT
Problem QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-11 is UNSAT
Problem QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-13 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 6 solved, 7 unsolved
Problem QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-00 is UNSAT
Problem QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-07 is UNSAT
At refinement iteration 2 (OVERLAPS) 26/56 variables, 30/35 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 8 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 8 solved, 5 unsolved in 328 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 8 solved, 5 unsolved
Problem QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-03 is UNSAT
Problem QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-04 is UNSAT
At refinement iteration 2 (OVERLAPS) 26/56 variables, 30/35 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 3/38 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/38 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/56 variables, 0/38 constraints. Problems are: Problem set: 10 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 38 constraints, problems are : Problem set: 10 solved, 3 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 3/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 668ms problems are : Problem set: 10 solved, 3 unsolved
Finished Parikh walk after 41 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=41 )
Parikh walk visited 3 properties in 53 ms.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-06-01 05:00:04] [INFO ] Flatten gal took : 16 ms
[2024-06-01 05:00:04] [INFO ] Flatten gal took : 5 ms
RANDOM walk for 0 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-00 TRUE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-02 TRUE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-03 TRUE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-04 FALSE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-05 FALSE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-06 TRUE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-07 FALSE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-08 TRUE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-11 FALSE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-13 FALSE TECHNIQUES CPN_APPROX
Domain [tsid(11), tsid(11)] of place n9 breaks symmetries in sort tsid
[2024-06-01 05:00:04] [INFO ] Unfolded HLPN to a Petri net with 550 places and 176 transitions 1287 arcs in 17 ms.
[2024-06-01 05:00:04] [INFO ] Unfolded 15 HLPN properties in 2 ms.
RANDOM walk for 40000 steps (2765 resets) in 1449 ms. (27 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (318 resets) in 177 ms. (224 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (321 resets) in 710 ms. (56 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (318 resets) in 106 ms. (373 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (320 resets) in 81 ms. (487 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (322 resets) in 484 ms. (82 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 978181 steps, run timeout after 3001 ms. (steps per millisecond=325 ) properties seen :4 out of 5
Probabilistic random walk after 978181 steps, saw 130561 distinct states, run finished after 3006 ms. (steps per millisecond=325 ) properties seen :4
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 176 rows 550 cols
[2024-06-01 05:00:08] [INFO ] Computed 375 invariants in 35 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/492 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/492 variables, 120/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/492 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/528 variables, 14/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 220/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/550 variables, 20/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 176/726 variables, 550/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/726 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 726/726 variables, and 925 constraints, problems are : Problem set: 0 solved, 1 unsolved in 783 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 360/360 constraints, State Equation: 550/550 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/492 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/492 variables, 120/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/492 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/528 variables, 14/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 220/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 05:00:09] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 28 ms to minimize.
[2024-06-01 05:00:09] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 3 ms to minimize.
[2024-06-01 05:00:09] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 2 ms to minimize.
[2024-06-01 05:00:10] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 3 ms to minimize.
[2024-06-01 05:00:10] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 2 ms to minimize.
[2024-06-01 05:00:10] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 2 ms to minimize.
[2024-06-01 05:00:10] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 2 ms to minimize.
[2024-06-01 05:00:10] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 3 ms to minimize.
[2024-06-01 05:00:10] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 05:00:10] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 10/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 22/550 variables, 20/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 935 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2307 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 360/360 constraints, State Equation: 550/550 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 3242ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 492 out of 550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 176/176 transitions.
Applied a total of 0 rules in 20 ms. Remains 550 /550 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 550/550 places, 176/176 transitions.
RANDOM walk for 40000 steps (2771 resets) in 221 ms. (180 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (325 resets) in 581 ms. (68 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1004756 steps, run timeout after 3001 ms. (steps per millisecond=334 ) properties seen :0 out of 1
Probabilistic random walk after 1004756 steps, saw 133654 distinct states, run finished after 3001 ms. (steps per millisecond=334 ) properties seen :0
[2024-06-01 05:00:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/492 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/492 variables, 120/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/492 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/528 variables, 14/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 220/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/550 variables, 20/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 176/726 variables, 550/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/726 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 726/726 variables, and 925 constraints, problems are : Problem set: 0 solved, 1 unsolved in 683 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 360/360 constraints, State Equation: 550/550 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/492 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/492 variables, 120/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/492 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/528 variables, 14/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 220/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 05:00:16] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 2 ms to minimize.
[2024-06-01 05:00:16] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 2 ms to minimize.
[2024-06-01 05:00:16] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 2 ms to minimize.
[2024-06-01 05:00:16] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 2 ms to minimize.
[2024-06-01 05:00:16] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 2 ms to minimize.
[2024-06-01 05:00:16] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 2 ms to minimize.
[2024-06-01 05:00:16] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 2 ms to minimize.
[2024-06-01 05:00:16] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 05:00:16] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 2 ms to minimize.
[2024-06-01 05:00:16] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 10/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 22/550 variables, 20/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 935 constraints, problems are : Problem set: 0 solved, 1 unsolved in 10196 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 360/360 constraints, State Equation: 550/550 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 10933ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 492 out of 550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 176/176 transitions.
Applied a total of 0 rules in 12 ms. Remains 550 /550 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 550/550 places, 176/176 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 550 /550 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-06-01 05:00:25] [INFO ] Invariant cache hit.
[2024-06-01 05:00:26] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-06-01 05:00:26] [INFO ] Invariant cache hit.
[2024-06-01 05:00:26] [INFO ] Implicit Places using invariants and state equation in 308 ms returned [444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 472 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 539/550 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 539 /539 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 488 ms. Remains : 539/550 places, 176/176 transitions.
RANDOM walk for 40000 steps (2767 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (321 resets) in 550 ms. (72 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1046437 steps, run timeout after 3001 ms. (steps per millisecond=348 ) properties seen :0 out of 1
Probabilistic random walk after 1046437 steps, saw 138135 distinct states, run finished after 3001 ms. (steps per millisecond=348 ) properties seen :0
// Phase 1: matrix 176 rows 539 cols
[2024-06-01 05:00:29] [INFO ] Computed 364 invariants in 23 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/492 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/492 variables, 341/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/492 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/517 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/517 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/539 variables, 20/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 176/715 variables, 539/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/715 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/715 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 715/715 variables, and 903 constraints, problems are : Problem set: 0 solved, 1 unsolved in 987 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 361/361 constraints, State Equation: 539/539 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/492 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/492 variables, 341/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/492 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/517 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 05:00:31] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/517 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/517 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/539 variables, 20/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
Problem QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-15 is UNSAT
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 715/715 variables, and 904 constraints, problems are : Problem set: 0 solved, 1 unsolved in 14940 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 361/361 constraints, State Equation: 539/539 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 16009ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 44389 ms.
ITS solved all properties within timeout

BK_STOP 1717218045743

--------------------
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="QuasiCertifProtocol-COL-10"
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 QuasiCertifProtocol-COL-10, 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 r520-tall-171662337600022"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-10.tgz
mv QuasiCertifProtocol-COL-10 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 ;