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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 8.6K Apr 29 18:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 29 18:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 29 18:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 29 18:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 9 09:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 09:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 9 09:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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-Z2T4N10-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z2T4N10-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z2T4N10-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z2T4N10-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z2T4N10-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z2T4N10-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z2T4N10-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z2T4N10-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z2T4N10-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z2T4N10-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z2T4N10-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z2T4N10-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z2T4N10-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z2T4N10-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z2T4N10-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z2T4N10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653119213089

Running Version 202205111006
[2022-05-21 07:46:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-21 07:46:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 07:46:55] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-21 07:46:55] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-21 07:46:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 884 ms
[2022-05-21 07:46:56] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 174 PT places and 270.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2022-05-21 07:46:56] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 7 ms.
[2022-05-21 07:46:56] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 9 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 58 steps, including 0 resets, run visited all 9 properties in 30 ms. (steps per millisecond=1 )
[2022-05-21 07:46:56] [INFO ] Flatten gal took : 23 ms
[2022-05-21 07:46:56] [INFO ] Flatten gal took : 4 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(10), Z(2), Z(2)] of place MovetoZ breaks symmetries in sort Z
[2022-05-21 07:46:56] [INFO ] Unfolded HLPN to a Petri net with 174 places and 270 transitions 850 arcs in 26 ms.
[2022-05-21 07:46:56] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
[2022-05-21 07:46:56] [INFO ] Reduced 10 identical enabling conditions.
[2022-05-21 07:46:56] [INFO ] Reduced 10 identical enabling conditions.
[2022-05-21 07:46:56] [INFO ] Reduced 10 identical enabling conditions.
Ensure Unique test removed 40 transitions
Reduce redundant transitions removed 40 transitions.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 153 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Applied a total of 0 rules in 12 ms. Remains 174 /174 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 174 cols
[2022-05-21 07:46:56] [INFO ] Computed 23 place invariants in 16 ms
[2022-05-21 07:46:56] [INFO ] Implicit Places using invariants in 312 ms returned [123]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 466 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 173/174 places, 230/230 transitions.
Applied a total of 0 rules in 5 ms. Remains 173 /173 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 173/174 places, 230/230 transitions.
Support contains 153 out of 173 places after structural reductions.
[2022-05-21 07:46:57] [INFO ] Flatten gal took : 43 ms
[2022-05-21 07:46:57] [INFO ] Flatten gal took : 52 ms
[2022-05-21 07:46:57] [INFO ] Input system was already deterministic with 230 transitions.
Finished random walk after 289 steps, including 0 resets, run visited all 14 properties in 22 ms. (steps per millisecond=13 )
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLFireability-08 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(F(!((G(p1)||p0) U X(p2)))))'
Support contains 63 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 21 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:46:57] [INFO ] Computed 22 place invariants in 8 ms
[2022-05-21 07:46:58] [INFO ] Implicit Places using invariants in 335 ms returned []
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:46:58] [INFO ] Computed 22 place invariants in 20 ms
[2022-05-21 07:46:58] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:46:58] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:46:58] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 424 ms :[p2, false, p2, (AND p1 p2), (AND p2 p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s17 1) (GEQ s102 1)) (AND (GEQ s1 1) (GEQ s19 1) (GEQ s102 1)) (AND (GEQ s0 1) (GEQ s12 1) (GEQ s102 1)) (AND (GEQ s0 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 33463 reset in 592 ms.
Product exploration explored 100000 steps with 33238 reset in 517 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 (NOT p0) p1 p2))), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 9 factoid took 501 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 189 ms :[p2, false, p2, (AND p1 p2), (AND p2 p1)]
Finished random walk after 1243 steps, including 0 resets, run visited all 7 properties in 67 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (AND (NOT p0) p2 p1)), (F (AND p0 p2)), (F (AND p2 p1)), (F p1), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2) p1)), (F p2)]
Knowledge based reduction with 9 factoid took 711 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 186 ms :[p2, false, p2, (AND p1 p2), (AND p2 p1)]
Stuttering acceptance computed with spot in 187 ms :[p2, false, p2, (AND p1 p2), (AND p2 p1)]
Support contains 63 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:47:02] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:47:02] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:47:02] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:47:02] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:47:02] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:47:02] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 210/210 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 (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 9 factoid took 858 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 268 ms :[p2, false, p2, (AND p1 p2), (AND p2 p1)]
Finished random walk after 2299 steps, including 0 resets, run visited all 7 properties in 132 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (AND (NOT p0) p2 p1)), (F (AND p0 p2)), (F (AND p2 p1)), (F p1), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2) p1)), (F p2)]
Knowledge based reduction with 9 factoid took 931 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 281 ms :[p2, false, p2, (AND p1 p2), (AND p2 p1)]
Stuttering acceptance computed with spot in 275 ms :[p2, false, p2, (AND p1 p2), (AND p2 p1)]
Stuttering acceptance computed with spot in 273 ms :[p2, false, p2, (AND p1 p2), (AND p2 p1)]
Product exploration explored 100000 steps with 33306 reset in 548 ms.
Product exploration explored 100000 steps with 33201 reset in 560 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 209 ms :[p2, false, p2, (AND p1 p2), (AND p2 p1)]
Support contains 63 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 20 places in 1 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 153 transition count 210
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 190
Deduced a syphon composed of 20 places in 1 ms
Applied a total of 40 rules in 43 ms. Remains 153 /153 variables (removed 0) and now considering 190/210 (removed 20) transitions.
[2022-05-21 07:47:07] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 190 rows 153 cols
[2022-05-21 07:47:07] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:47:07] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/153 places, 190/210 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 190/210 transitions.
Product exploration explored 100000 steps with 33208 reset in 788 ms.
Product exploration explored 100000 steps with 33410 reset in 623 ms.
Built C files in :
/tmp/ltsmin16384638698684760649
[2022-05-21 07:47:09] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16384638698684760649
Running compilation step : cd /tmp/ltsmin16384638698684760649;'/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 980 ms.
Running link step : cd /tmp/ltsmin16384638698684760649;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin16384638698684760649;'/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/stateBased5383218193376092256.hoa' '--buchi-type=spotba'
LTSmin run took 485 ms.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLFireability-00 finished in 13125 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(F((X(F(p0))||F(p1)))))))'
Support contains 23 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 17 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:47:10] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-21 07:47:10] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:47:10] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-21 07:47:11] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:47:11] [INFO ] Computed 22 place invariants in 6 ms
[2022-05-21 07:47:11] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 139 ms :[(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-Z2T4N10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p1:(AND (OR (LT s1 1) (LT s17 1) (LT s102 1)) (OR (LT s1 1) (LT s19 1) (LT s102 1)) (OR (LT s0 1) (LT s12 1) (LT s102 1)) (OR (LT s0 1) (LT s30 1) (LT s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25939 reset in 338 ms.
Product exploration explored 100000 steps with 25816 reset in 368 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 p0)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 132 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 141 ms :[(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 143 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 23 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:47:12] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:47:12] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:47:12] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-21 07:47:13] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:47:13] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:47:13] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 210/210 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 p1 p0)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 86 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 131 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 135 ms :[(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 145 ms :[(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 138 ms :[(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 25893 reset in 338 ms.
Product exploration explored 100000 steps with 25968 reset in 362 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 23 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 153 transition count 230
Deduced a syphon composed of 20 places in 1 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 153 transition count 230
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 230
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 60 place count 153 transition count 210
Deduced a syphon composed of 40 places in 0 ms
Applied a total of 60 rules in 23 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2022-05-21 07:47:15] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:47:15] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:47:15] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/153 places, 210/210 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 210/210 transitions.
Product exploration explored 100000 steps with 24383 reset in 432 ms.
Product exploration explored 100000 steps with 24072 reset in 442 ms.
Built C files in :
/tmp/ltsmin884983843584312514
[2022-05-21 07:47:16] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin884983843584312514
Running compilation step : cd /tmp/ltsmin884983843584312514;'/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 531 ms.
Running link step : cd /tmp/ltsmin884983843584312514;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin884983843584312514;'/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/stateBased6774149043602723787.hoa' '--buchi-type=spotba'
LTSmin run took 219 ms.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLFireability-01 finished in 6231 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!(p0 U p1)||(X(p0)&&G(!p1))))))'
Support contains 30 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 5 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:47:17] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:47:17] [INFO ] Implicit Places using invariants in 135 ms returned []
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:47:17] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-21 07:47:17] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:47:17] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:47:17] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 81 ms :[p1, p1]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s94 1) (GEQ s95 1) (GEQ s92 1) (GEQ s93 1) (GEQ s98 1) (GEQ s99 1) (GEQ s96 1) (GEQ s97 1) (GEQ s100 1) (GEQ s101 1)), p1:(OR (GEQ s32 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 3997 reset in 384 ms.
Product exploration explored 100000 steps with 3976 reset in 407 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 210 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[false, p1]
Finished random walk after 21 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND p0 (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 269 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[false, p1]
Stuttering acceptance computed with spot in 83 ms :[false, p1]
Support contains 30 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 123 transition count 180
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 80 place count 123 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 122 transition count 140
Ensure Unique test removed 1 places
Iterating global reduction 0 with 2 rules applied. Total rules applied 83 place count 121 transition count 140
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 93 place count 111 transition count 120
Iterating global reduction 0 with 10 rules applied. Total rules applied 103 place count 111 transition count 120
Applied a total of 103 rules in 25 ms. Remains 111 /153 variables (removed 42) and now considering 120/210 (removed 90) transitions.
// Phase 1: matrix 120 rows 111 cols
[2022-05-21 07:47:19] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-21 07:47:19] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 120 rows 111 cols
[2022-05-21 07:47:19] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-21 07:47:19] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2022-05-21 07:47:19] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 120 rows 111 cols
[2022-05-21 07:47:19] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-21 07:47:19] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/153 places, 120/210 transitions.
Finished structural reductions, in 1 iterations. Remains : 111/153 places, 120/210 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 284 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[false, p1]
Finished random walk after 28 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND p0 (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 344 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[false, p1]
Stuttering acceptance computed with spot in 70 ms :[false, p1]
Stuttering acceptance computed with spot in 70 ms :[false, p1]
Product exploration explored 100000 steps with 7644 reset in 339 ms.
Stack based approach found an accepted trace after 57486 steps with 4373 reset with depth 42 and stack size 42 in 245 ms.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLFireability-03 finished in 4124 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&p1) U G(((p2 U X(p3))&&!p0))))'
Support contains 73 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 4 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:47:21] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:47:21] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:47:21] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-21 07:47:21] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:47:21] [INFO ] Computed 22 place invariants in 8 ms
[2022-05-21 07:47:21] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 348 ms :[(OR (NOT p3) p0), true, (NOT p3), (OR (NOT p3) p0), (AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=0 dest: 7}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p3), acceptance={} source=2 dest: 1}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND p0 p1 (NOT p3)), acceptance={0} source=5 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1) (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) p2 p1 (NOT p3)), acceptance={0} source=5 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=6 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=7 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=7 dest: 6}, { cond=(AND p2 p1 (NOT p3)), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s27 1) (GEQ s102 1)) (AND (GEQ s1 1) (GEQ s24 1) (GEQ s102 1)) (AND (GEQ s1 1) (GEQ s19 1) (GEQ s102 1)) (AND (GEQ s0 1) (GEQ ...], nbAcceptance=1, 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 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLFireability-07 finished in 738 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(p0))||!(!F(p1) U p1)))))'
Support contains 60 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Applied a total of 0 rules in 2 ms. Remains 173 /173 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 173 cols
[2022-05-21 07:47:21] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:47:22] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 230 rows 173 cols
[2022-05-21 07:47:22] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-21 07:47:22] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
// Phase 1: matrix 230 rows 173 cols
[2022-05-21 07:47:22] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-21 07:47:22] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 173/173 places, 230/230 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p1:(OR (GEQ s32 1) (GEQ s33 1) (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s37 1) (GEQ s39 1) (GEQ s38 1) (GEQ s41 1) (GEQ s40 1) (GEQ s43 1) (GEQ s42 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 338 ms.
Product exploration explored 100000 steps with 33333 reset in 387 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 (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p1)))
Knowledge based reduction with 2 factoid took 50 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLFireability-09 finished in 1544 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||!(F((G(p2)||p1)) U !X(p2))))'
Support contains 33 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 7 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:47:23] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:47:23] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:47:23] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:47:23] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:47:23] [INFO ] Computed 22 place invariants in 8 ms
[2022-05-21 07:47:23] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s27 1) (GEQ s102 1)) (AND (GEQ s1 1) (GEQ s24 1) (GEQ s102 1)) (AND (GEQ s1 1) (GEQ s19 1) (GEQ s102 1)) (AND (GEQ s0 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 34602 reset in 1337 ms.
Product exploration explored 100000 steps with 34685 reset in 1148 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 508 ms. Reduced automaton from 7 states, 15 edges and 3 AP to 7 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:47:28] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:47:28] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p1 p2)), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND (NOT p0) p1)), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 8 factoid took 823 ms. Reduced automaton from 7 states, 15 edges and 3 AP to 6 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (NOT p0), (AND (NOT p0) p1)]
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:47:29] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:47:29] [INFO ] [Real]Absence check using 22 positive place invariants in 14 ms returned sat
[2022-05-21 07:47:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:47:29] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2022-05-21 07:47:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:47:30] [INFO ] [Nat]Absence check using 22 positive place invariants in 14 ms returned sat
[2022-05-21 07:47:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:47:30] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2022-05-21 07:47:30] [INFO ] Computed and/alt/rep : 200/310/200 causal constraints (skipped 0 transitions) in 22 ms.
[2022-05-21 07:47:31] [INFO ] Added : 124 causal constraints over 25 iterations in 572 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 33 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:47:31] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:47:31] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:47:31] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:47:31] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:47:31] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:47:31] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 210/210 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 402 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 6 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (NOT p0), (AND (NOT p0) p1)]
Finished random walk after 6 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p0) p1)), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 485 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 6 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 361 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (NOT p0), (AND (NOT p0) p1)]
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:47:33] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:47:33] [INFO ] [Real]Absence check using 22 positive place invariants in 14 ms returned sat
[2022-05-21 07:47:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:47:33] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2022-05-21 07:47:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:47:34] [INFO ] [Nat]Absence check using 22 positive place invariants in 13 ms returned sat
[2022-05-21 07:47:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:47:34] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2022-05-21 07:47:34] [INFO ] Computed and/alt/rep : 200/310/200 causal constraints (skipped 0 transitions) in 18 ms.
[2022-05-21 07:47:34] [INFO ] Added : 124 causal constraints over 25 iterations in 488 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 34728 reset in 1041 ms.
Product exploration explored 100000 steps with 34540 reset in 1071 ms.
Applying partial POR strategy [false, false, true, false, true, true]
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 33 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 153 transition count 230
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 153 transition count 230
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 230
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 60 place count 153 transition count 210
Deduced a syphon composed of 40 places in 0 ms
Applied a total of 60 rules in 33 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2022-05-21 07:47:37] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:47:37] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:47:37] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/153 places, 210/210 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 210/210 transitions.
Product exploration explored 100000 steps with 34629 reset in 1650 ms.
Product exploration explored 100000 steps with 34831 reset in 1652 ms.
Built C files in :
/tmp/ltsmin8612950745411514967
[2022-05-21 07:47:41] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8612950745411514967
Running compilation step : cd /tmp/ltsmin8612950745411514967;'/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 509 ms.
Running link step : cd /tmp/ltsmin8612950745411514967;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin8612950745411514967;'/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/stateBased12869525550567682247.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 33 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:47:56] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:47:56] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:47:56] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:47:56] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:47:56] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:47:56] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 210/210 transitions.
Built C files in :
/tmp/ltsmin372804047026514570
[2022-05-21 07:47:56] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin372804047026514570
Running compilation step : cd /tmp/ltsmin372804047026514570;'/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 494 ms.
Running link step : cd /tmp/ltsmin372804047026514570;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin372804047026514570;'/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/stateBased11388064539944076220.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 07:48:12] [INFO ] Flatten gal took : 21 ms
[2022-05-21 07:48:12] [INFO ] Flatten gal took : 20 ms
[2022-05-21 07:48:12] [INFO ] Time to serialize gal into /tmp/LTL11466831413834788222.gal : 7 ms
[2022-05-21 07:48:12] [INFO ] Time to serialize properties into /tmp/LTL8425989205520218414.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/LTL11466831413834788222.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8425989205520218414.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/LTL1146683...267
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((((IdleTechs_0>=1)&&(OpenRequests_15>=1))&&(Idles_0>=1))||(((IdleTechs_1>=1)&&(OpenRequests_12>=1))&&(Idles_0>=1)))||((((...3195
Formula 0 simplified : !(F"(((((((((IdleTechs_0>=1)&&(OpenRequests_15>=1))&&(Idles_0>=1))||(((IdleTechs_1>=1)&&(OpenRequests_12>=1))&&(Idles_0>=1)))||((((I...3170
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-21 07:48:27] [INFO ] Flatten gal took : 16 ms
[2022-05-21 07:48:27] [INFO ] Applying decomposition
[2022-05-21 07:48:27] [INFO ] Flatten gal took : 16 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/graph6740862795740196230.txt' '-o' '/tmp/graph6740862795740196230.bin' '-w' '/tmp/graph6740862795740196230.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6740862795740196230.bin' '-l' '-1' '-v' '-w' '/tmp/graph6740862795740196230.weights' '-q' '0' '-e' '0.001'
[2022-05-21 07:48:27] [INFO ] Decomposing Gal with order
[2022-05-21 07:48:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 07:48:27] [INFO ] Removed a total of 239 redundant transitions.
[2022-05-21 07:48:27] [INFO ] Flatten gal took : 96 ms
[2022-05-21 07:48:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 17 ms.
[2022-05-21 07:48:27] [INFO ] Time to serialize gal into /tmp/LTL6103112337380510903.gal : 7 ms
[2022-05-21 07:48:27] [INFO ] Time to serialize properties into /tmp/LTL12533010293317324405.ltl : 7 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/LTL6103112337380510903.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12533010293317324405.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/LTL6103112...246
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((((i2.i0.u17.IdleTechs_0>=1)&&(i4.i0.u43.OpenRequests_15>=1))&&(i9.i0.u16.Idles_0>=1))||(((i5.i0.u10.IdleTechs_1>=1)&&(i8...4691
Formula 0 simplified : !(F"(((((((((i2.i0.u17.IdleTechs_0>=1)&&(i4.i0.u43.OpenRequests_15>=1))&&(i9.i0.u16.Idles_0>=1))||(((i5.i0.u10.IdleTechs_1>=1)&&(i8....4666
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
135 unique states visited
0 strongly connected components in search stack
242 transitions explored
22 items max in DFS search stack
62 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.660231,36044,1,0,39575,199,2069,40538,108,619,74195
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLFireability-10 finished in 64712 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)&&p0)))'
Support contains 23 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 173 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 133 transition count 170
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 100 place count 133 transition count 150
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 140 place count 113 transition count 150
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 160 place count 103 transition count 140
Applied a total of 160 rules in 15 ms. Remains 103 /173 variables (removed 70) and now considering 140/230 (removed 90) transitions.
// Phase 1: matrix 140 rows 103 cols
[2022-05-21 07:48:28] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:48:28] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 140 rows 103 cols
[2022-05-21 07:48:28] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:48:28] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2022-05-21 07:48:28] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 140 rows 103 cols
[2022-05-21 07:48:28] [INFO ] Computed 22 place invariants in 7 ms
[2022-05-21 07:48:28] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/173 places, 140/230 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/173 places, 140/230 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s17 1) (LT s52 1)) (OR (LT s1 1) (LT s14 1) (LT s52 1)) (OR (LT s1 1) (LT s9 1) (LT s52 1)) (OR (LT s0 1) (LT s2 1) (LT s52 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 935 ms.
Stack based approach found an accepted trace after 2610 steps with 0 reset with depth 2611 and stack size 2611 in 21 ms.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLFireability-11 finished in 1583 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((p0 U !p1))))'
Support contains 23 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 4 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:48:29] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:48:29] [INFO ] Implicit Places using invariants in 146 ms returned []
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:48:29] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:48:30] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:48:30] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:48:30] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 167 ms :[p1, p1, true, p1]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s27 1) (GEQ s102 1)) (AND (GEQ s1 1) (GEQ s24 1) (GEQ s102 1)) (AND (GEQ s1 1) (GEQ s19 1) (GEQ s102 1)) (AND (GEQ s0 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 51 steps with 4 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLFireability-12 finished in 893 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(F((G(p0) U p0)))))||G(p1)))'
Support contains 20 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 173 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 133 transition count 170
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 100 place count 133 transition count 150
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 140 place count 113 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 112 transition count 130
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 112 transition count 130
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 152 place count 102 transition count 120
Iterating global reduction 2 with 10 rules applied. Total rules applied 162 place count 102 transition count 120
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 172 place count 92 transition count 100
Iterating global reduction 2 with 10 rules applied. Total rules applied 182 place count 92 transition count 100
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 192 place count 82 transition count 90
Iterating global reduction 2 with 10 rules applied. Total rules applied 202 place count 82 transition count 90
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 212 place count 82 transition count 80
Applied a total of 212 rules in 32 ms. Remains 82 /173 variables (removed 91) and now considering 80/230 (removed 150) transitions.
// Phase 1: matrix 80 rows 82 cols
[2022-05-21 07:48:30] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:48:30] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 80 rows 82 cols
[2022-05-21 07:48:30] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-21 07:48:30] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2022-05-21 07:48:30] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 82 cols
[2022-05-21 07:48:30] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:48:31] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/173 places, 80/230 transitions.
Finished structural reductions, in 1 iterations. Remains : 82/173 places, 80/230 transitions.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s33 1) (GEQ s34 1) (GEQ s31 1) (GEQ s32 1) (GEQ s37 1) (GEQ s38 1) (GEQ s35 1) (GEQ s36 1) (GEQ s39 1) (GEQ s40 1)), p0:(OR (GEQ s48 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3715 reset in 353 ms.
Product exploration explored 100000 steps with 3730 reset in 255 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 (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), true, (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 319 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Finished random walk after 25 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), true, (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F p0)]
Knowledge based reduction with 6 factoid took 413 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 80 rows 82 cols
[2022-05-21 07:48:32] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-21 07:48:33] [INFO ] [Real]Absence check using 22 positive place invariants in 14 ms returned sat
[2022-05-21 07:48:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:48:33] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2022-05-21 07:48:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:48:33] [INFO ] [Nat]Absence check using 22 positive place invariants in 14 ms returned sat
[2022-05-21 07:48:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:48:33] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2022-05-21 07:48:33] [INFO ] Computed and/alt/rep : 70/100/70 causal constraints (skipped 0 transitions) in 12 ms.
[2022-05-21 07:48:33] [INFO ] Added : 23 causal constraints over 5 iterations in 93 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 82 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 80/80 transitions.
Applied a total of 0 rules in 6 ms. Remains 82 /82 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 82 cols
[2022-05-21 07:48:33] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:48:33] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 80 rows 82 cols
[2022-05-21 07:48:33] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:48:33] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2022-05-21 07:48:33] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 80 rows 82 cols
[2022-05-21 07:48:33] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:48:33] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 80/80 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), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 227 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 80 rows 82 cols
[2022-05-21 07:48:34] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-21 07:48:34] [INFO ] [Real]Absence check using 22 positive place invariants in 12 ms returned sat
[2022-05-21 07:48:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:48:34] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2022-05-21 07:48:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:48:34] [INFO ] [Nat]Absence check using 22 positive place invariants in 10 ms returned sat
[2022-05-21 07:48:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:48:34] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2022-05-21 07:48:34] [INFO ] Computed and/alt/rep : 70/100/70 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-21 07:48:34] [INFO ] Added : 23 causal constraints over 5 iterations in 76 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3720 reset in 370 ms.
Product exploration explored 100000 steps with 3684 reset in 359 ms.
Built C files in :
/tmp/ltsmin5215322281253785360
[2022-05-21 07:48:35] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2022-05-21 07:48:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:48:35] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2022-05-21 07:48:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:48:35] [INFO ] Computing Do-Not-Accords matrix : 80 transitions.
[2022-05-21 07:48:35] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:48:35] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5215322281253785360
Running compilation step : cd /tmp/ltsmin5215322281253785360;'/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 390 ms.
Running link step : cd /tmp/ltsmin5215322281253785360;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin5215322281253785360;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5183320411119690114.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 80/80 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 82 transition count 70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 72 transition count 70
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 62 transition count 60
Applied a total of 40 rules in 7 ms. Remains 62 /82 variables (removed 20) and now considering 60/80 (removed 20) transitions.
// Phase 1: matrix 60 rows 62 cols
[2022-05-21 07:48:50] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:48:50] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 60 rows 62 cols
[2022-05-21 07:48:50] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:48:50] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2022-05-21 07:48:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 60 rows 62 cols
[2022-05-21 07:48:50] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-21 07:48:50] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/82 places, 60/80 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/82 places, 60/80 transitions.
Built C files in :
/tmp/ltsmin9973001508319421366
[2022-05-21 07:48:50] [INFO ] Computing symmetric may disable matrix : 60 transitions.
[2022-05-21 07:48:50] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:48:50] [INFO ] Computing symmetric may enable matrix : 60 transitions.
[2022-05-21 07:48:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:48:50] [INFO ] Computing Do-Not-Accords matrix : 60 transitions.
[2022-05-21 07:48:50] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:48:50] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9973001508319421366
Running compilation step : cd /tmp/ltsmin9973001508319421366;'/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 287 ms.
Running link step : cd /tmp/ltsmin9973001508319421366;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin9973001508319421366;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16501125368025869868.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 07:49:06] [INFO ] Flatten gal took : 7 ms
[2022-05-21 07:49:06] [INFO ] Flatten gal took : 6 ms
[2022-05-21 07:49:06] [INFO ] Time to serialize gal into /tmp/LTL12714186500346430245.gal : 3 ms
[2022-05-21 07:49:06] [INFO ] Time to serialize properties into /tmp/LTL4309839503253796763.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/LTL12714186500346430245.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4309839503253796763.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/LTL1271418...267
Read 1 LTL properties
Checking formula 0 : !(((X(X(G(F((G("(((((Finished_6>=1)||(Finished_7>=1))||((Finished_4>=1)||(Finished_5>=1)))||(((Finished_8>=1)||(Finished_9>=1))||((Fin...729
Formula 0 simplified : !(XXGF(G"(((((Finished_6>=1)||(Finished_7>=1))||((Finished_4>=1)||(Finished_5>=1)))||(((Finished_8>=1)||(Finished_9>=1))||((Finished...714
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
0 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
321 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.23724,90432,1,0,165,437790,33,33,2039,328390,357
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLFireability-13 finished in 39068 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!X(!p0) U X((X(p1) U X(p2)))))'
Support contains 40 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 3 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:49:09] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:49:09] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:49:09] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:49:09] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:49:10] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:49:10] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(OR (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 1)), p2:(OR (GEQ s113 1) (GEQ s114 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 32222 reset in 318 ms.
Product exploration explored 100000 steps with 32253 reset in 364 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 4 factoid took 277 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 5 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 189 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:49:11] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-21 07:49:11] [INFO ] After 54ms 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 p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 5 factoid took 599 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 203 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 206 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:49:12] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:49:13] [INFO ] [Real]Absence check using 22 positive place invariants in 19 ms returned sat
[2022-05-21 07:49:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:49:13] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2022-05-21 07:49:13] [INFO ] Computed and/alt/rep : 200/310/200 causal constraints (skipped 0 transitions) in 26 ms.
[2022-05-21 07:49:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:49:13] [INFO ] [Nat]Absence check using 22 positive place invariants in 20 ms returned sat
[2022-05-21 07:49:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:49:13] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2022-05-21 07:49:13] [INFO ] Computed and/alt/rep : 200/310/200 causal constraints (skipped 0 transitions) in 27 ms.
[2022-05-21 07:49:13] [INFO ] Added : 20 causal constraints over 4 iterations in 150 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 20 out of 153 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:49:13] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:49:14] [INFO ] Implicit Places using invariants in 130 ms returned []
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:49:14] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:49:14] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:49:14] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:49:14] [INFO ] Dead Transitions using invariants and state equation in 295 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 210/210 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 p2) p0), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 2 factoid took 171 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 201 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Finished random walk after 37 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p2) p0), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (NOT (AND p0 (NOT p2)))), (F p2), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 2 factoid took 251 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 204 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 196 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:49:15] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:49:15] [INFO ] [Real]Absence check using 22 positive place invariants in 20 ms returned sat
[2022-05-21 07:49:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:49:16] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2022-05-21 07:49:16] [INFO ] Computed and/alt/rep : 200/310/200 causal constraints (skipped 0 transitions) in 27 ms.
[2022-05-21 07:49:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:49:16] [INFO ] [Nat]Absence check using 22 positive place invariants in 22 ms returned sat
[2022-05-21 07:49:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:49:16] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2022-05-21 07:49:16] [INFO ] Computed and/alt/rep : 200/310/200 causal constraints (skipped 0 transitions) in 27 ms.
[2022-05-21 07:49:16] [INFO ] Added : 20 causal constraints over 4 iterations in 151 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 216 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Product exploration explored 100000 steps with 32231 reset in 411 ms.
Product exploration explored 100000 steps with 32165 reset in 449 ms.
Applying partial POR strategy [false, false, true, true, false]
Stuttering acceptance computed with spot in 216 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Support contains 20 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 153 transition count 230
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 153 transition count 230
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 70 places in 1 ms
Iterating global reduction 0 with 50 rules applied. Total rules applied 70 place count 153 transition count 240
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 90 place count 153 transition count 220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 152 transition count 200
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 152 transition count 200
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 122 place count 122 transition count 150
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 152 place count 122 transition count 150
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 172 place count 102 transition count 130
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 192 place count 102 transition count 130
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 212 place count 102 transition count 110
Deduced a syphon composed of 40 places in 0 ms
Applied a total of 212 rules in 46 ms. Remains 102 /153 variables (removed 51) and now considering 110/210 (removed 100) transitions.
[2022-05-21 07:49:18] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 110 rows 102 cols
[2022-05-21 07:49:18] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:49:18] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/153 places, 110/210 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/153 places, 110/210 transitions.
Product exploration explored 100000 steps with 32191 reset in 313 ms.
Product exploration explored 100000 steps with 32195 reset in 262 ms.
Built C files in :
/tmp/ltsmin11062057884150008522
[2022-05-21 07:49:18] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11062057884150008522
Running compilation step : cd /tmp/ltsmin11062057884150008522;'/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 471 ms.
Running link step : cd /tmp/ltsmin11062057884150008522;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin11062057884150008522;'/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/stateBased10286622318562066432.hoa' '--buchi-type=spotba'
LTSmin run took 273 ms.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLFireability-15 finished in 10006 ms.
All properties solved by simple procedures.
Total runtime 144854 ms.

BK_STOP 1653119360022

--------------------
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-Z2T4N10"
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-Z2T4N10, 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-165307352900076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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