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.r512-smll-171654407100202.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 Peterson-COL-2, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407100202
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 8.1K Apr 12 02:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 12 02:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 12 02:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 12 02:40 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.6K 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.4K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 02:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 02:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 02:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 02:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 42K 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-2-CTLFireability-2024-00
FORMULA_NAME Peterson-COL-2-CTLFireability-2024-01
FORMULA_NAME Peterson-COL-2-CTLFireability-2024-02
FORMULA_NAME Peterson-COL-2-CTLFireability-2024-03
FORMULA_NAME Peterson-COL-2-CTLFireability-2024-04
FORMULA_NAME Peterson-COL-2-CTLFireability-2024-05
FORMULA_NAME Peterson-COL-2-CTLFireability-2024-06
FORMULA_NAME Peterson-COL-2-CTLFireability-2024-07
FORMULA_NAME Peterson-COL-2-CTLFireability-2024-08
FORMULA_NAME Peterson-COL-2-CTLFireability-2024-09
FORMULA_NAME Peterson-COL-2-CTLFireability-2024-10
FORMULA_NAME Peterson-COL-2-CTLFireability-2024-11
FORMULA_NAME Peterson-COL-2-CTLFireability-2024-12
FORMULA_NAME Peterson-COL-2-CTLFireability-2024-13
FORMULA_NAME Peterson-COL-2-CTLFireability-2024-14
FORMULA_NAME Peterson-COL-2-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717257237059

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:53:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:53:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:53:58] [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 15:53:59] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 15:53:59] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1049 ms
[2024-06-01 15:54:00] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 108 PT places and 159.0 transition bindings in 30 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
[2024-06-01 15:54:00] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 6 ms.
[2024-06-01 15:54:00] [INFO ] Skeletonized 9 HLPN properties in 2 ms. Removed 7 properties that had guard overlaps.
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 8 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 547 steps (0 resets) in 34 ms. (15 steps per ms) remains 0/11 properties
[2024-06-01 15:54:00] [INFO ] Flatten gal took : 21 ms
[2024-06-01 15:54:00] [INFO ] Flatten gal took : 4 ms
Domain [Process(3), Tour(2), Process(3)] of place BeginLoop breaks symmetries in sort Process
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.
Arc [2:1*[$i, (MOD (ADD $j 1) 2)]] contains successor/predecessor on variables of sort Tour
[2024-06-01 15:54:00] [INFO ] Unfolded HLPN to a Petri net with 108 places and 138 transitions 432 arcs in 50 ms.
[2024-06-01 15:54:00] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 12 transitions.
FORMULA Peterson-COL-2-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-CTLFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 102 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 10 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-06-01 15:54:00] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2024-06-01 15:54:00] [INFO ] Computed 11 invariants in 16 ms
[2024-06-01 15:54:00] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-06-01 15:54:00] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-06-01 15:54:00] [INFO ] Invariant cache hit.
[2024-06-01 15:54:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 15:54:00] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-06-01 15:54:00] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-06-01 15:54:00] [INFO ] Invariant cache hit.
[2024-06-01 15:54:00] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 15:54:01] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 26 ms to minimize.
[2024-06-01 15:54:01] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:54:01] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-06-01 15:54:02] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 4 ms to minimize.
[2024-06-01 15:54:02] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:54:02] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:54:02] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-06-01 15:54:02] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 2 ms to minimize.
[2024-06-01 15:54:02] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 2 ms to minimize.
[2024-06-01 15:54:02] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 3 ms to minimize.
[2024-06-01 15:54:02] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-06-01 15:54:02] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 2 ms to minimize.
[2024-06-01 15:54:02] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-06-01 15:54:02] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 2 ms to minimize.
[2024-06-01 15:54:02] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-01 15:54:03] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 2 ms to minimize.
[2024-06-01 15:54:03] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 15:54:03] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 3 ms to minimize.
[2024-06-01 15:54:03] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 15:54:04] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 15:54:04] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 3/102 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 120/222 variables, 102/134 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 22/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 0/222 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 156 constraints, problems are : Problem set: 0 solved, 123 unsolved in 8801 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 3/102 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 120/222 variables, 102/134 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 22/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 123/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (OVERLAPS) 0/222 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 279 constraints, problems are : Problem set: 0 solved, 123 unsolved in 4656 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints]
After SMT, in 13571ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 13590ms
Finished structural reductions in LTL mode , in 1 iterations and 14100 ms. Remains : 102/102 places, 126/126 transitions.
Support contains 102 out of 102 places after structural reductions.
[2024-06-01 15:54:14] [INFO ] Flatten gal took : 26 ms
[2024-06-01 15:54:14] [INFO ] Flatten gal took : 29 ms
[2024-06-01 15:54:14] [INFO ] Input system was already deterministic with 126 transitions.
RANDOM walk for 40000 steps (8 resets) in 2432 ms. (16 steps per ms) remains 4/30 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1133 ms. (35 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1032 ms. (38 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 596 ms. (67 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 637 ms. (62 steps per ms) remains 4/4 properties
[2024-06-01 15:54:16] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-06-01 15:54:16] [INFO ] Invariant cache hit.
[2024-06-01 15:54:16] [INFO ] State equation strengthened by 22 read => feed constraints.
Problem AtomicPropp8 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 60/102 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 15:54:16] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:54:16] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 2 ms to minimize.
[2024-06-01 15:54:16] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 3/14 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 15:54:16] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-06-01 15:54:16] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 2 ms to minimize.
[2024-06-01 15:54:17] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:54:17] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 15:54:17] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 5/19 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 120/222 variables, 102/121 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 22/143 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/222 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 143 constraints, problems are : Problem set: 1 solved, 3 unsolved in 592 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 72/102 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 8/19 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 15:54:17] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:54:17] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 15:54:17] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 3/22 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 120/222 variables, 102/124 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 22/146 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 3/149 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/222 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 149 constraints, problems are : Problem set: 1 solved, 3 unsolved in 423 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 11/11 constraints]
After SMT, in 1040ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 2 properties in 278 ms.
Support contains 18 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 102 transition count 90
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 66 transition count 90
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 72 place count 66 transition count 75
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 102 place count 51 transition count 75
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 114 place count 45 transition count 69
Applied a total of 114 rules in 33 ms. Remains 45 /102 variables (removed 57) and now considering 69/126 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 45/102 places, 69/126 transitions.
RANDOM walk for 40000 steps (8 resets) in 261 ms. (152 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3326 steps, run visited all 1 properties in 21 ms. (steps per millisecond=158 )
Probabilistic random walk after 3326 steps, saw 888 distinct states, run finished after 26 ms. (steps per millisecond=127 ) properties seen :1
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2024-06-01 15:54:18] [INFO ] Flatten gal took : 12 ms
[2024-06-01 15:54:18] [INFO ] Flatten gal took : 16 ms
[2024-06-01 15:54:18] [INFO ] Input system was already deterministic with 126 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 102/102 places, 126/126 transitions.
[2024-06-01 15:54:18] [INFO ] Flatten gal took : 9 ms
[2024-06-01 15:54:18] [INFO ] Flatten gal took : 10 ms
[2024-06-01 15:54:18] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 102/102 places, 126/126 transitions.
[2024-06-01 15:54:18] [INFO ] Flatten gal took : 9 ms
[2024-06-01 15:54:18] [INFO ] Flatten gal took : 10 ms
[2024-06-01 15:54:18] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 102/102 places, 126/126 transitions.
[2024-06-01 15:54:18] [INFO ] Flatten gal took : 9 ms
[2024-06-01 15:54:18] [INFO ] Flatten gal took : 16 ms
[2024-06-01 15:54:18] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 102/102 places, 126/126 transitions.
[2024-06-01 15:54:18] [INFO ] Flatten gal took : 8 ms
[2024-06-01 15:54:18] [INFO ] Flatten gal took : 9 ms
[2024-06-01 15:54:18] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 102/102 places, 126/126 transitions.
[2024-06-01 15:54:18] [INFO ] Flatten gal took : 8 ms
[2024-06-01 15:54:18] [INFO ] Flatten gal took : 9 ms
[2024-06-01 15:54:18] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 102 transition count 94
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 70 transition count 94
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 64 place count 70 transition count 74
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 104 place count 50 transition count 74
Applied a total of 104 rules in 9 ms. Remains 50 /102 variables (removed 52) and now considering 74/126 (removed 52) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 50/102 places, 74/126 transitions.
[2024-06-01 15:54:18] [INFO ] Flatten gal took : 5 ms
[2024-06-01 15:54:18] [INFO ] Flatten gal took : 6 ms
[2024-06-01 15:54:18] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 102/102 places, 126/126 transitions.
[2024-06-01 15:54:18] [INFO ] Flatten gal took : 8 ms
[2024-06-01 15:54:18] [INFO ] Flatten gal took : 9 ms
[2024-06-01 15:54:18] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 102/102 places, 126/126 transitions.
[2024-06-01 15:54:18] [INFO ] Flatten gal took : 8 ms
[2024-06-01 15:54:18] [INFO ] Flatten gal took : 9 ms
[2024-06-01 15:54:18] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 102/102 places, 126/126 transitions.
[2024-06-01 15:54:18] [INFO ] Flatten gal took : 8 ms
[2024-06-01 15:54:18] [INFO ] Flatten gal took : 9 ms
[2024-06-01 15:54:18] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 102/102 places, 126/126 transitions.
[2024-06-01 15:54:18] [INFO ] Flatten gal took : 8 ms
[2024-06-01 15:54:18] [INFO ] Flatten gal took : 8 ms
[2024-06-01 15:54:18] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 102/102 places, 126/126 transitions.
[2024-06-01 15:54:18] [INFO ] Flatten gal took : 7 ms
[2024-06-01 15:54:18] [INFO ] Flatten gal took : 8 ms
[2024-06-01 15:54:18] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 102/102 places, 126/126 transitions.
[2024-06-01 15:54:18] [INFO ] Flatten gal took : 7 ms
[2024-06-01 15:54:18] [INFO ] Flatten gal took : 8 ms
[2024-06-01 15:54:18] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 102 transition count 90
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 66 transition count 90
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 72 place count 66 transition count 72
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 108 place count 48 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 42 transition count 66
Applied a total of 120 rules in 10 ms. Remains 42 /102 variables (removed 60) and now considering 66/126 (removed 60) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 42/102 places, 66/126 transitions.
[2024-06-01 15:54:18] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:54:18] [INFO ] Flatten gal took : 5 ms
[2024-06-01 15:54:18] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 102 transition count 91
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 67 transition count 91
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 70 place count 67 transition count 75
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 102 place count 51 transition count 75
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 108 place count 48 transition count 72
Applied a total of 108 rules in 9 ms. Remains 48 /102 variables (removed 54) and now considering 72/126 (removed 54) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 48/102 places, 72/126 transitions.
[2024-06-01 15:54:18] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:54:18] [INFO ] Flatten gal took : 5 ms
[2024-06-01 15:54:18] [INFO ] Input system was already deterministic with 72 transitions.
RANDOM walk for 72 steps (0 resets) in 4 ms. (14 steps per ms) remains 0/1 properties
FORMULA Peterson-COL-2-CTLFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-01 15:54:18] [INFO ] Flatten gal took : 10 ms
[2024-06-01 15:54:18] [INFO ] Flatten gal took : 9 ms
[2024-06-01 15:54:18] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 10 ms.
[2024-06-01 15:54:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 102 places, 126 transitions and 384 arcs took 6 ms.
Total runtime 20224 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : Peterson-COL-2-CTLFireability-2024-00
Could not compute solution for formula : Peterson-COL-2-CTLFireability-2024-01
Could not compute solution for formula : Peterson-COL-2-CTLFireability-2024-02
Could not compute solution for formula : Peterson-COL-2-CTLFireability-2024-03
Could not compute solution for formula : Peterson-COL-2-CTLFireability-2024-04
Could not compute solution for formula : Peterson-COL-2-CTLFireability-2024-05
Could not compute solution for formula : Peterson-COL-2-CTLFireability-2024-06
Could not compute solution for formula : Peterson-COL-2-CTLFireability-2024-07
Could not compute solution for formula : Peterson-COL-2-CTLFireability-2024-08
Could not compute solution for formula : Peterson-COL-2-CTLFireability-2024-09
Could not compute solution for formula : Peterson-COL-2-CTLFireability-2024-10
Could not compute solution for formula : Peterson-COL-2-CTLFireability-2024-12
Could not compute solution for formula : Peterson-COL-2-CTLFireability-2024-13

BK_STOP 1717257259363

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name Peterson-COL-2-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/619/ctl_0_
ctl formula name Peterson-COL-2-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/619/ctl_1_
ctl formula name Peterson-COL-2-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/619/ctl_2_
ctl formula name Peterson-COL-2-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/619/ctl_3_
ctl formula name Peterson-COL-2-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/619/ctl_4_
ctl formula name Peterson-COL-2-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/619/ctl_5_
ctl formula name Peterson-COL-2-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/619/ctl_6_
ctl formula name Peterson-COL-2-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/619/ctl_7_
ctl formula name Peterson-COL-2-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/619/ctl_8_
ctl formula name Peterson-COL-2-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/619/ctl_9_
ctl formula name Peterson-COL-2-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/619/ctl_10_
ctl formula name Peterson-COL-2-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/619/ctl_11_
ctl formula name Peterson-COL-2-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/619/ctl_12_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-2"
export BK_EXAMINATION="CTLFireability"
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 Peterson-COL-2, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r512-smll-171654407100202"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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