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.r037-tajo-167813690300411.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 itstools
Input is BugTracking-PT-q8m016, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690300411
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.8K Feb 26 08:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 08:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 07:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 07:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 08:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 26 08:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 08:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Feb 26 08:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M 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 BugTracking-PT-q8m016-LTLCardinality-00
FORMULA_NAME BugTracking-PT-q8m016-LTLCardinality-01
FORMULA_NAME BugTracking-PT-q8m016-LTLCardinality-02
FORMULA_NAME BugTracking-PT-q8m016-LTLCardinality-03
FORMULA_NAME BugTracking-PT-q8m016-LTLCardinality-04
FORMULA_NAME BugTracking-PT-q8m016-LTLCardinality-05
FORMULA_NAME BugTracking-PT-q8m016-LTLCardinality-06
FORMULA_NAME BugTracking-PT-q8m016-LTLCardinality-07
FORMULA_NAME BugTracking-PT-q8m016-LTLCardinality-08
FORMULA_NAME BugTracking-PT-q8m016-LTLCardinality-09
FORMULA_NAME BugTracking-PT-q8m016-LTLCardinality-10
FORMULA_NAME BugTracking-PT-q8m016-LTLCardinality-11
FORMULA_NAME BugTracking-PT-q8m016-LTLCardinality-12
FORMULA_NAME BugTracking-PT-q8m016-LTLCardinality-13
FORMULA_NAME BugTracking-PT-q8m016-LTLCardinality-14
FORMULA_NAME BugTracking-PT-q8m016-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678355202112

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m016
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-09 09:46:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 09:46:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 09:46:45] [INFO ] Load time of PNML (sax parser for PT used): 989 ms
[2023-03-09 09:46:45] [INFO ] Transformed 754 places.
[2023-03-09 09:46:45] [INFO ] Transformed 27370 transitions.
[2023-03-09 09:46:45] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1210 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 474 places in 146 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA BugTracking-PT-q8m016-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 7 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 278 transition count 3904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 277 transition count 3871
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 277 transition count 3871
Applied a total of 4 rules in 115 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2023-03-09 09:46:45] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2023-03-09 09:46:45] [INFO ] Computed 8 place invariants in 43 ms
[2023-03-09 09:46:46] [INFO ] Implicit Places using invariants in 684 ms returned []
[2023-03-09 09:46:46] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-09 09:46:46] [INFO ] Invariant cache hit.
[2023-03-09 09:46:47] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-09 09:46:48] [INFO ] Implicit Places using invariants and state equation in 1925 ms returned []
Implicit Place search using SMT with State Equation took 2642 ms to find 0 implicit places.
[2023-03-09 09:46:48] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-09 09:46:48] [INFO ] Invariant cache hit.
[2023-03-09 09:46:49] [INFO ] Dead Transitions using invariants and state equation in 1202 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3871/3904 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3964 ms. Remains : 277/280 places, 3871/3904 transitions.
Support contains 7 out of 277 places after structural reductions.
[2023-03-09 09:46:50] [INFO ] Flatten gal took : 347 ms
[2023-03-09 09:46:50] [INFO ] Flatten gal took : 195 ms
[2023-03-09 09:46:50] [INFO ] Input system was already deterministic with 3871 transitions.
Incomplete random walk after 10002 steps, including 32 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-09 09:46:51] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-09 09:46:51] [INFO ] Invariant cache hit.
[2023-03-09 09:46:51] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 09:46:51] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 09:46:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 09:46:52] [INFO ] After 1073ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-09 09:46:52] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-09 09:46:54] [INFO ] After 1354ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-09 09:46:54] [INFO ] Deduced a trap composed of 16 places in 571 ms of which 6 ms to minimize.
[2023-03-09 09:46:55] [INFO ] Deduced a trap composed of 36 places in 399 ms of which 1 ms to minimize.
[2023-03-09 09:46:55] [INFO ] Deduced a trap composed of 56 places in 395 ms of which 2 ms to minimize.
[2023-03-09 09:46:56] [INFO ] Deduced a trap composed of 24 places in 409 ms of which 2 ms to minimize.
[2023-03-09 09:46:56] [INFO ] Deduced a trap composed of 10 places in 245 ms of which 0 ms to minimize.
[2023-03-09 09:46:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2661 ms
[2023-03-09 09:46:57] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 0 ms to minimize.
[2023-03-09 09:46:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 191 ms
[2023-03-09 09:46:57] [INFO ] Deduced a trap composed of 24 places in 223 ms of which 1 ms to minimize.
[2023-03-09 09:46:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 434 ms
[2023-03-09 09:46:58] [INFO ] After 5226ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 332 ms.
[2023-03-09 09:46:58] [INFO ] After 6741ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 70 ms.
Support contains 4 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 3871/3871 transitions.
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 4 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 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 16 place count 269 transition count 3871
Applied a total of 16 rules in 345 ms. Remains 269 /277 variables (removed 8) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 347 ms. Remains : 269/277 places, 3871/3871 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 117462 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 117462 steps, saw 40378 distinct states, run finished after 3003 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-09 09:47:02] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:47:02] [INFO ] Computed 8 place invariants in 43 ms
[2023-03-09 09:47:02] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 09:47:02] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 09:47:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 09:47:03] [INFO ] After 969ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 09:47:03] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:47:03] [INFO ] After 592ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 09:47:04] [INFO ] Deduced a trap composed of 17 places in 383 ms of which 1 ms to minimize.
[2023-03-09 09:47:05] [INFO ] Deduced a trap composed of 97 places in 424 ms of which 1 ms to minimize.
[2023-03-09 09:47:05] [INFO ] Deduced a trap composed of 48 places in 291 ms of which 0 ms to minimize.
[2023-03-09 09:47:05] [INFO ] Deduced a trap composed of 62 places in 384 ms of which 0 ms to minimize.
[2023-03-09 09:47:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1974 ms
[2023-03-09 09:47:06] [INFO ] After 3206ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 388 ms.
[2023-03-09 09:47:06] [INFO ] After 4670ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 86 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 70 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-09 09:47:07] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:47:07] [INFO ] Invariant cache hit.
[2023-03-09 09:47:07] [INFO ] Implicit Places using invariants in 482 ms returned []
[2023-03-09 09:47:07] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:47:07] [INFO ] Invariant cache hit.
[2023-03-09 09:47:08] [INFO ] Implicit Places using invariants and state equation in 1061 ms returned []
Implicit Place search using SMT with State Equation took 1550 ms to find 0 implicit places.
[2023-03-09 09:47:09] [INFO ] Redundant transitions in 357 ms returned []
[2023-03-09 09:47:09] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:47:09] [INFO ] Invariant cache hit.
[2023-03-09 09:47:10] [INFO ] Dead Transitions using invariants and state equation in 1201 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3194 ms. 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 2 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 301 ms. Remains 263 /269 variables (removed 6) and now considering 3691/3871 (removed 180) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 3691 rows 263 cols
[2023-03-09 09:47:10] [INFO ] Computed 9 place invariants in 50 ms
[2023-03-09 09:47:10] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-09 09:47:10] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 09:47:10] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-09 09:47:11] [INFO ] After 742ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 09:47:12] [INFO ] After 1262ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 340 ms.
[2023-03-09 09:47:12] [INFO ] After 1660ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA BugTracking-PT-q8m016-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 3 simplifications.
FORMULA BugTracking-PT-q8m016-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 131 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X(!p0))))'
Support contains 0 out of 277 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
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 4 place count 275 transition count 3877
Applied a total of 4 rules in 176 ms. Remains 275 /277 variables (removed 2) and now considering 3877/3871 (removed -6) transitions.
[2023-03-09 09:47:12] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2023-03-09 09:47:12] [INFO ] Computed 8 place invariants in 34 ms
[2023-03-09 09:47:13] [INFO ] Implicit Places using invariants in 541 ms returned []
[2023-03-09 09:47:13] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-09 09:47:13] [INFO ] Invariant cache hit.
[2023-03-09 09:47:13] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:47:15] [INFO ] Implicit Places using invariants and state equation in 2554 ms returned []
Implicit Place search using SMT with State Equation took 3100 ms to find 0 implicit places.
[2023-03-09 09:47:16] [INFO ] Redundant transitions in 259 ms returned []
[2023-03-09 09:47:16] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-09 09:47:16] [INFO ] Invariant cache hit.
[2023-03-09 09:47:17] [INFO ] Dead Transitions using invariants and state equation in 1306 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 275/277 places, 3877/3871 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4861 ms. Remains : 275/277 places, 3877/3871 transitions.
Stuttering acceptance computed with spot in 45 ms :[false]
Running random walk in product with property : BugTracking-PT-q8m016-LTLCardinality-01 automaton TGBA Formula[mat=[[]], initial=0, aps=[], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 1 ms.
FORMULA BugTracking-PT-q8m016-LTLCardinality-01 TRUE TECHNIQUES STUTTER_TEST
Treatment of property BugTracking-PT-q8m016-LTLCardinality-01 finished in 5007 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 14 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-09 09:47:17] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2023-03-09 09:47:17] [INFO ] Computed 8 place invariants in 18 ms
[2023-03-09 09:47:18] [INFO ] Implicit Places using invariants in 531 ms returned []
[2023-03-09 09:47:18] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-09 09:47:18] [INFO ] Invariant cache hit.
[2023-03-09 09:47:18] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-09 09:47:20] [INFO ] Implicit Places using invariants and state equation in 2605 ms returned []
Implicit Place search using SMT with State Equation took 3144 ms to find 0 implicit places.
[2023-03-09 09:47:20] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-09 09:47:20] [INFO ] Invariant cache hit.
[2023-03-09 09:47:21] [INFO ] Dead Transitions using invariants and state equation in 1279 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4439 ms. Remains : 277/277 places, 3871/3871 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BugTracking-PT-q8m016-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GT s193 0) (LEQ 2 s181))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA BugTracking-PT-q8m016-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BugTracking-PT-q8m016-LTLCardinality-14 finished in 4713 ms.
All properties solved by simple procedures.
Total runtime 38080 ms.

BK_STOP 1678355242394

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="LTLCardinality"
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-5348"
echo " Executing tool itstools"
echo " Input is BugTracking-PT-q8m016, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r037-tajo-167813690300411"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;