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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 24K Apr 29 17:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 29 17:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 23K Apr 29 17:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 29 17:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 9 09:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K May 9 09:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 9 09:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 9 09:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 9 09:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.3K May 9 09:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 8 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 70K 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-PT-Z2T4N06-LTLFireability-00
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-LTLFireability-01
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-LTLFireability-02
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-LTLFireability-03
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-LTLFireability-04
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-LTLFireability-05
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-LTLFireability-06
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-LTLFireability-07
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-LTLFireability-08
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-LTLFireability-09
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-LTLFireability-10
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-LTLFireability-11
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-LTLFireability-12
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-LTLFireability-13
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-LTLFireability-14
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653147410069

Running Version 202205111006
[2022-05-21 15:36:51] [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 15:36:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 15:36:52] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2022-05-21 15:36:52] [INFO ] Transformed 106 places.
[2022-05-21 15:36:52] [INFO ] Transformed 162 transitions.
[2022-05-21 15:36:52] [INFO ] Parsed PT model containing 106 places and 162 transitions in 294 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
FORMULA UtilityControlRoom-PT-Z2T4N06-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N06-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N06-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N06-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 88 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 16 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 15:36:52] [INFO ] Computed 15 place invariants in 22 ms
[2022-05-21 15:36:52] [INFO ] Implicit Places using invariants in 284 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 334 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 3 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 88 out of 105 places after structural reductions.
[2022-05-21 15:36:53] [INFO ] Flatten gal took : 61 ms
[2022-05-21 15:36:53] [INFO ] Flatten gal took : 26 ms
[2022-05-21 15:36:53] [INFO ] Input system was already deterministic with 138 transitions.
Finished random walk after 7018 steps, including 2 resets, run visited all 21 properties in 296 ms. (steps per millisecond=23 )
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 41 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 15:36:54] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-21 15:36:54] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 15:36:54] [INFO ] Computed 14 place invariants in 6 ms
[2022-05-21 15:36:54] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2022-05-21 15:36:54] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 15:36:54] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 15:36:54] [INFO ] Dead Transitions using invariants and state equation in 153 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 252 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-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 8839 reset in 777 ms.
Product exploration explored 100000 steps with 8884 reset in 516 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 130 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 74 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 152 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 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 15:36:56] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-21 15:36:56] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2022-05-21 15:36:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 15:36:57] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2022-05-21 15:36:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 15:36:57] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2022-05-21 15:36:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 15:36:57] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2022-05-21 15:36:57] [INFO ] Computed and/alt/rep : 120/186/120 causal constraints (skipped 0 transitions) in 16 ms.
[2022-05-21 15:36:57] [INFO ] Added : 14 causal constraints over 3 iterations in 106 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 7 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 15:36:57] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 15:36:57] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 15:36:57] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 15:36:58] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2022-05-21 15:36:58] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 15:36:58] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-21 15:36:58] [INFO ] Dead Transitions using invariants and state equation in 140 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 217 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 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
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 141 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 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 15:36:58] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 15:36:59] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2022-05-21 15:36:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 15:36:59] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2022-05-21 15:36:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 15:36:59] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-05-21 15:36:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 15:36:59] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2022-05-21 15:36:59] [INFO ] Computed and/alt/rep : 120/186/120 causal constraints (skipped 0 transitions) in 13 ms.
[2022-05-21 15:36:59] [INFO ] Added : 14 causal constraints over 3 iterations in 65 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8920 reset in 411 ms.
Product exploration explored 100000 steps with 8869 reset in 417 ms.
Built C files in :
/tmp/ltsmin11634033249752149342
[2022-05-21 15:37:00] [INFO ] Computing symmetric may disable matrix : 126 transitions.
[2022-05-21 15:37:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 15:37:00] [INFO ] Computing symmetric may enable matrix : 126 transitions.
[2022-05-21 15:37:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 15:37:00] [INFO ] Computing Do-Not-Accords matrix : 126 transitions.
[2022-05-21 15:37:00] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 15:37:00] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11634033249752149342
Running compilation step : cd /tmp/ltsmin11634033249752149342;'/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 558 ms.
Running link step : cd /tmp/ltsmin11634033249752149342;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin11634033249752149342;'/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/stateBased7570011486001482965.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 7 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 15:37:15] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 15:37:15] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 15:37:15] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 15:37:15] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2022-05-21 15:37:15] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 15:37:15] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 15:37:15] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/93 places, 126/126 transitions.
Built C files in :
/tmp/ltsmin17779821251920543887
[2022-05-21 15:37:15] [INFO ] Computing symmetric may disable matrix : 126 transitions.
[2022-05-21 15:37:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 15:37:15] [INFO ] Computing symmetric may enable matrix : 126 transitions.
[2022-05-21 15:37:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 15:37:15] [INFO ] Computing Do-Not-Accords matrix : 126 transitions.
[2022-05-21 15:37:15] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 15:37:15] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17779821251920543887
Running compilation step : cd /tmp/ltsmin17779821251920543887;'/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 392 ms.
Running link step : cd /tmp/ltsmin17779821251920543887;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17779821251920543887;'/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/stateBased11763291565588573469.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 15:37:31] [INFO ] Flatten gal took : 15 ms
[2022-05-21 15:37:31] [INFO ] Flatten gal took : 13 ms
[2022-05-21 15:37:31] [INFO ] Time to serialize gal into /tmp/LTL2425490779195267198.gal : 4 ms
[2022-05-21 15:37:31] [INFO ] Time to serialize properties into /tmp/LTL9673334150269615414.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/LTL2425490779195267198.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9673334150269615414.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/LTL2425490...266
Read 1 LTL properties
Checking formula 0 : !((F(G(F((G(F("(((((((((IdleTechs_0>=1)&&(OpenRequests_4_0>=1))&&(Idles>=1))||(((IdleTechs_0>=1)&&(OpenRequests_3_0>=1))&&(Idles>=1)))...2326
Formula 0 simplified : !FGF(GF"(((((((((IdleTechs_0>=1)&&(OpenRequests_4_0>=1))&&(Idles>=1))||(((IdleTechs_0>=1)&&(OpenRequests_3_0>=1))&&(Idles>=1)))||(((...2311
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
999 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,10.0431,233364,1,0,67,1.14673e+06,28,1,2658,877057,169
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-PT-Z2T4N06-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-PT-Z2T4N06-LTLFireability-00 finished in 48755 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 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 15:37:42] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 15:37:42] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 15:37:42] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-21 15:37:42] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 15:37:42] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 15:37:43] [INFO ] Dead Transitions using invariants and state equation in 134 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 270 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-PT-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 20 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T4N06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N06-LTLFireability-02 finished in 607 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 3 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 15:37:43] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 15:37:43] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 138 rows 105 cols
[2022-05-21 15:37:43] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 15:37:43] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
// Phase 1: matrix 138 rows 105 cols
[2022-05-21 15:37:43] [INFO ] Computed 14 place invariants in 17 ms
[2022-05-21 15:37:43] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/105 places, 138/138 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : UtilityControlRoom-PT-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-PT-Z2T4N06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N06-LTLFireability-04 finished in 494 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 3 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 15:37:43] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 15:37:43] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 138 rows 105 cols
[2022-05-21 15:37:43] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 15:37:44] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
// Phase 1: matrix 138 rows 105 cols
[2022-05-21 15:37:44] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 15:37:44] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/105 places, 138/138 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-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 11069 reset in 457 ms.
Product exploration explored 100000 steps with 11063 reset in 559 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 p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p1))), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 7 factoid took 460 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 193 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 17 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p1))), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 7 factoid took 544 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 189 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 138 rows 105 cols
[2022-05-21 15:37:47] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 15:37:47] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2022-05-21 15:37:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 15:37:47] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2022-05-21 15:37:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 15:37:47] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2022-05-21 15:37:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 15:37:47] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2022-05-21 15:37:47] [INFO ] Computed and/alt/rep : 132/198/132 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-21 15:37:48] [INFO ] Added : 132 causal constraints over 27 iterations in 416 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 138 rows 105 cols
[2022-05-21 15:37:48] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 15:37:48] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2022-05-21 15:37:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 15:37:48] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2022-05-21 15:37:48] [INFO ] Computed and/alt/rep : 132/198/132 causal constraints (skipped 0 transitions) in 17 ms.
[2022-05-21 15:37:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 15:37:48] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2022-05-21 15:37:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 15:37:48] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2022-05-21 15:37:48] [INFO ] Computed and/alt/rep : 132/198/132 causal constraints (skipped 0 transitions) in 13 ms.
[2022-05-21 15:37:48] [INFO ] Added : 32 causal constraints over 7 iterations in 100 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 3 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 15:37:48] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 15:37:48] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 138 rows 105 cols
[2022-05-21 15:37:48] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 15:37:48] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
// Phase 1: matrix 138 rows 105 cols
[2022-05-21 15:37:48] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-21 15:37:48] [INFO ] Dead Transitions using invariants and state equation in 111 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 p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p1))), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 7 factoid took 483 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 198 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 10 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p1))), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 7 factoid took 578 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 200 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 138 rows 105 cols
[2022-05-21 15:37:50] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 15:37:50] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2022-05-21 15:37:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 15:37:50] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2022-05-21 15:37:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 15:37:50] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2022-05-21 15:37:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 15:37:51] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2022-05-21 15:37:51] [INFO ] Computed and/alt/rep : 132/198/132 causal constraints (skipped 0 transitions) in 13 ms.
[2022-05-21 15:37:51] [INFO ] Added : 132 causal constraints over 27 iterations in 379 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 138 rows 105 cols
[2022-05-21 15:37:51] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 15:37:51] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2022-05-21 15:37:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 15:37:51] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2022-05-21 15:37:51] [INFO ] Computed and/alt/rep : 132/198/132 causal constraints (skipped 0 transitions) in 12 ms.
[2022-05-21 15:37:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 15:37:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2022-05-21 15:37:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 15:37:51] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2022-05-21 15:37:51] [INFO ] Computed and/alt/rep : 132/198/132 causal constraints (skipped 0 transitions) in 12 ms.
[2022-05-21 15:37:51] [INFO ] Added : 32 causal constraints over 7 iterations in 100 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 10941 reset in 456 ms.
Product exploration explored 100000 steps with 11098 reset in 482 ms.
Built C files in :
/tmp/ltsmin2632626910171728079
[2022-05-21 15:37:53] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2632626910171728079
Running compilation step : cd /tmp/ltsmin2632626910171728079;'/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 371 ms.
Running link step : cd /tmp/ltsmin2632626910171728079;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2632626910171728079;'/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/stateBased3297317865288969867.hoa' '--buchi-type=spotba'
LTSmin run took 130 ms.
FORMULA UtilityControlRoom-PT-Z2T4N06-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z2T4N06-LTLFireability-05 finished in 10103 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 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 15:37:53] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-21 15:37:54] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 15:37:54] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 15:37:54] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 15:37:54] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-21 15:37:54] [INFO ] Dead Transitions using invariants and state equation in 118 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 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-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 361 ms.
Stack based approach found an accepted trace after 678 steps with 0 reset with depth 679 and stack size 679 in 3 ms.
FORMULA UtilityControlRoom-PT-Z2T4N06-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N06-LTLFireability-06 finished in 785 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 4 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 15:37:54] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 15:37:54] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 15:37:54] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 15:37:54] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 15:37:54] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 15:37:54] [INFO ] Dead Transitions using invariants and state equation in 107 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 118 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-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 212 ms.
Stack based approach found an accepted trace after 1905 steps with 0 reset with depth 1906 and stack size 1906 in 7 ms.
FORMULA UtilityControlRoom-PT-Z2T4N06-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N06-LTLFireability-07 finished in 584 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((G(X(p0))||p1)))))'
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 94 transition count 127
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 94 transition count 127
Applied a total of 22 rules in 6 ms. Remains 94 /105 variables (removed 11) and now considering 127/138 (removed 11) transitions.
// Phase 1: matrix 127 rows 94 cols
[2022-05-21 15:37:55] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 15:37:55] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 127 rows 94 cols
[2022-05-21 15:37:55] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-21 15:37:55] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
// Phase 1: matrix 127 rows 94 cols
[2022-05-21 15:37:55] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 15:37:55] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/105 places, 127/138 transitions.
Finished structural reductions, in 1 iterations. Remains : 94/105 places, 127/138 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(LT s64 1), p1:(GEQ s33 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 35 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N06-LTLFireability-09 finished in 427 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!X(p0) U p1)&&!(p1 U G(p2))))'
Support contains 5 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 15:37:55] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 15:37:55] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 15:37:55] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 15:37:55] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 15:37:55] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 15:37:56] [INFO ] Dead Transitions using invariants and state equation in 108 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 168 ms :[(OR (NOT p1) p2), p2, p2, (OR (NOT p1) p0), true]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(GEQ s2 1), p1:(AND (GEQ s0 1) (GEQ s14 1) (GEQ s62 1)), p0:(GEQ s58 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T4N06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N06-LTLFireability-10 finished in 483 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&p1)))'
Support contains 4 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
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 60 place count 81 transition count 92
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 80 place count 71 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 70 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 70 transition count 80
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 88 place count 64 transition count 74
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 64 transition count 74
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 98 place count 60 transition count 66
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 60 transition count 66
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 106 place count 56 transition count 62
Iterating global reduction 2 with 4 rules applied. Total rules applied 110 place count 56 transition count 62
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 114 place count 56 transition count 58
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 114 place count 56 transition count 54
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 122 place count 52 transition count 54
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 151 place count 37 transition count 40
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 159 place count 33 transition count 36
Applied a total of 159 rules in 34 ms. Remains 33 /105 variables (removed 72) and now considering 36/138 (removed 102) transitions.
// Phase 1: matrix 36 rows 33 cols
[2022-05-21 15:37:56] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-21 15:37:56] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 36 rows 33 cols
[2022-05-21 15:37:56] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-21 15:37:56] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2022-05-21 15:37:56] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 36 rows 33 cols
[2022-05-21 15:37:56] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-21 15:37:56] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/105 places, 36/138 transitions.
Finished structural reductions, in 1 iterations. Remains : 33/105 places, 36/138 transitions.
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s15 1) (LT s22 1)), p0:(OR (LT s16 1) (LT s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 189 ms.
Stack based approach found an accepted trace after 206 steps with 0 reset with depth 207 and stack size 198 in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T4N06-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N06-LTLFireability-11 finished in 451 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(F(G(F((G(!p0)||p1)))) U !p2)))'
Support contains 6 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
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 60 place count 81 transition count 90
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 84 place count 69 transition count 90
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 92 place count 65 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 64 transition count 85
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 64 transition count 85
Applied a total of 95 rules in 16 ms. Remains 64 /105 variables (removed 41) and now considering 85/138 (removed 53) transitions.
// Phase 1: matrix 85 rows 64 cols
[2022-05-21 15:37:56] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 15:37:56] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 85 rows 64 cols
[2022-05-21 15:37:56] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 15:37:56] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2022-05-21 15:37:56] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 85 rows 64 cols
[2022-05-21 15:37:56] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-21 15:37:56] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/105 places, 85/138 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/105 places, 85/138 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s18 1) (GEQ s33 1)), p1:(GEQ s6 1), p0:(AND (GEQ s0 1) (GEQ s13 1) (GEQ s33 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 738 reset in 209 ms.
Stack based approach found an accepted trace after 5611 steps with 34 reset with depth 47 and stack size 47 in 17 ms.
FORMULA UtilityControlRoom-PT-Z2T4N06-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N06-LTLFireability-12 finished in 616 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(X(X(p0)))||p1))))'
Support contains 3 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 4 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 15:37:57] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 15:37:57] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 15:37:57] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 15:37:57] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 93 cols
[2022-05-21 15:37:57] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 15:37:57] [INFO ] Dead Transitions using invariants and state equation in 90 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 143 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}]], initial=0, aps=[p1:(GEQ s5 1), p0:(AND (GEQ s51 1) (GEQ s72 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 11713 reset in 177 ms.
Stack based approach found an accepted trace after 98311 steps with 11661 reset with depth 97 and stack size 97 in 204 ms.
FORMULA UtilityControlRoom-PT-Z2T4N06-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N06-LTLFireability-13 finished in 832 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(F(!p0)))))'
Support contains 1 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 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 105 transition count 115
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 57 place count 82 transition count 104
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 57 place count 82 transition count 92
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 81 place count 70 transition count 92
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 129 place count 46 transition count 68
Applied a total of 129 rules in 9 ms. Remains 46 /105 variables (removed 59) and now considering 68/138 (removed 70) transitions.
// Phase 1: matrix 68 rows 46 cols
[2022-05-21 15:37:58] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-21 15:37:58] [INFO ] Implicit Places using invariants in 67 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 68 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/105 places, 68/138 transitions.
Applied a total of 0 rules in 3 ms. Remains 45 /45 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 45/105 places, 68/138 transitions.
Stuttering acceptance computed with spot in 144 ms :[p0, p0]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 752 reset in 222 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T4N06-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N06-LTLFireability-14 finished in 459 ms.
All properties solved by simple procedures.
Total runtime 66712 ms.

BK_STOP 1653147478750

--------------------
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-PT-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-PT-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-165307353100196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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