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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 284K
-rw-r--r-- 1 mcc users 9.7K Apr 29 17:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 29 17:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 17:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 29 17:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 9 09:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 09:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 09:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 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-Z2T4N06-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z2T4N06-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z2T4N06-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z2T4N06-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z2T4N06-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z2T4N06-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z2T4N06-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z2T4N06-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z2T4N06-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z2T4N06-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z2T4N06-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z2T4N06-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z2T4N06-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z2T4N06-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z2T4N06-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z2T4N06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653118387002

Running Version 202205111006
[2022-05-21 07:33:09] [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:33:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 07:33:09] [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:33:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-21 07:33:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1432 ms
[2022-05-21 07:33:11] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 106 PT places and 162.0 transition bindings in 40 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
[2022-05-21 07:33:11] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 11 ms.
[2022-05-21 07:33:11] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA UtilityControlRoom-COL-Z2T4N06-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N06-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N06-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N06-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 10 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 319 steps, including 0 resets, run visited all 13 properties in 69 ms. (steps per millisecond=4 )
[2022-05-21 07:33:11] [INFO ] Flatten gal took : 34 ms
[2022-05-21 07:33:11] [INFO ] Flatten gal took : 8 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(6), Z(2), Z(2)] of place MovetoZ breaks symmetries in sort Z
[2022-05-21 07:33:11] [INFO ] Unfolded HLPN to a Petri net with 106 places and 162 transitions 510 arcs in 28 ms.
[2022-05-21 07:33:11] [INFO ] Unfolded 12 HLPN properties in 1 ms.
[2022-05-21 07:33:11] [INFO ] Reduced 6 identical enabling conditions.
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
Support contains 93 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Applied a total of 0 rules in 13 ms. Remains 106 /106 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 106 cols
[2022-05-21 07:33:12] [INFO ] Computed 15 place invariants in 33 ms
[2022-05-21 07:33:12] [INFO ] Implicit Places using invariants in 352 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 413 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/106 places, 138/138 transitions.
Applied a total of 0 rules in 9 ms. Remains 105 /105 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 105/106 places, 138/138 transitions.
Support contains 93 out of 105 places after structural reductions.
[2022-05-21 07:33:12] [INFO ] Flatten gal took : 43 ms
[2022-05-21 07:33:12] [INFO ] Flatten gal took : 49 ms
[2022-05-21 07:33:12] [INFO ] Input system was already deterministic with 138 transitions.
Support contains 87 out of 105 places (down from 93) after GAL structural reductions.
Finished random walk after 3330 steps, including 0 resets, run visited all 13 properties in 104 ms. (steps per millisecond=32 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F((G(F(p0))||F(p1))))))'
Support contains 45 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 22 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 07:33:13] [INFO ] Computed 14 place invariants in 8 ms
[2022-05-21 07:33:13] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 07:33:13] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-21 07:33:13] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2022-05-21 07:33:13] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 07:33:13] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 07:33:13] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N06-LTLFireability-00 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) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (AND (GEQ s0 1) (GEQ s16 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s14 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s16 1) (GEQ s62 1)) (AND (GEQ s0 1) (GE...], 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 8934 reset in 788 ms.
Product exploration explored 100000 steps with 8957 reset in 500 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 (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 07:33:15] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-21 07:33:16] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2022-05-21 07:33:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:33:16] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2022-05-21 07:33:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:33:16] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2022-05-21 07:33:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:33:17] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2022-05-21 07:33:17] [INFO ] Computed and/alt/rep : 120/186/120 causal constraints (skipped 0 transitions) in 20 ms.
[2022-05-21 07:33:17] [INFO ] Added : 32 causal constraints over 7 iterations in 192 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 45 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 126/126 transitions.
Applied a total of 0 rules in 9 ms. Remains 93 /93 variables (removed 0) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 07:33:17] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 07:33:17] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 07:33:17] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-21 07:33:17] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2022-05-21 07:33:17] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 07:33:17] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 07:33:17] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/93 places, 126/126 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 (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 07:33:18] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 07:33:18] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2022-05-21 07:33:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:33:18] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2022-05-21 07:33:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:33:19] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2022-05-21 07:33:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:33:19] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2022-05-21 07:33:19] [INFO ] Computed and/alt/rep : 120/186/120 causal constraints (skipped 0 transitions) in 27 ms.
[2022-05-21 07:33:19] [INFO ] Added : 32 causal constraints over 7 iterations in 169 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8888 reset in 635 ms.
Product exploration explored 100000 steps with 8870 reset in 382 ms.
Built C files in :
/tmp/ltsmin3007696084729293231
[2022-05-21 07:33:20] [INFO ] Computing symmetric may disable matrix : 126 transitions.
[2022-05-21 07:33:20] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:33:20] [INFO ] Computing symmetric may enable matrix : 126 transitions.
[2022-05-21 07:33:20] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:33:20] [INFO ] Computing Do-Not-Accords matrix : 126 transitions.
[2022-05-21 07:33:20] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:33:20] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3007696084729293231
Running compilation step : cd /tmp/ltsmin3007696084729293231;'/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 838 ms.
Running link step : cd /tmp/ltsmin3007696084729293231;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin3007696084729293231;'/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/stateBased9063790899516259798.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 45 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 126/126 transitions.
Applied a total of 0 rules in 11 ms. Remains 93 /93 variables (removed 0) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 07:33:35] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 07:33:35] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 07:33:35] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 07:33:35] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2022-05-21 07:33:35] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 07:33:35] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 07:33:35] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/93 places, 126/126 transitions.
Built C files in :
/tmp/ltsmin12690223530234281765
[2022-05-21 07:33:36] [INFO ] Computing symmetric may disable matrix : 126 transitions.
[2022-05-21 07:33:36] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:33:36] [INFO ] Computing symmetric may enable matrix : 126 transitions.
[2022-05-21 07:33:36] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:33:36] [INFO ] Computing Do-Not-Accords matrix : 126 transitions.
[2022-05-21 07:33:36] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:33:36] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12690223530234281765
Running compilation step : cd /tmp/ltsmin12690223530234281765;'/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 554 ms.
Running link step : cd /tmp/ltsmin12690223530234281765;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin12690223530234281765;'/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/stateBased8285718237591654371.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 07:33:51] [INFO ] Flatten gal took : 17 ms
[2022-05-21 07:33:51] [INFO ] Flatten gal took : 15 ms
[2022-05-21 07:33:51] [INFO ] Time to serialize gal into /tmp/LTL3556732126272559885.gal : 4 ms
[2022-05-21 07:33:51] [INFO ] Time to serialize properties into /tmp/LTL2928976393202137856.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3556732126272559885.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2928976393202137856.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/LTL3556732...266
Read 1 LTL properties
Checking formula 0 : !((F(G(F((G(F("(((((((((IdleTechs_0>=1)&&(OpenRequests_8>=1))&&(Idles_0>=1))||(((IdleTechs_0>=1)&&(OpenRequests_6>=1))&&(Idles_0>=1)))...2286
Formula 0 simplified : !FGF(GF"(((((((((IdleTechs_0>=1)&&(OpenRequests_8>=1))&&(Idles_0>=1))||(((IdleTechs_0>=1)&&(OpenRequests_6>=1))&&(Idles_0>=1)))||(((...2271
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
300 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.03632,96852,1,0,67,440675,28,1,2633,319528,169
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-COL-Z2T4N06-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-COL-Z2T4N06-LTLFireability-00 finished in 41539 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(((p0 U !p0)&&(X(p0) U F(p1))))&&G(X(p2))))'
Support contains 27 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 6 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 07:33:54] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 07:33:54] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 07:33:54] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 07:33:54] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 07:33:54] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 07:33:55] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 348 ms :[(NOT p2), (OR (NOT p2) p0), (OR (NOT p2) (NOT p1)), true, (OR (NOT p1) (NOT p2) p0), (OR (NOT p2) (NOT p1) p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 3}], [{ cond=(AND p1 p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND p1 (NOT p0) p2), acceptance={0} source=5 dest: 0}, { cond=(AND p1 p0 p2), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=5 dest: 2}, { cond=(NOT p2), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p2:(OR (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1)), p0:(OR (AND (GEQ s0 1) (GEQ s16 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s14 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T4N06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N06-LTLFireability-02 finished in 657 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 30 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 105 cols
[2022-05-21 07:33:55] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 07:33:55] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 138 rows 105 cols
[2022-05-21 07:33:55] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 07:33:55] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
// Phase 1: matrix 138 rows 105 cols
[2022-05-21 07:33:55] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-21 07:33:55] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/105 places, 138/138 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (LT s80 1) (LT s79 1) (LT s76 1) (LT s75 1) (LT s78 1) (LT s77 1)), p0:(OR (GEQ s32 1) (GEQ s33 1) (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s37 1)...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T4N06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N06-LTLFireability-04 finished in 692 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F((X(p0)&&G((p0 U X(p1))))))))'
Support contains 39 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 105 cols
[2022-05-21 07:33:56] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-21 07:33:56] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 138 rows 105 cols
[2022-05-21 07:33:56] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 07:33:56] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
// Phase 1: matrix 138 rows 105 cols
[2022-05-21 07:33:56] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 07:33:56] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/105 places, 138/138 transitions.
Stuttering acceptance computed with spot in 378 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s10 1) (GEQ s74 1)) (AND (GEQ s1 1) (GEQ s17 1) (GEQ s74 1)) (AND (GEQ s0 1) (GEQ s16 1) (GEQ s74 1)) (AND (GEQ s0 1) (GEQ s14...], 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 10993 reset in 714 ms.
Product exploration explored 100000 steps with 10974 reset in 446 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 7 factoid took 658 ms. Reduced automaton from 5 states, 16 edges and 2 AP to 5 states, 16 edges and 2 AP.
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 12 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 7 factoid took 775 ms. Reduced automaton from 5 states, 16 edges and 2 AP to 5 states, 16 edges and 2 AP.
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 138 rows 105 cols
[2022-05-21 07:34:00] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 07:34:00] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2022-05-21 07:34:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:34:00] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2022-05-21 07:34:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:34:01] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2022-05-21 07:34:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:34:01] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2022-05-21 07:34:01] [INFO ] Computed and/alt/rep : 132/198/132 causal constraints (skipped 0 transitions) in 20 ms.
[2022-05-21 07:34:01] [INFO ] Added : 112 causal constraints over 23 iterations in 514 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 138 rows 105 cols
[2022-05-21 07:34:01] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 07:34:01] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-05-21 07:34:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:34:01] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2022-05-21 07:34:01] [INFO ] Computed and/alt/rep : 132/198/132 causal constraints (skipped 0 transitions) in 19 ms.
[2022-05-21 07:34:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:34:02] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-05-21 07:34:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:34:02] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2022-05-21 07:34:02] [INFO ] Computed and/alt/rep : 132/198/132 causal constraints (skipped 0 transitions) in 21 ms.
[2022-05-21 07:34:02] [INFO ] Added : 32 causal constraints over 7 iterations in 156 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 39 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 105 cols
[2022-05-21 07:34:02] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 07:34:02] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 138 rows 105 cols
[2022-05-21 07:34:02] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 07:34:02] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
// Phase 1: matrix 138 rows 105 cols
[2022-05-21 07:34:02] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-21 07:34:02] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/105 places, 138/138 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 (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 7 factoid took 646 ms. Reduced automaton from 5 states, 16 edges and 2 AP to 5 states, 16 edges and 2 AP.
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 7 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 7 factoid took 776 ms. Reduced automaton from 5 states, 16 edges and 2 AP to 5 states, 16 edges and 2 AP.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 138 rows 105 cols
[2022-05-21 07:34:05] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 07:34:05] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2022-05-21 07:34:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:34:05] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2022-05-21 07:34:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:34:05] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2022-05-21 07:34:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:34:05] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2022-05-21 07:34:05] [INFO ] Computed and/alt/rep : 132/198/132 causal constraints (skipped 0 transitions) in 19 ms.
[2022-05-21 07:34:06] [INFO ] Added : 112 causal constraints over 23 iterations in 499 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 138 rows 105 cols
[2022-05-21 07:34:06] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 07:34:06] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2022-05-21 07:34:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:34:06] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2022-05-21 07:34:06] [INFO ] Computed and/alt/rep : 132/198/132 causal constraints (skipped 0 transitions) in 19 ms.
[2022-05-21 07:34:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:34:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-05-21 07:34:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:34:06] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2022-05-21 07:34:06] [INFO ] Computed and/alt/rep : 132/198/132 causal constraints (skipped 0 transitions) in 21 ms.
[2022-05-21 07:34:07] [INFO ] Added : 32 causal constraints over 7 iterations in 155 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 10937 reset in 740 ms.
Product exploration explored 100000 steps with 11130 reset in 456 ms.
Built C files in :
/tmp/ltsmin17656626965524730949
[2022-05-21 07:34:08] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17656626965524730949
Running compilation step : cd /tmp/ltsmin17656626965524730949;'/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 503 ms.
Running link step : cd /tmp/ltsmin17656626965524730949;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin17656626965524730949;'/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/stateBased14861752506381192282.hoa' '--buchi-type=spotba'
LTSmin run took 145 ms.
FORMULA UtilityControlRoom-COL-Z2T4N06-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z2T4N06-LTLFireability-05 finished in 13502 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(G(p0))))||X(p0))))'
Support contains 15 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 10 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 07:34:09] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 07:34:09] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 07:34:09] [INFO ] Computed 14 place invariants in 7 ms
[2022-05-21 07:34:09] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 07:34:09] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 07:34:10] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s16 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s14 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s16 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s9 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 561 ms.
Stack based approach found an accepted trace after 2042 steps with 0 reset with depth 2043 and stack size 2043 in 15 ms.
FORMULA UtilityControlRoom-COL-Z2T4N06-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N06-LTLFireability-06 finished in 1199 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p1))&&p0)))'
Support contains 39 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 7 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 07:34:10] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 07:34:10] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 07:34:10] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-21 07:34:11] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 07:34:11] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 07:34:11] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s10 1) (LT s62 1)) (OR (LT s1 1) (LT s17 1) (LT s62 1)) (OR (LT s0 1) (LT s16 1) (LT s62 1)) (OR (LT s0 1) (LT s14 1) (LT s62 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 318 ms.
Stack based approach found an accepted trace after 2296 steps with 0 reset with depth 2297 and stack size 2297 in 12 ms.
FORMULA UtilityControlRoom-COL-Z2T4N06-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N06-LTLFireability-07 finished in 896 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))&&F(p1)))'
Support contains 24 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 10 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 07:34:11] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 07:34:11] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 07:34:11] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 07:34:11] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 07:34:11] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 07:34:12] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (AND (GEQ s44 1) (GEQ s69 1)) (AND (GEQ s54 1) (GEQ s74 1)) (AND (GEQ s45 1) (GEQ s69 1)) (AND (GEQ s50 1) (GEQ s72 1)) (AND (GEQ s49 1) (GEQ s71 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z2T4N06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N06-LTLFireability-08 finished in 530 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 6 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 6 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 07:34:12] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-21 07:34:12] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 07:34:12] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-21 07:34:12] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 07:34:12] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-21 07:34:12] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s70 1) (GEQ s69 1) (GEQ s72 1) (GEQ s71 1) (GEQ s74 1) (GEQ s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 295 ms.
Product exploration explored 100000 steps with 50000 reset in 334 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))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA UtilityControlRoom-COL-Z2T4N06-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T4N06-LTLFireability-10 finished in 1107 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 21 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 5 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 07:34:13] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 07:34:13] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 07:34:13] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 07:34:13] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 07:34:13] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 07:34:13] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s68 1) (GEQ s67 1) (GEQ s64 1) (GEQ s63 1) (GEQ s66 1) (GEQ s65 1) (AND (GEQ s0 1) (GEQ s16 1) (GEQ s62 1)) (AND (GEQ s0 1) (GEQ s14 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T4N06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N06-LTLFireability-12 finished in 626 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 18 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 105 transition count 114
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 60 place count 81 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 80 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 80 transition count 90
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 68 place count 74 transition count 84
Iterating global reduction 2 with 6 rules applied. Total rules applied 74 place count 74 transition count 84
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 111 place count 55 transition count 66
Applied a total of 111 rules in 27 ms. Remains 55 /105 variables (removed 50) and now considering 66/138 (removed 72) transitions.
// Phase 1: matrix 66 rows 55 cols
[2022-05-21 07:34:14] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-21 07:34:14] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 66 rows 55 cols
[2022-05-21 07:34:14] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-21 07:34:14] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2022-05-21 07:34:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 66 rows 55 cols
[2022-05-21 07:34:14] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-21 07:34:14] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/105 places, 66/138 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/105 places, 66/138 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s39 1) (GEQ s53 1)) (AND (GEQ s35 1) (GEQ s51 1)) (AND (GEQ s34 1) (GEQ s50 1)) (AND (GEQ s33 1) (GEQ s50 1)) (AND (GEQ s38 1) (GEQ s52 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 7331 reset in 356 ms.
Stack based approach found an accepted trace after 104 steps with 6 reset with depth 22 and stack size 22 in 1 ms.
FORMULA UtilityControlRoom-COL-Z2T4N06-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N06-LTLFireability-13 finished in 703 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F(X(p0)) U F(G(F(X(F(((p1 U p0)&&p2))))))))'
Support contains 39 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 105 transition count 114
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 60 place count 81 transition count 102
Applied a total of 60 rules in 11 ms. Remains 81 /105 variables (removed 24) and now considering 102/138 (removed 36) transitions.
// Phase 1: matrix 102 rows 81 cols
[2022-05-21 07:34:14] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 07:34:14] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 102 rows 81 cols
[2022-05-21 07:34:14] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 07:34:14] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2022-05-21 07:34:14] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 102 rows 81 cols
[2022-05-21 07:34:14] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 07:34:14] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/105 places, 102/138 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/105 places, 102/138 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p2) (AND (NOT p0) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p2) (AND (NOT p0) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (AND (GEQ s40 1) (GEQ s67 1)) (AND (GEQ s36 1) (GEQ s65 1)) (AND (GEQ s35 1) (GEQ s64 1)) (AND (GEQ s34 1) (GEQ s64 1)) (AND (GEQ s39 1) (GEQ s66 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5631 reset in 477 ms.
Product exploration explored 100000 steps with 5653 reset in 507 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 p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR (NOT p2) (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (OR (NOT p2) (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 8 factoid took 344 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0)]
Finished random walk after 40 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR (NOT p2) (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (OR (NOT p2) (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) p1)), (F (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 8 factoid took 631 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0)]
// Phase 1: matrix 102 rows 81 cols
[2022-05-21 07:34:17] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 07:34:17] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2022-05-21 07:34:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:34:17] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2022-05-21 07:34:17] [INFO ] Computed and/alt/rep : 96/150/96 causal constraints (skipped 0 transitions) in 13 ms.
[2022-05-21 07:34:17] [INFO ] Added : 0 causal constraints over 0 iterations in 32 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 102 rows 81 cols
[2022-05-21 07:34:17] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 07:34:17] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-05-21 07:34:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:34:18] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2022-05-21 07:34:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:34:18] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2022-05-21 07:34:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:34:18] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2022-05-21 07:34:18] [INFO ] Computed and/alt/rep : 96/150/96 causal constraints (skipped 0 transitions) in 14 ms.
[2022-05-21 07:34:18] [INFO ] Added : 14 causal constraints over 3 iterations in 72 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 39 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 102/102 transitions.
Applied a total of 0 rules in 5 ms. Remains 81 /81 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 81 cols
[2022-05-21 07:34:18] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-21 07:34:18] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 102 rows 81 cols
[2022-05-21 07:34:18] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 07:34:18] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2022-05-21 07:34:18] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 102 rows 81 cols
[2022-05-21 07:34:18] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 07:34:18] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 102/102 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 (AND (NOT p0) p1))), (X (OR (AND (NOT p0) (NOT p1)) (NOT p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (AND (NOT p0) (NOT p1)) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 8 factoid took 608 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0)]
Finished random walk after 24 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (OR (AND (NOT p0) (NOT p1)) (NOT p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (AND (NOT p0) (NOT p1)) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) p1)), (F (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 8 factoid took 635 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0)]
// Phase 1: matrix 102 rows 81 cols
[2022-05-21 07:34:20] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-21 07:34:20] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2022-05-21 07:34:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:34:20] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2022-05-21 07:34:20] [INFO ] Computed and/alt/rep : 96/150/96 causal constraints (skipped 0 transitions) in 13 ms.
[2022-05-21 07:34:20] [INFO ] Added : 0 causal constraints over 0 iterations in 30 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 102 rows 81 cols
[2022-05-21 07:34:20] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 07:34:20] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-05-21 07:34:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:34:20] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2022-05-21 07:34:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:34:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2022-05-21 07:34:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:34:21] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2022-05-21 07:34:21] [INFO ] Computed and/alt/rep : 96/150/96 causal constraints (skipped 0 transitions) in 12 ms.
[2022-05-21 07:34:21] [INFO ] Added : 14 causal constraints over 3 iterations in 61 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0)]
Product exploration explored 100000 steps with 5656 reset in 439 ms.
Product exploration explored 100000 steps with 5607 reset in 525 ms.
Built C files in :
/tmp/ltsmin7164024190996486460
[2022-05-21 07:34:22] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2022-05-21 07:34:22] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:34:22] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2022-05-21 07:34:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:34:22] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2022-05-21 07:34:22] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:34:22] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7164024190996486460
Running compilation step : cd /tmp/ltsmin7164024190996486460;'/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 457 ms.
Running link step : cd /tmp/ltsmin7164024190996486460;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin7164024190996486460;'/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/stateBased8225489682747263723.hoa' '--buchi-type=spotba'
LTSmin run took 116 ms.
FORMULA UtilityControlRoom-COL-Z2T4N06-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z2T4N06-LTLFireability-14 finished in 8237 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(!p1)||p0) U !X(p2))))'
Support contains 27 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 3 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 07:34:22] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 07:34:22] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 07:34:22] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 07:34:23] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 07:34:23] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-21 07:34:23] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 298 ms :[p2, p2, p2, p2, (AND p1 p2), true, p1]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(OR p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1 p2), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p0 p2) (AND (NOT p1) p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 5}, { cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (NOT (OR (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1))) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s62 1)) (AND (GEQ s1 1) (GEQ s17 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, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T4N06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N06-LTLFireability-15 finished in 680 ms.
All properties solved by simple procedures.
Total runtime 74110 ms.

BK_STOP 1653118463772

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

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