About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S32C10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16216.075 | 3600000.00 | 6744114.00 | 87806.60 | F?FFFFFFFTFFFFTF | 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.r132-tall-165271821500860.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 MultiCrashLeafsetExtension-PT-S32C10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821500860
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 33M
-rw-r--r-- 1 mcc users 9.5K Apr 29 16:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 29 16:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 29 16:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 16:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K May 9 08:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 9 08:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 9 08:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 08:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 32M May 10 09:34 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 MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652889801883
Running Version 202205111006
[2022-05-18 16:03:23] [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-05-18 16:03:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 16:03:24] [INFO ] Load time of PNML (sax parser for PT used): 1295 ms
[2022-05-18 16:03:24] [INFO ] Transformed 32088 places.
[2022-05-18 16:03:24] [INFO ] Transformed 48223 transitions.
[2022-05-18 16:03:24] [INFO ] Parsed PT model containing 32088 places and 48223 transitions in 1657 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 32088 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32088/32088 places, 48223/48223 transitions.
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 32032 transition count 48223
Applied a total of 56 rules in 2836 ms. Remains 32032 /32088 variables (removed 56) and now considering 48223/48223 (removed 0) transitions.
[2022-05-18 16:03:28] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
// Phase 1: matrix 47167 rows 32032 cols
[2022-05-18 16:03:42] [INFO ] Computed 1837 place invariants in 13590 ms
[2022-05-18 16:03:45] [INFO ] Implicit Places using invariants in 16545 ms returned []
Implicit Place search using SMT only with invariants took 16576 ms to find 0 implicit places.
[2022-05-18 16:03:45] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
// Phase 1: matrix 47167 rows 32032 cols
[2022-05-18 16:03:54] [INFO ] Computed 1837 place invariants in 9512 ms
[2022-05-18 16:03:57] [INFO ] Dead Transitions using invariants and state equation in 12246 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 32032/32088 places, 48223/48223 transitions.
Finished structural reductions, in 1 iterations. Remains : 32032/32088 places, 48223/48223 transitions.
Support contains 48 out of 32032 places after structural reductions.
[2022-05-18 16:03:59] [INFO ] Flatten gal took : 1765 ms
[2022-05-18 16:04:01] [INFO ] Flatten gal took : 1428 ms
[2022-05-18 16:04:04] [INFO ] Input system was already deterministic with 48223 transitions.
Incomplete random walk after 10000 steps, including 97 resets, run finished after 1009 ms. (steps per millisecond=9 ) properties (out of 28) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
[2022-05-18 16:04:05] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
// Phase 1: matrix 47167 rows 32032 cols
[2022-05-18 16:04:14] [INFO ] Computed 1837 place invariants in 8879 ms
[2022-05-18 16:04:28] [INFO ] [Real]Absence check using 63 positive place invariants in 458 ms returned sat
[2022-05-18 16:04:31] [INFO ] [Real]Absence check using 63 positive and 1774 generalized place invariants in 2370 ms returned sat
[2022-05-18 16:04:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 16:04:39] [INFO ] After 25224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 22 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 34 out of 32032 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 32032/32032 places, 48223/48223 transitions.
Drop transitions removed 10473 transitions
Trivial Post-agglo rules discarded 10473 transitions
Performed 10473 trivial Post agglomeration. Transition count delta: 10473
Iterating post reduction 0 with 10473 rules applied. Total rules applied 10473 place count 32032 transition count 37750
Reduce places removed 10473 places and 0 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Iterating post reduction 1 with 10553 rules applied. Total rules applied 21026 place count 21559 transition count 37670
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 21106 place count 21479 transition count 37670
Performed 654 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 654 Pre rules applied. Total rules applied 21106 place count 21479 transition count 37016
Deduced a syphon composed of 654 places in 65 ms
Reduce places removed 654 places and 0 transitions.
Iterating global reduction 3 with 1308 rules applied. Total rules applied 22414 place count 20825 transition count 37016
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 81 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 22478 place count 20793 transition count 36984
Free-agglomeration rule (complex) applied 1572 times.
Iterating global reduction 3 with 1572 rules applied. Total rules applied 24050 place count 20793 transition count 35412
Reduce places removed 1572 places and 0 transitions.
Iterating post reduction 3 with 1572 rules applied. Total rules applied 25622 place count 19221 transition count 35412
Partial Free-agglomeration rule applied 5193 times.
Drop transitions removed 5193 transitions
Iterating global reduction 4 with 5193 rules applied. Total rules applied 30815 place count 19221 transition count 35412
Applied a total of 30815 rules in 15281 ms. Remains 19221 /32032 variables (removed 12811) and now considering 35412/48223 (removed 12811) transitions.
Finished structural reductions, in 1 iterations. Remains : 19221/32032 places, 35412/48223 transitions.
Incomplete random walk after 10000 steps, including 162 resets, run finished after 1316 ms. (steps per millisecond=7 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 7439 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 7439 steps, saw 3634 distinct states, run finished after 3003 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 21 properties.
[2022-05-18 16:04:59] [INFO ] Flow matrix only has 33846 transitions (discarded 1566 similar events)
// Phase 1: matrix 33846 rows 19221 cols
[2022-05-18 16:05:16] [INFO ] Computed 1837 place invariants in 16918 ms
[2022-05-18 16:05:24] [INFO ] [Real]Absence check using 65 positive place invariants in 199 ms returned sat
[2022-05-18 16:05:26] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1693 ms returned sat
[2022-05-18 16:05:41] [INFO ] After 9268ms SMT Verify possible using state equation in real domain returned unsat :0 sat :20
[2022-05-18 16:05:42] [INFO ] State equation strengthened by 15490 read => feed constraints.
[2022-05-18 16:05:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 16:05:42] [INFO ] After 25789ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 21 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 34 out of 19221 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 19221/19221 places, 35412/35412 transitions.
Applied a total of 0 rules in 1419 ms. Remains 19221 /19221 variables (removed 0) and now considering 35412/35412 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 19221/19221 places, 35412/35412 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 19221/19221 places, 35412/35412 transitions.
Applied a total of 0 rules in 1364 ms. Remains 19221 /19221 variables (removed 0) and now considering 35412/35412 (removed 0) transitions.
[2022-05-18 16:05:45] [INFO ] Flow matrix only has 33846 transitions (discarded 1566 similar events)
// Phase 1: matrix 33846 rows 19221 cols
[2022-05-18 16:06:00] [INFO ] Computed 1837 place invariants in 14621 ms
[2022-05-18 16:06:01] [INFO ] Implicit Places using invariants in 16255 ms returned []
Implicit Place search using SMT only with invariants took 16267 ms to find 0 implicit places.
[2022-05-18 16:06:01] [INFO ] Flow matrix only has 33846 transitions (discarded 1566 similar events)
// Phase 1: matrix 33846 rows 19221 cols
[2022-05-18 16:06:16] [INFO ] Computed 1837 place invariants in 14493 ms
[2022-05-18 16:06:17] [INFO ] Dead Transitions using invariants and state equation in 16085 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 19221/19221 places, 35412/35412 transitions.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 26016 stabilizing places and 36254 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U ((X(F(p1))||p0) U p1)) U X(p0))||G(p1)))'
Support contains 4 out of 32032 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32032/32032 places, 48223/48223 transitions.
Applied a total of 0 rules in 1729 ms. Remains 32032 /32032 variables (removed 0) and now considering 48223/48223 (removed 0) transitions.
[2022-05-18 16:06:19] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
// Phase 1: matrix 47167 rows 32032 cols
[2022-05-18 16:06:28] [INFO ] Computed 1837 place invariants in 8243 ms
[2022-05-18 16:06:30] [INFO ] Implicit Places using invariants in 10799 ms returned []
Implicit Place search using SMT only with invariants took 10808 ms to find 0 implicit places.
[2022-05-18 16:06:30] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
// Phase 1: matrix 47167 rows 32032 cols
[2022-05-18 16:06:38] [INFO ] Computed 1837 place invariants in 8039 ms
[2022-05-18 16:06:41] [INFO ] Dead Transitions using invariants and state equation in 11046 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32032/32032 places, 48223/48223 transitions.
Stuttering acceptance computed with spot in 378 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s17475 1) (GEQ s17598 1)), p0:(AND (GEQ s25629 1) (GEQ s31451 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 103 steps with 0 reset in 16 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-00 finished in 24241 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0) U (!p1&&F(!p2))))))'
Support contains 6 out of 32032 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32032/32032 places, 48223/48223 transitions.
Drop transitions removed 10560 transitions
Trivial Post-agglo rules discarded 10560 transitions
Performed 10560 trivial Post agglomeration. Transition count delta: 10560
Iterating post reduction 0 with 10560 rules applied. Total rules applied 10560 place count 32032 transition count 37663
Reduce places removed 10560 places and 0 transitions.
Iterating post reduction 1 with 10560 rules applied. Total rules applied 21120 place count 21472 transition count 37663
Performed 660 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 660 Pre rules applied. Total rules applied 21120 place count 21472 transition count 37003
Deduced a syphon composed of 660 places in 111 ms
Reduce places removed 660 places and 0 transitions.
Iterating global reduction 2 with 1320 rules applied. Total rules applied 22440 place count 20812 transition count 37003
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 62 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 22504 place count 20780 transition count 36971
Applied a total of 22504 rules in 6236 ms. Remains 20780 /32032 variables (removed 11252) and now considering 36971/48223 (removed 11252) transitions.
[2022-05-18 16:06:48] [INFO ] Flow matrix only has 35915 transitions (discarded 1056 similar events)
// Phase 1: matrix 35915 rows 20780 cols
[2022-05-18 16:06:53] [INFO ] Computed 1837 place invariants in 5252 ms
[2022-05-18 16:06:55] [INFO ] Implicit Places using invariants in 6985 ms returned []
Implicit Place search using SMT only with invariants took 6987 ms to find 0 implicit places.
[2022-05-18 16:06:55] [INFO ] Flow matrix only has 35915 transitions (discarded 1056 similar events)
// Phase 1: matrix 35915 rows 20780 cols
[2022-05-18 16:07:00] [INFO ] Computed 1837 place invariants in 5230 ms
[2022-05-18 16:07:02] [INFO ] Dead Transitions using invariants and state equation in 6857 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20780/32032 places, 36971/48223 transitions.
Finished structural reductions, in 1 iterations. Remains : 20780/32032 places, 36971/48223 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR p1 p2), p2, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR p2 p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={1} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={0, 1} source=0 dest: 3}], [{ cond=p2, acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={1} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={1} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s3059 1) (GEQ s13579 1)), p0:(AND (GEQ s18241 1) (GEQ s19139 1)), p2:(AND (GEQ s14134 1) (GEQ s17791 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1223 reset in 3329 ms.
Product exploration explored 100000 steps with 1223 reset in 3277 ms.
Computed a total of 14796 stabilizing places and 25034 stable transitions
Computed a total of 14796 stabilizing places and 25034 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 p0))), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (OR (NOT p1) p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 782 ms. Reduced automaton from 4 states, 15 edges and 3 AP to 4 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 145 ms :[(OR p1 p2), p2, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR p1 p2)]
Incomplete random walk after 10000 steps, including 122 resets, run finished after 632 ms. (steps per millisecond=15 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 6576 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 6576 steps, saw 3293 distinct states, run finished after 3001 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 8 properties.
[2022-05-18 16:07:15] [INFO ] Flow matrix only has 35915 transitions (discarded 1056 similar events)
// Phase 1: matrix 35915 rows 20780 cols
[2022-05-18 16:07:21] [INFO ] Computed 1837 place invariants in 6004 ms
[2022-05-18 16:07:25] [INFO ] [Real]Absence check using 63 positive place invariants in 174 ms returned sat
[2022-05-18 16:07:27] [INFO ] [Real]Absence check using 63 positive and 1774 generalized place invariants in 1570 ms returned sat
[2022-05-18 16:07:46] [INFO ] After 25011ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2022-05-18 16:07:50] [INFO ] [Nat]Absence check using 63 positive place invariants in 201 ms returned sat
[2022-05-18 16:07:52] [INFO ] [Nat]Absence check using 63 positive and 1774 generalized place invariants in 1942 ms returned sat
[2022-05-18 16:08:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 16:08:11] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:4
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 20780 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20780/20780 places, 36971/36971 transitions.
Free-agglomeration rule (complex) applied 1585 times.
Iterating global reduction 0 with 1585 rules applied. Total rules applied 1585 place count 20780 transition count 35386
Reduce places removed 1585 places and 0 transitions.
Iterating post reduction 0 with 1585 rules applied. Total rules applied 3170 place count 19195 transition count 35386
Applied a total of 3170 rules in 6301 ms. Remains 19195 /20780 variables (removed 1585) and now considering 35386/36971 (removed 1585) transitions.
Finished structural reductions, in 1 iterations. Remains : 19195/20780 places, 35386/36971 transitions.
Incomplete random walk after 10000 steps, including 162 resets, run finished after 1252 ms. (steps per millisecond=7 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 15501 steps, run timeout after 6001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 15501 steps, saw 7512 distinct states, run finished after 6001 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 7 properties.
[2022-05-18 16:08:25] [INFO ] Flow matrix only has 33820 transitions (discarded 1566 similar events)
// Phase 1: matrix 33820 rows 19195 cols
[2022-05-18 16:08:40] [INFO ] Computed 1837 place invariants in 14503 ms
[2022-05-18 16:08:44] [INFO ] [Real]Absence check using 65 positive place invariants in 177 ms returned sat
[2022-05-18 16:08:45] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1438 ms returned sat
[2022-05-18 16:09:05] [INFO ] After 18946ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2022-05-18 16:09:05] [INFO ] State equation strengthened by 15490 read => feed constraints.
[2022-05-18 16:09:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 16:09:05] [INFO ] After 25538ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 19195 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 19195/19195 places, 35386/35386 transitions.
Applied a total of 0 rules in 1403 ms. Remains 19195 /19195 variables (removed 0) and now considering 35386/35386 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 19195/19195 places, 35386/35386 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 19195/19195 places, 35386/35386 transitions.
Applied a total of 0 rules in 1386 ms. Remains 19195 /19195 variables (removed 0) and now considering 35386/35386 (removed 0) transitions.
[2022-05-18 16:09:08] [INFO ] Flow matrix only has 33820 transitions (discarded 1566 similar events)
// Phase 1: matrix 33820 rows 19195 cols
[2022-05-18 16:09:21] [INFO ] Computed 1837 place invariants in 12580 ms
[2022-05-18 16:09:22] [INFO ] Implicit Places using invariants in 14172 ms returned []
Implicit Place search using SMT only with invariants took 14174 ms to find 0 implicit places.
[2022-05-18 16:09:22] [INFO ] Flow matrix only has 33820 transitions (discarded 1566 similar events)
// Phase 1: matrix 33820 rows 19195 cols
[2022-05-18 16:09:35] [INFO ] Computed 1837 place invariants in 12465 ms
[2022-05-18 16:09:36] [INFO ] Dead Transitions using invariants and state equation in 14012 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 19195/19195 places, 35386/35386 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 p0))), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (OR (NOT p1) p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 788 ms. Reduced automaton from 4 states, 15 edges and 3 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(OR p1 p2), p2]
Stuttering acceptance computed with spot in 77 ms :[(OR p1 p2), p2]
Support contains 4 out of 20780 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 20780/20780 places, 36971/36971 transitions.
Applied a total of 0 rules in 2003 ms. Remains 20780 /20780 variables (removed 0) and now considering 36971/36971 (removed 0) transitions.
[2022-05-18 16:09:39] [INFO ] Flow matrix only has 35915 transitions (discarded 1056 similar events)
// Phase 1: matrix 35915 rows 20780 cols
[2022-05-18 16:09:45] [INFO ] Computed 1837 place invariants in 5720 ms
[2022-05-18 16:09:47] [INFO ] Implicit Places using invariants in 7316 ms returned []
Implicit Place search using SMT only with invariants took 7317 ms to find 0 implicit places.
[2022-05-18 16:09:47] [INFO ] Flow matrix only has 35915 transitions (discarded 1056 similar events)
// Phase 1: matrix 35915 rows 20780 cols
[2022-05-18 16:09:52] [INFO ] Computed 1837 place invariants in 5540 ms
[2022-05-18 16:09:54] [INFO ] Dead Transitions using invariants and state equation in 7163 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20780/20780 places, 36971/36971 transitions.
Computed a total of 14796 stabilizing places and 25034 stable transitions
Computed a total of 14796 stabilizing places and 25034 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 294 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 240 ms :[(OR p1 p2), p2]
Incomplete random walk after 10000 steps, including 122 resets, run finished after 459 ms. (steps per millisecond=21 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 6977 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 6977 steps, saw 3468 distinct states, run finished after 3001 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 3 properties.
[2022-05-18 16:09:58] [INFO ] Flow matrix only has 35915 transitions (discarded 1056 similar events)
// Phase 1: matrix 35915 rows 20780 cols
[2022-05-18 16:10:04] [INFO ] Computed 1837 place invariants in 5568 ms
[2022-05-18 16:10:07] [INFO ] [Real]Absence check using 63 positive place invariants in 181 ms returned sat
[2022-05-18 16:10:09] [INFO ] [Real]Absence check using 63 positive and 1774 generalized place invariants in 1826 ms returned sat
[2022-05-18 16:10:29] [INFO ] After 25014ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 16:10:32] [INFO ] [Nat]Absence check using 63 positive place invariants in 188 ms returned sat
[2022-05-18 16:10:33] [INFO ] [Nat]Absence check using 63 positive and 1774 generalized place invariants in 1442 ms returned sat
[2022-05-18 16:10:54] [INFO ] After 19580ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 16:10:54] [INFO ] State equation strengthened by 15490 read => feed constraints.
[2022-05-18 16:10:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 16:10:54] [INFO ] After 25160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 20780 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20780/20780 places, 36971/36971 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 51 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 20779 transition count 36970
Free-agglomeration rule (complex) applied 1586 times.
Iterating global reduction 0 with 1586 rules applied. Total rules applied 1588 place count 20779 transition count 35384
Reduce places removed 1586 places and 0 transitions.
Iterating post reduction 0 with 1586 rules applied. Total rules applied 3174 place count 19193 transition count 35384
Applied a total of 3174 rules in 7913 ms. Remains 19193 /20780 variables (removed 1587) and now considering 35384/36971 (removed 1587) transitions.
Finished structural reductions, in 1 iterations. Remains : 19193/20780 places, 35384/36971 transitions.
Incomplete random walk after 10000 steps, including 162 resets, run finished after 1213 ms. (steps per millisecond=8 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 7963 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 7963 steps, saw 3865 distinct states, run finished after 3001 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 3 properties.
[2022-05-18 16:11:07] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
// Phase 1: matrix 33818 rows 19193 cols
[2022-05-18 16:11:18] [INFO ] Computed 1837 place invariants in 11590 ms
[2022-05-18 16:11:21] [INFO ] [Real]Absence check using 65 positive place invariants in 180 ms returned sat
[2022-05-18 16:11:23] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1384 ms returned sat
[2022-05-18 16:11:43] [INFO ] After 25017ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 16:11:46] [INFO ] [Nat]Absence check using 65 positive place invariants in 178 ms returned sat
[2022-05-18 16:11:47] [INFO ] [Nat]Absence check using 65 positive and 1772 generalized place invariants in 1184 ms returned sat
[2022-05-18 16:12:08] [INFO ] After 20189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 16:12:09] [INFO ] State equation strengthened by 15490 read => feed constraints.
[2022-05-18 16:12:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 16:12:09] [INFO ] After 25651ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 19193 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 19193/19193 places, 35384/35384 transitions.
Applied a total of 0 rules in 1326 ms. Remains 19193 /19193 variables (removed 0) and now considering 35384/35384 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 19193/19193 places, 35384/35384 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 19193/19193 places, 35384/35384 transitions.
Applied a total of 0 rules in 1446 ms. Remains 19193 /19193 variables (removed 0) and now considering 35384/35384 (removed 0) transitions.
[2022-05-18 16:12:12] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
// Phase 1: matrix 33818 rows 19193 cols
[2022-05-18 16:12:25] [INFO ] Computed 1837 place invariants in 13251 ms
[2022-05-18 16:12:27] [INFO ] Implicit Places using invariants in 14799 ms returned []
Implicit Place search using SMT only with invariants took 14800 ms to find 0 implicit places.
[2022-05-18 16:12:27] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
// Phase 1: matrix 33818 rows 19193 cols
[2022-05-18 16:12:40] [INFO ] Computed 1837 place invariants in 12970 ms
[2022-05-18 16:12:41] [INFO ] Dead Transitions using invariants and state equation in 14496 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 19193/19193 places, 35384/35384 transitions.
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 266 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(OR p1 p2), p2]
Stuttering acceptance computed with spot in 72 ms :[(OR p1 p2), p2]
Stuttering acceptance computed with spot in 61 ms :[(OR p1 p2), p2]
Product exploration explored 100000 steps with 1223 reset in 2957 ms.
Product exploration explored 100000 steps with 1222 reset in 2971 ms.
Built C files in :
/tmp/ltsmin18315475300065259206
[2022-05-18 16:12:48] [INFO ] Too many transitions (36971) to apply POR reductions. Disabling POR matrices.
[2022-05-18 16:12:48] [INFO ] Built C files in 442ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18315475300065259206
Running compilation step : cd /tmp/ltsmin18315475300065259206;'/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/ltsmin18315475300065259206;'/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/ltsmin18315475300065259206;'/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 4 out of 20780 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20780/20780 places, 36971/36971 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 52 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 20779 transition count 36970
Applied a total of 2 rules in 3928 ms. Remains 20779 /20780 variables (removed 1) and now considering 36970/36971 (removed 1) transitions.
[2022-05-18 16:12:55] [INFO ] Flow matrix only has 35914 transitions (discarded 1056 similar events)
// Phase 1: matrix 35914 rows 20779 cols
[2022-05-18 16:13:00] [INFO ] Computed 1837 place invariants in 5189 ms
[2022-05-18 16:13:02] [INFO ] Implicit Places using invariants in 6846 ms returned []
Implicit Place search using SMT only with invariants took 6858 ms to find 0 implicit places.
[2022-05-18 16:13:02] [INFO ] Flow matrix only has 35914 transitions (discarded 1056 similar events)
// Phase 1: matrix 35914 rows 20779 cols
[2022-05-18 16:13:07] [INFO ] Computed 1837 place invariants in 5540 ms
[2022-05-18 16:13:09] [INFO ] Dead Transitions using invariants and state equation in 7210 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20779/20780 places, 36970/36971 transitions.
Finished structural reductions, in 1 iterations. Remains : 20779/20780 places, 36970/36971 transitions.
Built C files in :
/tmp/ltsmin16706521718760855326
[2022-05-18 16:13:09] [INFO ] Too many transitions (36970) to apply POR reductions. Disabling POR matrices.
[2022-05-18 16:13:09] [INFO ] Built C files in 373ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16706521718760855326
Running compilation step : cd /tmp/ltsmin16706521718760855326;'/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/ltsmin16706521718760855326;'/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/ltsmin16706521718760855326;'/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-05-18 16:13:17] [INFO ] Flatten gal took : 1835 ms
[2022-05-18 16:13:18] [INFO ] Flatten gal took : 1146 ms
[2022-05-18 16:13:18] [INFO ] Time to serialize gal into /tmp/LTL16122087363322450583.gal : 477 ms
[2022-05-18 16:13:18] [INFO ] Time to serialize properties into /tmp/LTL1371202751377513736.ltl : 21 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/LTL16122087363322450583.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1371202751377513736.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/LTL1612208...267
Read 1 LTL properties
Detected timeout of ITS tools.
[2022-05-18 16:13:35] [INFO ] Flatten gal took : 1267 ms
[2022-05-18 16:13:35] [INFO ] Applying decomposition
[2022-05-18 16:13:36] [INFO ] Flatten gal took : 1235 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/graph156670144772125844.txt' '-o' '/tmp/graph156670144772125844.bin' '-w' '/tmp/graph156670144772125844.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph156670144772125844.bin' '-l' '-1' '-v' '-w' '/tmp/graph156670144772125844.weights' '-q' '0' '-e' '0.001'
[2022-05-18 16:13:40] [INFO ] Decomposing Gal with order
[2022-05-18 16:13:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 16:14:05] [INFO ] Removed a total of 28722 redundant transitions.
[2022-05-18 16:14:06] [INFO ] Flatten gal took : 15218 ms
[2022-05-18 16:14:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 9213 labels/synchronizations in 3491 ms.
[2022-05-18 16:14:13] [INFO ] Time to serialize gal into /tmp/LTL12370095268569050393.gal : 433 ms
[2022-05-18 16:14:13] [INFO ] Time to serialize properties into /tmp/LTL8374296856426783051.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/LTL12370095268569050393.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8374296856426783051.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/LTL1237009...246
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3114830315230359151
[2022-05-18 16:14:28] [INFO ] Built C files in 298ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3114830315230359151
Running compilation step : cd /tmp/ltsmin3114830315230359151;'/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/ltsmin3114830315230359151;'/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/ltsmin3114830315230359151;'/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 MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-01 finished in 469069 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 32032 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32032/32032 places, 48223/48223 transitions.
Drop transitions removed 10559 transitions
Trivial Post-agglo rules discarded 10559 transitions
Performed 10559 trivial Post agglomeration. Transition count delta: 10559
Iterating post reduction 0 with 10559 rules applied. Total rules applied 10559 place count 32032 transition count 37664
Reduce places removed 10559 places and 0 transitions.
Iterating post reduction 1 with 10559 rules applied. Total rules applied 21118 place count 21473 transition count 37664
Performed 660 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 660 Pre rules applied. Total rules applied 21118 place count 21473 transition count 37004
Deduced a syphon composed of 660 places in 169 ms
Reduce places removed 660 places and 0 transitions.
Iterating global reduction 2 with 1320 rules applied. Total rules applied 22438 place count 20813 transition count 37004
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 59 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 22504 place count 20780 transition count 36971
Applied a total of 22504 rules in 8688 ms. Remains 20780 /32032 variables (removed 11252) and now considering 36971/48223 (removed 11252) transitions.
[2022-05-18 16:14:40] [INFO ] Flow matrix only has 35915 transitions (discarded 1056 similar events)
// Phase 1: matrix 35915 rows 20780 cols
[2022-05-18 16:14:46] [INFO ] Computed 1837 place invariants in 6018 ms
[2022-05-18 16:14:47] [INFO ] Implicit Places using invariants in 7528 ms returned []
Implicit Place search using SMT only with invariants took 7529 ms to find 0 implicit places.
[2022-05-18 16:14:47] [INFO ] Flow matrix only has 35915 transitions (discarded 1056 similar events)
// Phase 1: matrix 35915 rows 20780 cols
[2022-05-18 16:14:54] [INFO ] Computed 1837 place invariants in 6692 ms
[2022-05-18 16:14:55] [INFO ] Dead Transitions using invariants and state equation in 8167 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20780/32032 places, 36971/48223 transitions.
Finished structural reductions, in 1 iterations. Remains : 20780/32032 places, 36971/48223 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-02 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:(GEQ s4003 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 85 steps with 0 reset in 5 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-02 finished in 24585 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&(p1 U p0))))'
Support contains 4 out of 32032 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32032/32032 places, 48223/48223 transitions.
Applied a total of 0 rules in 1863 ms. Remains 32032 /32032 variables (removed 0) and now considering 48223/48223 (removed 0) transitions.
[2022-05-18 16:14:57] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
// Phase 1: matrix 47167 rows 32032 cols
[2022-05-18 16:15:14] [INFO ] Computed 1837 place invariants in 16312 ms
[2022-05-18 16:15:16] [INFO ] Implicit Places using invariants in 18528 ms returned []
Implicit Place search using SMT only with invariants took 18528 ms to find 0 implicit places.
[2022-05-18 16:15:16] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
// Phase 1: matrix 47167 rows 32032 cols
[2022-05-18 16:15:33] [INFO ] Computed 1837 place invariants in 16857 ms
[2022-05-18 16:15:35] [INFO ] Dead Transitions using invariants and state equation in 19042 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32032/32032 places, 48223/48223 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(OR p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s3620 1) (GEQ s28125 1)), p1:(AND (GEQ s6764 1) (GEQ s20893 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-03 finished in 39767 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X(F(p0))||F(p2)))'
Support contains 4 out of 32032 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32032/32032 places, 48223/48223 transitions.
Applied a total of 0 rules in 1875 ms. Remains 32032 /32032 variables (removed 0) and now considering 48223/48223 (removed 0) transitions.
[2022-05-18 16:15:37] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
// Phase 1: matrix 47167 rows 32032 cols
[2022-05-18 16:15:53] [INFO ] Computed 1837 place invariants in 15550 ms
[2022-05-18 16:15:55] [INFO ] Implicit Places using invariants in 17739 ms returned []
Implicit Place search using SMT only with invariants took 17742 ms to find 0 implicit places.
[2022-05-18 16:15:55] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
// Phase 1: matrix 47167 rows 32032 cols
[2022-05-18 16:16:03] [INFO ] Computed 1837 place invariants in 8351 ms
[2022-05-18 16:16:05] [INFO ] Dead Transitions using invariants and state equation in 10508 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32032/32032 places, 48223/48223 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s4676 1) (GEQ s31347 1)), p2:(GEQ s2613 1), p1:(GEQ s19785 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 6 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-05 finished in 30402 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)&&p1))&&F(p2)))'
Support contains 4 out of 32032 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32032/32032 places, 48223/48223 transitions.
Applied a total of 0 rules in 1803 ms. Remains 32032 /32032 variables (removed 0) and now considering 48223/48223 (removed 0) transitions.
[2022-05-18 16:16:08] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
// Phase 1: matrix 47167 rows 32032 cols
[2022-05-18 16:16:16] [INFO ] Computed 1837 place invariants in 8796 ms
[2022-05-18 16:16:18] [INFO ] Implicit Places using invariants in 10970 ms returned []
Implicit Place search using SMT only with invariants took 10970 ms to find 0 implicit places.
[2022-05-18 16:16:19] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
// Phase 1: matrix 47167 rows 32032 cols
[2022-05-18 16:16:28] [INFO ] Computed 1837 place invariants in 9704 ms
[2022-05-18 16:16:30] [INFO ] Dead Transitions using invariants and state equation in 11878 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32032/32032 places, 48223/48223 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), true, (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(GEQ s15933 1), p1:(GEQ s13768 1), p0:(AND (GEQ s15571 1) (GEQ s31556 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-07 finished in 25020 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(G(p0)))))'
Support contains 2 out of 32032 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32032/32032 places, 48223/48223 transitions.
Drop transitions removed 10544 transitions
Trivial Post-agglo rules discarded 10544 transitions
Performed 10544 trivial Post agglomeration. Transition count delta: 10544
Iterating post reduction 0 with 10544 rules applied. Total rules applied 10544 place count 32032 transition count 37679
Reduce places removed 10544 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 10560 rules applied. Total rules applied 21104 place count 21488 transition count 37663
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 21120 place count 21472 transition count 37663
Performed 659 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 659 Pre rules applied. Total rules applied 21120 place count 21472 transition count 37004
Deduced a syphon composed of 659 places in 83 ms
Reduce places removed 659 places and 0 transitions.
Iterating global reduction 3 with 1318 rules applied. Total rules applied 22438 place count 20813 transition count 37004
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 72 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 22504 place count 20780 transition count 36971
Applied a total of 22504 rules in 6819 ms. Remains 20780 /32032 variables (removed 11252) and now considering 36971/48223 (removed 11252) transitions.
[2022-05-18 16:16:38] [INFO ] Flow matrix only has 35915 transitions (discarded 1056 similar events)
// Phase 1: matrix 35915 rows 20780 cols
[2022-05-18 16:16:43] [INFO ] Computed 1837 place invariants in 5314 ms
[2022-05-18 16:16:44] [INFO ] Implicit Places using invariants in 6772 ms returned []
Implicit Place search using SMT only with invariants took 6773 ms to find 0 implicit places.
[2022-05-18 16:16:44] [INFO ] Flow matrix only has 35915 transitions (discarded 1056 similar events)
// Phase 1: matrix 35915 rows 20780 cols
[2022-05-18 16:16:50] [INFO ] Computed 1837 place invariants in 5747 ms
[2022-05-18 16:16:52] [INFO ] Dead Transitions using invariants and state equation in 7206 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20780/32032 places, 36971/48223 transitions.
Finished structural reductions, in 1 iterations. Remains : 20780/32032 places, 36971/48223 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s16583 1) (GEQ s16698 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 5 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-08 finished in 20958 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(G(p0) U p1)||p2)))'
Support contains 5 out of 32032 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32032/32032 places, 48223/48223 transitions.
Applied a total of 0 rules in 1766 ms. Remains 32032 /32032 variables (removed 0) and now considering 48223/48223 (removed 0) transitions.
[2022-05-18 16:16:53] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
// Phase 1: matrix 47167 rows 32032 cols
[2022-05-18 16:17:07] [INFO ] Computed 1837 place invariants in 13451 ms
[2022-05-18 16:17:09] [INFO ] Implicit Places using invariants in 15624 ms returned []
Implicit Place search using SMT only with invariants took 15625 ms to find 0 implicit places.
[2022-05-18 16:17:09] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
// Phase 1: matrix 47167 rows 32032 cols
[2022-05-18 16:17:24] [INFO ] Computed 1837 place invariants in 14895 ms
[2022-05-18 16:17:26] [INFO ] Dead Transitions using invariants and state equation in 17091 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32032/32032 places, 48223/48223 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, p0, (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(GEQ s15194 1), p2:(AND (GEQ s2943 1) (GEQ s31661 1)), p1:(AND (GEQ s4622 1) (GEQ s4707 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 52430 steps with 26215 reset in 10001 ms.
Product exploration timeout after 51550 steps with 25775 reset in 10001 ms.
Computed a total of 26016 stabilizing places and 36254 stable transitions
Computed a total of 26016 stabilizing places and 36254 stable transitions
Detected a total of 26016/32032 stabilizing places and 36254/48223 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) p0 (NOT p1))))
Knowledge based reduction with 9 factoid took 186 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-09 finished in 55221 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(X((G(X(p0)) U p0))))))'
Support contains 1 out of 32032 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32032/32032 places, 48223/48223 transitions.
Drop transitions removed 10559 transitions
Trivial Post-agglo rules discarded 10559 transitions
Performed 10559 trivial Post agglomeration. Transition count delta: 10559
Iterating post reduction 0 with 10559 rules applied. Total rules applied 10559 place count 32032 transition count 37664
Reduce places removed 10559 places and 0 transitions.
Iterating post reduction 1 with 10559 rules applied. Total rules applied 21118 place count 21473 transition count 37664
Performed 660 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 660 Pre rules applied. Total rules applied 21118 place count 21473 transition count 37004
Deduced a syphon composed of 660 places in 79 ms
Reduce places removed 660 places and 0 transitions.
Iterating global reduction 2 with 1320 rules applied. Total rules applied 22438 place count 20813 transition count 37004
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 82 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 22504 place count 20780 transition count 36971
Applied a total of 22504 rules in 6534 ms. Remains 20780 /32032 variables (removed 11252) and now considering 36971/48223 (removed 11252) transitions.
[2022-05-18 16:17:53] [INFO ] Flow matrix only has 35915 transitions (discarded 1056 similar events)
// Phase 1: matrix 35915 rows 20780 cols
[2022-05-18 16:17:59] [INFO ] Computed 1837 place invariants in 5498 ms
[2022-05-18 16:18:00] [INFO ] Implicit Places using invariants in 6968 ms returned []
Implicit Place search using SMT only with invariants took 6969 ms to find 0 implicit places.
[2022-05-18 16:18:00] [INFO ] Flow matrix only has 35915 transitions (discarded 1056 similar events)
// Phase 1: matrix 35915 rows 20780 cols
[2022-05-18 16:18:06] [INFO ] Computed 1837 place invariants in 5395 ms
[2022-05-18 16:18:07] [INFO ] Dead Transitions using invariants and state equation in 6893 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20780/32032 places, 36971/48223 transitions.
Finished structural reductions, in 1 iterations. Remains : 20780/32032 places, 36971/48223 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-10 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:(GEQ s9991 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 80 steps with 0 reset in 5 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-10 finished in 20686 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((F(p0)&&(!p0 U p1))))))'
Support contains 4 out of 32032 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32032/32032 places, 48223/48223 transitions.
Drop transitions removed 10528 transitions
Trivial Post-agglo rules discarded 10528 transitions
Performed 10528 trivial Post agglomeration. Transition count delta: 10528
Iterating post reduction 0 with 10528 rules applied. Total rules applied 10528 place count 32032 transition count 37695
Reduce places removed 10528 places and 0 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 1 with 10560 rules applied. Total rules applied 21088 place count 21504 transition count 37663
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 21120 place count 21472 transition count 37663
Performed 658 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 658 Pre rules applied. Total rules applied 21120 place count 21472 transition count 37005
Deduced a syphon composed of 658 places in 79 ms
Reduce places removed 658 places and 0 transitions.
Iterating global reduction 3 with 1316 rules applied. Total rules applied 22436 place count 20814 transition count 37005
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 112 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 22502 place count 20781 transition count 36972
Applied a total of 22502 rules in 6945 ms. Remains 20781 /32032 variables (removed 11251) and now considering 36972/48223 (removed 11251) transitions.
[2022-05-18 16:18:15] [INFO ] Flow matrix only has 35916 transitions (discarded 1056 similar events)
// Phase 1: matrix 35916 rows 20781 cols
[2022-05-18 16:18:20] [INFO ] Computed 1837 place invariants in 5858 ms
[2022-05-18 16:18:22] [INFO ] Implicit Places using invariants in 7581 ms returned []
Implicit Place search using SMT only with invariants took 7585 ms to find 0 implicit places.
[2022-05-18 16:18:22] [INFO ] Flow matrix only has 35916 transitions (discarded 1056 similar events)
// Phase 1: matrix 35916 rows 20781 cols
[2022-05-18 16:18:29] [INFO ] Computed 1837 place invariants in 6692 ms
[2022-05-18 16:18:31] [INFO ] Dead Transitions using invariants and state equation in 8429 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20781/32032 places, 36972/48223 transitions.
Finished structural reductions, in 1 iterations. Remains : 20781/32032 places, 36972/48223 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s2460 1) (LT s2583 1)), p1:(AND (GEQ s14780 1) (GEQ s15322 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 8 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-11 finished in 23309 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G((G(p0)||p1))||p2))))'
Support contains 6 out of 32032 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32032/32032 places, 48223/48223 transitions.
Applied a total of 0 rules in 2009 ms. Remains 32032 /32032 variables (removed 0) and now considering 48223/48223 (removed 0) transitions.
[2022-05-18 16:18:33] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
// Phase 1: matrix 47167 rows 32032 cols
[2022-05-18 16:18:51] [INFO ] Computed 1837 place invariants in 18110 ms
[2022-05-18 16:18:54] [INFO ] Implicit Places using invariants in 20700 ms returned []
Implicit Place search using SMT only with invariants took 20701 ms to find 0 implicit places.
[2022-05-18 16:18:54] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
// Phase 1: matrix 47167 rows 32032 cols
[2022-05-18 16:19:07] [INFO ] Computed 1837 place invariants in 12864 ms
[2022-05-18 16:19:09] [INFO ] Dead Transitions using invariants and state equation in 15465 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32032/32032 places, 48223/48223 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(AND (GEQ s19694 1) (GEQ s20030 1)), p2:(AND (GEQ s28847 1) (GEQ s30730 1)), p1:(AND (GEQ s6766 1) (GEQ s14480 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 6 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-13 finished in 38449 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&p1)))'
Support contains 4 out of 32032 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32032/32032 places, 48223/48223 transitions.
Applied a total of 0 rules in 1829 ms. Remains 32032 /32032 variables (removed 0) and now considering 48223/48223 (removed 0) transitions.
[2022-05-18 16:19:11] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
// Phase 1: matrix 47167 rows 32032 cols
[2022-05-18 16:19:27] [INFO ] Computed 1837 place invariants in 15689 ms
[2022-05-18 16:19:29] [INFO ] Implicit Places using invariants in 17896 ms returned []
Implicit Place search using SMT only with invariants took 17899 ms to find 0 implicit places.
[2022-05-18 16:19:29] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
// Phase 1: matrix 47167 rows 32032 cols
[2022-05-18 16:19:44] [INFO ] Computed 1837 place invariants in 14738 ms
[2022-05-18 16:19:46] [INFO ] Dead Transitions using invariants and state equation in 16994 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32032/32032 places, 48223/48223 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (LT s28680 1) (LT s31976 1)), p0:(OR (LT s2470 1) (LT s12896 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C10-LTLFireability-15 finished in 37025 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0) U (!p1&&F(!p2))))))'
[2022-05-18 16:19:48] [INFO ] Flatten gal took : 1574 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15640626957013086762
[2022-05-18 16:19:49] [INFO ] Too many transitions (48223) to apply POR reductions. Disabling POR matrices.
[2022-05-18 16:19:49] [INFO ] Built C files in 373ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15640626957013086762
Running compilation step : cd /tmp/ltsmin15640626957013086762;'/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-05-18 16:19:50] [INFO ] Applying decomposition
[2022-05-18 16:19:52] [INFO ] Flatten gal took : 2381 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/graph2533402619931992581.txt' '-o' '/tmp/graph2533402619931992581.bin' '-w' '/tmp/graph2533402619931992581.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2533402619931992581.bin' '-l' '-1' '-v' '-w' '/tmp/graph2533402619931992581.weights' '-q' '0' '-e' '0.001'
[2022-05-18 16:19:56] [INFO ] Decomposing Gal with order
[2022-05-18 16:20:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 16:20:33] [INFO ] Removed a total of 32336 redundant transitions.
[2022-05-18 16:20:34] [INFO ] Flatten gal took : 11759 ms
[2022-05-18 16:20:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 6456 labels/synchronizations in 2135 ms.
[2022-05-18 16:20:38] [INFO ] Time to serialize gal into /tmp/LTLFireability5030245716600605.gal : 192 ms
[2022-05-18 16:20:38] [INFO ] Time to serialize properties into /tmp/LTLFireability17686580391547018360.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/LTLFireability5030245716600605.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17686580391547018360.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...265
Read 1 LTL properties
Checking formula 0 : !((F(G((G("((i1.u526.Node30HasDetectedCrashOfNode32>=1)&&(i0.u0.Node32IsTheNodeMaster>=1))"))U((!("((i2.i0.u153.Node3ThinksNode24Shoul...378
Formula 0 simplified : !FG(G"((i1.u526.Node30HasDetectedCrashOfNode32>=1)&&(i0.u0.Node32IsTheNodeMaster>=1))" U (!"((i2.i0.u153.Node3ThinksNode24ShouldBeNo...363
Compilation finished in 253393 ms.
Running link step : cd /tmp/ltsmin15640626957013086762;'gcc' '-shared' '-o' 'gal.so' 'model.o'
gcc: error: model.o: No such file or directory
gcc: fatal error: no input files
compilation terminated.
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Could not link executable .cd /tmp/ltsmin15640626957013086762;'gcc' '-shared' '-o' 'gal.so' 'model.o'
java.lang.RuntimeException: Could not link executable .cd /tmp/ltsmin15640626957013086762;'gcc' '-shared' '-o' 'gal.so' 'model.o'
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.linkPINS(LTSminRunner.java:342)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:829)
ITS-tools command line returned an error code 137
[2022-05-18 16:45:55] [INFO ] Flatten gal took : 8199 ms
[2022-05-18 16:45:55] [INFO ] Time to serialize gal into /tmp/LTLFireability17172221541160238324.gal : 208 ms
[2022-05-18 16:45:55] [INFO ] Time to serialize properties into /tmp/LTLFireability9493276036721542805.ltl : 4 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/LTLFireability17172221541160238324.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9493276036721542805.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...289
Read 1 LTL properties
Checking formula 0 : !((F(G((G("((Node30HasDetectedCrashOfNode32>=1)&&(Node32IsTheNodeMaster>=1))"))U((!("((Node3ThinksNode24ShouldBeNodeMasterToReplaceNod...323
Formula 0 simplified : !FG(G"((Node30HasDetectedCrashOfNode32>=1)&&(Node32IsTheNodeMaster>=1))" U (!"((Node3ThinksNode24ShouldBeNodeMasterToReplaceNode19>=...308
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="MultiCrashLeafsetExtension-PT-S32C10"
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 MultiCrashLeafsetExtension-PT-S32C10, 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 r132-tall-165271821500860"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S32C10.tgz
mv MultiCrashLeafsetExtension-PT-S32C10 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 ;