fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r276-smll-165307352900068
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for UtilityControlRoom-COL-Z2T4N08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1684.176 73850.00 185498.00 346.00 FFFFTFFFFFFTFFFF 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.r276-smll-165307352900068.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 UtilityControlRoom-COL-Z2T4N08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-165307352900068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 268K
-rw-r--r-- 1 mcc users 8.4K Apr 29 18:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 29 18:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 29 17:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 29 17:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 9 09:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 09:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 09:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 09:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 09:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 09:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 8 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 29K 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 UtilityControlRoom-COL-Z2T4N08-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z2T4N08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653118655238

Running Version 202205111006
[2022-05-21 07:37:36] [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-21 07:37:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 07:37:37] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-21 07:37:37] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-21 07:37:38] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 907 ms
[2022-05-21 07:37:38] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 140 PT places and 216.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2022-05-21 07:37:38] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 8 ms.
[2022-05-21 07:37:38] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 61 steps, including 0 resets, run visited all 13 properties in 25 ms. (steps per millisecond=2 )
[2022-05-21 07:37:38] [INFO ] Flatten gal took : 23 ms
[2022-05-21 07:37:38] [INFO ] Flatten gal took : 5 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(8), Z(2), Z(2)] of place MovetoZ breaks symmetries in sort Z
[2022-05-21 07:37:38] [INFO ] Unfolded HLPN to a Petri net with 140 places and 216 transitions 680 arcs in 21 ms.
[2022-05-21 07:37:38] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
Support contains 107 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Applied a total of 0 rules in 35 ms. Remains 140 /140 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 140 cols
[2022-05-21 07:37:38] [INFO ] Computed 19 place invariants in 40 ms
[2022-05-21 07:37:39] [INFO ] Implicit Places using invariants in 378 ms returned [99]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 452 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 139/140 places, 184/184 transitions.
Applied a total of 0 rules in 7 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 139/140 places, 184/184 transitions.
Support contains 107 out of 139 places after structural reductions.
[2022-05-21 07:37:39] [INFO ] Flatten gal took : 53 ms
[2022-05-21 07:37:39] [INFO ] Flatten gal took : 65 ms
[2022-05-21 07:37:39] [INFO ] Input system was already deterministic with 184 transitions.
Finished random walk after 35 steps, including 0 resets, run visited all 14 properties in 27 ms. (steps per millisecond=1 )
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F(p0) U p1))'
Support contains 35 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 48 place count 115 transition count 160
Applied a total of 48 rules in 40 ms. Remains 115 /139 variables (removed 24) and now considering 160/184 (removed 24) transitions.
// Phase 1: matrix 160 rows 115 cols
[2022-05-21 07:37:40] [INFO ] Computed 18 place invariants in 4 ms
[2022-05-21 07:37:40] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 160 rows 115 cols
[2022-05-21 07:37:40] [INFO ] Computed 18 place invariants in 4 ms
[2022-05-21 07:37:40] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2022-05-21 07:37:40] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 160 rows 115 cols
[2022-05-21 07:37:40] [INFO ] Computed 18 place invariants in 6 ms
[2022-05-21 07:37:40] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/139 places, 160/184 transitions.
Finished structural reductions, in 1 iterations. Remains : 115/139 places, 160/184 transitions.
Stuttering acceptance computed with spot in 342 ms :[(NOT p1), true, p0]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s24 1) (GEQ s25 1) (GEQ s26 1) (GEQ s27 1) (GEQ s28 1) (GEQ s29 1) (GEQ s31 1) (GEQ s30 1) (GEQ s33 1) (GEQ s32 1) (GEQ s18 1) (GEQ s19 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 4 steps with 1 reset in 3 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-00 finished in 967 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(X(p1))))'
Support contains 40 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 9 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:37:40] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 07:37:41] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:37:41] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 07:37:41] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:37:41] [INFO ] Computed 18 place invariants in 4 ms
[2022-05-21 07:37:41] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s70 1) (GEQ s105 1)) (AND (GEQ s67 1) (GEQ s103 1)) (AND (GEQ s65 1) (GEQ s102 1)) (AND (GEQ s62 1) (GEQ s101 1)) (AND (GEQ s60 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-01 finished in 571 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||X((p1 U p2)))))'
Support contains 51 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 9 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:37:41] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 07:37:41] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:37:41] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 07:37:41] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:37:41] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 07:37:41] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p2:(OR (AND (GEQ s0 1) (GEQ s25 1) (GEQ s82 1)) (AND (GEQ s1 1) (GEQ s13 1) (GEQ s82 1)) (AND (GEQ s0 1) (GEQ s20 1) (GEQ s82 1)) (AND (GEQ s0 1) (GEQ s10...], 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-02 finished in 638 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p1)&&p0)))'
Support contains 32 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 139 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 107 transition count 136
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 106 transition count 120
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 106 transition count 120
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 90 place count 98 transition count 112
Iterating global reduction 2 with 8 rules applied. Total rules applied 98 place count 98 transition count 112
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 49 rules applied. Total rules applied 147 place count 73 transition count 88
Applied a total of 147 rules in 32 ms. Remains 73 /139 variables (removed 66) and now considering 88/184 (removed 96) transitions.
// Phase 1: matrix 88 rows 73 cols
[2022-05-21 07:37:42] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-21 07:37:42] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 88 rows 73 cols
[2022-05-21 07:37:42] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-21 07:37:42] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2022-05-21 07:37:42] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 88 rows 73 cols
[2022-05-21 07:37:42] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-21 07:37:42] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/139 places, 88/184 transitions.
Finished structural reductions, in 1 iterations. Remains : 73/139 places, 88/184 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (LT s63 1) (LT s64 1) (LT s61 1) (LT s62 1) (LT s59 1) (LT s60 1) (LT s57 1) (LT s58 1)), p0:(AND (OR (GEQ s63 1) (GEQ s64 1) (GEQ s61 1) (GEQ s62...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3223 reset in 493 ms.
Stack based approach found an accepted trace after 695 steps with 20 reset with depth 32 and stack size 32 in 3 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-03 finished in 882 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(X(p0)))||G(p1)))'
Support contains 24 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 9 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:37:43] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 07:37:43] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:37:43] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 07:37:43] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:37:43] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:37:43] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 287 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (LT s84 1) (LT s83 1) (LT s86 1) (LT s85 1) (LT s89 1) (LT s87 1) (LT s90 1) (LT s88 1)), p1:(AND (LT s32 1) (LT s33 1) (LT s34 1) (LT s35 1) (LT ...], 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 explored 100000 steps with 33333 reset in 449 ms.
Product exploration explored 100000 steps with 33333 reset in 463 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 5 factoid took 256 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-04 finished in 1935 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))&&G(p1))))'
Support contains 51 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 139 transition count 168
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 123 transition count 168
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 48 place count 115 transition count 160
Applied a total of 48 rules in 15 ms. Remains 115 /139 variables (removed 24) and now considering 160/184 (removed 24) transitions.
// Phase 1: matrix 160 rows 115 cols
[2022-05-21 07:37:44] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:37:45] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 160 rows 115 cols
[2022-05-21 07:37:45] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 07:37:45] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2022-05-21 07:37:45] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 160 rows 115 cols
[2022-05-21 07:37:45] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 07:37:45] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/139 places, 160/184 transitions.
Finished structural reductions, in 1 iterations. Remains : 115/139 places, 160/184 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s10 1) (GEQ s74 1)) (AND (GEQ s1 1) (GEQ s17 1) (GEQ s74 1)) (AND (GEQ s1 1) (GEQ s7 1) (GEQ s74 1)) (AND (GEQ s1 1) (GEQ s5 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8557 reset in 506 ms.
Stack based approach found an accepted trace after 93990 steps with 7996 reset with depth 49 and stack size 49 in 742 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-06 finished in 1809 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(p1))))'
Support contains 56 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Applied a total of 0 rules in 3 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 139 cols
[2022-05-21 07:37:46] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:37:46] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 184 rows 139 cols
[2022-05-21 07:37:46] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:37:46] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
// Phase 1: matrix 184 rows 139 cols
[2022-05-21 07:37:46] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:37:47] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 139/139 places, 184/184 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s65 1) (GEQ s64 1) (GEQ s67 1) (GEQ s66 1) (GEQ s69 1) (GEQ s68 1) (GEQ s71 1) (GEQ s70 1) (GEQ s73 1) (GEQ s72 1) (GEQ s43 1) (GEQ s42 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-08 finished in 611 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 43 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 139 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 107 transition count 136
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 96 place count 99 transition count 128
Applied a total of 96 rules in 13 ms. Remains 99 /139 variables (removed 40) and now considering 128/184 (removed 56) transitions.
// Phase 1: matrix 128 rows 99 cols
[2022-05-21 07:37:47] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:37:47] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 128 rows 99 cols
[2022-05-21 07:37:47] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 07:37:47] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2022-05-21 07:37:47] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 128 rows 99 cols
[2022-05-21 07:37:47] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:37:47] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/139 places, 128/184 transitions.
Finished structural reductions, in 1 iterations. Remains : 99/139 places, 128/184 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (OR (LT s0 1) (LT s17 1) (LT s58 1)) (OR (LT s1 1) (LT s5 1) (LT s58 1)) (OR (LT s0 1) (LT s12 1) (LT s58 1)) (OR (LT s0 1) (LT s2 1) (LT s58 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 616 ms.
Stack based approach found an accepted trace after 3583 steps with 0 reset with depth 3584 and stack size 3584 in 28 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-09 finished in 969 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G((p0 U p1))))||F((G(p0) U p0))||F(p0)))'
Support contains 35 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 5 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:37:48] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:37:48] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:37:48] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:37:48] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:37:48] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:37:48] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (GEQ s32 1) (GEQ s33 1) (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s37 1) (GEQ s39 1) (GEQ s38 1) (GEQ s41 1) (GEQ s40 1) (GEQ s26 1) (GEQ s27 1) (GE...], 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][false, false, false, false]]
Product exploration explored 100000 steps with 7841 reset in 303 ms.
Product exploration explored 100000 steps with 7777 reset in 376 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 2 factoid took 166 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 10 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p0), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 2 factoid took 227 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:37:50] [INFO ] Computed 18 place invariants in 22 ms
[2022-05-21 07:37:50] [INFO ] [Real]Absence check using 18 positive place invariants in 14 ms returned sat
[2022-05-21 07:37:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:37:51] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2022-05-21 07:37:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:37:51] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2022-05-21 07:37:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:37:51] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2022-05-21 07:37:51] [INFO ] Computed and/alt/rep : 160/248/160 causal constraints (skipped 0 transitions) in 25 ms.
[2022-05-21 07:37:51] [INFO ] Added : 107 causal constraints over 22 iterations in 417 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 35 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:37:51] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:37:51] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:37:51] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:37:52] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:37:52] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:37:52] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 168/168 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 1 factoid took 223 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 21 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 330 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:37:53] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:37:53] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2022-05-21 07:37:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:37:53] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2022-05-21 07:37:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:37:53] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2022-05-21 07:37:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:37:54] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2022-05-21 07:37:54] [INFO ] Computed and/alt/rep : 160/248/160 causal constraints (skipped 0 transitions) in 17 ms.
[2022-05-21 07:37:54] [INFO ] Added : 107 causal constraints over 22 iterations in 463 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7845 reset in 332 ms.
Product exploration explored 100000 steps with 7815 reset in 327 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 35 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 7 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2022-05-21 07:37:55] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:37:55] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 07:37:55] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 168/168 transitions.
Product exploration explored 100000 steps with 7834 reset in 766 ms.
Product exploration explored 100000 steps with 7845 reset in 632 ms.
Built C files in :
/tmp/ltsmin13755469019169237199
[2022-05-21 07:37:57] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13755469019169237199
Running compilation step : cd /tmp/ltsmin13755469019169237199;'/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'
Compilation finished in 581 ms.
Running link step : cd /tmp/ltsmin13755469019169237199;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin13755469019169237199;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14200994993733354219.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 35 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:38:12] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:38:12] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:38:12] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:38:12] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:38:12] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:38:12] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 168/168 transitions.
Built C files in :
/tmp/ltsmin17995649121238886146
[2022-05-21 07:38:12] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17995649121238886146
Running compilation step : cd /tmp/ltsmin17995649121238886146;'/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'
Compilation finished in 589 ms.
Running link step : cd /tmp/ltsmin17995649121238886146;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin17995649121238886146;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3682870487724983764.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 07:38:27] [INFO ] Flatten gal took : 16 ms
[2022-05-21 07:38:27] [INFO ] Flatten gal took : 14 ms
[2022-05-21 07:38:27] [INFO ] Time to serialize gal into /tmp/LTL10695416351249768032.gal : 5 ms
[2022-05-21 07:38:27] [INFO ] Time to serialize properties into /tmp/LTL10427899320699586294.ltl : 2 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/LTL10695416351249768032.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10427899320699586294.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/LTL1069541...268
Read 1 LTL properties
Checking formula 0 : !((((X(X(G(("(((((Assigned_6>=1)||(Assigned_7>=1))||((Assigned_8>=1)||(Assigned_9>=1)))||(((Assigned_10>=1)||(Assigned_11>=1))||((Assi...2246
Formula 0 simplified : !(XXG("(((((Assigned_6>=1)||(Assigned_7>=1))||((Assigned_8>=1)||(Assigned_9>=1)))||(((Assigned_10>=1)||(Assigned_11>=1))||((Assigned...2228
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-21 07:38:43] [INFO ] Flatten gal took : 14 ms
[2022-05-21 07:38:43] [INFO ] Applying decomposition
[2022-05-21 07:38:43] [INFO ] Flatten gal took : 14 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/graph3028081152340283004.txt' '-o' '/tmp/graph3028081152340283004.bin' '-w' '/tmp/graph3028081152340283004.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3028081152340283004.bin' '-l' '-1' '-v' '-w' '/tmp/graph3028081152340283004.weights' '-q' '0' '-e' '0.001'
[2022-05-21 07:38:43] [INFO ] Decomposing Gal with order
[2022-05-21 07:38:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 07:38:43] [INFO ] Removed a total of 189 redundant transitions.
[2022-05-21 07:38:43] [INFO ] Flatten gal took : 72 ms
[2022-05-21 07:38:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 37 ms.
[2022-05-21 07:38:43] [INFO ] Time to serialize gal into /tmp/LTL4714030925983330702.gal : 14 ms
[2022-05-21 07:38:43] [INFO ] Time to serialize properties into /tmp/LTL17909402064931083359.ltl : 3 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/LTL4714030925983330702.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17909402064931083359.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/LTL4714030...246
Read 1 LTL properties
Checking formula 0 : !((((X(X(G(("(((((i3.i0.u12.Assigned_6>=1)||(i3.i0.u13.Assigned_7>=1))||((i4.i1.u6.Assigned_8>=1)||(i4.i1.u14.Assigned_9>=1)))||(((i2....3340
Formula 0 simplified : !(XXG("(((((i3.i0.u12.Assigned_6>=1)||(i3.i0.u13.Assigned_7>=1))||((i4.i1.u6.Assigned_8>=1)||(i4.i1.u14.Assigned_9>=1)))||(((i2.i0.u...3322
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
52 unique states visited
0 strongly connected components in search stack
51 transitions explored
28 items max in DFS search stack
291 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.9542,78324,1,0,129912,344,1605,126130,151,941,153694
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-11 finished in 58449 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 24 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 4 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:38:46] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:38:46] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:38:46] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:38:47] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:38:47] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 07:38:47] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (OR (LT s70 1) (LT s105 1)) (OR (LT s67 1) (LT s103 1)) (OR (LT s65 1) (LT s102 1)) (OR (LT s62 1) (LT s101 1)) (OR (LT s60 1) (LT s100 1)) (OR (L...], 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 35 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-13 finished in 765 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&F(p1))))'
Support contains 27 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 3 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:38:47] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:38:47] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:38:47] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 07:38:47] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
// Phase 1: matrix 168 rows 123 cols
[2022-05-21 07:38:47] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:38:47] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (LT s0 1) (LT s25 1) (LT s82 1)) (OR (LT s1 1) (LT s13 1) (LT s82 1)) (OR (LT s0 1) (LT s20 1) (LT s82 1)) (OR (LT s0 1) (LT s10 1) (LT s82 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 1 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-14 finished in 573 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 19 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 139 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 107 transition count 136
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 80 place count 107 transition count 120
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 112 place count 91 transition count 120
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 128 place count 83 transition count 112
Applied a total of 128 rules in 20 ms. Remains 83 /139 variables (removed 56) and now considering 112/184 (removed 72) transitions.
// Phase 1: matrix 112 rows 83 cols
[2022-05-21 07:38:48] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:38:48] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 112 rows 83 cols
[2022-05-21 07:38:48] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 07:38:48] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2022-05-21 07:38:48] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 112 rows 83 cols
[2022-05-21 07:38:48] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 07:38:48] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/139 places, 112/184 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/139 places, 112/184 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N08-LTLFireability-15 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 (OR (LT s0 1) (LT s17 1) (LT s42 1)) (OR (LT s1 1) (LT s5 1) (LT s42 1)) (OR (LT s0 1) (LT s12 1) (LT s42 1)) (OR (LT s0 1) (LT s2 1) (LT s42 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 463 ms.
Stack based approach found an accepted trace after 2375 steps with 0 reset with depth 2376 and stack size 2376 in 12 ms.
FORMULA UtilityControlRoom-COL-Z2T4N08-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N08-LTLFireability-15 finished in 853 ms.
All properties solved by simple procedures.
Total runtime 72027 ms.

BK_STOP 1653118729088

--------------------
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="UtilityControlRoom-COL-Z2T4N08"
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 UtilityControlRoom-COL-Z2T4N08, 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 r276-smll-165307352900068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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