Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r485-tall-167912700301148.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is UtilityControlRoom-PT-Z2T4N08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r485-tall-167912700301148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 28K Feb 26 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 150K Feb 26 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 37K Feb 26 14:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 159K Feb 26 14:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 17:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 45K Feb 25 17:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Feb 25 17:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 17:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 46K Feb 26 14:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 243K Feb 26 14:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 66K Feb 26 14:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 280K Feb 26 14:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 17:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.4K Feb 25 17:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 93K Mar 5 18:23 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-PT-Z2T4N08-LTLFireability-00
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-LTLFireability-01
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-LTLFireability-02
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-LTLFireability-03
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-LTLFireability-04
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-LTLFireability-05
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-LTLFireability-06
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-LTLFireability-07
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-LTLFireability-08
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-LTLFireability-09
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-LTLFireability-10
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-LTLFireability-11
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-LTLFireability-12
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-LTLFireability-13
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-LTLFireability-14
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679320276902

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-PT-Z2T4N08
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-20 13:51:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-20 13:51:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 13:51:18] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2023-03-20 13:51:18] [INFO ] Transformed 140 places.
[2023-03-20 13:51:18] [INFO ] Transformed 216 transitions.
[2023-03-20 13:51:18] [INFO ] Parsed PT model containing 140 places and 216 transitions and 680 arcs in 106 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
[2023-03-20 13:51:18] [INFO ] Reduced 8 identical enabling conditions.
[2023-03-20 13:51:18] [INFO ] Reduced 8 identical enabling conditions.
[2023-03-20 13:51:18] [INFO ] Reduced 8 identical enabling conditions.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 123 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Applied a total of 0 rules in 11 ms. Remains 140 /140 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 140 cols
[2023-03-20 13:51:18] [INFO ] Computed 19 place invariants in 22 ms
[2023-03-20 13:51:19] [INFO ] Implicit Places using invariants in 354 ms returned [99]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 378 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 139/140 places, 184/184 transitions.
Applied a total of 0 rules in 2 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 392 ms. Remains : 139/140 places, 184/184 transitions.
Support contains 123 out of 139 places after structural reductions.
[2023-03-20 13:51:19] [INFO ] Flatten gal took : 35 ms
[2023-03-20 13:51:19] [INFO ] Flatten gal took : 23 ms
[2023-03-20 13:51:19] [INFO ] Input system was already deterministic with 184 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 22) seen :21
Finished Best-First random walk after 225 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=225 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&F(p1)))))'
Support contains 40 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Applied a total of 0 rules in 4 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 139 cols
[2023-03-20 13:51:19] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-20 13:51:19] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-20 13:51:19] [INFO ] Invariant cache hit.
[2023-03-20 13:51:20] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2023-03-20 13:51:20] [INFO ] Invariant cache hit.
[2023-03-20 13:51:20] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 330 ms. Remains : 139/139 places, 184/184 transitions.
Stuttering acceptance computed with spot in 410 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p1:(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)), p0:(OR (GEQ s65 1) (GEQ s64 1) (GEQ s67 1) (GEQ s66 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLFireability-03 finished in 806 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 8 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 139 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 107 transition count 136
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 80 place count 107 transition count 120
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 112 place count 91 transition count 120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 90 transition count 104
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 90 transition count 104
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 122 place count 82 transition count 96
Iterating global reduction 2 with 8 rules applied. Total rules applied 130 place count 82 transition count 96
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 138 place count 74 transition count 80
Iterating global reduction 2 with 8 rules applied. Total rules applied 146 place count 74 transition count 80
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 154 place count 66 transition count 72
Iterating global reduction 2 with 8 rules applied. Total rules applied 162 place count 66 transition count 72
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 170 place count 66 transition count 64
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 33 rules applied. Total rules applied 203 place count 49 transition count 48
Applied a total of 203 rules in 32 ms. Remains 49 /139 variables (removed 90) and now considering 48/184 (removed 136) transitions.
// Phase 1: matrix 48 rows 49 cols
[2023-03-20 13:51:20] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-20 13:51:20] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-20 13:51:20] [INFO ] Invariant cache hit.
[2023-03-20 13:51:20] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-20 13:51:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 13:51:20] [INFO ] Invariant cache hit.
[2023-03-20 13:51:20] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/139 places, 48/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 166 ms. Remains : 49/139 places, 48/184 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s32 1) (GEQ s31 1) (GEQ s26 1) (GEQ s25 1) (GEQ s28 1) (GEQ s27 1) (GEQ s30 1) (GEQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4040 reset in 360 ms.
Product exploration explored 100000 steps with 3833 reset in 226 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
[2023-03-20 13:51:22] [INFO ] Invariant cache hit.
[2023-03-20 13:51:22] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-03-20 13:51:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:51:22] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-20 13:51:22] [INFO ] Computed and/alt/rep : 40/56/40 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-20 13:51:22] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 49 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49/49 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2023-03-20 13:51:22] [INFO ] Invariant cache hit.
[2023-03-20 13:51:22] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-20 13:51:22] [INFO ] Invariant cache hit.
[2023-03-20 13:51:22] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-20 13:51:22] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 13:51:22] [INFO ] Invariant cache hit.
[2023-03-20 13:51:22] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 145 ms. Remains : 49/49 places, 48/48 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 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 144 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
[2023-03-20 13:51:22] [INFO ] Invariant cache hit.
[2023-03-20 13:51:22] [INFO ] [Real]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-03-20 13:51:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:51:22] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-20 13:51:22] [INFO ] Computed and/alt/rep : 40/56/40 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-20 13:51:22] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3962 reset in 181 ms.
Product exploration explored 100000 steps with 4167 reset in 209 ms.
Built C files in :
/tmp/ltsmin17289304310717378385
[2023-03-20 13:51:23] [INFO ] Computing symmetric may disable matrix : 48 transitions.
[2023-03-20 13:51:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 13:51:23] [INFO ] Computing symmetric may enable matrix : 48 transitions.
[2023-03-20 13:51:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 13:51:23] [INFO ] Computing Do-Not-Accords matrix : 48 transitions.
[2023-03-20 13:51:23] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 13:51:23] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17289304310717378385
Running compilation step : cd /tmp/ltsmin17289304310717378385;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 227 ms.
Running link step : cd /tmp/ltsmin17289304310717378385;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin17289304310717378385;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5527139705985416198.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 49 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49/49 places, 48/48 transitions.
Applied a total of 0 rules in 11 ms. Remains 49 /49 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2023-03-20 13:51:38] [INFO ] Invariant cache hit.
[2023-03-20 13:51:38] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-20 13:51:38] [INFO ] Invariant cache hit.
[2023-03-20 13:51:38] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-20 13:51:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 13:51:38] [INFO ] Invariant cache hit.
[2023-03-20 13:51:38] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 139 ms. Remains : 49/49 places, 48/48 transitions.
Built C files in :
/tmp/ltsmin5729223050883590612
[2023-03-20 13:51:38] [INFO ] Computing symmetric may disable matrix : 48 transitions.
[2023-03-20 13:51:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 13:51:38] [INFO ] Computing symmetric may enable matrix : 48 transitions.
[2023-03-20 13:51:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 13:51:38] [INFO ] Computing Do-Not-Accords matrix : 48 transitions.
[2023-03-20 13:51:38] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 13:51:38] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5729223050883590612
Running compilation step : cd /tmp/ltsmin5729223050883590612;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 128 ms.
Running link step : cd /tmp/ltsmin5729223050883590612;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin5729223050883590612;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6346443084917582437.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-20 13:51:53] [INFO ] Flatten gal took : 4 ms
[2023-03-20 13:51:53] [INFO ] Flatten gal took : 3 ms
[2023-03-20 13:51:53] [INFO ] Time to serialize gal into /tmp/LTL8538641549604608248.gal : 4 ms
[2023-03-20 13:51:53] [INFO ] Time to serialize properties into /tmp/LTL18305736405091411689.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8538641549604608248.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17217495454799022691.hoa' '-atoms' '/tmp/LTL18305736405091411689.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL18305736405091411689.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17217495454799022691.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
7 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.100891,17796,1,0,54,21908,24,1,1184,13714,139
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLFireability-04 finished in 33366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p1&&X(p2))))))'
Support contains 35 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 6 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 123 cols
[2023-03-20 13:51:53] [INFO ] Computed 18 place invariants in 5 ms
[2023-03-20 13:51:54] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-20 13:51:54] [INFO ] Invariant cache hit.
[2023-03-20 13:51:54] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2023-03-20 13:51:54] [INFO ] Invariant cache hit.
[2023-03-20 13:51:54] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 226 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s25 1) (LT s82 1)) (OR (LT s1 1) (LT s13 1) (LT s82 1)) (OR (LT s0 1) (LT s20 1) (LT s82 1)) (OR (LT s0 1) (LT s10 1) (LT s82 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 12077 reset in 529 ms.
Product exploration explored 100000 steps with 12099 reset in 541 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 p1) p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 14 factoid took 711 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Finished random walk after 39 steps, including 0 resets, run visited all 8 properties in 4 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1)), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 14 factoid took 844 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 107 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 35 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2023-03-20 13:51:57] [INFO ] Invariant cache hit.
[2023-03-20 13:51:57] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-20 13:51:57] [INFO ] Invariant cache hit.
[2023-03-20 13:51:57] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-20 13:51:57] [INFO ] Invariant cache hit.
[2023-03-20 13:51:57] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 354 ms. Remains : 123/123 places, 168/168 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 14 factoid took 864 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Finished random walk after 35 steps, including 0 resets, run visited all 8 properties in 4 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1)), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 14 factoid took 809 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 115 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 12048 reset in 493 ms.
Product exploration explored 100000 steps with 12245 reset in 504 ms.
Built C files in :
/tmp/ltsmin13087117991457999899
[2023-03-20 13:52:01] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13087117991457999899
Running compilation step : cd /tmp/ltsmin13087117991457999899;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 272 ms.
Running link step : cd /tmp/ltsmin13087117991457999899;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin13087117991457999899;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17534734464938705195.hoa' '--buchi-type=spotba'
LTSmin run took 115 ms.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLFireability-05 finished in 7621 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0) U (!p1||G(F(!p2))))))'
Support contains 83 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Applied a total of 0 rules in 11 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 139 cols
[2023-03-20 13:52:01] [INFO ] Computed 18 place invariants in 3 ms
[2023-03-20 13:52:01] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-20 13:52:01] [INFO ] Invariant cache hit.
[2023-03-20 13:52:01] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-20 13:52:01] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-20 13:52:01] [INFO ] Invariant cache hit.
[2023-03-20 13:52:01] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 218 ms. Remains : 139/139 places, 184/184 transitions.
Stuttering acceptance computed with spot in 257 ms :[(AND p1 p2), p2, p2, (AND p2 (NOT p1) (NOT p0)), (AND p2 (NOT p0)), (AND p1 p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={} source=0 dest: 3}, { cond=(AND p1 p2 p0), acceptance={} source=0 dest: 5}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p2 p0), acceptance={} source=4 dest: 4}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p1 p2 p0), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2 p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (GEQ s97 1) (GEQ s96 1) (GEQ s91 1) (GEQ s90 1) (GEQ s93 1) (GEQ s92 1) (GEQ s95 1) (GEQ s94 1)), p0:(AND (OR (GEQ s65 1) (GEQ s64 1) (GEQ s67 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 224 reset in 203 ms.
Product exploration explored 100000 steps with 264 reset in 226 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) (NOT p2)), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT p2)), (X (NOT (AND p1 p2 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (OR (NOT p1) p0))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), true, (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (OR (NOT p1) p0))), (X (X (NOT (OR (NOT p1) p0))))]
Knowledge based reduction with 19 factoid took 1102 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) p1 p2), p2, p2]
Finished random walk after 12 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT p2)), (X (NOT (AND p1 p2 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (OR (NOT p1) p0))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), true, (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (OR (NOT p1) p0))), (X (X (NOT (OR (NOT p1) p0)))), (F p2), (F (NOT (OR p0 (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 19 factoid took 1025 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) p1 p2), p2, p2]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) p1 p2), p2, p2]
Support contains 83 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Applied a total of 0 rules in 9 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
[2023-03-20 13:52:05] [INFO ] Invariant cache hit.
[2023-03-20 13:52:05] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-20 13:52:05] [INFO ] Invariant cache hit.
[2023-03-20 13:52:05] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2023-03-20 13:52:05] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-20 13:52:05] [INFO ] Invariant cache hit.
[2023-03-20 13:52:05] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 227 ms. Remains : 139/139 places, 184/184 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 (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (OR p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (X (OR p0 (NOT p1)))), (X (X (NOT (OR p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 8 factoid took 368 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) p1 p2), p2, p2]
Finished random walk after 2962 steps, including 0 resets, run visited all 4 properties in 21 ms. (steps per millisecond=141 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (OR p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (X (OR p0 (NOT p1)))), (X (X (NOT (OR p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p2), (F (NOT (OR p0 (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 8 factoid took 543 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) p1 p2), p2, p2]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) p1 p2), p2, p2]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) p1 p2), p2, p2]
Product exploration explored 100000 steps with 237 reset in 203 ms.
Product exploration explored 100000 steps with 209 reset in 216 ms.
Built C files in :
/tmp/ltsmin11988449178491239580
[2023-03-20 13:52:07] [INFO ] Computing symmetric may disable matrix : 184 transitions.
[2023-03-20 13:52:07] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 13:52:07] [INFO ] Computing symmetric may enable matrix : 184 transitions.
[2023-03-20 13:52:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 13:52:07] [INFO ] Computing Do-Not-Accords matrix : 184 transitions.
[2023-03-20 13:52:07] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 13:52:07] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11988449178491239580
Running compilation step : cd /tmp/ltsmin11988449178491239580;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 372 ms.
Running link step : cd /tmp/ltsmin11988449178491239580;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11988449178491239580;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3757287564669736830.hoa' '--buchi-type=spotba'
LTSmin run took 486 ms.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLFireability-06 finished in 6491 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (p1 U (G(!p2)&&(X(G(p4))||p3)))))'
Support contains 99 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Applied a total of 0 rules in 4 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
[2023-03-20 13:52:08] [INFO ] Invariant cache hit.
[2023-03-20 13:52:08] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-20 13:52:08] [INFO ] Invariant cache hit.
[2023-03-20 13:52:08] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-20 13:52:08] [INFO ] Invariant cache hit.
[2023-03-20 13:52:08] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 212 ms. Remains : 139/139 places, 184/184 transitions.
Stuttering acceptance computed with spot in 582 ms :[(OR p2 (AND (NOT p3) (NOT p4))), true, p2, (NOT p4), (OR p2 (AND (NOT p3) (NOT p4))), p2, (OR (AND (NOT p3) (NOT p4)) (AND p2 (NOT p4))), p2, (OR (AND (NOT p3) (NOT p4)) (AND p2 (NOT p4))), (AND p2 (NOT p4)), (AND p2 (NOT p4)), (AND p2 (NOT p4))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(AND p2 p1 p0), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={1} source=0 dest: 5}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={0, 1} source=0 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 7}, { cond=(AND (NOT p2) (NOT p3) p1 p0), acceptance={} source=0 dest: 8}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(NOT p4), acceptance={} source=3 dest: 1}, { cond=p4, acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={1} source=4 dest: 7}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={0, 1} source=4 dest: 8}], [{ cond=(AND p2 (NOT p0)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 2}, { cond=(AND p2 p1 p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={1} source=5 dest: 5}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=5 dest: 7}], [{ cond=(AND p2 (NOT p0) (NOT p4)), acceptance={0, 1} source=6 dest: 0}, { cond=(AND p2 (NOT p1) p0 (NOT p4)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p4)), acceptance={} source=6 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p3) (NOT p1) p0) (AND p2 (NOT p1) p0 p4)), acceptance={} source=6 dest: 3}, { cond=(AND p2 p1 p0 (NOT p4)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) (NOT p0) (NOT p4)), acceptance={1} source=6 dest: 5}, { cond=(OR (AND p2 (NOT p0) p4) (AND (NOT p3) (NOT p0) p4)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p4)), acceptance={0, 1} source=6 dest: 6}, { cond=(AND (NOT p2) p1 p0 (NOT p4)), acceptance={} source=6 dest: 7}, { cond=(OR (AND (NOT p2) (NOT p3) p1 p0) (AND p2 p1 p0 p4)), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p2) p3 (NOT p0) p4), acceptance={} source=6 dest: 9}, { cond=(AND (NOT p2) p3 (NOT p1) p0 p4), acceptance={} source=6 dest: 10}, { cond=(AND (NOT p2) p3 p1 p0 p4), acceptance={} source=6 dest: 11}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 2}, { cond=(AND p2 p1), acceptance={0, 1} source=7 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={1} source=7 dest: 7}], [{ cond=(AND p2 (NOT p1) (NOT p4)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p4)), acceptance={} source=8 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p3) (NOT p1)) (AND p2 (NOT p1) p4)), acceptance={} source=8 dest: 3}, { cond=(AND p2 p1 (NOT p4)), acceptance={0, 1} source=8 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p4)), acceptance={1} source=8 dest: 7}, { cond=(OR (AND p2 p1 p4) (AND (NOT p3) p1 p4)), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p2) (NOT p3) p1 (NOT p4)), acceptance={0, 1} source=8 dest: 8}, { cond=(AND (NOT p2) p3 (NOT p1) p4), acceptance={} source=8 dest: 10}, { cond=(AND (NOT p2) p3 p1 p4), acceptance={} source=8 dest: 11}], [{ cond=(AND p2 (NOT p0) (NOT p4)), acceptance={0, 1} source=9 dest: 0}, { cond=(AND p2 (NOT p1) p0 (NOT p4)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p4)), acceptance={} source=9 dest: 2}, { cond=(AND p2 (NOT p1) p0 p4), acceptance={} source=9 dest: 3}, { cond=(AND p2 p1 p0 (NOT p4)), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p2) (NOT p0) (NOT p4)), acceptance={1} source=9 dest: 5}, { cond=(AND p2 (NOT p0) p4), acceptance={0} source=9 dest: 6}, { cond=(AND (NOT p2) p1 p0 (NOT p4)), acceptance={} source=9 dest: 7}, { cond=(AND p2 p1 p0 p4), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p2) (NOT p0) p4), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p2) (NOT p1) p0 p4), acceptance={} source=9 dest: 10}, { cond=(AND (NOT p2) p1 p0 p4), acceptance={} source=9 dest: 11}], [{ cond=(AND p2 (NOT p4)), acceptance={} source=10 dest: 1}, { cond=(AND (NOT p2) (NOT p4)), acceptance={} source=10 dest: 2}, { cond=(AND p2 p4), acceptance={} source=10 dest: 3}, { cond=(AND (NOT p2) p4), acceptance={} source=10 dest: 10}], [{ cond=(AND p2 (NOT p1) (NOT p4)), acceptance={} source=11 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p4)), acceptance={} source=11 dest: 2}, { cond=(AND p2 (NOT p1) p4), acceptance={} source=11 dest: 3}, { cond=(AND p2 p1 (NOT p4)), acceptance={0, 1} source=11 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p4)), acceptance={1} source=11 dest: 7}, { cond=(AND p2 p1 p4), acceptance={0} source=11 dest: 8}, { cond=(AND (NOT p2) (NOT p1) p4), acceptance={} source=11 dest: 10}, { cond=(AND (NOT p2) p1 p4), acceptance={} source=11 dest: 11}]], initial=0, aps=[p2:(OR (GEQ s65 1) (GEQ s64 1) (GEQ s67 1) (GEQ s66 1) (GEQ s69 1) (GEQ s68 1) (GEQ s71 1) (GEQ s70 1) (GEQ s73 1) (GEQ s72 1) (GEQ s43 1) (GEQ s42 1) (GE...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, 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-PT-Z2T4N08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLFireability-07 finished in 831 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 139 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 107 transition count 136
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 80 place count 107 transition count 120
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 112 place count 91 transition count 120
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 142 place count 76 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 144 place count 75 transition count 104
Applied a total of 144 rules in 18 ms. Remains 75 /139 variables (removed 64) and now considering 104/184 (removed 80) transitions.
// Phase 1: matrix 104 rows 75 cols
[2023-03-20 13:52:08] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-20 13:52:08] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-20 13:52:08] [INFO ] Invariant cache hit.
[2023-03-20 13:52:09] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-20 13:52:09] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 13:52:09] [INFO ] Invariant cache hit.
[2023-03-20 13:52:09] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/139 places, 104/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 196 ms. Remains : 75/139 places, 104/184 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s51 1), p0:(AND (GEQ s0 1) (GEQ s17 1) (GEQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1394 reset in 184 ms.
Stack based approach found an accepted trace after 2560 steps with 37 reset with depth 285 and stack size 285 in 6 ms.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLFireability-08 finished in 472 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 139 transition count 154
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 75 place count 109 transition count 139
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 75 place count 109 transition count 124
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 105 place count 94 transition count 124
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 93 transition count 123
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 93 transition count 123
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 165 place count 64 transition count 94
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 64 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 63 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 63 transition count 77
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 176 place count 55 transition count 62
Iterating global reduction 2 with 8 rules applied. Total rules applied 184 place count 55 transition count 62
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 191 place count 48 transition count 54
Iterating global reduction 2 with 7 rules applied. Total rules applied 198 place count 48 transition count 54
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 204 place count 48 transition count 48
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 205 place count 47 transition count 47
Iterating global reduction 3 with 1 rules applied. Total rules applied 206 place count 47 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 207 place count 47 transition count 46
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 221 place count 40 transition count 39
Applied a total of 221 rules in 32 ms. Remains 40 /139 variables (removed 99) and now considering 39/184 (removed 145) transitions.
// Phase 1: matrix 39 rows 40 cols
[2023-03-20 13:52:09] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-20 13:52:09] [INFO ] Implicit Places using invariants in 38 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/139 places, 39/184 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 90 ms. Remains : 39/139 places, 39/184 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s21 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 138 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLFireability-09 finished in 283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!p0)))'
Support contains 3 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 139 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 107 transition count 136
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 80 place count 107 transition count 120
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 112 place count 91 transition count 120
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 142 place count 76 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 144 place count 75 transition count 104
Applied a total of 144 rules in 18 ms. Remains 75 /139 variables (removed 64) and now considering 104/184 (removed 80) transitions.
// Phase 1: matrix 104 rows 75 cols
[2023-03-20 13:52:09] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-20 13:52:09] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-20 13:52:09] [INFO ] Invariant cache hit.
[2023-03-20 13:52:09] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2023-03-20 13:52:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 13:52:09] [INFO ] Invariant cache hit.
[2023-03-20 13:52:09] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/139 places, 104/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 201 ms. Remains : 75/139 places, 104/184 transitions.
Stuttering acceptance computed with spot in 97 ms :[p0, true, p0]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s16 1) (GEQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 71 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLFireability-10 finished in 323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 8 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 123 cols
[2023-03-20 13:52:10] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-20 13:52:10] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-20 13:52:10] [INFO ] Invariant cache hit.
[2023-03-20 13:52:10] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2023-03-20 13:52:10] [INFO ] Invariant cache hit.
[2023-03-20 13:52:10] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 259 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s29 1), p0:(AND (GEQ s0 1) (GEQ s17 1) (GEQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLFireability-11 finished in 350 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 139 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 107 transition count 136
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 80 place count 107 transition count 120
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 112 place count 91 transition count 120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 90 transition count 104
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 90 transition count 104
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 122 place count 82 transition count 96
Iterating global reduction 2 with 8 rules applied. Total rules applied 130 place count 82 transition count 96
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 138 place count 74 transition count 80
Iterating global reduction 2 with 8 rules applied. Total rules applied 146 place count 74 transition count 80
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 154 place count 66 transition count 72
Iterating global reduction 2 with 8 rules applied. Total rules applied 162 place count 66 transition count 72
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 170 place count 66 transition count 64
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 170 place count 66 transition count 56
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 186 place count 58 transition count 56
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 33 rules applied. Total rules applied 219 place count 41 transition count 40
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 233 place count 34 transition count 33
Applied a total of 233 rules in 18 ms. Remains 34 /139 variables (removed 105) and now considering 33/184 (removed 151) transitions.
// Phase 1: matrix 33 rows 34 cols
[2023-03-20 13:52:10] [INFO ] Computed 17 place invariants in 0 ms
[2023-03-20 13:52:10] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-20 13:52:10] [INFO ] Invariant cache hit.
[2023-03-20 13:52:10] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-20 13:52:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 13:52:10] [INFO ] Invariant cache hit.
[2023-03-20 13:52:10] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/139 places, 33/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 138 ms. Remains : 34/139 places, 33/184 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10011 reset in 124 ms.
Stack based approach found an accepted trace after 25 steps with 3 reset with depth 4 and stack size 4 in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLFireability-12 finished in 304 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0))||(p1 U (G((p1||G(p0)))||(X(!p2)&&(p1||G(p0))))))))'
Support contains 6 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 5 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 123 cols
[2023-03-20 13:52:10] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-20 13:52:10] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-20 13:52:10] [INFO ] Invariant cache hit.
[2023-03-20 13:52:10] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2023-03-20 13:52:10] [INFO ] Invariant cache hit.
[2023-03-20 13:52:10] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 252 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 0}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p1) (NOT p2))), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LT s94 1), p0:(OR (LT s58 1) (LT s91 1)), p2:(AND (GEQ s0 1) (GEQ s18 1) (GEQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4316 steps with 0 reset in 11 ms.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLFireability-13 finished in 392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(p0)&&G(!p1)) U (p0&&F(!p2)))))'
Support contains 6 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 124 transition count 169
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 124 transition count 169
Applied a total of 30 rules in 5 ms. Remains 124 /139 variables (removed 15) and now considering 169/184 (removed 15) transitions.
// Phase 1: matrix 169 rows 124 cols
[2023-03-20 13:52:11] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-20 13:52:11] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-20 13:52:11] [INFO ] Invariant cache hit.
[2023-03-20 13:52:11] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2023-03-20 13:52:11] [INFO ] Invariant cache hit.
[2023-03-20 13:52:11] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 124/139 places, 169/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 255 ms. Remains : 124/139 places, 169/184 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), true, (AND (NOT p0) (NOT p1)), p1, p2]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 4}, { cond=(AND p0 p2), acceptance={0} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=p2, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s52 1), p1:(AND (GEQ s1 1) (GEQ s19 1) (GEQ s83 1)), p2:(AND (GEQ s62 1) (GEQ s101 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 62 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLFireability-15 finished in 491 ms.
All properties solved by simple procedures.
Total runtime 53160 ms.

BK_STOP 1679320332605

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-PT-Z2T4N08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is UtilityControlRoom-PT-Z2T4N08, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r485-tall-167912700301148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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