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-165307352900092.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-Z4T3N08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-165307352900092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 7.3K Apr 29 17:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 17:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 29 17:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 29 17:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 9 09:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 09:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 09:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 4.0K 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-Z4T3N08-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z4T3N08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653122238826

Running Version 202205111006
[2022-05-21 08:37:20] [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 08:37:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 08:37:21] [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 08:37:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-21 08:37:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1464 ms
[2022-05-21 08:37:22] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 302 PT places and 600.0 transition bindings in 40 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
[2022-05-21 08:37:22] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 12 ms.
[2022-05-21 08:37:22] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 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 173 steps, including 0 resets, run visited all 11 properties in 42 ms. (steps per millisecond=4 )
[2022-05-21 08:37:23] [INFO ] Flatten gal took : 28 ms
[2022-05-21 08:37:23] [INFO ] Flatten gal took : 6 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(8), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
[2022-05-21 08:37:23] [INFO ] Unfolded HLPN to a Petri net with 302 places and 600 transitions 1928 arcs in 44 ms.
[2022-05-21 08:37:23] [INFO ] Unfolded 15 HLPN properties in 1 ms.
[2022-05-21 08:37:23] [INFO ] Reduced 24 identical enabling conditions.
[2022-05-21 08:37:23] [INFO ] Reduced 24 identical enabling conditions.
[2022-05-21 08:37:23] [INFO ] Reduced 24 identical enabling conditions.
[2022-05-21 08:37:23] [INFO ] Reduced 24 identical enabling conditions.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 269 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Applied a total of 0 rules in 17 ms. Remains 302 /302 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 302 cols
[2022-05-21 08:37:23] [INFO ] Computed 19 place invariants in 52 ms
[2022-05-21 08:37:24] [INFO ] Implicit Places using invariants in 527 ms returned [245]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 576 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/302 places, 472/472 transitions.
Applied a total of 0 rules in 10 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 301/302 places, 472/472 transitions.
Support contains 269 out of 301 places after structural reductions.
[2022-05-21 08:37:24] [INFO ] Flatten gal took : 140 ms
[2022-05-21 08:37:24] [INFO ] Flatten gal took : 140 ms
[2022-05-21 08:37:25] [INFO ] Input system was already deterministic with 472 transitions.
Finished random walk after 107 steps, including 0 resets, run visited all 18 properties in 24 ms. (steps per millisecond=4 )
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLFireability-02 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' '!(((G(X(p0)) U p1)||(p1 U p0)))'
Support contains 165 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Applied a total of 0 rules in 10 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 301 cols
[2022-05-21 08:37:25] [INFO ] Computed 18 place invariants in 8 ms
[2022-05-21 08:37:25] [INFO ] Implicit Places using invariants in 158 ms returned []
// Phase 1: matrix 472 rows 301 cols
[2022-05-21 08:37:25] [INFO ] Computed 18 place invariants in 8 ms
[2022-05-21 08:37:26] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
// Phase 1: matrix 472 rows 301 cols
[2022-05-21 08:37:26] [INFO ] Computed 18 place invariants in 18 ms
[2022-05-21 08:37:26] [INFO ] Dead Transitions using invariants and state equation in 424 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 301/301 places, 472/472 transitions.
Stuttering acceptance computed with spot in 422 ms :[(NOT p0), true, (AND (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s19 1) (GEQ s244 1)) (AND (GEQ s3 1) (GEQ s33 1) (GEQ s244 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s244 1)) (AND (GEQ s2 1) (GEQ ...], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLFireability-00 finished in 1475 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(X(p0)))||G(p1)))'
Support contains 45 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 301 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 173 transition count 312
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 288 place count 173 transition count 280
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 352 place count 141 transition count 280
Applied a total of 352 rules in 71 ms. Remains 141 /301 variables (removed 160) and now considering 280/472 (removed 192) transitions.
// Phase 1: matrix 280 rows 141 cols
[2022-05-21 08:37:27] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 08:37:27] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 280 rows 141 cols
[2022-05-21 08:37:27] [INFO ] Computed 18 place invariants in 4 ms
[2022-05-21 08:37:27] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2022-05-21 08:37:27] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 280 rows 141 cols
[2022-05-21 08:37:27] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 08:37:28] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/301 places, 280/472 transitions.
Finished structural reductions, in 1 iterations. Remains : 141/301 places, 280/472 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (GEQ s99 1) (GEQ s100 1) (GEQ s95 1) (GEQ s96 1) (GEQ s97 1) (GEQ s98 1) (GEQ s93 1) (GEQ s94 1)), p0:(OR (AND (GEQ s1 1) (GEQ s19 1) (GEQ s84 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 2020 ms.
Stack based approach found an accepted trace after 16835 steps with 0 reset with depth 16836 and stack size 16836 in 300 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLFireability-01 finished in 3405 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U !(G(p1)||G(X(!X(p0)))))))'
Support contains 16 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 32 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:37:30] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 08:37:30] [INFO ] Implicit Places using invariants in 128 ms returned []
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:37:30] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 08:37:31] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:37:31] [INFO ] Computed 18 place invariants in 4 ms
[2022-05-21 08:37:31] [INFO ] Dead Transitions using invariants and state equation in 346 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (OR (GEQ s163 1) (GEQ s164 1) (GEQ s159 1) (GEQ s160 1) (GEQ s161 1) (GEQ s162 1) (GEQ s157 1) (GEQ s158 1)) (NOT (OR (GEQ s4 1) (GEQ s5 1) (GEQ s...], 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]]
Product exploration explored 100000 steps with 24513 reset in 724 ms.
Product exploration explored 100000 steps with 24514 reset in 381 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 p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 179 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:37:33] [INFO ] Computed 18 place invariants in 4 ms
[2022-05-21 08:37:34] [INFO ] [Real]Absence check using 18 positive place invariants in 24 ms returned sat
[2022-05-21 08:37:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 08:37:34] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2022-05-21 08:37:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 08:37:34] [INFO ] [Nat]Absence check using 18 positive place invariants in 24 ms returned sat
[2022-05-21 08:37:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 08:37:35] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2022-05-21 08:37:35] [INFO ] Computed and/alt/rep : 368/616/368 causal constraints (skipped 0 transitions) in 113 ms.
[2022-05-21 08:37:35] [INFO ] Added : 0 causal constraints over 0 iterations in 235 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 205 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Applied a total of 0 rules in 15 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:37:35] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 08:37:35] [INFO ] Implicit Places using invariants in 198 ms returned []
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:37:35] [INFO ] Computed 18 place invariants in 4 ms
[2022-05-21 08:37:35] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:37:35] [INFO ] Computed 18 place invariants in 4 ms
[2022-05-21 08:37:36] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 376/376 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 : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 144 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:37:37] [INFO ] Computed 18 place invariants in 4 ms
[2022-05-21 08:37:37] [INFO ] [Real]Absence check using 18 positive place invariants in 16 ms returned sat
[2022-05-21 08:37:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 08:37:37] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2022-05-21 08:37:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 08:37:38] [INFO ] [Nat]Absence check using 18 positive place invariants in 24 ms returned sat
[2022-05-21 08:37:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 08:37:38] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2022-05-21 08:37:38] [INFO ] Computed and/alt/rep : 368/616/368 causal constraints (skipped 0 transitions) in 47 ms.
[2022-05-21 08:37:38] [INFO ] Added : 0 causal constraints over 0 iterations in 131 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 24516 reset in 589 ms.
Product exploration explored 100000 steps with 24495 reset in 484 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 8 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 32 Pre rules applied. Total rules applied 0 place count 205 transition count 408
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 205 transition count 408
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 112 places in 1 ms
Iterating global reduction 0 with 80 rules applied. Total rules applied 112 place count 205 transition count 432
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 144 place count 205 transition count 400
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 147 place count 202 transition count 304
Deduced a syphon composed of 112 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 150 place count 202 transition count 304
Discarding 72 places :
Symmetric choice reduction at 1 with 72 rule applications. Total rules 222 place count 130 transition count 184
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 72 rules applied. Total rules applied 294 place count 130 transition count 184
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 342 place count 82 transition count 136
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 390 place count 82 transition count 136
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 438 place count 82 transition count 88
Deduced a syphon composed of 40 places in 0 ms
Applied a total of 438 rules in 67 ms. Remains 82 /205 variables (removed 123) and now considering 88/376 (removed 288) transitions.
[2022-05-21 08:37:40] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 88 rows 82 cols
[2022-05-21 08:37:40] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 08:37:40] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/205 places, 88/376 transitions.
Finished structural reductions, in 1 iterations. Remains : 82/205 places, 88/376 transitions.
Product exploration explored 100000 steps with 24603 reset in 1134 ms.
Product exploration explored 100000 steps with 24613 reset in 875 ms.
Built C files in :
/tmp/ltsmin6730126373554217548
[2022-05-21 08:37:42] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6730126373554217548
Running compilation step : cd /tmp/ltsmin6730126373554217548;'/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 1485 ms.
Running link step : cd /tmp/ltsmin6730126373554217548;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin6730126373554217548;'/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/stateBased14109016939280418508.hoa' '--buchi-type=spotba'
LTSmin run took 459 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLFireability-03 finished in 13924 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(X(F(p0)))&&F((F(!p0)&&p1))&&p1)))'
Support contains 45 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 301 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 173 transition count 312
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 288 place count 173 transition count 280
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 352 place count 141 transition count 280
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 2 with 16 rules applied. Total rules applied 368 place count 133 transition count 272
Applied a total of 368 rules in 31 ms. Remains 133 /301 variables (removed 168) and now considering 272/472 (removed 200) transitions.
// Phase 1: matrix 272 rows 133 cols
[2022-05-21 08:37:44] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 08:37:44] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 272 rows 133 cols
[2022-05-21 08:37:44] [INFO ] Computed 18 place invariants in 5 ms
[2022-05-21 08:37:44] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2022-05-21 08:37:44] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 272 rows 133 cols
[2022-05-21 08:37:44] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 08:37:45] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/301 places, 272/472 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/301 places, 272/472 transitions.
Stuttering acceptance computed with spot in 223 ms :[true, (NOT p0), (NOT p0), (OR (NOT p1) p0), p0]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=(AND p0 p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LT s77 1) (LT s78 1) (LT s83 1) (LT s84 1) (LT s79 1) (LT s80 1) (LT s81 1) (LT s82 1)), p1:(OR (AND (GEQ s1 1) (GEQ s11 1) (GEQ s76 1)) (AND (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 4021 reset in 574 ms.
Stack based approach found an accepted trace after 29798 steps with 1207 reset with depth 34 and stack size 34 in 239 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLFireability-04 finished in 1655 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))||X(p1)||G(p0)))'
Support contains 45 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 15 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:37:46] [INFO ] Computed 18 place invariants in 6 ms
[2022-05-21 08:37:46] [INFO ] Implicit Places using invariants in 114 ms returned []
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:37:46] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 08:37:46] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:37:46] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 08:37:46] [INFO ] Dead Transitions using invariants and state equation in 307 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (LT s144 1) (LT s145 1) (LT s146 1) (LT s147 1) (LT s143 1) (LT s142 1) (LT s141 1) (LT s140 1)), p0:(OR (AND (GEQ s1 1) (GEQ s19 1) (GEQ s148 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]]
Product exploration explored 100000 steps with 23648 reset in 650 ms.
Product exploration explored 100000 steps with 23687 reset in 667 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 p1 (NOT p0)), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:37:49] [INFO ] Computed 18 place invariants in 5 ms
[2022-05-21 08:37:50] [INFO ] [Real]Absence check using 18 positive place invariants in 26 ms returned sat
[2022-05-21 08:37:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 08:37:51] [INFO ] [Real]Absence check using state equation in 580 ms returned sat
[2022-05-21 08:37:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 08:37:52] [INFO ] [Nat]Absence check using 18 positive place invariants in 22 ms returned sat
[2022-05-21 08:37:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 08:37:53] [INFO ] [Nat]Absence check using state equation in 362 ms returned sat
[2022-05-21 08:37:53] [INFO ] Computed and/alt/rep : 368/616/368 causal constraints (skipped 0 transitions) in 45 ms.
[2022-05-21 08:37:56] [INFO ] Added : 280 causal constraints over 56 iterations in 2671 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 37 out of 205 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Applied a total of 0 rules in 4 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:37:56] [INFO ] Computed 18 place invariants in 5 ms
[2022-05-21 08:37:56] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:37:56] [INFO ] Computed 18 place invariants in 4 ms
[2022-05-21 08:37:56] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:37:56] [INFO ] Computed 18 place invariants in 4 ms
[2022-05-21 08:37:56] [INFO ] Dead Transitions using invariants and state equation in 419 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 376/376 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 : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 102 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:37:57] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 08:37:59] [INFO ] [Real]Absence check using 18 positive place invariants in 24 ms returned sat
[2022-05-21 08:37:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 08:38:00] [INFO ] [Real]Absence check using state equation in 583 ms returned sat
[2022-05-21 08:38:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 08:38:01] [INFO ] [Nat]Absence check using 18 positive place invariants in 21 ms returned sat
[2022-05-21 08:38:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 08:38:02] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2022-05-21 08:38:02] [INFO ] Computed and/alt/rep : 368/616/368 causal constraints (skipped 0 transitions) in 45 ms.
[2022-05-21 08:38:04] [INFO ] Added : 280 causal constraints over 56 iterations in 2554 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23589 reset in 1001 ms.
Product exploration explored 100000 steps with 23635 reset in 659 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 37 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 32 Pre rules applied. Total rules applied 0 place count 205 transition count 408
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 205 transition count 408
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 205 transition count 408
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 96 place count 205 transition count 376
Deduced a syphon composed of 64 places in 1 ms
Applied a total of 96 rules in 35 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2022-05-21 08:38:06] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:38:06] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 08:38:07] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 205/205 places, 376/376 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 376/376 transitions.
Product exploration explored 100000 steps with 23625 reset in 1510 ms.
Product exploration explored 100000 steps with 23679 reset in 1304 ms.
Built C files in :
/tmp/ltsmin14960583549823329917
[2022-05-21 08:38:10] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14960583549823329917
Running compilation step : cd /tmp/ltsmin14960583549823329917;'/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 1033 ms.
Running link step : cd /tmp/ltsmin14960583549823329917;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin14960583549823329917;'/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/stateBased15990072537628282406.hoa' '--buchi-type=spotba'
LTSmin run took 11601 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLFireability-05 finished in 36626 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(G(p0)))))'
Support contains 48 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 5 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:38:22] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 08:38:22] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:38:22] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 08:38:23] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:38:23] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 08:38:23] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (OR (LT s137 1) (LT s164 1)) (OR (LT s122 1) (LT s160 1)) (OR (LT s112 1) (LT s158 1)) (OR (LT s117 1) (LT s159 1)) (OR (LT s113 1) (LT s158 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 18 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLFireability-06 finished in 877 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0) U X((X(X(p0))||G(p0))))))'
Support contains 128 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 301 cols
[2022-05-21 08:38:23] [INFO ] Computed 18 place invariants in 6 ms
[2022-05-21 08:38:23] [INFO ] Implicit Places using invariants in 170 ms returned []
// Phase 1: matrix 472 rows 301 cols
[2022-05-21 08:38:23] [INFO ] Computed 18 place invariants in 7 ms
[2022-05-21 08:38:24] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
// Phase 1: matrix 472 rows 301 cols
[2022-05-21 08:38:24] [INFO ] Computed 18 place invariants in 6 ms
[2022-05-21 08:38:24] [INFO ] Dead Transitions using invariants and state equation in 645 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 301/301 places, 472/472 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (GEQ s131 1) (GEQ s192 1) (GEQ s135 1) (GEQ s196 1) (GEQ s139 1) (GEQ s200 1) (GEQ s143 1) (GEQ s78 1) (GEQ s147 1) (GEQ s82 1) (GEQ s151 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, 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 44 steps with 1 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLFireability-07 finished in 1507 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 40 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 10 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:38:25] [INFO ] Computed 18 place invariants in 6 ms
[2022-05-21 08:38:25] [INFO ] Implicit Places using invariants in 183 ms returned []
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:38:25] [INFO ] Computed 18 place invariants in 4 ms
[2022-05-21 08:38:25] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:38:25] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 08:38:26] [INFO ] Dead Transitions using invariants and state equation in 373 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s137 1) (GEQ s164 1)) (AND (GEQ s122 1) (GEQ s160 1)) (AND (GEQ s112 1) (GEQ s158 1)) (AND (GEQ s117 1) (GEQ s159 1)) (AND (GEQ s113 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][false, false]]
Product exploration explored 100000 steps with 483 reset in 656 ms.
Product exploration explored 100000 steps with 526 reset in 539 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:38:27] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 08:38:28] [INFO ] [Real]Absence check using 18 positive place invariants in 21 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLFireability-09 finished in 3274 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 8 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 301 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 173 transition count 312
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 288 place count 173 transition count 280
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 352 place count 141 transition count 280
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 355 place count 138 transition count 184
Iterating global reduction 2 with 3 rules applied. Total rules applied 358 place count 138 transition count 184
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 382 place count 114 transition count 160
Iterating global reduction 2 with 24 rules applied. Total rules applied 406 place count 114 transition count 160
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 430 place count 90 transition count 112
Iterating global reduction 2 with 24 rules applied. Total rules applied 454 place count 90 transition count 112
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 478 place count 66 transition count 88
Iterating global reduction 2 with 24 rules applied. Total rules applied 502 place count 66 transition count 88
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 526 place count 66 transition count 64
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 526 place count 66 transition count 56
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 542 place count 58 transition count 56
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 3 with 16 rules applied. Total rules applied 558 place count 50 transition count 48
Applied a total of 558 rules in 32 ms. Remains 50 /301 variables (removed 251) and now considering 48/472 (removed 424) transitions.
// Phase 1: matrix 48 rows 50 cols
[2022-05-21 08:38:28] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-21 08:38:28] [INFO ] Implicit Places using invariants in 62 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/301 places, 48/472 transitions.
Applied a total of 0 rules in 5 ms. Remains 49 /49 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 49/301 places, 48/472 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLFireability-10 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 (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 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 337 ms.
Stack based approach found an accepted trace after 1248 steps with 0 reset with depth 1249 and stack size 1247 in 7 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLFireability-10 finished in 518 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p1)&&p0)))'
Support contains 40 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 301 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 173 transition count 312
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 291 place count 170 transition count 216
Iterating global reduction 2 with 3 rules applied. Total rules applied 294 place count 170 transition count 216
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 318 place count 146 transition count 192
Iterating global reduction 2 with 24 rules applied. Total rules applied 342 place count 146 transition count 192
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 391 place count 121 transition count 168
Applied a total of 391 rules in 32 ms. Remains 121 /301 variables (removed 180) and now considering 168/472 (removed 304) transitions.
// Phase 1: matrix 168 rows 121 cols
[2022-05-21 08:38:29] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-21 08:38:29] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 168 rows 121 cols
[2022-05-21 08:38:29] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-21 08:38:29] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2022-05-21 08:38:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 168 rows 121 cols
[2022-05-21 08:38:29] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-21 08:38:29] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/301 places, 168/472 transitions.
Finished structural reductions, in 1 iterations. Remains : 121/301 places, 168/472 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLFireability-11 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:(OR (AND (GEQ s72 1) (GEQ s113 1)) (AND (GEQ s77 1) (GEQ s114 1)) (AND (GEQ s87 1) (GEQ s116 1)) (AND (GEQ s97 1) (GEQ s119 1)) (AND (GEQ s92 1) (GEQ s...], 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 5592 reset in 480 ms.
Stack based approach found an accepted trace after 4488 steps with 246 reset with depth 17 and stack size 17 in 19 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLFireability-11 finished in 1115 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X((p1 U p2)) U X(G((G(p4)||p3))))))'
Support contains 85 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 5 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:38:30] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 08:38:30] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:38:30] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 08:38:30] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:38:30] [INFO ] Computed 18 place invariants in 4 ms
[2022-05-21 08:38:30] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 562 ms :[(AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), true, (NOT p2), (NOT p4), (AND (NOT p4) (NOT p3)), (AND (NOT p3) (NOT p4)), (AND (NOT p2) p3 (NOT p4)), (AND (NOT p3) (NOT p4))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (AND p3 p2) (AND p3 p1) (AND p4 p2) (AND p4 p1)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p4) p2) (AND (NOT p3) (NOT p4) p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p4) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p4) (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p4 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 5}, { cond=(OR (AND (NOT p3) p4 p2) (AND (NOT p3) p4 p1)), acceptance={1} source=0 dest: 6}, { cond=(AND (NOT p3) p4 (NOT p2) p1), acceptance={} source=0 dest: 7}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(OR (AND p0 p3) (AND p0 p4)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p4)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p4), acceptance={} source=1 dest: 6}, { cond=(AND p0 (NOT p3) p4), acceptance={1} source=1 dest: 8}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=3 dest: 3}], [{ cond=(NOT p4), acceptance={} source=4 dest: 2}, { cond=p4, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p4)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p3) p4), acceptance={} source=5 dest: 4}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(OR (AND p3 (NOT p4) p2) (AND p3 (NOT p4) p1)), acceptance={0} source=6 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p4) p2) (AND (NOT p3) (NOT p4) p1)), acceptance={0, 1} source=6 dest: 0}, { cond=(AND (NOT p3) (NOT p4) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p3) (NOT p4) (NOT p2) p1), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) p4 (NOT p2) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(OR (AND p3 p4 p2) (AND p3 p4 p1)), acceptance={} source=6 dest: 6}, { cond=(OR (AND (NOT p3) p4 p2) (AND (NOT p3) p4 p1)), acceptance={1} source=6 dest: 6}, { cond=(AND (NOT p3) p4 (NOT p2) p1), acceptance={} source=6 dest: 7}], [{ cond=(AND p3 (NOT p4) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 2}, { cond=(AND p3 (NOT p4) (NOT p2) p1), acceptance={} source=7 dest: 3}, { cond=(AND p3 p4 (NOT p2) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND p3 p4 (NOT p2) p1), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p4)), acceptance={} source=8 dest: 0}, { cond=(AND p0 p3 (NOT p4)), acceptance={0} source=8 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p4)), acceptance={0, 1} source=8 dest: 1}, { cond=(AND (NOT p0) p4), acceptance={} source=8 dest: 6}, { cond=(AND p0 p3 p4), acceptance={} source=8 dest: 8}, { cond=(AND p0 (NOT p3) p4), acceptance={1} source=8 dest: 8}]], initial=1, aps=[p3:(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 s75 1) (GEQ s74 1) (GE...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 50 steps with 1 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLFireability-12 finished in 1463 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!((X(G(p1))||p0) U X(p2)))))'
Support contains 69 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 6 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:38:31] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 08:38:31] [INFO ] Implicit Places using invariants in 146 ms returned []
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:38:31] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 08:38:32] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:38:32] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 08:38:32] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 247 ms :[p2, false, (AND p1 p2), p2, (AND p2 p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={0} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 4}], [{ cond=(AND p0 p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=4 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s19 1) (GEQ s148 1)) (AND (GEQ s3 1) (GEQ s33 1) (GEQ s148 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s148 1)) (AND (GEQ s2 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33352 reset in 1373 ms.
Product exploration explored 100000 steps with 33158 reset in 1000 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 p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 458 ms. Reduced automaton from 5 states, 12 edges and 3 AP to 5 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 208 ms :[p2, false, (AND p1 p2), p2, (AND p2 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 611 ms. (steps per millisecond=16 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:38:36] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 08:38:37] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F (AND p0 p2)), (F p1), (F (AND p1 p2)), (F (AND p0 (NOT p2))), (F p2), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 8 factoid took 735 ms. Reduced automaton from 5 states, 12 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 264 ms :[p2, (AND (NOT p0) p2 p1), (AND p1 p2), p2, (AND p2 p1)]
Stuttering acceptance computed with spot in 230 ms :[p2, (AND (NOT p0) p2 p1), (AND p1 p2), p2, (AND p2 p1)]
Support contains 69 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Applied a total of 0 rules in 2 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:38:38] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 08:38:38] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:38:38] [INFO ] Computed 18 place invariants in 4 ms
[2022-05-21 08:38:38] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:38:38] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 08:38:39] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 376/376 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 p2) (NOT p1)), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 3 factoid took 342 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 241 ms :[p2, (AND (NOT p0) p2 p1), (AND p1 p2), p2, (AND p2 p1)]
Finished random walk after 14 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (AND p1 p2)), (F p1), (F (AND p0 (NOT p2))), (F p2), (F p0)]
Knowledge based reduction with 3 factoid took 487 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 230 ms :[p2, (AND (NOT p0) p2 p1), (AND p1 p2), p2, (AND p2 p1)]
Stuttering acceptance computed with spot in 236 ms :[p2, (AND (NOT p0) p2 p1), (AND p1 p2), p2, (AND p2 p1)]
Stuttering acceptance computed with spot in 257 ms :[p2, (AND (NOT p0) p2 p1), (AND p1 p2), p2, (AND p2 p1)]
Product exploration explored 100000 steps with 33420 reset in 726 ms.
Product exploration explored 100000 steps with 33054 reset in 673 ms.
Applying partial POR strategy [false, false, true, false, true]
Stuttering acceptance computed with spot in 263 ms :[p2, (AND (NOT p0) p2 p1), (AND p1 p2), p2, (AND p2 p1)]
Support contains 69 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Applied a total of 0 rules in 14 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2022-05-21 08:38:43] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:38:43] [INFO ] Computed 18 place invariants in 4 ms
[2022-05-21 08:38:43] [INFO ] Dead Transitions using invariants and state equation in 518 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 376/376 transitions.
Product exploration explored 100000 steps with 33159 reset in 645 ms.
Product exploration explored 100000 steps with 33289 reset in 460 ms.
Built C files in :
/tmp/ltsmin15302265114419914827
[2022-05-21 08:38:44] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15302265114419914827
Running compilation step : cd /tmp/ltsmin15302265114419914827;'/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 1256 ms.
Running link step : cd /tmp/ltsmin15302265114419914827;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15302265114419914827;'/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/stateBased17302893229117515337.hoa' '--buchi-type=spotba'
LTSmin run took 173 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLFireability-13 finished in 14585 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G((G(X(p0))||X(p0))))||F(p1))))'
Support contains 45 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 5 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:38:46] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-21 08:38:46] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:38:46] [INFO ] Computed 18 place invariants in 7 ms
[2022-05-21 08:38:46] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:38:46] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 08:38:47] [INFO ] Dead Transitions using invariants and state equation in 461 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}]], initial=1, aps=[p1:(OR (GEQ s149 1) (GEQ s150 1) (GEQ s155 1) (GEQ s156 1) (GEQ s151 1) (GEQ s152 1) (GEQ s153 1) (GEQ s154 1)), p0:(OR (AND (GEQ s0 1) (GEQ s12 1) (GEQ s...], 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 3210 reset in 535 ms.
Product exploration explored 100000 steps with 3230 reset in 370 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 p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 233 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 29 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 261 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 239 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 243 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:38:49] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 08:38:50] [INFO ] [Real]Absence check using 18 positive place invariants in 29 ms returned sat
[2022-05-21 08:38:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 08:38:50] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2022-05-21 08:38:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 08:38:51] [INFO ] [Nat]Absence check using 18 positive place invariants in 21 ms returned sat
[2022-05-21 08:38:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 08:38:51] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2022-05-21 08:38:51] [INFO ] Computed and/alt/rep : 368/616/368 causal constraints (skipped 0 transitions) in 69 ms.
[2022-05-21 08:38:55] [INFO ] Added : 324 causal constraints over 65 iterations in 3212 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 45 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:38:55] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 08:38:55] [INFO ] Implicit Places using invariants in 120 ms returned []
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:38:55] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 08:38:55] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:38:55] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 08:38:56] [INFO ] Dead Transitions using invariants and state equation in 503 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 376/376 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 p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 244 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 32 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 2 factoid took 204 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 300 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 244 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:38:57] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 08:38:58] [INFO ] [Real]Absence check using 18 positive place invariants in 27 ms returned sat
[2022-05-21 08:38:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 08:38:58] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2022-05-21 08:38:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 08:38:59] [INFO ] [Nat]Absence check using 18 positive place invariants in 21 ms returned sat
[2022-05-21 08:38:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 08:38:59] [INFO ] [Nat]Absence check using state equation in 359 ms returned sat
[2022-05-21 08:38:59] [INFO ] Computed and/alt/rep : 368/616/368 causal constraints (skipped 0 transitions) in 38 ms.
[2022-05-21 08:39:02] [INFO ] Added : 324 causal constraints over 65 iterations in 2732 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 242 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3219 reset in 314 ms.
Product exploration explored 100000 steps with 3213 reset in 337 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 235 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 45 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 32 Pre rules applied. Total rules applied 0 place count 205 transition count 408
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 205 transition count 408
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 64 places in 1 ms
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 205 transition count 408
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 96 place count 205 transition count 376
Deduced a syphon composed of 64 places in 0 ms
Applied a total of 96 rules in 15 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2022-05-21 08:39:03] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:39:03] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-21 08:39:04] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 205/205 places, 376/376 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 376/376 transitions.
Product exploration explored 100000 steps with 4528 reset in 510 ms.
Product exploration explored 100000 steps with 4503 reset in 511 ms.
Built C files in :
/tmp/ltsmin16624584000997431308
[2022-05-21 08:39:05] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16624584000997431308
Running compilation step : cd /tmp/ltsmin16624584000997431308;'/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 1228 ms.
Running link step : cd /tmp/ltsmin16624584000997431308;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin16624584000997431308;'/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/stateBased16445465188228678911.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 45 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Applied a total of 0 rules in 2 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:39:20] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 08:39:20] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:39:20] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-21 08:39:20] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
// Phase 1: matrix 376 rows 205 cols
[2022-05-21 08:39:20] [INFO ] Computed 18 place invariants in 7 ms
[2022-05-21 08:39:21] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 376/376 transitions.
Built C files in :
/tmp/ltsmin1508005113215797838
[2022-05-21 08:39:21] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1508005113215797838
Running compilation step : cd /tmp/ltsmin1508005113215797838;'/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 997 ms.
Running link step : cd /tmp/ltsmin1508005113215797838;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin1508005113215797838;'/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/stateBased14056048869529007271.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 08:39:36] [INFO ] Flatten gal took : 59 ms
[2022-05-21 08:39:36] [INFO ] Flatten gal took : 57 ms
[2022-05-21 08:39:36] [INFO ] Time to serialize gal into /tmp/LTL17930538279054264587.gal : 9 ms
[2022-05-21 08:39:36] [INFO ] Time to serialize properties into /tmp/LTL7074608293417958684.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/LTL17930538279054264587.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7074608293417958684.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/LTL1793053...267
Read 1 LTL properties
Checking formula 0 : !((X((X(G((G(X("((((((((IdleTechs_0>=1)&&(OpenRequests_0>=1))&&(Idles_0>=1))||(((IdleTechs_2>=1)&&(OpenRequests_14>=1))&&(Idles_0>=1))...4025
Formula 0 simplified : !X(XG(X"((((((((IdleTechs_0>=1)&&(OpenRequests_0>=1))&&(Idles_0>=1))||(((IdleTechs_2>=1)&&(OpenRequests_14>=1))&&(Idles_0>=1)))||(((...4007
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-21 08:39:51] [INFO ] Flatten gal took : 31 ms
[2022-05-21 08:39:51] [INFO ] Applying decomposition
[2022-05-21 08:39:51] [INFO ] Flatten gal took : 27 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/graph18042260179001014663.txt' '-o' '/tmp/graph18042260179001014663.bin' '-w' '/tmp/graph18042260179001014663.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18042260179001014663.bin' '-l' '-1' '-v' '-w' '/tmp/graph18042260179001014663.weights' '-q' '0' '-e' '0.001'
[2022-05-21 08:39:51] [INFO ] Decomposing Gal with order
[2022-05-21 08:39:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 08:39:52] [INFO ] Removed a total of 546 redundant transitions.
[2022-05-21 08:39:52] [INFO ] Flatten gal took : 132 ms
[2022-05-21 08:39:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 31 ms.
[2022-05-21 08:39:52] [INFO ] Time to serialize gal into /tmp/LTL11645215777889253616.gal : 12 ms
[2022-05-21 08:39:52] [INFO ] Time to serialize properties into /tmp/LTL11330546857195046544.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/LTL11645215777889253616.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11330546857195046544.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/LTL1164521...247
Read 1 LTL properties
Checking formula 0 : !((X((X(G((G(X("((((((((i0.i0.u5.IdleTechs_0>=1)&&(i2.u19.OpenRequests_0>=1))&&(i3.i0.u35.Idles_0>=1))||(((i4.i0.u9.IdleTechs_2>=1)&&(...5821
Formula 0 simplified : !X(XG(X"((((((((i0.i0.u5.IdleTechs_0>=1)&&(i2.u19.OpenRequests_0>=1))&&(i3.i0.u35.Idles_0>=1))||(((i4.i0.u9.IdleTechs_2>=1)&&(i4.i0....5803
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14595537839004452032
[2022-05-21 08:40:07] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14595537839004452032
Running compilation step : cd /tmp/ltsmin14595537839004452032;'/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 1192 ms.
Running link step : cd /tmp/ltsmin14595537839004452032;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14595537839004452032;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X([](([](X((LTLAPp0==true)))||X((LTLAPp0==true)))))||<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLFireability-14 finished in 96218 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(G((G(F(p1))||p0))))))'
Support contains 80 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 272 place count 165 transition count 336
Drop transitions removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 0 with 32 rules applied. Total rules applied 304 place count 165 transition count 304
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 307 place count 162 transition count 208
Ensure Unique test removed 1 places
Iterating global reduction 0 with 4 rules applied. Total rules applied 311 place count 161 transition count 208
Applied a total of 311 rules in 25 ms. Remains 161 /301 variables (removed 140) and now considering 208/472 (removed 264) transitions.
// Phase 1: matrix 208 rows 161 cols
[2022-05-21 08:40:22] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-21 08:40:22] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 208 rows 161 cols
[2022-05-21 08:40:22] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-21 08:40:22] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2022-05-21 08:40:22] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 208 rows 161 cols
[2022-05-21 08:40:22] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-21 08:40:22] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/301 places, 208/472 transitions.
Finished structural reductions, in 1 iterations. Remains : 161/301 places, 208/472 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s140 1) (GEQ s141 1) (GEQ s142 1) (GEQ s143 1) (GEQ s139 1) (GEQ s138 1) (GEQ s137 1) (GEQ s136 1) (AND (LT s61 1) (LT s60 1) (LT s63 1) (LT s...], 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 571 reset in 535 ms.
Stack based approach found an accepted trace after 28911 steps with 176 reset with depth 159 and stack size 159 in 166 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLFireability-15 finished in 1238 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G((G(X(p0))||X(p0))))||F(p1))))'
[2022-05-21 08:40:23] [INFO ] Flatten gal took : 37 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10053965179205287748
[2022-05-21 08:40:23] [INFO ] Computing symmetric may disable matrix : 472 transitions.
[2022-05-21 08:40:23] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 08:40:23] [INFO ] Applying decomposition
[2022-05-21 08:40:23] [INFO ] Computing symmetric may enable matrix : 472 transitions.
[2022-05-21 08:40:23] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 08:40:23] [INFO ] Flatten gal took : 53 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/graph2259285963075913518.txt' '-o' '/tmp/graph2259285963075913518.bin' '-w' '/tmp/graph2259285963075913518.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2259285963075913518.bin' '-l' '-1' '-v' '-w' '/tmp/graph2259285963075913518.weights' '-q' '0' '-e' '0.001'
[2022-05-21 08:40:23] [INFO ] Decomposing Gal with order
[2022-05-21 08:40:23] [INFO ] Computing Do-Not-Accords matrix : 472 transitions.
[2022-05-21 08:40:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 08:40:24] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 08:40:24] [INFO ] Built C files in 217ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10053965179205287748
Running compilation step : cd /tmp/ltsmin10053965179205287748;'/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-21 08:40:24] [INFO ] Removed a total of 401 redundant transitions.
[2022-05-21 08:40:24] [INFO ] Flatten gal took : 81 ms
[2022-05-21 08:40:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 255 labels/synchronizations in 31 ms.
[2022-05-21 08:40:24] [INFO ] Time to serialize gal into /tmp/LTLFireability2994032454376212901.gal : 8 ms
[2022-05-21 08:40:24] [INFO ] Time to serialize properties into /tmp/LTLFireability9407721960885169465.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/LTLFireability2994032454376212901.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9407721960885169465.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 1 LTL properties
Checking formula 0 : !((X((X(G((G(X("((((((((i0.u46.IdleTechs_0>=1)&&(i4.u25.OpenRequests_0>=1))&&(i4.u1.Idles_0>=1))||(((i5.u24.IdleTechs_2>=1)&&(i0.u11.O...5342
Formula 0 simplified : !X(XG(X"((((((((i0.u46.IdleTechs_0>=1)&&(i4.u25.OpenRequests_0>=1))&&(i4.u1.Idles_0>=1))||(((i5.u24.IdleTechs_2>=1)&&(i0.u11.OpenReq...5324
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 1602 ms.
Running link step : cd /tmp/ltsmin10053965179205287748;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin10053965179205287748;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X([](([](X((LTLAPp0==true)))||X((LTLAPp0==true)))))||<>((LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: LTL layer: formula: X((X([](([](X((LTLAPp0==true)))||X((LTLAPp0==true)))))||<>((LTLAPp1==true))))
pins2lts-mc-linux64( 4/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: "X((X([](([](X((LTLAPp0==true)))||X((LTLAPp0==true)))))||<>((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.010: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.055: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.063: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.064: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.074: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.144: DFS-FIFO for weak LTL, using special progress label 475
pins2lts-mc-linux64( 0/ 8), 0.144: There are 476 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.144: State length is 302, there are 478 groups
pins2lts-mc-linux64( 0/ 8), 0.144: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.144: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.144: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.144: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.316: ~35 levels ~960 states ~4968 transitions
pins2lts-mc-linux64( 4/ 8), 0.359: ~35 levels ~1920 states ~6920 transitions
pins2lts-mc-linux64( 0/ 8), 0.414: ~34 levels ~3840 states ~13904 transitions
pins2lts-mc-linux64( 0/ 8), 0.548: ~34 levels ~7680 states ~22264 transitions
pins2lts-mc-linux64( 3/ 8), 0.754: ~33 levels ~15360 states ~33952 transitions
pins2lts-mc-linux64( 6/ 8), 1.220: ~35 levels ~30720 states ~65080 transitions
pins2lts-mc-linux64( 6/ 8), 2.054: ~35 levels ~61440 states ~144184 transitions
pins2lts-mc-linux64( 6/ 8), 3.443: ~35 levels ~122880 states ~270224 transitions
pins2lts-mc-linux64( 6/ 8), 6.192: ~35 levels ~245760 states ~581240 transitions
pins2lts-mc-linux64( 5/ 8), 11.012: ~33 levels ~491520 states ~1413912 transitions
pins2lts-mc-linux64( 5/ 8), 18.503: ~33 levels ~983040 states ~2850768 transitions
pins2lts-mc-linux64( 5/ 8), 32.349: ~33 levels ~1966080 states ~5819224 transitions
pins2lts-mc-linux64( 5/ 8), 58.342: ~33 levels ~3932160 states ~10900616 transitions
pins2lts-mc-linux64( 5/ 8), 113.290: ~33 levels ~7864320 states ~23523824 transitions
pins2lts-mc-linux64( 5/ 8), 220.685: ~33 levels ~15728640 states ~47208512 transitions
pins2lts-mc-linux64( 5/ 8), 440.479: ~33 levels ~31457280 states ~97040624 transitions
pins2lts-mc-linux64( 0/ 8), 581.891: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 581.959:
pins2lts-mc-linux64( 0/ 8), 581.959: mean standard work distribution: 7.5% (states) 10.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 581.959:
pins2lts-mc-linux64( 0/ 8), 581.959: Explored 34536723 states 164603616 transitions, fanout: 4.766
pins2lts-mc-linux64( 0/ 8), 581.959: Total exploration time 581.800 sec (581.710 sec minimum, 581.764 sec on average)
pins2lts-mc-linux64( 0/ 8), 581.959: States per second: 59362, Transitions per second: 282921
pins2lts-mc-linux64( 0/ 8), 581.960:
pins2lts-mc-linux64( 0/ 8), 581.960: Progress states detected: 631
pins2lts-mc-linux64( 0/ 8), 581.960: Redundant explorations: -0.0087
pins2lts-mc-linux64( 0/ 8), 581.960:
pins2lts-mc-linux64( 0/ 8), 581.960: Queue width: 8B, total height: 1393, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 581.960: Tree memory: 519.5MB, 15.8 B/state, compr.: 1.3%
pins2lts-mc-linux64( 0/ 8), 581.960: Tree fill ratio (roots/leafs): 25.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 581.960: Stored 478 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 581.960: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 581.960: Est. total memory use: 519.5MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10053965179205287748;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X([](([](X((LTLAPp0==true)))||X((LTLAPp0==true)))))||<>((LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10053965179205287748;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X([](([](X((LTLAPp0==true)))||X((LTLAPp0==true)))))||<>((LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-21 09:01:24] [INFO ] Applying decomposition
[2022-05-21 09:01:24] [INFO ] Flatten gal took : 29 ms
[2022-05-21 09:01:24] [INFO ] Decomposing Gal with order
[2022-05-21 09:01:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 09:01:24] [INFO ] Removed a total of 670 redundant transitions.
[2022-05-21 09:01:24] [INFO ] Flatten gal took : 61 ms
[2022-05-21 09:01:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 20 ms.
[2022-05-21 09:01:24] [INFO ] Time to serialize gal into /tmp/LTLFireability16678579409763892423.gal : 6 ms
[2022-05-21 09:01:24] [INFO ] Time to serialize properties into /tmp/LTLFireability1739934432238726150.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/LTLFireability16678579409763892423.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1739934432238726150.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...268
Read 1 LTL properties
Checking formula 0 : !((X((X(G((G(X("((((((((Z0.IdleTechs_0>=1)&&(CliZ0.OpenRequests_0>=1))&&(Idles.Idles_0>=1))||(((Z2.IdleTechs_2>=1)&&(CliZ14.OpenReques...5069
Formula 0 simplified : !X(XG(X"((((((((Z0.IdleTechs_0>=1)&&(CliZ0.OpenRequests_0>=1))&&(Idles.Idles_0>=1))||(((Z2.IdleTechs_2>=1)&&(CliZ14.OpenRequests_14>...5051
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-21 09:22:25] [INFO ] Flatten gal took : 42 ms
[2022-05-21 09:22:25] [INFO ] Input system was already deterministic with 472 transitions.
[2022-05-21 09:22:25] [INFO ] Transformed 301 places.
[2022-05-21 09:22:25] [INFO ] Transformed 472 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-21 09:22:25] [INFO ] Time to serialize gal into /tmp/LTLFireability11515121209250498149.gal : 5 ms
[2022-05-21 09:22:25] [INFO ] Time to serialize properties into /tmp/LTLFireability14471649738256919567.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/LTLFireability11515121209250498149.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14471649738256919567.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...335
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((X(G((G(X("((((((((IdleTechs_0>=1)&&(OpenRequests_0>=1))&&(Idles_0>=1))||(((IdleTechs_2>=1)&&(OpenRequests_14>=1))&&(Idles_0>=1))...4025
Formula 0 simplified : !X(XG(X"((((((((IdleTechs_0>=1)&&(OpenRequests_0>=1))&&(Idles_0>=1))||(((IdleTechs_2>=1)&&(OpenRequests_14>=1))&&(Idles_0>=1)))||(((...4007
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

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="UtilityControlRoom-COL-Z4T3N08"
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-Z4T3N08, 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-165307352900092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-COL-Z4T3N08.tgz
mv UtilityControlRoom-COL-Z4T3N08 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 ;