fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r169-tall-167838856200641
Last Updated
May 14, 2023

About the Execution of LTSMin+red for FunctionPointer-PT-a064

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
14772.628 3584637.00 14306392.00 283.90 F?T????F????T??? normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r169-tall-167838856200641.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is FunctionPointer-PT-a064, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856200641
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 7.2K Feb 25 11:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 11:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 11:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 11:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 25 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 11:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 34K Mar 5 18:22 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 FunctionPointer-PT-a064-CTLCardinality-00
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-01
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-02
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-03
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-04
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-05
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-06
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-07
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-08
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-09
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-10
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-11
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-12
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-13
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-14
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678599343964

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-a064
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 05:35:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 05:35:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 05:35:45] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2023-03-12 05:35:45] [INFO ] Transformed 40 places.
[2023-03-12 05:35:45] [INFO ] Transformed 70 transitions.
[2023-03-12 05:35:45] [INFO ] Parsed PT model containing 40 places and 70 transitions and 284 arcs in 97 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 4 transitions.
Support contains 34 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Applied a total of 0 rules in 9 ms. Remains 34 /34 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2023-03-12 05:35:45] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
// Phase 1: matrix 46 rows 34 cols
[2023-03-12 05:35:45] [INFO ] Computed 4 place invariants in 9 ms
[2023-03-12 05:35:45] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-12 05:35:45] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2023-03-12 05:35:45] [INFO ] Invariant cache hit.
[2023-03-12 05:35:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 05:35:45] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2023-03-12 05:35:45] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2023-03-12 05:35:45] [INFO ] Invariant cache hit.
[2023-03-12 05:35:45] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 325 ms. Remains : 34/34 places, 66/66 transitions.
Support contains 34 out of 34 places after structural reductions.
[2023-03-12 05:35:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-12 05:35:46] [INFO ] Flatten gal took : 26 ms
FORMULA FunctionPointer-PT-a064-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 05:35:46] [INFO ] Flatten gal took : 9 ms
[2023-03-12 05:35:46] [INFO ] Input system was already deterministic with 66 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 61) seen :28
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 33) seen :0
Running SMT prover for 33 properties.
[2023-03-12 05:35:46] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2023-03-12 05:35:46] [INFO ] Invariant cache hit.
[2023-03-12 05:35:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 05:35:46] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 05:35:46] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :10 sat :0 real:23
[2023-03-12 05:35:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 05:35:47] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 05:35:47] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :15 sat :18
[2023-03-12 05:35:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 05:35:47] [INFO ] After 135ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :15 sat :18
[2023-03-12 05:35:47] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 5 ms to minimize.
[2023-03-12 05:35:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-03-12 05:35:47] [INFO ] After 270ms SMT Verify possible using trap constraints in natural domain returned unsat :15 sat :18
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-12 05:35:47] [INFO ] After 620ms SMT Verify possible using all constraints in natural domain returned unsat :15 sat :18
Fused 33 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 356 ms.
Support contains 16 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 66/66 transitions.
Graph (complete) has 118 edges and 34 vertex of which 32 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 removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 32 transition count 64
Applied a total of 3 rules in 17 ms. Remains 32 /34 variables (removed 2) and now considering 64/66 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 32/34 places, 64/66 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Interrupted probabilistic random walk after 321274 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{17=1}
Probabilistic random walk after 321274 steps, saw 216036 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :1
Running SMT prover for 17 properties.
[2023-03-12 05:35:51] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
// Phase 1: matrix 45 rows 32 cols
[2023-03-12 05:35:51] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-12 05:35:51] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-12 05:35:51] [INFO ] After 73ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:13
[2023-03-12 05:35:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 05:35:51] [INFO ] After 14ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-12 05:35:51] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-12 05:35:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-12 05:35:51] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-12 05:35:51] [INFO ] After 63ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-12 05:35:51] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-12 05:35:51] [INFO ] After 312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 0 properties in 91 ms.
Support contains 14 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 32 /32 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 32/32 places, 64/64 transitions.
Incomplete random walk after 10040 steps, including 24 resets, run finished after 53 ms. (steps per millisecond=189 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 373708 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :{}
Probabilistic random walk after 373708 steps, saw 250834 distinct states, run finished after 3002 ms. (steps per millisecond=124 ) properties seen :0
Running SMT prover for 17 properties.
[2023-03-12 05:35:54] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
[2023-03-12 05:35:54] [INFO ] Invariant cache hit.
[2023-03-12 05:35:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 05:35:54] [INFO ] After 82ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:13
[2023-03-12 05:35:54] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 05:35:54] [INFO ] After 12ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-12 05:35:54] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-12 05:35:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 05:35:55] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-12 05:35:55] [INFO ] After 38ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-12 05:35:55] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-12 05:35:55] [INFO ] After 284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 0 properties in 182 ms.
Support contains 14 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 32/32 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-12 05:35:55] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
[2023-03-12 05:35:55] [INFO ] Invariant cache hit.
[2023-03-12 05:35:55] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-12 05:35:55] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
[2023-03-12 05:35:55] [INFO ] Invariant cache hit.
[2023-03-12 05:35:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 05:35:55] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-12 05:35:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 05:35:55] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
[2023-03-12 05:35:55] [INFO ] Invariant cache hit.
[2023-03-12 05:35:55] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 32/32 places, 64/64 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 32 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 31 transition count 44
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 21 place count 31 transition count 42
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 29 transition count 42
Applied a total of 25 rules in 5 ms. Remains 29 /32 variables (removed 3) and now considering 42/64 (removed 22) transitions.
Running SMT prover for 17 properties.
// Phase 1: matrix 42 rows 29 cols
[2023-03-12 05:35:55] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-12 05:35:55] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 05:35:55] [INFO ] After 57ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:13
[2023-03-12 05:35:55] [INFO ] After 70ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:16
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-12 05:35:55] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:16
[2023-03-12 05:35:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-12 05:35:55] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-12 05:35:55] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2023-03-12 05:35:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-03-12 05:35:55] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-12 05:35:55] [INFO ] After 189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Successfully simplified 15 atomic propositions for a total of 15 simplifications.
FORMULA FunctionPointer-PT-a064-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a064-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 05:35:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-12 05:35:55] [INFO ] Flatten gal took : 6 ms
FORMULA FunctionPointer-PT-a064-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 05:35:55] [INFO ] Flatten gal took : 6 ms
[2023-03-12 05:35:55] [INFO ] Input system was already deterministic with 66 transitions.
Computed a total of 3 stabilizing places and 8 stable transitions
Graph (complete) has 153 edges and 34 vertex of which 31 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 30 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 30 transition count 62
Applied a total of 7 rules in 4 ms. Remains 30 /34 variables (removed 4) and now considering 62/66 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 30/34 places, 62/66 transitions.
[2023-03-12 05:35:55] [INFO ] Flatten gal took : 14 ms
[2023-03-12 05:35:55] [INFO ] Flatten gal took : 7 ms
[2023-03-12 05:35:55] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 32 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 31 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 31 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 31 transition count 62
Applied a total of 6 rules in 2 ms. Remains 31 /34 variables (removed 3) and now considering 62/66 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 31/34 places, 62/66 transitions.
[2023-03-12 05:35:55] [INFO ] Flatten gal took : 3 ms
[2023-03-12 05:35:55] [INFO ] Flatten gal took : 4 ms
[2023-03-12 05:35:55] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 30 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 30 transition count 62
Applied a total of 7 rules in 1 ms. Remains 30 /34 variables (removed 4) and now considering 62/66 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/34 places, 62/66 transitions.
[2023-03-12 05:35:55] [INFO ] Flatten gal took : 13 ms
[2023-03-12 05:35:55] [INFO ] Flatten gal took : 3 ms
[2023-03-12 05:35:56] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 30 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 30 transition count 62
Applied a total of 7 rules in 19 ms. Remains 30 /34 variables (removed 4) and now considering 62/66 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 30/34 places, 62/66 transitions.
[2023-03-12 05:35:56] [INFO ] Flatten gal took : 3 ms
[2023-03-12 05:35:56] [INFO ] Flatten gal took : 3 ms
[2023-03-12 05:35:56] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Applied a total of 3 rules in 1 ms. Remains 31 /34 variables (removed 3) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/34 places, 66/66 transitions.
[2023-03-12 05:35:56] [INFO ] Flatten gal took : 3 ms
[2023-03-12 05:35:56] [INFO ] Flatten gal took : 4 ms
[2023-03-12 05:35:56] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 30 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 30 transition count 62
Applied a total of 7 rules in 1 ms. Remains 30 /34 variables (removed 4) and now considering 62/66 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/34 places, 62/66 transitions.
[2023-03-12 05:35:56] [INFO ] Flatten gal took : 3 ms
[2023-03-12 05:35:56] [INFO ] Flatten gal took : 3 ms
[2023-03-12 05:35:56] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Applied a total of 3 rules in 1 ms. Remains 31 /34 variables (removed 3) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 31/34 places, 66/66 transitions.
[2023-03-12 05:35:56] [INFO ] Flatten gal took : 3 ms
[2023-03-12 05:35:56] [INFO ] Flatten gal took : 3 ms
[2023-03-12 05:35:56] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Applied a total of 3 rules in 5 ms. Remains 31 /34 variables (removed 3) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 31/34 places, 66/66 transitions.
[2023-03-12 05:35:56] [INFO ] Flatten gal took : 3 ms
[2023-03-12 05:35:56] [INFO ] Flatten gal took : 4 ms
[2023-03-12 05:35:56] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 30 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 30 transition count 62
Applied a total of 7 rules in 2 ms. Remains 30 /34 variables (removed 4) and now considering 62/66 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 30/34 places, 62/66 transitions.
[2023-03-12 05:35:56] [INFO ] Flatten gal took : 3 ms
[2023-03-12 05:35:56] [INFO ] Flatten gal took : 3 ms
[2023-03-12 05:35:56] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Applied a total of 3 rules in 1 ms. Remains 31 /34 variables (removed 3) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/34 places, 66/66 transitions.
[2023-03-12 05:35:56] [INFO ] Flatten gal took : 3 ms
[2023-03-12 05:35:56] [INFO ] Flatten gal took : 3 ms
[2023-03-12 05:35:56] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 32 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 31 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 31 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 31 transition count 62
Applied a total of 6 rules in 1 ms. Remains 31 /34 variables (removed 3) and now considering 62/66 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/34 places, 62/66 transitions.
[2023-03-12 05:35:56] [INFO ] Flatten gal took : 3 ms
[2023-03-12 05:35:56] [INFO ] Flatten gal took : 3 ms
[2023-03-12 05:35:56] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Graph (complete) has 153 edges and 34 vertex of which 31 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 30 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 30 transition count 62
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 30 transition count 60
Applied a total of 7 rules in 7 ms. Remains 30 /34 variables (removed 4) and now considering 60/66 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 30/34 places, 60/66 transitions.
[2023-03-12 05:35:56] [INFO ] Flatten gal took : 2 ms
[2023-03-12 05:35:56] [INFO ] Flatten gal took : 7 ms
[2023-03-12 05:35:56] [INFO ] Input system was already deterministic with 60 transitions.
[2023-03-12 05:35:56] [INFO ] Flatten gal took : 3 ms
[2023-03-12 05:35:56] [INFO ] Flatten gal took : 4 ms
[2023-03-12 05:35:56] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-12 05:35:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 34 places, 66 transitions and 268 arcs took 1 ms.
Total runtime 10926 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/511/ctl_0_ --ctl=/tmp/511/ctl_1_ --ctl=/tmp/511/ctl_2_ --ctl=/tmp/511/ctl_3_ --ctl=/tmp/511/ctl_4_ --ctl=/tmp/511/ctl_5_ --ctl=/tmp/511/ctl_6_ --ctl=/tmp/511/ctl_7_ --ctl=/tmp/511/ctl_8_ --ctl=/tmp/511/ctl_9_ --ctl=/tmp/511/ctl_10_ --ctl=/tmp/511/ctl_11_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 1373760 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16097984 kB
Could not compute solution for formula : FunctionPointer-PT-a064-CTLCardinality-01
Could not compute solution for formula : FunctionPointer-PT-a064-CTLCardinality-03
Could not compute solution for formula : FunctionPointer-PT-a064-CTLCardinality-04
Could not compute solution for formula : FunctionPointer-PT-a064-CTLCardinality-05
Could not compute solution for formula : FunctionPointer-PT-a064-CTLCardinality-06
Could not compute solution for formula : FunctionPointer-PT-a064-CTLCardinality-08
Could not compute solution for formula : FunctionPointer-PT-a064-CTLCardinality-09
Could not compute solution for formula : FunctionPointer-PT-a064-CTLCardinality-10
Could not compute solution for formula : FunctionPointer-PT-a064-CTLCardinality-11
Could not compute solution for formula : FunctionPointer-PT-a064-CTLCardinality-13
Could not compute solution for formula : FunctionPointer-PT-a064-CTLCardinality-14
Could not compute solution for formula : FunctionPointer-PT-a064-CTLCardinality-15

BK_STOP 1678602928601

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2023
ctl formula name FunctionPointer-PT-a064-CTLCardinality-01
ctl formula formula --ctl=/tmp/511/ctl_0_
ctl formula name FunctionPointer-PT-a064-CTLCardinality-03
ctl formula formula --ctl=/tmp/511/ctl_1_
ctl formula name FunctionPointer-PT-a064-CTLCardinality-04
ctl formula formula --ctl=/tmp/511/ctl_2_
ctl formula name FunctionPointer-PT-a064-CTLCardinality-05
ctl formula formula --ctl=/tmp/511/ctl_3_
ctl formula name FunctionPointer-PT-a064-CTLCardinality-06
ctl formula formula --ctl=/tmp/511/ctl_4_
ctl formula name FunctionPointer-PT-a064-CTLCardinality-08
ctl formula formula --ctl=/tmp/511/ctl_5_
ctl formula name FunctionPointer-PT-a064-CTLCardinality-09
ctl formula formula --ctl=/tmp/511/ctl_6_
ctl formula name FunctionPointer-PT-a064-CTLCardinality-10
ctl formula formula --ctl=/tmp/511/ctl_7_
ctl formula name FunctionPointer-PT-a064-CTLCardinality-11
ctl formula formula --ctl=/tmp/511/ctl_8_
ctl formula name FunctionPointer-PT-a064-CTLCardinality-13
ctl formula formula --ctl=/tmp/511/ctl_9_
ctl formula name FunctionPointer-PT-a064-CTLCardinality-14
ctl formula formula --ctl=/tmp/511/ctl_10_
ctl formula name FunctionPointer-PT-a064-CTLCardinality-15
ctl formula formula --ctl=/tmp/511/ctl_11_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 34 places, 66 transitions and 268 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 66->56 groups
pnml2lts-sym: Regrouping took 0.000 real 0.010 user 0.000 sys
pnml2lts-sym: state vector length is 34; there are 56 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 517
Killing (9) : 517

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="FunctionPointer-PT-a064"
export BK_EXAMINATION="CTLCardinality"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is FunctionPointer-PT-a064, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r169-tall-167838856200641"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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