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.r522-tall-171662353100013.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 StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-171662353100013
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-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 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717217929161

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=QuasiCertifProtocol-COL-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:58:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 04:58:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:58:50] [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 04:58:50] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 04:58:50] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 642 ms
[2024-06-01 04:58:51] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 550 PT places and 176.0 transition bindings in 18 ms.
[2024-06-01 04:58:51] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2024-06-01 04:58:51] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
Structural test allowed to assert that 4 places are NOT stable. Took 4 ms.
RANDOM walk for 40007 steps (2229 resets) in 910 ms. (43 steps per ms) remains 2/26 properties
BEST_FIRST walk for 40003 steps (827 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (845 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
// Phase 1: matrix 26 rows 30 cols
[2024-06-01 04:58:51] [INFO ] Computed 5 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/22 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 26/48 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/56 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 0 solved, 2 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/22 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 26/48 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/56 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/56 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 37 constraints, problems are : Problem set: 0 solved, 2 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 375ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 63 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=31 )
Parikh walk visited 2 properties in 5 ms.
Able to resolve query StableMarking after proving 27 properties.
[2024-06-01 04:58:51] [INFO ] Unfolded HLPN to a Petri net with 550 places and 176 transitions 1287 arcs in 18 ms.
[2024-06-01 04:58:51] [INFO ] Unfolded 30 HLPN properties in 1 ms.
RANDOM walk for 40000 steps (2765 resets) in 1288 ms. (31 steps per ms) remains 21/30 properties
BEST_FIRST walk for 4004 steps (31 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (31 resets) in 43 ms. (91 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (33 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (30 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (32 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (27 resets) in 32 ms. (121 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (32 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (30 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (30 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (31 resets) in 34 ms. (114 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (32 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (31 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (29 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (33 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (31 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (33 resets) in 21 ms. (182 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (30 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (31 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (28 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (29 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (29 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
// Phase 1: matrix 176 rows 550 cols
[2024-06-01 04:58:52] [INFO ] Computed 375 invariants in 36 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 350/351 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/501 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 27/528 variables, 14/365 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 176/704 variables, 528/893 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/704 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 22/726 variables, 22/915 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 10/925 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 0/726 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 726/726 variables, and 925 constraints, problems are : Problem set: 0 solved, 21 unsolved in 3675 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 360/360 constraints, State Equation: 550/550 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 350/351 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 04:58:56] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 19 ms to minimize.
[2024-06-01 04:58:56] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/501 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 04:58:57] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 2 ms to minimize.
[2024-06-01 04:58:57] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 2 ms to minimize.
[2024-06-01 04:58:57] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 2 ms to minimize.
[2024-06-01 04:58:57] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 2 ms to minimize.
[2024-06-01 04:58:57] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 2 ms to minimize.
[2024-06-01 04:58:58] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 6/359 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 04:58:58] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 27/528 variables, 14/374 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 04:59:00] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2024-06-01 04:59:00] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 2 ms to minimize.
[2024-06-01 04:59:01] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 2 ms to minimize.
[2024-06-01 04:59:01] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 5 ms to minimize.
[2024-06-01 04:59:01] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-06-01 04:59:01] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
SMT process timed out in 8835ms, After SMT, problems are : Problem set: 0 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 501 out of 550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 176/176 transitions.
Graph (complete) has 2400 edges and 550 vertex of which 548 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 537 transition count 153
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 35 place count 537 transition count 142
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 1 with 43 rules applied. Total rules applied 78 place count 505 transition count 142
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 78 place count 505 transition count 141
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 81 place count 503 transition count 141
Applied a total of 81 rules in 40 ms. Remains 503 /550 variables (removed 47) and now considering 141/176 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 503/550 places, 141/176 transitions.
RANDOM walk for 4000000 steps (329802 resets) in 25913 ms. (154 steps per ms) remains 9/21 properties
BEST_FIRST walk for 4000004 steps (42977 resets) in 5467 ms. (731 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (42893 resets) in 11603 ms. (344 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (42870 resets) in 11705 ms. (341 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000003 steps (43033 resets) in 6809 ms. (587 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (42865 resets) in 5865 ms. (681 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (42819 resets) in 6042 ms. (661 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000003 steps (42795 resets) in 5995 ms. (667 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (42809 resets) in 5381 ms. (743 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (42938 resets) in 5972 ms. (669 steps per ms) remains 9/9 properties
// Phase 1: matrix 141 rows 503 cols
[2024-06-01 04:59:25] [INFO ] Computed 362 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/299 variables, 231/232 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 121/420 variables, 110/342 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 78/498 variables, 420/762 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 81/579 variables, 35/797 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 11/590 variables, 10/807 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/590 variables, 11/818 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/590 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 25/615 variables, 12/830 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/615 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 25/640 variables, 23/853 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/640 variables, 10/863 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/640 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 3/643 variables, 1/864 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/643 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 1/644 variables, 1/865 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/644 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 0/644 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 644/644 variables, and 865 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3815 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 361/361 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/299 variables, 231/232 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 04:59:29] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 121/420 variables, 110/343 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 78/498 variables, 420/763 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/498 variables, 9/772 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/498 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 81/579 variables, 35/807 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/579 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 11/590 variables, 10/817 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/590 variables, 11/828 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/590 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 25/615 variables, 12/840 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/615 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 25/640 variables, 23/863 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/640 variables, 10/873 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/640 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 3/643 variables, 1/874 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/643 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 1/644 variables, 1/875 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/644 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 0/644 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 644/644 variables, and 875 constraints, problems are : Problem set: 0 solved, 9 unsolved in 9255 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 361/361 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 13099ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 6 different solutions.
Finished Parikh walk after 72 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=72 )
Parikh walk visited 9 properties in 191 ms.
Able to resolve query StableMarking after proving 30 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK TOPOLOGICAL
Total runtime 48662 ms.
ITS solved all properties within timeout

BK_STOP 1717217978955

--------------------
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 StableMarking -timeout 180 -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="StableMarking"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r522-tall-171662353100013"
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 [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;