fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r312-tall-165472281800094
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for BugTracking-PT-q8m016

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4489.628 3600000.00 13991592.00 381.40 T??TTTTTTFFFFTTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r312-tall-165472281800094.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BugTracking-PT-q8m016, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472281800094
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.5K Jun 7 16:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Jun 7 16:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 7 16:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 7 16:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K Jun 6 15:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 15K Jun 7 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Jun 7 17:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Jun 7 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Jun 7 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 16M Jun 6 12:11 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 BugTracking-PT-q8m016-ReachabilityCardinality-00
FORMULA_NAME BugTracking-PT-q8m016-ReachabilityCardinality-01
FORMULA_NAME BugTracking-PT-q8m016-ReachabilityCardinality-02
FORMULA_NAME BugTracking-PT-q8m016-ReachabilityCardinality-03
FORMULA_NAME BugTracking-PT-q8m016-ReachabilityCardinality-04
FORMULA_NAME BugTracking-PT-q8m016-ReachabilityCardinality-05
FORMULA_NAME BugTracking-PT-q8m016-ReachabilityCardinality-06
FORMULA_NAME BugTracking-PT-q8m016-ReachabilityCardinality-07
FORMULA_NAME BugTracking-PT-q8m016-ReachabilityCardinality-08
FORMULA_NAME BugTracking-PT-q8m016-ReachabilityCardinality-09
FORMULA_NAME BugTracking-PT-q8m016-ReachabilityCardinality-10
FORMULA_NAME BugTracking-PT-q8m016-ReachabilityCardinality-11
FORMULA_NAME BugTracking-PT-q8m016-ReachabilityCardinality-12
FORMULA_NAME BugTracking-PT-q8m016-ReachabilityCardinality-13
FORMULA_NAME BugTracking-PT-q8m016-ReachabilityCardinality-14
FORMULA_NAME BugTracking-PT-q8m016-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654759914762

Running Version 202205111006
[2022-06-09 07:31:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 07:31:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 07:31:56] [INFO ] Load time of PNML (sax parser for PT used): 821 ms
[2022-06-09 07:31:56] [INFO ] Transformed 754 places.
[2022-06-09 07:31:57] [INFO ] Transformed 27370 transitions.
[2022-06-09 07:31:57] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 1041 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 474 places in 133 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m016-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 28 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 122133 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122133 steps, saw 64985 distinct states, run finished after 3002 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 3 properties.
[2022-06-09 07:32:00] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2022-06-09 07:32:00] [INFO ] Computed 10 place invariants in 48 ms
[2022-06-09 07:32:01] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-09 07:32:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 07:32:02] [INFO ] After 946ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-06-09 07:32:02] [INFO ] State equation strengthened by 303 read => feed constraints.
[2022-06-09 07:32:02] [INFO ] After 447ms SMT Verify possible using 303 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2022-06-09 07:32:03] [INFO ] Deduced a trap composed of 32 places in 374 ms of which 5 ms to minimize.
[2022-06-09 07:32:03] [INFO ] Deduced a trap composed of 31 places in 364 ms of which 1 ms to minimize.
[2022-06-09 07:32:04] [INFO ] Deduced a trap composed of 15 places in 283 ms of which 1 ms to minimize.
[2022-06-09 07:32:04] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 3 ms to minimize.
[2022-06-09 07:32:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1599 ms
[2022-06-09 07:32:04] [INFO ] After 2457ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 346 ms.
[2022-06-09 07:32:05] [INFO ] After 3884ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
FORMULA BugTracking-PT-q8m016-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3924 ms.
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.24 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 368 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/280 places, 3871/3904 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5126 ms. (steps per millisecond=195 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2945 ms. (steps per millisecond=339 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2833 ms. (steps per millisecond=352 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1219655 steps, run timeout after 30001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 1219655 steps, saw 719309 distinct states, run finished after 30002 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-09 07:32:50] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 07:32:50] [INFO ] Computed 8 place invariants in 23 ms
[2022-06-09 07:32:50] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-09 07:32:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 07:32:51] [INFO ] After 725ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-09 07:32:51] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 07:32:51] [INFO ] After 418ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-09 07:32:51] [INFO ] After 694ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 172 ms.
[2022-06-09 07:32:52] [INFO ] After 1669ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 65 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 84 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 07:32:52] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 07:32:52] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 07:32:52] [INFO ] Implicit Places using invariants in 494 ms returned []
[2022-06-09 07:32:52] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 07:32:52] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 07:32:53] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 07:32:54] [INFO ] Implicit Places using invariants and state equation in 2035 ms returned []
Implicit Place search using SMT with State Equation took 2534 ms to find 0 implicit places.
[2022-06-09 07:32:55] [INFO ] Redundant transitions in 300 ms returned []
[2022-06-09 07:32:55] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 07:32:55] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 07:32:56] [INFO ] Dead Transitions using invariants and state equation in 1015 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Incomplete random walk after 100008 steps, including 2 resets, run finished after 591 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-06-09 07:32:56] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 07:32:56] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-09 07:32:56] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-09 07:32:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-06-09 07:32:57] [INFO ] After 722ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-09 07:32:57] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 07:32:57] [INFO ] After 399ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-09 07:32:58] [INFO ] After 675ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 171 ms.
[2022-06-09 07:32:58] [INFO ] After 1624ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4656 ms. (steps per millisecond=214 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 3013 ms. (steps per millisecond=331 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2910 ms. (steps per millisecond=343 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1227601 steps, run timeout after 30001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 1227601 steps, saw 721789 distinct states, run finished after 30003 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-09 07:33:38] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 07:33:39] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 07:33:39] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-09 07:33:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 07:33:39] [INFO ] After 681ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-09 07:33:39] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 07:33:40] [INFO ] After 412ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-09 07:33:40] [INFO ] After 693ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 173 ms.
[2022-06-09 07:33:40] [INFO ] After 1611ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 61 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 58 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 07:33:40] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 07:33:40] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 07:33:41] [INFO ] Implicit Places using invariants in 440 ms returned []
[2022-06-09 07:33:41] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 07:33:41] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 07:33:41] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 07:33:43] [INFO ] Implicit Places using invariants and state equation in 2035 ms returned []
Implicit Place search using SMT with State Equation took 2478 ms to find 0 implicit places.
[2022-06-09 07:33:43] [INFO ] Redundant transitions in 236 ms returned []
[2022-06-09 07:33:43] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 07:33:43] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 07:33:44] [INFO ] Dead Transitions using invariants and state equation in 1030 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Incomplete random walk after 100005 steps, including 2 resets, run finished after 580 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-06-09 07:33:45] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 07:33:45] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 07:33:45] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-09 07:33:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 07:33:45] [INFO ] After 677ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-09 07:33:45] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 07:33:46] [INFO ] After 395ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-09 07:33:46] [INFO ] After 672ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 174 ms.
[2022-06-09 07:33:46] [INFO ] After 1593ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Incomplete random walk after 10010 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 151977 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 151977 steps, saw 63511 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-09 07:33:49] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 07:33:49] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 07:33:49] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 07:33:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 07:33:50] [INFO ] After 619ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 07:33:50] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 07:33:50] [INFO ] After 275ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 07:33:51] [INFO ] After 396ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 107 ms.
[2022-06-09 07:33:51] [INFO ] After 1180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 61 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Incomplete random walk after 10008 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 151713 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 151713 steps, saw 63334 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-09 07:33:54] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 07:33:54] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 07:33:54] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 07:33:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 07:33:54] [INFO ] After 597ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 07:33:54] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 07:33:55] [INFO ] After 277ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 07:33:55] [INFO ] After 395ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 103 ms.
[2022-06-09 07:33:55] [INFO ] After 1146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 75 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 53 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 07:33:55] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 07:33:55] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-09 07:33:55] [INFO ] Implicit Places using invariants in 400 ms returned []
[2022-06-09 07:33:55] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 07:33:55] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-09 07:33:56] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 07:33:57] [INFO ] Implicit Places using invariants and state equation in 2024 ms returned []
Implicit Place search using SMT with State Equation took 2426 ms to find 0 implicit places.
[2022-06-09 07:33:58] [INFO ] Redundant transitions in 140 ms returned []
[2022-06-09 07:33:58] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 07:33:58] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 07:33:59] [INFO ] Dead Transitions using invariants and state equation in 995 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 269 transition count 3698
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 177 place count 267 transition count 3696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 267 transition count 3695
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 267 transition count 3691
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 263 transition count 3691
Applied a total of 186 rules in 261 ms. Remains 263 /269 variables (removed 6) and now considering 3691/3871 (removed 180) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3691 rows 263 cols
[2022-06-09 07:33:59] [INFO ] Computed 9 place invariants in 11 ms
[2022-06-09 07:33:59] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 07:33:59] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-06-09 07:34:00] [INFO ] After 626ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 07:34:00] [INFO ] After 736ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2022-06-09 07:34:00] [INFO ] After 856ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10008 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 154995 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 154995 steps, saw 65533 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-09 07:34:03] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 07:34:03] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 07:34:03] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 07:34:04] [INFO ] After 625ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-09 07:34:04] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 07:34:04] [INFO ] After 195ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 07:34:04] [INFO ] After 876ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 07:34:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-06-09 07:34:05] [INFO ] After 615ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 07:34:05] [INFO ] After 263ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 07:34:05] [INFO ] Deduced a trap composed of 5 places in 305 ms of which 0 ms to minimize.
[2022-06-09 07:34:05] [INFO ] Deduced a trap composed of 18 places in 264 ms of which 0 ms to minimize.
[2022-06-09 07:34:06] [INFO ] Deduced a trap composed of 41 places in 290 ms of which 0 ms to minimize.
[2022-06-09 07:34:06] [INFO ] Deduced a trap composed of 16 places in 268 ms of which 1 ms to minimize.
[2022-06-09 07:34:07] [INFO ] Deduced a trap composed of 22 places in 275 ms of which 0 ms to minimize.
[2022-06-09 07:34:07] [INFO ] Deduced a trap composed of 17 places in 253 ms of which 0 ms to minimize.
[2022-06-09 07:34:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2139 ms
[2022-06-09 07:34:07] [INFO ] After 2468ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2022-06-09 07:34:07] [INFO ] After 3210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 48 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Incomplete random walk after 10014 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=385 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 155447 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 155447 steps, saw 65837 distinct states, run finished after 3002 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-09 07:34:10] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 07:34:10] [INFO ] Computed 8 place invariants in 19 ms
[2022-06-09 07:34:10] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-06-09 07:34:11] [INFO ] After 611ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-09 07:34:11] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 07:34:11] [INFO ] After 223ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 07:34:11] [INFO ] After 896ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 07:34:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-06-09 07:34:12] [INFO ] After 606ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 07:34:12] [INFO ] After 259ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 07:34:12] [INFO ] Deduced a trap composed of 5 places in 298 ms of which 0 ms to minimize.
[2022-06-09 07:34:13] [INFO ] Deduced a trap composed of 18 places in 272 ms of which 1 ms to minimize.
[2022-06-09 07:34:13] [INFO ] Deduced a trap composed of 41 places in 267 ms of which 1 ms to minimize.
[2022-06-09 07:34:13] [INFO ] Deduced a trap composed of 16 places in 273 ms of which 0 ms to minimize.
[2022-06-09 07:34:14] [INFO ] Deduced a trap composed of 22 places in 271 ms of which 1 ms to minimize.
[2022-06-09 07:34:14] [INFO ] Deduced a trap composed of 17 places in 263 ms of which 0 ms to minimize.
[2022-06-09 07:34:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2135 ms
[2022-06-09 07:34:14] [INFO ] After 2447ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2022-06-09 07:34:14] [INFO ] After 3183ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 57 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 63 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 07:34:14] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 07:34:14] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 07:34:15] [INFO ] Implicit Places using invariants in 396 ms returned []
[2022-06-09 07:34:15] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 07:34:15] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 07:34:15] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 07:34:17] [INFO ] Implicit Places using invariants and state equation in 1991 ms returned []
Implicit Place search using SMT with State Equation took 2389 ms to find 0 implicit places.
[2022-06-09 07:34:17] [INFO ] Redundant transitions in 138 ms returned []
[2022-06-09 07:34:17] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 07:34:17] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 07:34:18] [INFO ] Dead Transitions using invariants and state equation in 994 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 269 transition count 3698
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 177 place count 267 transition count 3696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 267 transition count 3695
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 267 transition count 3691
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 263 transition count 3691
Applied a total of 186 rules in 239 ms. Remains 263 /269 variables (removed 6) and now considering 3691/3871 (removed 180) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3691 rows 263 cols
[2022-06-09 07:34:18] [INFO ] Computed 9 place invariants in 16 ms
[2022-06-09 07:34:18] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-06-09 07:34:19] [INFO ] After 614ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-09 07:34:19] [INFO ] After 730ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2022-06-09 07:34:19] [INFO ] After 839ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 269 transition count 3698
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 177 place count 267 transition count 3696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 267 transition count 3695
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 267 transition count 3691
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 263 transition count 3691
Applied a total of 186 rules in 252 ms. Remains 263 /269 variables (removed 6) and now considering 3691/3871 (removed 180) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 3691 rows 263 cols
[2022-06-09 07:34:19] [INFO ] Computed 9 place invariants in 11 ms
[2022-06-09 07:34:19] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-09 07:34:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-06-09 07:34:20] [INFO ] After 660ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-09 07:34:20] [INFO ] After 895ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 134 ms.
[2022-06-09 07:34:20] [INFO ] After 1079ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-09 07:34:21] [INFO ] Flatten gal took : 382 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12945579479627116655
[2022-06-09 07:34:21] [INFO ] Too many transitions (3871) to apply POR reductions. Disabling POR matrices.
[2022-06-09 07:34:21] [INFO ] Applying decomposition
[2022-06-09 07:34:21] [INFO ] Built C files in 177ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12945579479627116655
Running compilation step : cd /tmp/ltsmin12945579479627116655;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-09 07:34:22] [INFO ] Flatten gal took : 526 ms
[2022-06-09 07:34:22] [INFO ] Flatten gal took : 443 ms
Compilation finished in 11288 ms.
Running link step : cd /tmp/ltsmin12945579479627116655;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin12945579479627116655;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'BugTrackingPTq8m016ReachabilityCardinality01==true'
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin12945579479627116655;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'BugTrackingPTq8m016ReachabilityCardinality01==true'
Running LTSmin : cd /tmp/ltsmin12945579479627116655;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'BugTrackingPTq8m016ReachabilityCardinality02==true'

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="BugTracking-PT-q8m016"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is BugTracking-PT-q8m016, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r312-tall-165472281800094"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m016.tgz
mv BugTracking-PT-q8m016 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;