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-167813690300420.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-q8m032, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690300420
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.2K Feb 26 06:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 06:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 06:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 26 06:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 07:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 07:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 06:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 06:38 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-q8m032-LTLFireability-00
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-01
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-02
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-03
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-04
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-05
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-06
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-07
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-08
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-09
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-10
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-11
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-12
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-13
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-14
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678355947324

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m032
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 09:59:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 09:59:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 09:59:09] [INFO ] Load time of PNML (sax parser for PT used): 727 ms
[2023-03-09 09:59:09] [INFO ] Transformed 754 places.
[2023-03-09 09:59:09] [INFO ] Transformed 27370 transitions.
[2023-03-09 09:59:09] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 898 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 474 places in 106 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q8m032-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 6 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 82 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2023-03-09 09:59:10] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2023-03-09 09:59:10] [INFO ] Computed 8 place invariants in 61 ms
[2023-03-09 09:59:10] [INFO ] Implicit Places using invariants in 602 ms returned []
[2023-03-09 09:59:10] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-09 09:59:10] [INFO ] Invariant cache hit.
[2023-03-09 09:59:11] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-09 09:59:15] [INFO ] Implicit Places using invariants and state equation in 4073 ms returned []
Implicit Place search using SMT with State Equation took 4705 ms to find 0 implicit places.
[2023-03-09 09:59:15] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-09 09:59:15] [INFO ] Invariant cache hit.
[2023-03-09 09:59:16] [INFO ] Dead Transitions using invariants and state equation in 1275 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 6067 ms. Remains : 277/280 places, 3871/3904 transitions.
Support contains 6 out of 277 places after structural reductions.
[2023-03-09 09:59:16] [INFO ] Flatten gal took : 312 ms
[2023-03-09 09:59:17] [INFO ] Flatten gal took : 187 ms
[2023-03-09 09:59:17] [INFO ] Input system was already deterministic with 3871 transitions.
Incomplete random walk after 10008 steps, including 24 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 151692 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 151692 steps, saw 77150 distinct states, run finished after 3003 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-09 09:59:20] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-09 09:59:20] [INFO ] Invariant cache hit.
[2023-03-09 09:59:20] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 09:59:21] [INFO ] After 708ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-09 09:59:21] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-09 09:59:22] [INFO ] After 839ms SMT Verify possible using 282 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 09:59:22] [INFO ] After 1647ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 09:59:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 09:59:23] [INFO ] After 927ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 09:59:24] [INFO ] After 597ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 09:59:24] [INFO ] Deduced a trap composed of 12 places in 557 ms of which 10 ms to minimize.
[2023-03-09 09:59:25] [INFO ] Deduced a trap composed of 26 places in 566 ms of which 2 ms to minimize.
[2023-03-09 09:59:26] [INFO ] Deduced a trap composed of 17 places in 542 ms of which 2 ms to minimize.
[2023-03-09 09:59:26] [INFO ] Deduced a trap composed of 47 places in 349 ms of which 2 ms to minimize.
[2023-03-09 09:59:27] [INFO ] Deduced a trap composed of 45 places in 342 ms of which 1 ms to minimize.
[2023-03-09 09:59:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3016 ms
[2023-03-09 09:59:28] [INFO ] Deduced a trap composed of 71 places in 633 ms of which 1 ms to minimize.
[2023-03-09 09:59:28] [INFO ] Deduced a trap composed of 62 places in 565 ms of which 0 ms to minimize.
[2023-03-09 09:59:29] [INFO ] Deduced a trap composed of 10 places in 383 ms of which 1 ms to minimize.
[2023-03-09 09:59:29] [INFO ] Deduced a trap composed of 7 places in 421 ms of which 0 ms to minimize.
[2023-03-09 09:59:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2527 ms
[2023-03-09 09:59:29] [INFO ] After 6402ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 286 ms.
[2023-03-09 09:59:30] [INFO ] After 7739ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 45 ms.
Support contains 6 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 3 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 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 275 transition count 3872
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 14 place count 270 transition count 3872
Applied a total of 14 rules in 301 ms. Remains 270 /277 variables (removed 7) and now considering 3872/3871 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 303 ms. Remains : 270/277 places, 3872/3871 transitions.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 119009 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 119009 steps, saw 78371 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-09 09:59:33] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2023-03-09 09:59:33] [INFO ] Computed 8 place invariants in 18 ms
[2023-03-09 09:59:33] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 09:59:34] [INFO ] After 659ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-09 09:59:34] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:59:35] [INFO ] After 577ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 09:59:35] [INFO ] After 1316ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 09:59:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 09:59:36] [INFO ] After 878ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 09:59:36] [INFO ] After 449ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 09:59:37] [INFO ] Deduced a trap composed of 83 places in 467 ms of which 1 ms to minimize.
[2023-03-09 09:59:37] [INFO ] Deduced a trap composed of 57 places in 507 ms of which 1 ms to minimize.
[2023-03-09 09:59:38] [INFO ] Deduced a trap composed of 78 places in 436 ms of which 2 ms to minimize.
[2023-03-09 09:59:38] [INFO ] Deduced a trap composed of 57 places in 487 ms of which 1 ms to minimize.
[2023-03-09 09:59:39] [INFO ] Deduced a trap composed of 39 places in 505 ms of which 0 ms to minimize.
[2023-03-09 09:59:39] [INFO ] Deduced a trap composed of 32 places in 465 ms of which 1 ms to minimize.
[2023-03-09 09:59:40] [INFO ] Deduced a trap composed of 57 places in 486 ms of which 1 ms to minimize.
[2023-03-09 09:59:41] [INFO ] Deduced a trap composed of 79 places in 438 ms of which 1 ms to minimize.
[2023-03-09 09:59:41] [INFO ] Deduced a trap composed of 17 places in 470 ms of which 0 ms to minimize.
[2023-03-09 09:59:42] [INFO ] Deduced a trap composed of 10 places in 458 ms of which 1 ms to minimize.
[2023-03-09 09:59:42] [INFO ] Deduced a trap composed of 10 places in 308 ms of which 1 ms to minimize.
[2023-03-09 09:59:42] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 6415 ms
[2023-03-09 09:59:43] [INFO ] After 7173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 263 ms.
[2023-03-09 09:59:43] [INFO ] After 8393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 57 ms.
Support contains 6 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 91 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 270/270 places, 3872/3872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 107 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2023-03-09 09:59:43] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-09 09:59:43] [INFO ] Invariant cache hit.
[2023-03-09 09:59:44] [INFO ] Implicit Places using invariants in 416 ms returned []
[2023-03-09 09:59:44] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-09 09:59:44] [INFO ] Invariant cache hit.
[2023-03-09 09:59:44] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:59:47] [INFO ] Implicit Places using invariants and state equation in 3236 ms returned []
Implicit Place search using SMT with State Equation took 3656 ms to find 0 implicit places.
[2023-03-09 09:59:47] [INFO ] Redundant transitions in 367 ms returned []
[2023-03-09 09:59:47] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-09 09:59:47] [INFO ] Invariant cache hit.
[2023-03-09 09:59:49] [INFO ] Dead Transitions using invariants and state equation in 1235 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5382 ms. Remains : 270/270 places, 3872/3872 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 270 transition count 3699
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 268 transition count 3697
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 268 transition count 3696
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 268 transition count 3692
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 264 transition count 3692
Applied a total of 186 rules in 254 ms. Remains 264 /270 variables (removed 6) and now considering 3692/3872 (removed 180) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 3692 rows 264 cols
[2023-03-09 09:59:49] [INFO ] Computed 9 place invariants in 53 ms
[2023-03-09 09:59:49] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-09 09:59:50] [INFO ] After 812ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-09 09:59:50] [INFO ] After 1007ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 125 ms.
[2023-03-09 09:59:50] [INFO ] After 1216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
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' '!(G(F(p0)))'
Support contains 3 out of 277 places. Attempting structural reductions.
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 3 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 112 ms. Remains 275 /277 variables (removed 2) and now considering 3877/3871 (removed -6) transitions.
[2023-03-09 09:59:50] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2023-03-09 09:59:50] [INFO ] Computed 8 place invariants in 20 ms
[2023-03-09 09:59:51] [INFO ] Implicit Places using invariants in 394 ms returned []
[2023-03-09 09:59:51] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-09 09:59:51] [INFO ] Invariant cache hit.
[2023-03-09 09:59:51] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:59:53] [INFO ] Implicit Places using invariants and state equation in 2351 ms returned []
Implicit Place search using SMT with State Equation took 2749 ms to find 0 implicit places.
[2023-03-09 09:59:53] [INFO ] Redundant transitions in 152 ms returned []
[2023-03-09 09:59:53] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-09 09:59:53] [INFO ] Invariant cache hit.
[2023-03-09 09:59:54] [INFO ] Dead Transitions using invariants and state equation in 1203 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 4224 ms. Remains : 275/277 places, 3877/3871 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BugTracking-PT-q8m032-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s49 1) (GEQ s188 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 475 steps with 0 reset in 16 ms.
FORMULA BugTracking-PT-q8m032-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BugTracking-PT-q8m032-LTLFireability-06 finished in 4503 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' '!(F(p0))'
Support contains 3 out of 277 places. Attempting structural reductions.
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 3 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 90 ms. Remains 275 /277 variables (removed 2) and now considering 3877/3871 (removed -6) transitions.
[2023-03-09 09:59:55] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-09 09:59:55] [INFO ] Invariant cache hit.
[2023-03-09 09:59:55] [INFO ] Implicit Places using invariants in 451 ms returned []
[2023-03-09 09:59:55] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-09 09:59:55] [INFO ] Invariant cache hit.
[2023-03-09 09:59:56] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:59:56] [INFO ] Implicit Places using invariants and state equation in 1249 ms returned []
Implicit Place search using SMT with State Equation took 1703 ms to find 0 implicit places.
[2023-03-09 09:59:57] [INFO ] Redundant transitions in 174 ms returned []
[2023-03-09 09:59:57] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-09 09:59:57] [INFO ] Invariant cache hit.
[2023-03-09 09:59:58] [INFO ] Dead Transitions using invariants and state equation in 1182 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 3157 ms. Remains : 275/277 places, 3877/3871 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : BugTracking-PT-q8m032-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s77 1) (GEQ s196 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 468 steps with 0 reset in 5 ms.
FORMULA BugTracking-PT-q8m032-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BugTracking-PT-q8m032-LTLFireability-15 finished in 3224 ms.
All properties solved by simple procedures.
Total runtime 49433 ms.

BK_STOP 1678355998592

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-q8m032"
export BK_EXAMINATION="LTLFireability"
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-q8m032, examination is LTLFireability"
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-167813690300420"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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