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.r267-smll-171654405900222.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 greatspnxred
Input is Peterson-COL-4, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654405900222
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 9.1K Apr 12 02:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 12 02:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 02:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 02:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 12 03:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 12 03:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 44K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-2024-00
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-2024-01
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-2024-02
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-2024-03
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-2024-04
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-2024-05
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-2024-06
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-2024-07
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-2024-08
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-2024-09
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-2024-10
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-2024-11
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-2024-12
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-2024-13
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-2024-14
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716733710471

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 14:28:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-26 14:28:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 14:28:33] [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-05-26 14:28:34] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 14:28:34] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1217 ms
[2024-05-26 14:28:34] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 500 PT places and 795.0 transition bindings in 36 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 52 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-4-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 14:28:34] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 7 ms.
[2024-05-26 14:28:34] [INFO ] Skeletonized 15 HLPN properties in 2 ms.
Remains 15 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40009 steps (8 resets) in 1243 ms. (32 steps per ms) remains 9/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 386 ms. (103 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 437 ms. (91 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 351 ms. (113 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 184 ms. (216 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 619 ms. (64 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 312 ms. (127 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 9/9 properties
// Phase 1: matrix 14 rows 9 cols
[2024-05-26 14:28:36] [INFO ] Computed 1 invariants in 6 ms
Problem Peterson-COL-4-ReachabilityCardinality-2024-00 is UNSAT
Problem Peterson-COL-4-ReachabilityCardinality-2024-03 is UNSAT
Problem Peterson-COL-4-ReachabilityCardinality-2024-04 is UNSAT
Problem Peterson-COL-4-ReachabilityCardinality-2024-05 is UNSAT
Problem Peterson-COL-4-ReachabilityCardinality-2024-06 is UNSAT
Problem Peterson-COL-4-ReachabilityCardinality-2024-11 is UNSAT
Problem Peterson-COL-4-ReachabilityCardinality-2024-12 is UNSAT
Problem Peterson-COL-4-ReachabilityCardinality-2024-13 is UNSAT
Problem Peterson-COL-4-ReachabilityCardinality-2024-15 is UNSAT
After SMT solving in domain Real declared 9/23 variables, and 1 constraints, problems are : Problem set: 9 solved, 0 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 257ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-26 14:28:36] [INFO ] Flatten gal took : 37 ms
[2024-05-26 14:28:36] [INFO ] Flatten gal took : 3 ms
RANDOM walk for 0 steps (0 resets) in 4 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 Peterson-COL-4-ReachabilityCardinality-2024-00 TRUE TECHNIQUES CPN_APPROX
FORMULA Peterson-COL-4-ReachabilityCardinality-2024-03 FALSE TECHNIQUES CPN_APPROX
FORMULA Peterson-COL-4-ReachabilityCardinality-2024-04 TRUE TECHNIQUES CPN_APPROX
FORMULA Peterson-COL-4-ReachabilityCardinality-2024-05 FALSE TECHNIQUES CPN_APPROX
FORMULA Peterson-COL-4-ReachabilityCardinality-2024-06 FALSE TECHNIQUES CPN_APPROX
FORMULA Peterson-COL-4-ReachabilityCardinality-2024-07 TRUE TECHNIQUES CPN_APPROX
FORMULA Peterson-COL-4-ReachabilityCardinality-2024-08 TRUE TECHNIQUES CPN_APPROX
FORMULA Peterson-COL-4-ReachabilityCardinality-2024-11 FALSE TECHNIQUES CPN_APPROX
FORMULA Peterson-COL-4-ReachabilityCardinality-2024-12 TRUE TECHNIQUES CPN_APPROX
FORMULA Peterson-COL-4-ReachabilityCardinality-2024-13 FALSE TECHNIQUES CPN_APPROX
FORMULA Peterson-COL-4-ReachabilityCardinality-2024-15 TRUE TECHNIQUES CPN_APPROX
Domain [Process(5), Tour(4), Process(5)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 4)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-26 14:28:36] [INFO ] Unfolded HLPN to a Petri net with 500 places and 730 transitions 2280 arcs in 56 ms.
[2024-05-26 14:28:36] [INFO ] Unfolded 15 HLPN properties in 2 ms.
Deduced a syphon composed of 20 places in 6 ms
Reduce places removed 20 places and 40 transitions.
RANDOM walk for 40000 steps (8 resets) in 1505 ms. (26 steps per ms) remains 1/4 properties
FORMULA Peterson-COL-4-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 316 ms. (126 steps per ms) remains 1/1 properties
[2024-05-26 14:28:37] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2024-05-26 14:28:37] [INFO ] Computed 19 invariants in 19 ms
[2024-05-26 14:28:37] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 325/455 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/460 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 630/1090 variables, 460/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1090 variables, 116/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1090 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 20/1110 variables, 20/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1110 variables, 4/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1110 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1110 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1110/1110 variables, and 615 constraints, problems are : Problem set: 0 solved, 1 unsolved in 923 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 480/480 constraints, ReadFeed: 116/116 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/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 325/455 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/460 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 630/1090 variables, 460/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1090 variables, 116/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1090 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 20/1110 variables, 20/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1110 variables, 4/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1110 variables, 1/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 14:28:40] [INFO ] Deduced a trap composed of 17 places in 452 ms of which 67 ms to minimize.
[2024-05-26 14:28:41] [INFO ] Deduced a trap composed of 36 places in 404 ms of which 8 ms to minimize.
[2024-05-26 14:28:41] [INFO ] Deduced a trap composed of 14 places in 459 ms of which 7 ms to minimize.
[2024-05-26 14:28:42] [INFO ] Deduced a trap composed of 37 places in 313 ms of which 6 ms to minimize.
[2024-05-26 14:28:42] [INFO ] Deduced a trap composed of 48 places in 452 ms of which 7 ms to minimize.
[2024-05-26 14:28:43] [INFO ] Deduced a trap composed of 47 places in 499 ms of which 8 ms to minimize.
[2024-05-26 14:28:43] [INFO ] Deduced a trap composed of 15 places in 378 ms of which 7 ms to minimize.
SMT process timed out in 6329ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 130 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 116 place count 480 transition count 574
Reduce places removed 116 places and 0 transitions.
Iterating post reduction 1 with 116 rules applied. Total rules applied 232 place count 364 transition count 574
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 232 place count 364 transition count 490
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 400 place count 280 transition count 490
Applied a total of 400 rules in 137 ms. Remains 280 /480 variables (removed 200) and now considering 490/690 (removed 200) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 280/480 places, 490/690 transitions.
RANDOM walk for 40000 steps (8 resets) in 616 ms. (64 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 690 ms. (57 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 910596 steps, run timeout after 3001 ms. (steps per millisecond=303 ) properties seen :0 out of 1
Probabilistic random walk after 910596 steps, saw 157833 distinct states, run finished after 3008 ms. (steps per millisecond=302 ) properties seen :0
[2024-05-26 14:28:47] [INFO ] Flow matrix only has 430 transitions (discarded 60 similar events)
// Phase 1: matrix 430 rows 280 cols
[2024-05-26 14:28:47] [INFO ] Computed 19 invariants in 5 ms
[2024-05-26 14:28:47] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/255 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/260 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 430/690 variables, 260/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 116/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/690 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 20/710 variables, 20/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/710 variables, 4/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/710 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/710 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 710/710 variables, and 415 constraints, problems are : Problem set: 0 solved, 1 unsolved in 468 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 280/280 constraints, ReadFeed: 116/116 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/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/255 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/260 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 430/690 variables, 260/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 116/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/690 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 20/710 variables, 20/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/710 variables, 4/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/710 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 14:28:48] [INFO ] Deduced a trap composed of 16 places in 252 ms of which 4 ms to minimize.
[2024-05-26 14:28:49] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 3 ms to minimize.
[2024-05-26 14:28:49] [INFO ] Deduced a trap composed of 29 places in 152 ms of which 3 ms to minimize.
[2024-05-26 14:28:49] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 3 ms to minimize.
[2024-05-26 14:28:50] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 3 ms to minimize.
[2024-05-26 14:28:50] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 4 ms to minimize.
[2024-05-26 14:28:50] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 4 ms to minimize.
[2024-05-26 14:28:50] [INFO ] Deduced a trap composed of 31 places in 204 ms of which 3 ms to minimize.
[2024-05-26 14:28:51] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 3 ms to minimize.
[2024-05-26 14:28:51] [INFO ] Deduced a trap composed of 28 places in 168 ms of which 4 ms to minimize.
[2024-05-26 14:28:51] [INFO ] Deduced a trap composed of 45 places in 225 ms of which 4 ms to minimize.
[2024-05-26 14:28:51] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 3 ms to minimize.
[2024-05-26 14:28:52] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 4 ms to minimize.
[2024-05-26 14:28:52] [INFO ] Deduced a trap composed of 58 places in 228 ms of which 5 ms to minimize.
[2024-05-26 14:28:52] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 4 ms to minimize.
[2024-05-26 14:28:53] [INFO ] Deduced a trap composed of 51 places in 229 ms of which 4 ms to minimize.
[2024-05-26 14:28:53] [INFO ] Deduced a trap composed of 51 places in 174 ms of which 4 ms to minimize.
[2024-05-26 14:28:53] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 4 ms to minimize.
[2024-05-26 14:28:54] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 4 ms to minimize.
[2024-05-26 14:28:54] [INFO ] Deduced a trap composed of 23 places in 235 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/710 variables, 20/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 14:28:55] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 4 ms to minimize.
[2024-05-26 14:28:55] [INFO ] Deduced a trap composed of 35 places in 185 ms of which 4 ms to minimize.
[2024-05-26 14:28:55] [INFO ] Deduced a trap composed of 18 places in 256 ms of which 4 ms to minimize.
[2024-05-26 14:28:55] [INFO ] Deduced a trap composed of 33 places in 232 ms of which 4 ms to minimize.
[2024-05-26 14:28:56] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 4 ms to minimize.
[2024-05-26 14:28:56] [INFO ] Deduced a trap composed of 63 places in 224 ms of which 4 ms to minimize.
[2024-05-26 14:28:56] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 5 ms to minimize.
[2024-05-26 14:28:57] [INFO ] Deduced a trap composed of 20 places in 233 ms of which 4 ms to minimize.
[2024-05-26 14:28:57] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 4 ms to minimize.
[2024-05-26 14:28:57] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 4 ms to minimize.
[2024-05-26 14:28:58] [INFO ] Deduced a trap composed of 13 places in 333 ms of which 4 ms to minimize.
Problem Peterson-COL-4-ReachabilityCardinality-2024-10 is UNSAT
FORMULA Peterson-COL-4-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 710/710 variables, and 447 constraints, problems are : Problem set: 1 solved, 0 unsolved in 10488 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 280/280 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 31/31 constraints]
After SMT, in 11029ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 25533 ms.
ITS solved all properties within timeout

BK_STOP 1716733738486

--------------------
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="Peterson-COL-4"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is Peterson-COL-4, 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 r267-smll-171654405900222"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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