Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r197-tall-171640625600418.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is GlobalResAllocation-COL-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625600418
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 8.6K Apr 12 08:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 12 08:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 12 08:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 12 08:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 08:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 12 08:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 12 08:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 12 08:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 29K May 18 16:42 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 GlobalResAllocation-COL-10-LTLFireability-00
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-01
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-02
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-03
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-04
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-05
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-06
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-07
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-08
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-09
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-10
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-11
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-12
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-13
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-14
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716556218976

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GlobalResAllocation-COL-10
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-24 13:10:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 13:10:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 13:10:20] [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.
[2024-05-24 13:10:20] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 13:10:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 640 ms
[2024-05-24 13:10:21] [INFO ] Imported 5 HL places and 7 HL transitions for a total of 250 PT places and 1688410.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-05-24 13:10:21] [INFO ] Built PT skeleton of HLPN with 5 places and 7 transitions 29 arcs in 7 ms.
[2024-05-24 13:10:21] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA GlobalResAllocation-COL-10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-10-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 1 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
[2024-05-24 13:10:21] [INFO ] Flatten gal took : 16 ms
[2024-05-24 13:10:21] [INFO ] Flatten gal took : 2 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Res
Symmetric sort wr.t. initial detected :Res
Symmetric sort wr.t. initial and guards detected :Res
Applying symmetric unfolding of full symmetric sort :Res domain size was 20
Transition release1 forces synchronizations/join behavior on parameter p of sort Proc
[2024-05-24 13:10:21] [INFO ] Unfolded HLPN to a Petri net with 41 places and 70 transitions 290 arcs in 11 ms.
[2024-05-24 13:10:21] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
FORMULA GlobalResAllocation-COL-10-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-10-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 70/70 transitions.
Reduce isomorphic (modulo) transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 41 transition count 60
Applied a total of 20 rules in 6 ms. Remains 41 /41 variables (removed 0) and now considering 60/70 (removed 10) transitions.
// Phase 1: matrix 60 rows 41 cols
[2024-05-24 13:10:21] [INFO ] Computed 21 invariants in 7 ms
[2024-05-24 13:10:21] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
[2024-05-24 13:10:21] [INFO ] Invariant cache hit.
[2024-05-24 13:10:21] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-24 13:10:21] [INFO ] Invariant cache hit.
[2024-05-24 13:10:21] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-05-24 13:10:21] [INFO ] Invariant cache hit.
[2024-05-24 13:10:21] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41/41 places, 60/70 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 331 ms. Remains : 41/41 places, 60/70 transitions.
Support contains 41 out of 41 places after structural reductions.
[2024-05-24 13:10:21] [INFO ] Flatten gal took : 13 ms
[2024-05-24 13:10:21] [INFO ] Flatten gal took : 16 ms
[2024-05-24 13:10:21] [INFO ] Input system was already deterministic with 60 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 15) seen :14
Finished Best-First random walk after 520 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=65 )
Parikh walk visited 0 properties in 0 ms.
FORMULA GlobalResAllocation-COL-10-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||G(!p0)))&&F(!p0)))'
Support contains 10 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 31 transition count 60
Applied a total of 10 rules in 2 ms. Remains 31 /41 variables (removed 10) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 31 cols
[2024-05-24 13:10:22] [INFO ] Computed 11 invariants in 1 ms
[2024-05-24 13:10:22] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
[2024-05-24 13:10:22] [INFO ] Invariant cache hit.
[2024-05-24 13:10:22] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 13:10:22] [INFO ] Invariant cache hit.
[2024-05-24 13:10:22] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-24 13:10:22] [INFO ] Invariant cache hit.
[2024-05-24 13:10:22] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 31/41 places, 60/60 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 31/41 places, 60/60 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 801 ms :[p0, false, p0, p0, true]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LT s25 4) (LT s26 4) (LT s28 4) (LT s27 4) (LT s30 4) (LT s29 4) (LT s21 4) (LT s22 4) (LT s23 4) (LT s24 4))], 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]]
Product exploration explored 100000 steps with 14500 reset in 502 ms.
Product exploration explored 100000 steps with 14471 reset in 393 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 5 states, 7 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[p0]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 154 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[p0]
Stuttering acceptance computed with spot in 32 ms :[p0]
[2024-05-24 13:10:24] [INFO ] Invariant cache hit.
[2024-05-24 13:10:24] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-24 13:10:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:10:24] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-24 13:10:24] [INFO ] Computed and/alt/rep : 20/80/20 causal constraints (skipped 0 transitions) in 35 ms.
[2024-05-24 13:10:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:10:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-24 13:10:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:10:25] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-24 13:10:25] [INFO ] Computed and/alt/rep : 20/80/20 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-24 13:10:25] [INFO ] Added : 14 causal constraints over 4 iterations in 31 ms. Result :sat
Could not prove EG p0
Support contains 10 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 60/60 transitions.
Applied a total of 0 rules in 6 ms. Remains 31 /31 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-24 13:10:25] [INFO ] Invariant cache hit.
[2024-05-24 13:10:25] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
[2024-05-24 13:10:25] [INFO ] Invariant cache hit.
[2024-05-24 13:10:25] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-24 13:10:25] [INFO ] Invariant cache hit.
[2024-05-24 13:10:25] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-05-24 13:10:25] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 13:10:25] [INFO ] Invariant cache hit.
[2024-05-24 13:10:25] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 506 ms. Remains : 31/31 places, 60/60 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[p0]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[p0]
Stuttering acceptance computed with spot in 26 ms :[p0]
[2024-05-24 13:10:25] [INFO ] Invariant cache hit.
[2024-05-24 13:10:26] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-24 13:10:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:10:26] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-24 13:10:26] [INFO ] Computed and/alt/rep : 20/80/20 causal constraints (skipped 0 transitions) in 26 ms.
[2024-05-24 13:10:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:10:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 27 ms returned sat
[2024-05-24 13:10:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:10:26] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-24 13:10:26] [INFO ] Computed and/alt/rep : 20/80/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 13:10:26] [INFO ] Added : 14 causal constraints over 4 iterations in 44 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 42 ms :[p0]
Product exploration explored 100000 steps with 8402 reset in 326 ms.
Product exploration explored 100000 steps with 8415 reset in 317 ms.
Built C files in :
/tmp/ltsmin4281336073779560775
[2024-05-24 13:10:27] [INFO ] Computing symmetric may disable matrix : 60 transitions.
[2024-05-24 13:10:27] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:10:27] [INFO ] Computing symmetric may enable matrix : 60 transitions.
[2024-05-24 13:10:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:10:27] [INFO ] Computing Do-Not-Accords matrix : 60 transitions.
[2024-05-24 13:10:27] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:10:27] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4281336073779560775
Running compilation step : cd /tmp/ltsmin4281336073779560775;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 236 ms.
Running link step : cd /tmp/ltsmin4281336073779560775;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin4281336073779560775;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7745786729914196807.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 10 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 60/60 transitions.
Applied a total of 0 rules in 8 ms. Remains 31 /31 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-24 13:10:42] [INFO ] Invariant cache hit.
[2024-05-24 13:10:42] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
[2024-05-24 13:10:42] [INFO ] Invariant cache hit.
[2024-05-24 13:10:42] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-24 13:10:42] [INFO ] Invariant cache hit.
[2024-05-24 13:10:42] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-05-24 13:10:42] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 13:10:42] [INFO ] Invariant cache hit.
[2024-05-24 13:10:42] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 192 ms. Remains : 31/31 places, 60/60 transitions.
Built C files in :
/tmp/ltsmin467707468205006538
[2024-05-24 13:10:42] [INFO ] Computing symmetric may disable matrix : 60 transitions.
[2024-05-24 13:10:42] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:10:42] [INFO ] Computing symmetric may enable matrix : 60 transitions.
[2024-05-24 13:10:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:10:42] [INFO ] Computing Do-Not-Accords matrix : 60 transitions.
[2024-05-24 13:10:42] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:10:42] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin467707468205006538
Running compilation step : cd /tmp/ltsmin467707468205006538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 139 ms.
Running link step : cd /tmp/ltsmin467707468205006538;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin467707468205006538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13719519975863089690.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 13:10:57] [INFO ] Flatten gal took : 5 ms
[2024-05-24 13:10:57] [INFO ] Flatten gal took : 4 ms
[2024-05-24 13:10:57] [INFO ] Time to serialize gal into /tmp/LTL7651877692969388535.gal : 1 ms
[2024-05-24 13:10:57] [INFO ] Time to serialize properties into /tmp/LTL2123651876912916891.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7651877692969388535.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17415713055403363070.hoa' '-atoms' '/tmp/LTL2123651876912916891.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2123651876912916891.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17415713055403363070.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
70 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.73447,42204,1,0,116,166111,20,12,1346,139424,263
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GlobalResAllocation-COL-10-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property GlobalResAllocation-COL-10-LTLFireability-00 finished in 35904 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G((p2||G(!p0)))||p1)))'
Support contains 21 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Ensure Unique test removed 10 places
Applied a total of 0 rules in 5 ms. Remains 31 /41 variables (removed 10) and now considering 60/60 (removed 0) transitions.
[2024-05-24 13:10:58] [INFO ] Invariant cache hit.
[2024-05-24 13:10:58] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2024-05-24 13:10:58] [INFO ] Invariant cache hit.
[2024-05-24 13:10:58] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-24 13:10:58] [INFO ] Invariant cache hit.
[2024-05-24 13:10:58] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-24 13:10:58] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 13:10:58] [INFO ] Invariant cache hit.
[2024-05-24 13:10:58] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 152 ms. Remains : 31/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p1))]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}]], initial=3, aps=[p0:(OR (AND (GEQ s4 1) (GEQ s10 2)) (AND (GEQ s3 1) (GEQ s10 2)) (AND (GEQ s5 1) (GEQ s10 2)) (AND (GEQ s6 1) (GEQ s10 2)) (AND (GEQ s9 1) (GEQ s10 2)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-COL-10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-10-LTLFireability-01 finished in 270 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0))||(G(p1)&&(G(!p1)||F(p2))))))'
Support contains 31 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 41 cols
[2024-05-24 13:10:58] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 13:10:58] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
[2024-05-24 13:10:58] [INFO ] Invariant cache hit.
[2024-05-24 13:10:58] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 13:10:58] [INFO ] Invariant cache hit.
[2024-05-24 13:10:58] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-24 13:10:58] [INFO ] Invariant cache hit.
[2024-05-24 13:10:58] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 41/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 395 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 9}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 10}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={} source=6 dest: 10}], [{ cond=(AND p1 p2), acceptance={} source=7 dest: 1}, { cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 8}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=8 dest: 0}, { cond=(AND p1 p2), acceptance={} source=8 dest: 2}, { cond=(NOT p1), acceptance={} source=8 dest: 10}], [{ cond=(AND p1 p2), acceptance={0} source=9 dest: 3}, { cond=(NOT p1), acceptance={0} source=9 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=9 dest: 9}], [{ cond=(NOT p0), acceptance={} source=10 dest: 4}]], initial=5, aps=[p1:(OR (AND (GEQ s4 1) (GEQ s10 3)) (AND (GEQ s3 1) (GEQ s10 3)) (AND (GEQ s6 1) (GEQ s10 3)) (AND (GEQ s9 1) (GEQ s10 3)) (AND (GEQ s5 1) (GEQ s10 3)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6983 steps with 1743 reset in 29 ms.
FORMULA GlobalResAllocation-COL-10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-10-LTLFireability-02 finished in 613 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U G(p1)))'
Support contains 21 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Ensure Unique test removed 10 places
Applied a total of 0 rules in 4 ms. Remains 31 /41 variables (removed 10) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 31 cols
[2024-05-24 13:10:59] [INFO ] Computed 11 invariants in 1 ms
[2024-05-24 13:10:59] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
[2024-05-24 13:10:59] [INFO ] Invariant cache hit.
[2024-05-24 13:10:59] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 13:10:59] [INFO ] Invariant cache hit.
[2024-05-24 13:10:59] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-24 13:10:59] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 13:10:59] [INFO ] Invariant cache hit.
[2024-05-24 13:10:59] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 187 ms. Remains : 31/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (LT s25 4) (LT s26 4) (LT s28 4) (LT s27 4) (LT s30 4) (LT s29 4) (LT s21 4) (LT s22 4) (LT s23 4) (LT s24 4)), p0:(OR (AND (GEQ s4 1) (GEQ s10 2)...], nbAcceptance=1, 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 6843 reset in 393 ms.
Stack based approach found an accepted trace after 361 steps with 25 reset with depth 11 and stack size 11 in 2 ms.
FORMULA GlobalResAllocation-COL-10-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-10-LTLFireability-04 finished in 707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(((p1&&G(!p2))||p0))||(p1 U p3))))'
Support contains 41 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 41 cols
[2024-05-24 13:10:59] [INFO ] Computed 21 invariants in 3 ms
[2024-05-24 13:10:59] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
[2024-05-24 13:10:59] [INFO ] Invariant cache hit.
[2024-05-24 13:10:59] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-24 13:10:59] [INFO ] Invariant cache hit.
[2024-05-24 13:10:59] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-24 13:10:59] [INFO ] Invariant cache hit.
[2024-05-24 13:11:00] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 41/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 344 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2 (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2 (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2)]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (GEQ s35 4) (GEQ s36 4) (GEQ s38 4) (GEQ s37 4) (GEQ s40 4) (GEQ s39 4) (GEQ s31 4) (GEQ s32 4) (GEQ s33 4) (GEQ s34 4)), p1:(OR (AND (GEQ s11 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 308 ms.
Product exploration explored 100000 steps with 50000 reset in 279 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 109 ms. Reduced automaton from 5 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GlobalResAllocation-COL-10-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-COL-10-LTLFireability-05 finished in 1228 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(p1))))))'
Support contains 31 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-24 13:11:01] [INFO ] Invariant cache hit.
[2024-05-24 13:11:01] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
[2024-05-24 13:11:01] [INFO ] Invariant cache hit.
[2024-05-24 13:11:01] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 13:11:01] [INFO ] Invariant cache hit.
[2024-05-24 13:11:01] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-24 13:11:01] [INFO ] Invariant cache hit.
[2024-05-24 13:11:01] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164 ms. Remains : 41/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-06 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: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(OR (AND (GEQ s11 1) (GEQ s21 1)) (AND (GEQ s15 1) (GEQ s25 1)) (AND (GEQ s19 1) (GEQ s29 1)) (AND (GEQ s13 1) (GEQ s23 1)) (AND (GEQ s17 1) (GEQ s27 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 264 ms.
Entered a terminal (fully accepting) state of product in 61555 steps with 0 reset in 190 ms.
FORMULA GlobalResAllocation-COL-10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-10-LTLFireability-06 finished in 808 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Support contains 11 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 31 transition count 60
Applied a total of 10 rules in 1 ms. Remains 31 /41 variables (removed 10) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 31 cols
[2024-05-24 13:11:01] [INFO ] Computed 11 invariants in 0 ms
[2024-05-24 13:11:01] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2024-05-24 13:11:01] [INFO ] Invariant cache hit.
[2024-05-24 13:11:01] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-24 13:11:01] [INFO ] Invariant cache hit.
[2024-05-24 13:11:02] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-24 13:11:02] [INFO ] Invariant cache hit.
[2024-05-24 13:11:02] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 31/41 places, 60/60 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 31/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(OR (AND (OR (LT s4 1) (LT s10 2)) (OR (LT s3 1) (LT s10 2)) (OR (LT s5 1) (LT s10 2)) (OR (LT s6 1) (LT s10 2)) (OR (LT s9 1) (LT s10 2)) (OR (LT s8 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 235 ms.
Stack based approach found an accepted trace after 393 steps with 0 reset with depth 394 and stack size 393 in 1 ms.
FORMULA GlobalResAllocation-COL-10-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-10-LTLFireability-08 finished in 536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(F(p1))) U G((X(p0)||F(p2)))))'
Support contains 31 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 41 cols
[2024-05-24 13:11:02] [INFO ] Computed 21 invariants in 3 ms
[2024-05-24 13:11:02] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2024-05-24 13:11:02] [INFO ] Invariant cache hit.
[2024-05-24 13:11:02] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 13:11:02] [INFO ] Invariant cache hit.
[2024-05-24 13:11:02] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-05-24 13:11:02] [INFO ] Invariant cache hit.
[2024-05-24 13:11:02] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147 ms. Remains : 41/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s4 1) (GEQ s10 2)) (AND (GEQ s3 1) (GEQ s10 2)) (AND (GEQ s5 1) (GEQ s10 2)) (AND (GEQ s6 1) (GEQ s10 2)) (AND (GEQ s9 1) (GEQ s10 2)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 224 ms.
Product exploration explored 100000 steps with 3 reset in 273 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 11 factoid took 276 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1))]
Finished random walk after 2182 steps, including 0 resets, run visited all 6 properties in 58 ms. (steps per millisecond=37 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X p2)), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F p2), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (NOT (AND (NOT p2) p0))), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 11 factoid took 444 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1))]
Support contains 31 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-24 13:11:04] [INFO ] Invariant cache hit.
[2024-05-24 13:11:04] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
[2024-05-24 13:11:04] [INFO ] Invariant cache hit.
[2024-05-24 13:11:04] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-24 13:11:04] [INFO ] Invariant cache hit.
[2024-05-24 13:11:04] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-24 13:11:04] [INFO ] Invariant cache hit.
[2024-05-24 13:11:05] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 41/41 places, 60/60 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 11 factoid took 369 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1))]
Finished random walk after 1126 steps, including 0 resets, run visited all 6 properties in 30 ms. (steps per millisecond=37 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X p2)), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F p2), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (NOT (AND (NOT p2) p0))), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 11 factoid took 464 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 5 reset in 239 ms.
Product exploration explored 100000 steps with 4 reset in 286 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1))]
Support contains 31 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-24 13:11:07] [INFO ] Invariant cache hit.
[2024-05-24 13:11:07] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2024-05-24 13:11:07] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 13:11:07] [INFO ] Invariant cache hit.
[2024-05-24 13:11:07] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96 ms. Remains : 41/41 places, 60/60 transitions.
Built C files in :
/tmp/ltsmin6564163865800784834
[2024-05-24 13:11:07] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6564163865800784834
Running compilation step : cd /tmp/ltsmin6564163865800784834;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 141 ms.
Running link step : cd /tmp/ltsmin6564163865800784834;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6564163865800784834;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10790836880590498029.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 31 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Applied a total of 0 rules in 4 ms. Remains 41 /41 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-24 13:11:22] [INFO ] Invariant cache hit.
[2024-05-24 13:11:23] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
[2024-05-24 13:11:23] [INFO ] Invariant cache hit.
[2024-05-24 13:11:23] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-24 13:11:23] [INFO ] Invariant cache hit.
[2024-05-24 13:11:23] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-24 13:11:23] [INFO ] Invariant cache hit.
[2024-05-24 13:11:23] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161 ms. Remains : 41/41 places, 60/60 transitions.
Built C files in :
/tmp/ltsmin11798265462383959167
[2024-05-24 13:11:23] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11798265462383959167
Running compilation step : cd /tmp/ltsmin11798265462383959167;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 138 ms.
Running link step : cd /tmp/ltsmin11798265462383959167;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin11798265462383959167;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1840657553699014249.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 13:11:38] [INFO ] Flatten gal took : 4 ms
[2024-05-24 13:11:38] [INFO ] Flatten gal took : 5 ms
[2024-05-24 13:11:38] [INFO ] Time to serialize gal into /tmp/LTL16297991808701186761.gal : 2 ms
[2024-05-24 13:11:38] [INFO ] Time to serialize properties into /tmp/LTL3775226826445598265.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16297991808701186761.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17701463943949689516.hoa' '-atoms' '/tmp/LTL3775226826445598265.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3775226826445598265.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17701463943949689516.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
0 strongly connected components in search stack
5 transitions explored
3 items max in DFS search stack
95 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.966985,48156,1,0,46,185659,37,19,1960,178488,130
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GlobalResAllocation-COL-10-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property GlobalResAllocation-COL-10-LTLFireability-09 finished in 36942 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 11 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Ensure Unique test removed 10 places
Applied a total of 0 rules in 3 ms. Remains 31 /41 variables (removed 10) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 31 cols
[2024-05-24 13:11:39] [INFO ] Computed 11 invariants in 0 ms
[2024-05-24 13:11:39] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2024-05-24 13:11:39] [INFO ] Invariant cache hit.
[2024-05-24 13:11:39] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-24 13:11:39] [INFO ] Invariant cache hit.
[2024-05-24 13:11:39] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-24 13:11:39] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 13:11:39] [INFO ] Invariant cache hit.
[2024-05-24 13:11:39] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 155 ms. Remains : 31/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s3 1) (GEQ s10 1)) (AND (GEQ s4 1) (GEQ s10 1)) (AND (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s8 1) (GEQ s10 1)) (AND (GEQ s9 1) (GEQ s10 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 231 ms.
Stack based approach found an accepted trace after 1123 steps with 0 reset with depth 1124 and stack size 1124 in 3 ms.
FORMULA GlobalResAllocation-COL-10-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-10-LTLFireability-12 finished in 452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p1) U p2)&&p0)))'
Support contains 11 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 31 transition count 60
Applied a total of 10 rules in 1 ms. Remains 31 /41 variables (removed 10) and now considering 60/60 (removed 0) transitions.
[2024-05-24 13:11:39] [INFO ] Invariant cache hit.
[2024-05-24 13:11:39] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2024-05-24 13:11:39] [INFO ] Invariant cache hit.
[2024-05-24 13:11:39] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-24 13:11:39] [INFO ] Invariant cache hit.
[2024-05-24 13:11:39] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-24 13:11:39] [INFO ] Invariant cache hit.
[2024-05-24 13:11:39] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 31/41 places, 60/60 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142 ms. Remains : 31/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (OR (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p0) (NOT p2))]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(OR (AND (GEQ s4 1) (GEQ s10 3)) (AND (GEQ s3 1) (GEQ s10 3)) (AND (GEQ s6 1) (GEQ s10 3)) (AND (GEQ s9 1) (GEQ s10 3)) (AND (GEQ s5 1) (GEQ s10 3)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA GlobalResAllocation-COL-10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-10-LTLFireability-13 finished in 332 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&F((X(!p2)&&p1))))'
Support contains 31 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Applied a total of 0 rules in 0 ms. Remains 41 /41 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 41 cols
[2024-05-24 13:11:40] [INFO ] Computed 21 invariants in 2 ms
[2024-05-24 13:11:40] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
[2024-05-24 13:11:40] [INFO ] Invariant cache hit.
[2024-05-24 13:11:40] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-24 13:11:40] [INFO ] Invariant cache hit.
[2024-05-24 13:11:40] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-24 13:11:40] [INFO ] Invariant cache hit.
[2024-05-24 13:11:40] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 41/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1) p2), (NOT p0), (OR (NOT p1) p2), p2]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (LT s3 1) (LT s10 1)) (OR (LT s4 1) (LT s10 1)) (OR (LT s5 1) (LT s10 1)) (OR (LT s8 1) (LT s10 1)) (OR (LT s9 1) (LT s10 1)) (OR (LT s1 1) (L...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 402 reset in 318 ms.
Stack based approach found an accepted trace after 96 steps with 2 reset with depth 93 and stack size 93 in 0 ms.
FORMULA GlobalResAllocation-COL-10-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-10-LTLFireability-15 finished in 646 ms.
All properties solved by simple procedures.
Total runtime 80371 ms.

BK_STOP 1716556301726

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GlobalResAllocation-COL-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is GlobalResAllocation-COL-10, 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 r197-tall-171640625600418"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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