About the Execution of ITS-Tools for BugTracking-PT-q8m256
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14631.939 | 3600000.00 | 12824300.00 | 5489.30 | FTTFT?TTFTFTFFFT | 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-165472281800124.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-q8m256, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472281800124
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.3K Jun 7 16:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Jun 7 16:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Jun 7 16:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 7 16:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 6 15:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 15:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 20K Jun 7 16:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 177K Jun 7 16:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 7 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 7 16:44 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-q8m256-LTLFireability-00
FORMULA_NAME BugTracking-PT-q8m256-LTLFireability-01
FORMULA_NAME BugTracking-PT-q8m256-LTLFireability-02
FORMULA_NAME BugTracking-PT-q8m256-LTLFireability-03
FORMULA_NAME BugTracking-PT-q8m256-LTLFireability-04
FORMULA_NAME BugTracking-PT-q8m256-LTLFireability-05
FORMULA_NAME BugTracking-PT-q8m256-LTLFireability-06
FORMULA_NAME BugTracking-PT-q8m256-LTLFireability-07
FORMULA_NAME BugTracking-PT-q8m256-LTLFireability-08
FORMULA_NAME BugTracking-PT-q8m256-LTLFireability-09
FORMULA_NAME BugTracking-PT-q8m256-LTLFireability-10
FORMULA_NAME BugTracking-PT-q8m256-LTLFireability-11
FORMULA_NAME BugTracking-PT-q8m256-LTLFireability-12
FORMULA_NAME BugTracking-PT-q8m256-LTLFireability-13
FORMULA_NAME BugTracking-PT-q8m256-LTLFireability-14
FORMULA_NAME BugTracking-PT-q8m256-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1654770897757
Running Version 202205111006
[2022-06-09 10:34:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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 10:34:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 10:34:59] [INFO ] Load time of PNML (sax parser for PT used): 811 ms
[2022-06-09 10:34:59] [INFO ] Transformed 754 places.
[2022-06-09 10:34:59] [INFO ] Transformed 27370 transitions.
[2022-06-09 10:34:59] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 1016 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 474 places in 107 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q8m256-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 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 92 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2022-06-09 10:35:00] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2022-06-09 10:35:00] [INFO ] Computed 8 place invariants in 57 ms
[2022-06-09 10:35:01] [INFO ] Implicit Places using invariants in 686 ms returned []
[2022-06-09 10:35:01] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2022-06-09 10:35:01] [INFO ] Computed 8 place invariants in 20 ms
[2022-06-09 10:35:01] [INFO ] State equation strengthened by 282 read => feed constraints.
[2022-06-09 10:35:03] [INFO ] Implicit Places using invariants and state equation in 2404 ms returned []
Implicit Place search using SMT with State Equation took 3118 ms to find 0 implicit places.
[2022-06-09 10:35:03] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2022-06-09 10:35:03] [INFO ] Computed 8 place invariants in 22 ms
[2022-06-09 10:35:04] [INFO ] Dead Transitions using invariants and state equation in 1135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3871/3904 transitions.
Finished structural reductions, in 1 iterations. Remains : 277/280 places, 3871/3904 transitions.
Support contains 8 out of 277 places after structural reductions.
[2022-06-09 10:35:05] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-06-09 10:35:05] [INFO ] Flatten gal took : 365 ms
[2022-06-09 10:35:05] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
FORMULA BugTracking-PT-q8m256-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-06-09 10:35:05] [INFO ] Flatten gal took : 230 ms
[2022-06-09 10:35:05] [INFO ] Input system was already deterministic with 3871 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 96498 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96498 steps, saw 46311 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 3 properties.
[2022-06-09 10:35:09] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2022-06-09 10:35:09] [INFO ] Computed 8 place invariants in 20 ms
[2022-06-09 10:35:09] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 10:35:10] [INFO ] After 783ms SMT Verify possible using state equation in real domain returned unsat :1 sat :2
[2022-06-09 10:35:10] [INFO ] State equation strengthened by 282 read => feed constraints.
[2022-06-09 10:35:10] [INFO ] After 476ms SMT Verify possible using 282 Read/Feed constraints in real domain returned unsat :1 sat :0 real:2
[2022-06-09 10:35:10] [INFO ] After 1392ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-06-09 10:35:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2022-06-09 10:35:11] [INFO ] After 985ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-06-09 10:35:12] [INFO ] After 437ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2022-06-09 10:35:12] [INFO ] Deduced a trap composed of 26 places in 406 ms of which 6 ms to minimize.
[2022-06-09 10:35:13] [INFO ] Deduced a trap composed of 13 places in 374 ms of which 2 ms to minimize.
[2022-06-09 10:35:13] [INFO ] Deduced a trap composed of 61 places in 224 ms of which 2 ms to minimize.
[2022-06-09 10:35:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1331 ms
[2022-06-09 10:35:13] [INFO ] After 1851ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 108 ms.
[2022-06-09 10:35:13] [INFO ] After 3030ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 3 out of 277 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 257 ms. Remains 270 /277 variables (removed 7) and now considering 3872/3871 (removed -1) transitions.
Finished structural reductions, in 1 iterations. Remains : 270/277 places, 3872/3871 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 98885 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98885 steps, saw 65786 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-09 10:35:17] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2022-06-09 10:35:17] [INFO ] Computed 8 place invariants in 25 ms
[2022-06-09 10:35:17] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 10:35:18] [INFO ] After 691ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-09 10:35:18] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:35:18] [INFO ] After 246ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:35:18] [INFO ] After 1010ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:35:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 10:35:19] [INFO ] After 687ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 10:35:19] [INFO ] After 334ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 10:35:19] [INFO ] Deduced a trap composed of 14 places in 388 ms of which 1 ms to minimize.
[2022-06-09 10:35:20] [INFO ] Deduced a trap composed of 10 places in 355 ms of which 1 ms to minimize.
[2022-06-09 10:35:20] [INFO ] Deduced a trap composed of 5 places in 346 ms of which 0 ms to minimize.
[2022-06-09 10:35:21] [INFO ] Deduced a trap composed of 17 places in 350 ms of which 1 ms to minimize.
[2022-06-09 10:35:21] [INFO ] Deduced a trap composed of 31 places in 407 ms of which 1 ms to minimize.
[2022-06-09 10:35:22] [INFO ] Deduced a trap composed of 12 places in 358 ms of which 0 ms to minimize.
[2022-06-09 10:35:22] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2746 ms
[2022-06-09 10:35:22] [INFO ] After 3185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 110 ms.
[2022-06-09 10:35:22] [INFO ] After 4049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 35 ms.
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 66 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 270/270 places, 3872/3872 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 79 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2022-06-09 10:35:22] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2022-06-09 10:35:22] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-09 10:35:23] [INFO ] Implicit Places using invariants in 648 ms returned []
[2022-06-09 10:35:23] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2022-06-09 10:35:23] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 10:35:23] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:35:25] [INFO ] Implicit Places using invariants and state equation in 2622 ms returned []
Implicit Place search using SMT with State Equation took 3272 ms to find 0 implicit places.
[2022-06-09 10:35:26] [INFO ] Redundant transitions in 259 ms returned []
[2022-06-09 10:35:26] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2022-06-09 10:35:26] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-09 10:35:27] [INFO ] Dead Transitions using invariants and state equation in 1052 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 2 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 234 ms. Remains 264 /270 variables (removed 6) and now considering 3692/3872 (removed 180) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3692 rows 264 cols
[2022-06-09 10:35:27] [INFO ] Computed 9 place invariants in 24 ms
[2022-06-09 10:35:27] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-06-09 10:35:28] [INFO ] After 665ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:35:28] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-06-09 10:35:28] [INFO ] After 622ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 10:35:28] [INFO ] After 754ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2022-06-09 10:35:28] [INFO ] After 892ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 2 atomic propositions for a total of 3 simplifications.
FORMULA BugTracking-PT-q8m256-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 131 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(F(X(X(X(G(X(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 113 ms. Remains 275 /277 variables (removed 2) and now considering 3877/3871 (removed -6) transitions.
[2022-06-09 10:35:29] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2022-06-09 10:35:29] [INFO ] Computed 8 place invariants in 23 ms
[2022-06-09 10:35:29] [INFO ] Implicit Places using invariants in 413 ms returned []
[2022-06-09 10:35:29] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2022-06-09 10:35:29] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-09 10:35:30] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:35:31] [INFO ] Implicit Places using invariants and state equation in 2351 ms returned []
Implicit Place search using SMT with State Equation took 2767 ms to find 0 implicit places.
[2022-06-09 10:35:32] [INFO ] Redundant transitions in 168 ms returned []
[2022-06-09 10:35:32] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2022-06-09 10:35:32] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 10:35:33] [INFO ] Dead Transitions using invariants and state equation in 1122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 275/277 places, 3877/3871 transitions.
Finished structural reductions, in 1 iterations. Remains : 275/277 places, 3877/3871 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0)]
Running random walk in product with property : BugTracking-PT-q8m256-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s42 1) (LT s193 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22 reset in 759 ms.
Product exploration explored 100000 steps with 22 reset in 748 ms.
Computed a total of 6 stabilizing places and 131 stable transitions
Computed a total of 6 stabilizing places and 131 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Incomplete random walk after 10133 steps, including 6 resets, run finished after 42 ms. (steps per millisecond=241 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 121777 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 121777 steps, saw 58900 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-09 10:35:38] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2022-06-09 10:35:38] [INFO ] Computed 8 place invariants in 22 ms
[2022-06-09 10:35:38] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 10:35:38] [INFO ] After 621ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-09 10:35:38] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:35:39] [INFO ] After 260ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:35:39] [INFO ] After 940ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:35:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 10:35:39] [INFO ] After 676ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 10:35:40] [INFO ] After 439ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 10:35:40] [INFO ] Deduced a trap composed of 16 places in 375 ms of which 0 ms to minimize.
[2022-06-09 10:35:41] [INFO ] Deduced a trap composed of 10 places in 378 ms of which 0 ms to minimize.
[2022-06-09 10:35:41] [INFO ] Deduced a trap composed of 43 places in 247 ms of which 1 ms to minimize.
[2022-06-09 10:35:41] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 1 ms to minimize.
[2022-06-09 10:35:42] [INFO ] Deduced a trap composed of 43 places in 233 ms of which 1 ms to minimize.
[2022-06-09 10:35:42] [INFO ] Deduced a trap composed of 57 places in 258 ms of which 0 ms to minimize.
[2022-06-09 10:35:42] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2235 ms
[2022-06-09 10:35:42] [INFO ] After 2757ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2022-06-09 10:35:42] [INFO ] After 3581ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 275 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 275/275 places, 3877/3877 transitions.
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 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 10 place count 270 transition count 3872
Applied a total of 10 rules in 119 ms. Remains 270 /275 variables (removed 5) and now considering 3872/3877 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 270/275 places, 3872/3877 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 101072 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101072 steps, saw 67097 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-09 10:35:45] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2022-06-09 10:35:45] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 10:35:46] [INFO ] [Real]Absence check using 8 positive place invariants in 29 ms returned sat
[2022-06-09 10:35:46] [INFO ] After 617ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-09 10:35:46] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:35:46] [INFO ] After 230ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:35:46] [INFO ] After 991ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:35:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 10:35:47] [INFO ] After 615ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 10:35:47] [INFO ] After 320ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 10:35:48] [INFO ] Deduced a trap composed of 14 places in 320 ms of which 0 ms to minimize.
[2022-06-09 10:35:48] [INFO ] Deduced a trap composed of 10 places in 346 ms of which 1 ms to minimize.
[2022-06-09 10:35:49] [INFO ] Deduced a trap composed of 5 places in 303 ms of which 0 ms to minimize.
[2022-06-09 10:35:49] [INFO ] Deduced a trap composed of 17 places in 302 ms of which 0 ms to minimize.
[2022-06-09 10:35:50] [INFO ] Deduced a trap composed of 31 places in 349 ms of which 3 ms to minimize.
[2022-06-09 10:35:50] [INFO ] Deduced a trap composed of 12 places in 338 ms of which 0 ms to minimize.
[2022-06-09 10:35:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2455 ms
[2022-06-09 10:35:50] [INFO ] After 2868ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 99 ms.
[2022-06-09 10:35:50] [INFO ] After 3632ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 41 ms.
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 52 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 270/270 places, 3872/3872 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 49 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2022-06-09 10:35:50] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2022-06-09 10:35:50] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 10:35:51] [INFO ] Implicit Places using invariants in 393 ms returned []
[2022-06-09 10:35:51] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2022-06-09 10:35:51] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 10:35:51] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:35:53] [INFO ] Implicit Places using invariants and state equation in 2142 ms returned []
Implicit Place search using SMT with State Equation took 2537 ms to find 0 implicit places.
[2022-06-09 10:35:53] [INFO ] Redundant transitions in 214 ms returned []
[2022-06-09 10:35:53] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2022-06-09 10:35:53] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 10:35:54] [INFO ] Dead Transitions using invariants and state equation in 1003 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 226 ms. Remains 264 /270 variables (removed 6) and now considering 3692/3872 (removed 180) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3692 rows 264 cols
[2022-06-09 10:35:54] [INFO ] Computed 9 place invariants in 16 ms
[2022-06-09 10:35:54] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-06-09 10:35:55] [INFO ] After 700ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:35:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-06-09 10:35:56] [INFO ] After 651ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 10:35:56] [INFO ] After 784ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2022-06-09 10:35:56] [INFO ] After 910ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 221 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 3 out of 275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 3877/3877 transitions.
Applied a total of 0 rules in 67 ms. Remains 275 /275 variables (removed 0) and now considering 3877/3877 (removed 0) transitions.
[2022-06-09 10:35:56] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2022-06-09 10:35:56] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 10:35:57] [INFO ] Implicit Places using invariants in 428 ms returned []
[2022-06-09 10:35:57] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2022-06-09 10:35:57] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-09 10:35:57] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:35:59] [INFO ] Implicit Places using invariants and state equation in 2397 ms returned []
Implicit Place search using SMT with State Equation took 2827 ms to find 0 implicit places.
[2022-06-09 10:35:59] [INFO ] Redundant transitions in 125 ms returned []
[2022-06-09 10:35:59] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2022-06-09 10:35:59] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 10:36:00] [INFO ] Dead Transitions using invariants and state equation in 1008 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 275/275 places, 3877/3877 transitions.
Computed a total of 6 stabilizing places and 131 stable transitions
Computed a total of 6 stabilizing places and 131 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Incomplete random walk after 10224 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=309 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 126116 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 126116 steps, saw 60972 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-09 10:36:04] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2022-06-09 10:36:04] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 10:36:04] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 10:36:04] [INFO ] After 620ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-09 10:36:04] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:36:05] [INFO ] After 261ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:36:05] [INFO ] After 940ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:36:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 10:36:05] [INFO ] After 711ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 10:36:06] [INFO ] After 510ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 10:36:06] [INFO ] Deduced a trap composed of 16 places in 379 ms of which 0 ms to minimize.
[2022-06-09 10:36:07] [INFO ] Deduced a trap composed of 10 places in 379 ms of which 0 ms to minimize.
[2022-06-09 10:36:07] [INFO ] Deduced a trap composed of 43 places in 246 ms of which 0 ms to minimize.
[2022-06-09 10:36:07] [INFO ] Deduced a trap composed of 12 places in 247 ms of which 0 ms to minimize.
[2022-06-09 10:36:08] [INFO ] Deduced a trap composed of 43 places in 263 ms of which 0 ms to minimize.
[2022-06-09 10:36:08] [INFO ] Deduced a trap composed of 57 places in 246 ms of which 0 ms to minimize.
[2022-06-09 10:36:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2306 ms
[2022-06-09 10:36:08] [INFO ] After 2898ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 95 ms.
[2022-06-09 10:36:08] [INFO ] After 3753ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 275 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 275/275 places, 3877/3877 transitions.
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 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 10 place count 270 transition count 3872
Applied a total of 10 rules in 105 ms. Remains 270 /275 variables (removed 5) and now considering 3872/3877 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 270/275 places, 3872/3877 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 104447 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104447 steps, saw 69122 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-09 10:36:11] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2022-06-09 10:36:11] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 10:36:12] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 10:36:12] [INFO ] After 612ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-09 10:36:12] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:36:12] [INFO ] After 228ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:36:12] [INFO ] After 891ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:36:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 10:36:13] [INFO ] After 612ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 10:36:13] [INFO ] After 307ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 10:36:14] [INFO ] Deduced a trap composed of 14 places in 315 ms of which 4 ms to minimize.
[2022-06-09 10:36:14] [INFO ] Deduced a trap composed of 10 places in 315 ms of which 1 ms to minimize.
[2022-06-09 10:36:15] [INFO ] Deduced a trap composed of 5 places in 301 ms of which 0 ms to minimize.
[2022-06-09 10:36:15] [INFO ] Deduced a trap composed of 17 places in 308 ms of which 1 ms to minimize.
[2022-06-09 10:36:15] [INFO ] Deduced a trap composed of 31 places in 334 ms of which 0 ms to minimize.
[2022-06-09 10:36:16] [INFO ] Deduced a trap composed of 12 places in 337 ms of which 1 ms to minimize.
[2022-06-09 10:36:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2412 ms
[2022-06-09 10:36:16] [INFO ] After 2809ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 101 ms.
[2022-06-09 10:36:16] [INFO ] After 3579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 35 ms.
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 48 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 270/270 places, 3872/3872 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 59 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2022-06-09 10:36:16] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2022-06-09 10:36:16] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-09 10:36:16] [INFO ] Implicit Places using invariants in 380 ms returned []
[2022-06-09 10:36:16] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2022-06-09 10:36:17] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 10:36:17] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:36:18] [INFO ] Implicit Places using invariants and state equation in 1944 ms returned []
Implicit Place search using SMT with State Equation took 2325 ms to find 0 implicit places.
[2022-06-09 10:36:19] [INFO ] Redundant transitions in 123 ms returned []
[2022-06-09 10:36:19] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2022-06-09 10:36:19] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 10:36:20] [INFO ] Dead Transitions using invariants and state equation in 999 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 2 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 177 ms. Remains 264 /270 variables (removed 6) and now considering 3692/3872 (removed 180) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3692 rows 264 cols
[2022-06-09 10:36:20] [INFO ] Computed 9 place invariants in 20 ms
[2022-06-09 10:36:20] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-06-09 10:36:21] [INFO ] After 709ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 10:36:21] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-06-09 10:36:21] [INFO ] After 650ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 10:36:21] [INFO ] After 779ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 80 ms.
[2022-06-09 10:36:21] [INFO ] After 909ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 21 reset in 679 ms.
Product exploration explored 100000 steps with 22 reset in 718 ms.
Built C files in :
/tmp/ltsmin16541257510251502780
[2022-06-09 10:36:23] [INFO ] Too many transitions (3877) to apply POR reductions. Disabling POR matrices.
[2022-06-09 10:36:23] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16541257510251502780
Running compilation step : cd /tmp/ltsmin16541257510251502780;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' '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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16541257510251502780;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' '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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16541257510251502780;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' '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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 3877/3877 transitions.
Applied a total of 0 rules in 56 ms. Remains 275 /275 variables (removed 0) and now considering 3877/3877 (removed 0) transitions.
[2022-06-09 10:36:26] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2022-06-09 10:36:26] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 10:36:27] [INFO ] Implicit Places using invariants in 393 ms returned []
[2022-06-09 10:36:27] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2022-06-09 10:36:27] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 10:36:27] [INFO ] State equation strengthened by 283 read => feed constraints.
[2022-06-09 10:36:29] [INFO ] Implicit Places using invariants and state equation in 1886 ms returned []
Implicit Place search using SMT with State Equation took 2280 ms to find 0 implicit places.
[2022-06-09 10:36:29] [INFO ] Redundant transitions in 118 ms returned []
[2022-06-09 10:36:29] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2022-06-09 10:36:29] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 10:36:30] [INFO ] Dead Transitions using invariants and state equation in 972 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 275/275 places, 3877/3877 transitions.
Built C files in :
/tmp/ltsmin8423210553807242103
[2022-06-09 10:36:30] [INFO ] Too many transitions (3877) to apply POR reductions. Disabling POR matrices.
[2022-06-09 10:36:30] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8423210553807242103
Running compilation step : cd /tmp/ltsmin8423210553807242103;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' '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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8423210553807242103;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' '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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8423210553807242103;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' '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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-09 10:36:33] [INFO ] Flatten gal took : 238 ms
[2022-06-09 10:36:33] [INFO ] Flatten gal took : 204 ms
[2022-06-09 10:36:33] [INFO ] Time to serialize gal into /tmp/LTL1608426638562378577.gal : 52 ms
[2022-06-09 10:36:33] [INFO ] Time to serialize properties into /tmp/LTL11338517719293900481.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1608426638562378577.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11338517719293900481.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1608426...267
Read 1 LTL properties
Checking formula 0 : !((G(X(G(F(X(X(X(G(X("(((l2<1)||(x0_MORE_INFO_q2<1))||(ch1_VERIFIED_q7<1))")))))))))))
Formula 0 simplified : !GXGFXXXGX"(((l2<1)||(x0_MORE_INFO_q2<1))||(ch1_VERIFIED_q7<1))"
Detected timeout of ITS tools.
[2022-06-09 10:36:49] [INFO ] Flatten gal took : 180 ms
[2022-06-09 10:36:49] [INFO ] Applying decomposition
[2022-06-09 10:36:49] [INFO ] Flatten gal took : 180 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12060468615651938717.txt' '-o' '/tmp/graph12060468615651938717.bin' '-w' '/tmp/graph12060468615651938717.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12060468615651938717.bin' '-l' '-1' '-v' '-w' '/tmp/graph12060468615651938717.weights' '-q' '0' '-e' '0.001'
[2022-06-09 10:36:49] [INFO ] Decomposing Gal with order
[2022-06-09 10:36:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 10:36:50] [INFO ] Removed a total of 424 redundant transitions.
[2022-06-09 10:36:50] [INFO ] Flatten gal took : 422 ms
[2022-06-09 10:36:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 27 ms.
[2022-06-09 10:36:50] [INFO ] Time to serialize gal into /tmp/LTL13738652374937045199.gal : 22 ms
[2022-06-09 10:36:50] [INFO ] Time to serialize properties into /tmp/LTL14368200731798606424.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13738652374937045199.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14368200731798606424.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1373865...247
Read 1 LTL properties
Checking formula 0 : !((G(X(G(F(X(X(X(G(X("(((u0.l2<1)||(u0.x0_MORE_INFO_q2<1))||(u0.ch1_VERIFIED_q7<1))")))))))))))
Formula 0 simplified : !GXGFXXXGX"(((u0.l2<1)||(u0.x0_MORE_INFO_q2<1))||(u0.ch1_VERIFIED_q7<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5597917621008471604
[2022-06-09 10:37:05] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5597917621008471604
Running compilation step : cd /tmp/ltsmin5597917621008471604;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' '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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5597917621008471604;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' '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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5597917621008471604;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' '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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BugTracking-PT-q8m256-LTLFireability-05 finished in 99611 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(F(X(X(X(G(X(p0))))))))))'
[2022-06-09 10:37:09] [INFO ] Flatten gal took : 212 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5931444794849092135
[2022-06-09 10:37:09] [INFO ] Too many transitions (3871) to apply POR reductions. Disabling POR matrices.
[2022-06-09 10:37:09] [INFO ] Applying decomposition
[2022-06-09 10:37:09] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5931444794849092135
Running compilation step : cd /tmp/ltsmin5931444794849092135;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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 10:37:09] [INFO ] Flatten gal took : 167 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9201253994344947796.txt' '-o' '/tmp/graph9201253994344947796.bin' '-w' '/tmp/graph9201253994344947796.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9201253994344947796.bin' '-l' '-1' '-v' '-w' '/tmp/graph9201253994344947796.weights' '-q' '0' '-e' '0.001'
[2022-06-09 10:37:09] [INFO ] Decomposing Gal with order
[2022-06-09 10:37:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 10:37:10] [INFO ] Removed a total of 406 redundant transitions.
[2022-06-09 10:37:10] [INFO ] Flatten gal took : 260 ms
[2022-06-09 10:37:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 377 labels/synchronizations in 15 ms.
[2022-06-09 10:37:10] [INFO ] Time to serialize gal into /tmp/LTLFireability3726055743823615181.gal : 16 ms
[2022-06-09 10:37:10] [INFO ] Time to serialize properties into /tmp/LTLFireability6014050532930437956.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3726055743823615181.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6014050532930437956.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 1 LTL properties
Checking formula 0 : !((G(X(G(F(X(X(X(G(X("(((u0.l2<1)||(u0.x0_MORE_INFO_q2<1))||(u0.ch1_VERIFIED_q7<1))")))))))))))
Formula 0 simplified : !GXGFXXXGX"(((u0.l2<1)||(u0.x0_MORE_INFO_q2<1))||(u0.ch1_VERIFIED_q7<1))"
Compilation finished in 10312 ms.
Running link step : cd /tmp/ltsmin5931444794849092135;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin5931444794849092135;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X([](<>(X(X(X([](X((LTLAPp0==true))))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-06-09 10:57:54] [INFO ] Flatten gal took : 375 ms
[2022-06-09 10:57:54] [INFO ] Time to serialize gal into /tmp/LTLFireability9462129688285949789.gal : 48 ms
[2022-06-09 10:57:54] [INFO ] Time to serialize properties into /tmp/LTLFireability1816135038947504561.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9462129688285949789.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1816135038947504561.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...288
Read 1 LTL properties
Checking formula 0 : !((G(X(G(F(X(X(X(G(X("(((l2<1)||(x0_MORE_INFO_q2<1))||(ch1_VERIFIED_q7<1))")))))))))))
Formula 0 simplified : !GXGFXXXGX"(((l2<1)||(x0_MORE_INFO_q2<1))||(ch1_VERIFIED_q7<1))"
Detected timeout of ITS tools.
[2022-06-09 11:18:38] [INFO ] Flatten gal took : 441 ms
[2022-06-09 11:18:39] [INFO ] Input system was already deterministic with 3871 transitions.
[2022-06-09 11:18:39] [INFO ] Transformed 277 places.
[2022-06-09 11:18:39] [INFO ] Transformed 3871 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-09 11:18:39] [INFO ] Time to serialize gal into /tmp/LTLFireability16155163032371589405.gal : 21 ms
[2022-06-09 11:18:39] [INFO ] Time to serialize properties into /tmp/LTLFireability17649358794981378855.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16155163032371589405.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17649358794981378855.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...335
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(X(G(F(X(X(X(G(X("(((l2<1)||(x0_MORE_INFO_q2<1))||(ch1_VERIFIED_q7<1))")))))))))))
Formula 0 simplified : !GXGFXXXGX"(((l2<1)||(x0_MORE_INFO_q2<1))||(ch1_VERIFIED_q7<1))"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: LTL layer: formula: [](X([](<>(X(X(X([](X((LTLAPp0==true))))))))))
pins2lts-mc-linux64( 3/ 8), 0.014: "[](X([](<>(X(X(X([](X((LTLAPp0==true))))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.015: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.189: There are 3873 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.189: State length is 278, there are 3875 groups
pins2lts-mc-linux64( 0/ 8), 0.189: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.189: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.189: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.189: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.332: [Blue] ~120 levels ~960 states ~4176 transitions
pins2lts-mc-linux64( 1/ 8), 0.451: [Blue] ~240 levels ~1920 states ~7448 transitions
pins2lts-mc-linux64( 1/ 8), 0.644: [Blue] ~480 levels ~3840 states ~14864 transitions
pins2lts-mc-linux64( 2/ 8), 0.941: [Blue] ~960 levels ~7680 states ~25112 transitions
pins2lts-mc-linux64( 1/ 8), 1.513: [Blue] ~1802 levels ~15360 states ~40112 transitions
pins2lts-mc-linux64( 1/ 8), 2.619: [Blue] ~3498 levels ~30720 states ~75912 transitions
pins2lts-mc-linux64( 1/ 8), 4.786: [Blue] ~6856 levels ~61440 states ~144632 transitions
pins2lts-mc-linux64( 0/ 8), 9.049: [Blue] ~13026 levels ~122880 states ~220664 transitions
pins2lts-mc-linux64( 0/ 8), 17.129: [Blue] ~25962 levels ~245760 states ~434136 transitions
pins2lts-mc-linux64( 6/ 8), 32.624: [Blue] ~61440 levels ~491520 states ~1200456 transitions
pins2lts-mc-linux64( 6/ 8), 63.669: [Blue] ~122880 levels ~983040 states ~2394160 transitions
pins2lts-mc-linux64( 6/ 8), 124.894: [Blue] ~245760 levels ~1966080 states ~4781544 transitions
pins2lts-mc-linux64( 6/ 8), 247.054: [Blue] ~491520 levels ~3932160 states ~9556296 transitions
pins2lts-mc-linux64( 6/ 8), 490.608: [Blue] ~983040 levels ~7864320 states ~19105840 transitions
pins2lts-mc-linux64( 6/ 8), 978.178: [Blue] ~1966080 levels ~15728640 states ~38204904 transitions
pins2lts-mc-linux64( 6/ 8), 1956.112: [Blue] ~3932160 levels ~31457280 states ~76403016 transitions
pins2lts-mc-linux64( 7/ 8), 3048.927: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 3048.940:
pins2lts-mc-linux64( 0/ 8), 3048.940: Explored 47576540 states 142124808 transitions, fanout: 2.987
pins2lts-mc-linux64( 0/ 8), 3048.940: Total exploration time 3048.740 sec (3048.710 sec minimum, 3048.729 sec on average)
pins2lts-mc-linux64( 0/ 8), 3048.940: States per second: 15605, Transitions per second: 46618
pins2lts-mc-linux64( 0/ 8), 3048.940:
pins2lts-mc-linux64( 0/ 8), 3048.940: State space has 134216029 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 3048.940: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 3048.940: blue states: 47576540 (35.45%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 3048.940: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 3048.940: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 3048.940:
pins2lts-mc-linux64( 0/ 8), 3048.940: Total memory used for local state coloring: 629.4MB
pins2lts-mc-linux64( 0/ 8), 3048.940:
pins2lts-mc-linux64( 0/ 8), 3048.941: Queue width: 8B, total height: 41250949, memory: 314.72MB
pins2lts-mc-linux64( 0/ 8), 3048.941: Tree memory: 1274.4MB, 10.0 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 3048.941: Tree fill ratio (roots/leafs): 99.0%/97.0%
pins2lts-mc-linux64( 0/ 8), 3048.941: Stored 5037 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 3048.941: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 3048.941: Est. total memory use: 1589.2MB (~1338.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5931444794849092135;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X([](<>(X(X(X([](X((LTLAPp0==true))))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5931444794849092135;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X([](<>(X(X(X([](X((LTLAPp0==true))))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-q8m256"
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-4028"
echo " Executing tool itstools"
echo " Input is BugTracking-PT-q8m256, 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 r312-tall-165472281800124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m256.tgz
mv BugTracking-PT-q8m256 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 '
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 ;