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

About the Execution of LTSMin+red for CANConstruction-PT-060

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3904.428 3600000.00 14043715.00 91.10 ??FFTFFTTTFTFTTT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813695000663.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CANConstruction-PT-060, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695000663
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.9M
-rw-r--r-- 1 mcc users 9.0K Feb 25 22:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 22:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 22:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 22:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Feb 25 22:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 219K Feb 25 22:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 22:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 22:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 5.4M 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 CANConstruction-PT-060-ReachabilityFireability-00
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-01
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-02
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-03
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-04
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-05
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-06
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-07
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-08
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-09
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-10
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-11
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-12
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-13
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-14
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678654886629

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-060
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 21:01:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 21:01:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 21:01:28] [INFO ] Load time of PNML (sax parser for PT used): 329 ms
[2023-03-12 21:01:28] [INFO ] Transformed 7922 places.
[2023-03-12 21:01:28] [INFO ] Transformed 14880 transitions.
[2023-03-12 21:01:28] [INFO ] Parsed PT model containing 7922 places and 14880 transitions and 44400 arcs in 476 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 9 resets, run finished after 562 ms. (steps per millisecond=17 ) properties (out of 16) seen :9
FORMULA CANConstruction-PT-060-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 14880 rows 7922 cols
[2023-03-12 21:01:30] [INFO ] Computed 121 place invariants in 251 ms
[2023-03-12 21:01:32] [INFO ] [Real]Absence check using 61 positive place invariants in 160 ms returned sat
[2023-03-12 21:01:32] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 108 ms returned sat
[2023-03-12 21:01:41] [INFO ] After 11743ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 21:01:44] [INFO ] [Nat]Absence check using 61 positive place invariants in 201 ms returned sat
[2023-03-12 21:01:44] [INFO ] [Nat]Absence check using 61 positive and 60 generalized place invariants in 129 ms returned sat
[2023-03-12 21:01:55] [INFO ] After 10429ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 21:01:55] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-12 21:02:02] [INFO ] After 6707ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-12 21:02:06] [INFO ] After 11125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-12 21:02:06] [INFO ] After 25040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 7 Parikh solutions to 6 different solutions.
FORMULA CANConstruction-PT-060-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 157 ms.
Support contains 49 out of 7922 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7922/7922 places, 14880/14880 transitions.
Drop transitions removed 399 transitions
Trivial Post-agglo rules discarded 399 transitions
Performed 399 trivial Post agglomeration. Transition count delta: 399
Iterating post reduction 0 with 399 rules applied. Total rules applied 399 place count 7922 transition count 14481
Reduce places removed 399 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 401 rules applied. Total rules applied 800 place count 7523 transition count 14479
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 802 place count 7521 transition count 14479
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 802 place count 7521 transition count 14472
Deduced a syphon composed of 7 places in 9 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 816 place count 7514 transition count 14472
Discarding 3457 places :
Symmetric choice reduction at 3 with 3457 rule applications. Total rules 4273 place count 4057 transition count 7558
Iterating global reduction 3 with 3457 rules applied. Total rules applied 7730 place count 4057 transition count 7558
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 3 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 7836 place count 4004 transition count 7505
Free-agglomeration rule applied 79 times.
Iterating global reduction 3 with 79 rules applied. Total rules applied 7915 place count 4004 transition count 7426
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 3 with 79 rules applied. Total rules applied 7994 place count 3925 transition count 7426
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 4 with 11 rules applied. Total rules applied 8005 place count 3925 transition count 7415
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 8016 place count 3914 transition count 7415
Partial Free-agglomeration rule applied 44 times.
Drop transitions removed 44 transitions
Iterating global reduction 5 with 44 rules applied. Total rules applied 8060 place count 3914 transition count 7415
Applied a total of 8060 rules in 4680 ms. Remains 3914 /7922 variables (removed 4008) and now considering 7415/14880 (removed 7465) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4682 ms. Remains : 3914/7922 places, 7415/14880 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 6) seen :2
FORMULA CANConstruction-PT-060-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 7415 rows 3914 cols
[2023-03-12 21:02:12] [INFO ] Computed 121 place invariants in 65 ms
[2023-03-12 21:02:12] [INFO ] [Real]Absence check using 61 positive place invariants in 67 ms returned sat
[2023-03-12 21:02:12] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 33 ms returned sat
[2023-03-12 21:02:15] [INFO ] After 3118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 21:02:16] [INFO ] [Nat]Absence check using 61 positive place invariants in 78 ms returned sat
[2023-03-12 21:02:16] [INFO ] [Nat]Absence check using 61 positive and 60 generalized place invariants in 40 ms returned sat
[2023-03-12 21:02:19] [INFO ] After 3289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 21:02:19] [INFO ] State equation strengthened by 7217 read => feed constraints.
[2023-03-12 21:02:22] [INFO ] After 2585ms SMT Verify possible using 7217 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 21:02:24] [INFO ] After 4648ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1543 ms.
[2023-03-12 21:02:25] [INFO ] After 10627ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
FORMULA CANConstruction-PT-060-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 38 ms.
Support contains 40 out of 3914 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3914/3914 places, 7415/7415 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 3907 transition count 7408
Applied a total of 14 rules in 1170 ms. Remains 3907 /3914 variables (removed 7) and now considering 7408/7415 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1170 ms. Remains : 3907/3914 places, 7408/7415 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 3) seen :1
FORMULA CANConstruction-PT-060-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 7408 rows 3907 cols
[2023-03-12 21:02:27] [INFO ] Computed 121 place invariants in 78 ms
[2023-03-12 21:02:28] [INFO ] [Real]Absence check using 61 positive place invariants in 117 ms returned sat
[2023-03-12 21:02:28] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 49 ms returned sat
[2023-03-12 21:02:31] [INFO ] After 3852ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 21:02:32] [INFO ] [Nat]Absence check using 61 positive place invariants in 115 ms returned sat
[2023-03-12 21:02:32] [INFO ] [Nat]Absence check using 61 positive and 60 generalized place invariants in 48 ms returned sat
[2023-03-12 21:02:35] [INFO ] After 3052ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 21:02:35] [INFO ] State equation strengthened by 7224 read => feed constraints.
[2023-03-12 21:02:37] [INFO ] After 1771ms SMT Verify possible using 7224 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 21:02:38] [INFO ] After 2906ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 731 ms.
[2023-03-12 21:02:39] [INFO ] After 7576ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 24 ms.
Support contains 39 out of 3907 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3907/3907 places, 7408/7408 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3906 transition count 7407
Applied a total of 2 rules in 1279 ms. Remains 3906 /3907 variables (removed 1) and now considering 7407/7408 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1280 ms. Remains : 3906/3907 places, 7407/7408 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 66973 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66973 steps, saw 47120 distinct states, run finished after 3003 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 7407 rows 3906 cols
[2023-03-12 21:02:43] [INFO ] Computed 121 place invariants in 43 ms
[2023-03-12 21:02:44] [INFO ] [Real]Absence check using 61 positive place invariants in 86 ms returned sat
[2023-03-12 21:02:44] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 43 ms returned sat
[2023-03-12 21:02:47] [INFO ] After 3369ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 21:02:47] [INFO ] [Nat]Absence check using 61 positive place invariants in 86 ms returned sat
[2023-03-12 21:02:47] [INFO ] [Nat]Absence check using 61 positive and 60 generalized place invariants in 35 ms returned sat
[2023-03-12 21:02:50] [INFO ] After 2841ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 21:02:50] [INFO ] State equation strengthened by 7225 read => feed constraints.
[2023-03-12 21:02:52] [INFO ] After 1712ms SMT Verify possible using 7225 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 21:02:53] [INFO ] After 2860ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1017 ms.
[2023-03-12 21:02:54] [INFO ] After 7575ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 19 ms.
Support contains 39 out of 3906 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3906/3906 places, 7407/7407 transitions.
Applied a total of 0 rules in 738 ms. Remains 3906 /3906 variables (removed 0) and now considering 7407/7407 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 741 ms. Remains : 3906/3906 places, 7407/7407 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3906/3906 places, 7407/7407 transitions.
Applied a total of 0 rules in 688 ms. Remains 3906 /3906 variables (removed 0) and now considering 7407/7407 (removed 0) transitions.
[2023-03-12 21:02:56] [INFO ] Invariant cache hit.
[2023-03-12 21:03:00] [INFO ] Implicit Places using invariants in 4204 ms returned []
[2023-03-12 21:03:00] [INFO ] Invariant cache hit.
[2023-03-12 21:03:04] [INFO ] Implicit Places using invariants and state equation in 3993 ms returned []
Implicit Place search using SMT with State Equation took 8201 ms to find 0 implicit places.
[2023-03-12 21:03:05] [INFO ] Redundant transitions in 797 ms returned []
[2023-03-12 21:03:05] [INFO ] Invariant cache hit.
[2023-03-12 21:03:09] [INFO ] Dead Transitions using invariants and state equation in 4291 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13989 ms. Remains : 3906/3906 places, 7407/7407 transitions.
Graph (trivial) has 6851 edges and 3906 vertex of which 3225 / 3906 are part of one of the 53 SCC in 7 ms
Free SCC test removed 3172 places
Drop transitions removed 6283 transitions
Reduce isomorphic transitions removed 6283 transitions.
Graph (complete) has 1506 edges and 734 vertex of which 552 are kept as prefixes of interest. Removing 182 places using SCC suffix rule.1 ms
Discarding 182 places :
Also discarding 90 output transitions
Drop transitions removed 90 transitions
Ensure Unique test removed 8 places
Drop transitions removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Drop transitions removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 190 rules applied. Total rules applied 192 place count 544 transition count 852
Reduce places removed 117 places and 0 transitions.
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Performed 302 Post agglomeration using F-continuation condition.Transition count delta: 302
Iterating post reduction 1 with 534 rules applied. Total rules applied 726 place count 427 transition count 435
Reduce places removed 302 places and 0 transitions.
Ensure Unique test removed 288 transitions
Reduce isomorphic transitions removed 288 transitions.
Iterating post reduction 2 with 590 rules applied. Total rules applied 1316 place count 125 transition count 147
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 1316 place count 125 transition count 133
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 1344 place count 111 transition count 133
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1351 place count 104 transition count 126
Iterating global reduction 3 with 7 rules applied. Total rules applied 1358 place count 104 transition count 126
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1358 place count 104 transition count 125
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1360 place count 103 transition count 125
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1362 place count 102 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1364 place count 101 transition count 123
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 1366 place count 101 transition count 121
Free-agglomeration rule applied 15 times.
Iterating global reduction 3 with 15 rules applied. Total rules applied 1381 place count 101 transition count 106
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 1397 place count 86 transition count 105
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 1406 place count 86 transition count 105
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1415 place count 77 transition count 96
Iterating global reduction 4 with 9 rules applied. Total rules applied 1424 place count 77 transition count 96
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1425 place count 76 transition count 95
Applied a total of 1425 rules in 78 ms. Remains 76 /3906 variables (removed 3830) and now considering 95/7407 (removed 7312) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 95 rows 76 cols
[2023-03-12 21:03:09] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-12 21:03:09] [INFO ] [Real]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-03-12 21:03:09] [INFO ] [Real]Absence check using 17 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-12 21:03:09] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 21:03:09] [INFO ] [Nat]Absence check using 17 positive place invariants in 1 ms returned sat
[2023-03-12 21:03:09] [INFO ] [Nat]Absence check using 17 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-12 21:03:09] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 21:03:09] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-12 21:03:09] [INFO ] After 116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-12 21:03:09] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-12 21:03:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3906 places, 7407 transitions and 29605 arcs took 32 ms.
[2023-03-12 21:03:10] [INFO ] Flatten gal took : 415 ms
Total runtime 102126 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 --inv-bin-par --invariant=/tmp/531/inv_0_ --invariant=/tmp/531/inv_1_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 12232396 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16090828 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023

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="CANConstruction-PT-060"
export BK_EXAMINATION="ReachabilityFireability"
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 CANConstruction-PT-060, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813695000663"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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