About the Execution of 2023-gold for GlobalResAllocation-COL-11
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2211.111 | 56400.00 | 161756.00 | 992.00 | FFFFTFTFFFTFTTFF | normal |
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-171640625600423.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-11, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625600423
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 9.0K Apr 12 08:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 08:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 12 08:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 31K 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 4.1K 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 16K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 08:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 12 08:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 08:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 08:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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-11-LTLFireability-00
FORMULA_NAME GlobalResAllocation-COL-11-LTLFireability-01
FORMULA_NAME GlobalResAllocation-COL-11-LTLFireability-02
FORMULA_NAME GlobalResAllocation-COL-11-LTLFireability-03
FORMULA_NAME GlobalResAllocation-COL-11-LTLFireability-04
FORMULA_NAME GlobalResAllocation-COL-11-LTLFireability-05
FORMULA_NAME GlobalResAllocation-COL-11-LTLFireability-06
FORMULA_NAME GlobalResAllocation-COL-11-LTLFireability-07
FORMULA_NAME GlobalResAllocation-COL-11-LTLFireability-08
FORMULA_NAME GlobalResAllocation-COL-11-LTLFireability-09
FORMULA_NAME GlobalResAllocation-COL-11-LTLFireability-10
FORMULA_NAME GlobalResAllocation-COL-11-LTLFireability-11
FORMULA_NAME GlobalResAllocation-COL-11-LTLFireability-12
FORMULA_NAME GlobalResAllocation-COL-11-LTLFireability-13
FORMULA_NAME GlobalResAllocation-COL-11-LTLFireability-14
FORMULA_NAME GlobalResAllocation-COL-11-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716556344185
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-11
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-24 13:12:25] [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:12:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 13:12:25] [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:12:26] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 13:12:26] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 634 ms
[2024-05-24 13:12:26] [INFO ] Imported 5 HL places and 7 HL transitions for a total of 297 PT places and 2705087.0 transition bindings in 31 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-05-24 13:12:26] [INFO ] Built PT skeleton of HLPN with 5 places and 7 transitions 29 arcs in 4 ms.
[2024-05-24 13:12:26] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 3 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 12 steps, including 0 resets, run visited all 4 properties in 7 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 1 ms.
[2024-05-24 13:12:26] [INFO ] Flatten gal took : 13 ms
[2024-05-24 13:12:26] [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 22
Transition release1 forces synchronizations/join behavior on parameter p of sort Proc
[2024-05-24 13:12:26] [INFO ] Unfolded HLPN to a Petri net with 45 places and 77 transitions 319 arcs in 11 ms.
[2024-05-24 13:12:26] [INFO ] Unfolded 16 HLPN properties in 0 ms.
Initial state reduction rules removed 3 formulas.
FORMULA GlobalResAllocation-COL-11-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-11-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-11-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 77/77 transitions.
Reduce isomorphic (modulo) transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 45 transition count 66
Applied a total of 22 rules in 7 ms. Remains 45 /45 variables (removed 0) and now considering 66/77 (removed 11) transitions.
// Phase 1: matrix 66 rows 45 cols
[2024-05-24 13:12:26] [INFO ] Computed 23 invariants in 8 ms
[2024-05-24 13:12:26] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
[2024-05-24 13:12:26] [INFO ] Invariant cache hit.
[2024-05-24 13:12:26] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-24 13:12:26] [INFO ] Invariant cache hit.
[2024-05-24 13:12:26] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-05-24 13:12:26] [INFO ] Invariant cache hit.
[2024-05-24 13:12:26] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 45/45 places, 66/77 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 337 ms. Remains : 45/45 places, 66/77 transitions.
Support contains 45 out of 45 places after structural reductions.
[2024-05-24 13:12:26] [INFO ] Flatten gal took : 14 ms
[2024-05-24 13:12:27] [INFO ] Flatten gal took : 11 ms
[2024-05-24 13:12:27] [INFO ] Input system was already deterministic with 66 transitions.
Finished random walk after 3477 steps, including 1 resets, run visited all 13 properties in 43 ms. (steps per millisecond=80 )
Parikh walk visited 0 properties in 0 ms.
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' '!(F((G(p0)||G(p1))))'
Support contains 34 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Applied a total of 0 rules in 5 ms. Remains 45 /45 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2024-05-24 13:12:27] [INFO ] Invariant cache hit.
[2024-05-24 13:12:27] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
[2024-05-24 13:12:27] [INFO ] Invariant cache hit.
[2024-05-24 13:12:27] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-24 13:12:27] [INFO ] Invariant cache hit.
[2024-05-24 13:12:27] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-24 13:12:27] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 13:12:27] [INFO ] Invariant cache hit.
[2024-05-24 13:12:27] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 180 ms. Remains : 45/45 places, 66/66 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 363 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s4 1) (GEQ s11 3)) (AND (GEQ s10 1) (GEQ s11 3)) (AND (GEQ s3 1) (GEQ s11 3)) (AND (GEQ s5 1) (GEQ s11 3)) (AND (GEQ s6 1) (GEQ s11 3)) (...], nbAcceptance=2, 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 499 ms.
Product exploration explored 100000 steps with 0 reset in 529 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 7 factoid took 225 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :3
Finished Best-First random walk after 627 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=104 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 313 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
Support contains 34 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Applied a total of 0 rules in 7 ms. Remains 45 /45 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2024-05-24 13:12:29] [INFO ] Invariant cache hit.
[2024-05-24 13:12:29] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
[2024-05-24 13:12:29] [INFO ] Invariant cache hit.
[2024-05-24 13:12:29] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-24 13:12:29] [INFO ] Invariant cache hit.
[2024-05-24 13:12:30] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-24 13:12:30] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 13:12:30] [INFO ] Invariant cache hit.
[2024-05-24 13:12:30] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 180 ms. Remains : 45/45 places, 66/66 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 7 factoid took 200 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 6275 steps, including 1 resets, run visited all 4 properties in 29 ms. (steps per millisecond=216 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 325 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 366 ms.
Product exploration explored 100000 steps with 0 reset in 516 ms.
Built C files in :
/tmp/ltsmin6768832117931584273
[2024-05-24 13:12:31] [INFO ] Computing symmetric may disable matrix : 66 transitions.
[2024-05-24 13:12:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:12:31] [INFO ] Computing symmetric may enable matrix : 66 transitions.
[2024-05-24 13:12:31] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:12:31] [INFO ] Computing Do-Not-Accords matrix : 66 transitions.
[2024-05-24 13:12:31] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:12:31] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6768832117931584273
Running compilation step : cd /tmp/ltsmin6768832117931584273;'/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 263 ms.
Running link step : cd /tmp/ltsmin6768832117931584273;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin6768832117931584273;'/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/stateBased11738404400573410886.hoa' '--buchi-type=spotba'
LTSmin run took 1735 ms.
FORMULA GlobalResAllocation-COL-11-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GlobalResAllocation-COL-11-LTLFireability-00 finished in 6329 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)))'
Support contains 22 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2024-05-24 13:12:33] [INFO ] Invariant cache hit.
[2024-05-24 13:12:33] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
[2024-05-24 13:12:33] [INFO ] Invariant cache hit.
[2024-05-24 13:12:33] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-24 13:12:33] [INFO ] Invariant cache hit.
[2024-05-24 13:12:33] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-24 13:12:33] [INFO ] Invariant cache hit.
[2024-05-24 13:12:34] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 45/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s20 2) (LT s31 2)) (OR (LT s22 2) (LT s33 2)) (OR (LT s21 2) (LT s32 2)) (OR (LT s12 2) (LT s23 2)) (OR (LT s13 2) (LT s24 2)) (OR (LT s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 165 reset in 269 ms.
Stack based approach found an accepted trace after 158 steps with 0 reset with depth 159 and stack size 159 in 1 ms.
FORMULA GlobalResAllocation-COL-11-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-11-LTLFireability-01 finished in 528 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 12 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Ensure Unique test removed 11 places
Applied a total of 0 rules in 4 ms. Remains 34 /45 variables (removed 11) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 34 cols
[2024-05-24 13:12:34] [INFO ] Computed 12 invariants in 1 ms
[2024-05-24 13:12:34] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2024-05-24 13:12:34] [INFO ] Invariant cache hit.
[2024-05-24 13:12:34] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-24 13:12:34] [INFO ] Invariant cache hit.
[2024-05-24 13:12:34] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-24 13:12:34] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 13:12:34] [INFO ] Invariant cache hit.
[2024-05-24 13:12:34] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 34/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 32 ms :[p0]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s4 1) (GEQ s11 3)) (AND (GEQ s10 1) (GEQ s11 3)) (AND (GEQ s3 1) (GEQ s11 3)) (AND (GEQ s5 1) (GEQ s11 3)) (AND (GEQ s6 1) (GEQ s11 3)) (...], 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 235 ms.
Stack based approach found an accepted trace after 579 steps with 0 reset with depth 580 and stack size 580 in 2 ms.
FORMULA GlobalResAllocation-COL-11-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-11-LTLFireability-02 finished in 430 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))))'
Support contains 12 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Ensure Unique test removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 34 transition count 66
Applied a total of 11 rules in 3 ms. Remains 34 /45 variables (removed 11) and now considering 66/66 (removed 0) transitions.
[2024-05-24 13:12:34] [INFO ] Invariant cache hit.
[2024-05-24 13:12:34] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2024-05-24 13:12:34] [INFO ] Invariant cache hit.
[2024-05-24 13:12:34] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-24 13:12:34] [INFO ] Invariant cache hit.
[2024-05-24 13:12:34] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-24 13:12:34] [INFO ] Invariant cache hit.
[2024-05-24 13:12:34] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 34/45 places, 66/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138 ms. Remains : 34/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLFireability-03 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: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (OR (LT s3 1) (LT s11 2)) (OR (LT s4 1) (LT s11 2)) (OR (LT s5 1) (LT s11 2)) (OR (LT s8 1) (LT s11 2)) (OR (LT s10 1) (LT s11 2)) (OR (LT s9 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 2 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-COL-11-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-11-LTLFireability-03 finished in 297 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&&X(X(G(!p1))))) U ((p3 U p0)||p2))))'
Support contains 45 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 45 cols
[2024-05-24 13:12:35] [INFO ] Computed 23 invariants in 5 ms
[2024-05-24 13:12:35] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
[2024-05-24 13:12:35] [INFO ] Invariant cache hit.
[2024-05-24 13:12:35] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-24 13:12:35] [INFO ] Invariant cache hit.
[2024-05-24 13:12:35] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-24 13:12:35] [INFO ] Invariant cache hit.
[2024-05-24 13:12:35] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 180 ms. Remains : 45/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p0) (NOT p2)), (OR (NOT p0) p1), (NOT p0), p1, p1, p1]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p3), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p3), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 4}, { cond=p0, acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (GEQ s35 4) (GEQ s36 4) (GEQ s38 4) (GEQ s37 4) (GEQ s40 4) (GEQ s39 4) (GEQ s42 4) (GEQ s41 4) (GEQ s44 4) (GEQ s43 4) (GEQ s34 4)), p0:(OR (AND (...], 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 8 reset in 256 ms.
Product exploration explored 100000 steps with 2 reset in 306 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p3 (NOT p1)), (X (NOT (AND (NOT p0) p3))), (X p0), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 217 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter sensitive) to 6 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p0) (NOT p2)), (OR (NOT p0) p1), (NOT p0), p1, p1, p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-24 13:12:36] [INFO ] Invariant cache hit.
[2024-05-24 13:12:36] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-24 13:12:36] [INFO ] [Real]Absence check using 12 positive and 11 generalized place invariants in 6 ms returned sat
[2024-05-24 13:12:36] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 13:12:36] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-05-24 13:12:36] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 2 ms returned sat
[2024-05-24 13:12:36] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p3 (NOT p1)), (X (NOT (AND (NOT p0) p3))), (X p0), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (G (NOT (AND (NOT p2) (NOT p0) (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT p0))), (X (X p0)), (F (NOT (AND (NOT p0) p3))), (F (AND (NOT p0) (NOT p3))), (F (AND p1 p0)), (F (AND p1 (NOT p0))), (F p0), (F (NOT (AND (NOT p2) (NOT p0) p3))), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 465 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter sensitive) to 6 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[(AND (NOT p0) (NOT p2)), (OR (NOT p0) p1), (NOT p0), p1, p1, p1]
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p0) (NOT p2)), (OR (NOT p0) p1), (NOT p0), p1, p1, p1]
[2024-05-24 13:12:38] [INFO ] Invariant cache hit.
[2024-05-24 13:12:38] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-24 13:12:38] [INFO ] [Real]Absence check using 12 positive and 11 generalized place invariants in 2 ms returned sat
[2024-05-24 13:12:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:12:38] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-24 13:12:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:12:38] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-24 13:12:38] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 2 ms returned sat
[2024-05-24 13:12:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:12:38] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-24 13:12:38] [INFO ] Computed and/alt/rep : 22/132/22 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-24 13:12:38] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 45 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Applied a total of 0 rules in 0 ms. Remains 45 /45 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2024-05-24 13:12:38] [INFO ] Invariant cache hit.
[2024-05-24 13:12:38] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
[2024-05-24 13:12:38] [INFO ] Invariant cache hit.
[2024-05-24 13:12:38] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-24 13:12:38] [INFO ] Invariant cache hit.
[2024-05-24 13:12:38] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-24 13:12:38] [INFO ] Invariant cache hit.
[2024-05-24 13:12:38] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 243 ms. Remains : 45/45 places, 66/66 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 297 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter sensitive) to 6 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p0) (NOT p2)), (OR (NOT p0) p1), (NOT p0), p1, p1, p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :7
Finished Best-First random walk after 627 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=313 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT p0))), (X (X p0)), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p0) p3))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 p0)), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p0) (NOT p3))), (F p0), (F (AND (NOT p1) p0))]
Knowledge based reduction with 4 factoid took 449 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter sensitive) to 6 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p0) (NOT p2)), (OR (NOT p0) p1), (NOT p0), p1, p1, p1]
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p0) (NOT p2)), (OR (NOT p0) p1), (NOT p0), p1, p1, p1]
[2024-05-24 13:12:40] [INFO ] Invariant cache hit.
[2024-05-24 13:12:40] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-24 13:12:40] [INFO ] [Real]Absence check using 12 positive and 11 generalized place invariants in 2 ms returned sat
[2024-05-24 13:12:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:12:40] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-24 13:12:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:12:40] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-24 13:12:40] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 5 ms returned sat
[2024-05-24 13:12:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:12:40] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-24 13:12:40] [INFO ] Computed and/alt/rep : 22/132/22 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 13:12:40] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 334 ms :[(AND (NOT p0) (NOT p2)), (OR (NOT p0) p1), (NOT p0), p1, p1, p1]
Product exploration explored 100000 steps with 1 reset in 281 ms.
Product exploration explored 100000 steps with 0 reset in 280 ms.
Built C files in :
/tmp/ltsmin12516227041973616334
[2024-05-24 13:12:41] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12516227041973616334
Running compilation step : cd /tmp/ltsmin12516227041973616334;'/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 154 ms.
Running link step : cd /tmp/ltsmin12516227041973616334;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12516227041973616334;'/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/stateBased159572202277449570.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 45 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2024-05-24 13:12:56] [INFO ] Invariant cache hit.
[2024-05-24 13:12:56] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
[2024-05-24 13:12:56] [INFO ] Invariant cache hit.
[2024-05-24 13:12:56] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-24 13:12:56] [INFO ] Invariant cache hit.
[2024-05-24 13:12:56] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-24 13:12:56] [INFO ] Invariant cache hit.
[2024-05-24 13:12:57] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 244 ms. Remains : 45/45 places, 66/66 transitions.
Built C files in :
/tmp/ltsmin17061347617152009878
[2024-05-24 13:12:57] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17061347617152009878
Running compilation step : cd /tmp/ltsmin17061347617152009878;'/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/ltsmin17061347617152009878;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17061347617152009878;'/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/stateBased10443161562625042056.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 13:13:12] [INFO ] Flatten gal took : 13 ms
[2024-05-24 13:13:12] [INFO ] Flatten gal took : 5 ms
[2024-05-24 13:13:12] [INFO ] Time to serialize gal into /tmp/LTL4202160906333036606.gal : 2 ms
[2024-05-24 13:13:12] [INFO ] Time to serialize properties into /tmp/LTL16635985542952209341.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/LTL4202160906333036606.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5298780437258703997.hoa' '-atoms' '/tmp/LTL16635985542952209341.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/LTL16635985542952209341.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5298780437258703997.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
44 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.472078,27096,1,0,6,78424,30,0,2138,31459,19
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GlobalResAllocation-COL-11-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property GlobalResAllocation-COL-11-LTLFireability-04 finished in 37656 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((p0||F(p1))))'
Support contains 12 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Ensure Unique test removed 11 places
Applied a total of 0 rules in 5 ms. Remains 34 /45 variables (removed 11) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 34 cols
[2024-05-24 13:13:12] [INFO ] Computed 12 invariants in 1 ms
[2024-05-24 13:13:12] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
[2024-05-24 13:13:12] [INFO ] Invariant cache hit.
[2024-05-24 13:13:12] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-24 13:13:12] [INFO ] Invariant cache hit.
[2024-05-24 13:13:12] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-24 13:13:12] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 13:13:12] [INFO ] Invariant cache hit.
[2024-05-24 13:13:12] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 163 ms. Remains : 34/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (AND (GEQ s10 1) (GEQ s11 4)) (AND (GEQ s4 1) (GEQ s11 4)) (AND (GEQ s3 1) (GEQ s11 4)) (AND (GEQ s6 1) (GEQ s11 4)) (AND (GEQ s9 1) (GEQ s11 ...], 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 5107 reset in 288 ms.
Stack based approach found an accepted trace after 60 steps with 3 reset with depth 18 and stack size 18 in 0 ms.
FORMULA GlobalResAllocation-COL-11-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-11-LTLFireability-05 finished in 540 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(!p0)||X(X(F(!p1)))))'
Support contains 34 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 45 cols
[2024-05-24 13:13:13] [INFO ] Computed 23 invariants in 3 ms
[2024-05-24 13:13:13] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
[2024-05-24 13:13:13] [INFO ] Invariant cache hit.
[2024-05-24 13:13:13] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 13:13:13] [INFO ] Invariant cache hit.
[2024-05-24 13:13:13] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-24 13:13:13] [INFO ] Invariant cache hit.
[2024-05-24 13:13:13] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 45/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 205 ms :[p1, p1, (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (AND (GEQ s15 1) (GEQ s26 1)) (AND (GEQ s19 1) (GEQ s30 1)) (AND (GEQ s17 1) (GEQ s28 1)) (AND (GEQ s21 1) (GEQ s32 1)) (AND (GEQ s13 1) (GEQ s24 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 227 ms.
Stack based approach found an accepted trace after 324 steps with 0 reset with depth 325 and stack size 325 in 3 ms.
FORMULA GlobalResAllocation-COL-11-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-11-LTLFireability-07 finished in 629 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(F((F(G(p1))&&p0)))))'
Support contains 34 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2024-05-24 13:13:13] [INFO ] Invariant cache hit.
[2024-05-24 13:13:13] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
[2024-05-24 13:13:13] [INFO ] Invariant cache hit.
[2024-05-24 13:13:13] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 13:13:14] [INFO ] Invariant cache hit.
[2024-05-24 13:13:14] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-24 13:13:14] [INFO ] Invariant cache hit.
[2024-05-24 13:13:14] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 45/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (LT s20 2) (LT s31 2)) (OR (LT s22 2) (LT s33 2)) (OR (LT s21 2) (LT s32 2)) (OR (LT s12 2) (LT s23 2)) (OR (LT s13 2) (LT s24 2)) (OR (LT 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 1 reset in 256 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 0 ms.
FORMULA GlobalResAllocation-COL-11-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-11-LTLFireability-08 finished in 648 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(p0)||(!p1 U p2)||X(X(!p1))))'
Support contains 33 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2024-05-24 13:13:14] [INFO ] Invariant cache hit.
[2024-05-24 13:13:14] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
[2024-05-24 13:13:14] [INFO ] Invariant cache hit.
[2024-05-24 13:13:14] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-24 13:13:14] [INFO ] Invariant cache hit.
[2024-05-24 13:13:14] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-24 13:13:14] [INFO ] Invariant cache hit.
[2024-05-24 13:13:14] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 169 ms. Remains : 45/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 428 ms :[p1, (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p0)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1), (NOT p0), true, p1]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 9}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 9}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 7}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=6 dest: 9}], [{ cond=(AND p0 p1), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 9}], [{ cond=p0, acceptance={} source=8 dest: 8}, { cond=(NOT p0), acceptance={} source=8 dest: 9}], [{ cond=true, acceptance={0} source=9 dest: 9}], [{ cond=true, acceptance={} source=10 dest: 0}]], initial=3, aps=[p1:(AND (OR (LT s20 2) (LT s31 2)) (OR (LT s22 2) (LT s33 2)) (OR (LT s21 2) (LT s32 2)) (OR (LT s12 2) (LT s23 2)) (OR (LT s13 2) (LT s24 2)) (OR (LT s14...], 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 47 steps with 15 reset in 1 ms.
FORMULA GlobalResAllocation-COL-11-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-11-LTLFireability-09 finished in 626 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(G((p0||X(p1)))))))'
Support contains 33 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2024-05-24 13:13:15] [INFO ] Invariant cache hit.
[2024-05-24 13:13:15] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
[2024-05-24 13:13:15] [INFO ] Invariant cache hit.
[2024-05-24 13:13:15] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-24 13:13:15] [INFO ] Invariant cache hit.
[2024-05-24 13:13:15] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-24 13:13:15] [INFO ] Invariant cache hit.
[2024-05-24 13:13:15] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 170 ms. Remains : 45/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p1:(OR (GEQ s35 4) (GEQ s36 4) (GEQ s38 4) (GEQ s37 4) (GEQ s40 4) (GEQ s39 4) (GEQ s42 4) (GEQ s41 4) (GEQ s44 4) (GEQ s43 4) (GEQ s34 4)), p0:(AND (OR (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 4 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-COL-11-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-11-LTLFireability-11 finished in 401 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)||G((G(!p2)||p1)))))'
Support contains 45 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2024-05-24 13:13:15] [INFO ] Invariant cache hit.
[2024-05-24 13:13:15] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
[2024-05-24 13:13:15] [INFO ] Invariant cache hit.
[2024-05-24 13:13:15] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-24 13:13:15] [INFO ] Invariant cache hit.
[2024-05-24 13:13:15] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-24 13:13:15] [INFO ] Invariant cache hit.
[2024-05-24 13:13:15] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 45/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p2), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (AND (GEQ s15 1) (GEQ s26 1)) (AND (GEQ s19 1) (GEQ s30 1)) (AND (GEQ s17 1) (GEQ s28 1)) (AND (GEQ s21 1) (GEQ s32 1)) (AND (GEQ s13 1) (GEQ ...], 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 50000 reset in 219 ms.
Product exploration explored 100000 steps with 50000 reset in 218 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 328 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GlobalResAllocation-COL-11-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-COL-11-LTLFireability-13 finished in 1114 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 p1))'
Support contains 23 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Ensure Unique test removed 11 places
Applied a total of 0 rules in 2 ms. Remains 34 /45 variables (removed 11) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 34 cols
[2024-05-24 13:13:16] [INFO ] Computed 12 invariants in 1 ms
[2024-05-24 13:13:16] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
[2024-05-24 13:13:16] [INFO ] Invariant cache hit.
[2024-05-24 13:13:16] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 13:13:16] [INFO ] Invariant cache hit.
[2024-05-24 13:13:16] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-05-24 13:13:16] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 13:13:16] [INFO ] Invariant cache hit.
[2024-05-24 13:13:16] [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 169 ms. Remains : 34/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 38 ms :[true, (NOT p1)]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(OR (GEQ s24 4) (GEQ s25 4) (GEQ s27 4) (GEQ s26 4) (GEQ s29 4) (GEQ s28 4) (GEQ s31 4) (GEQ s30 4) (GEQ s33 4) (GEQ s32 4) (GEQ s23 4)), p0:(OR (AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 18 steps with 1 reset in 0 ms.
FORMULA GlobalResAllocation-COL-11-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-11-LTLFireability-14 finished in 228 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((F(!p2)&&F(!p3)))&&p1)))))'
Support contains 23 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Ensure Unique test removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 34 transition count 66
Applied a total of 11 rules in 3 ms. Remains 34 /45 variables (removed 11) and now considering 66/66 (removed 0) transitions.
[2024-05-24 13:13:16] [INFO ] Invariant cache hit.
[2024-05-24 13:13:16] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2024-05-24 13:13:17] [INFO ] Invariant cache hit.
[2024-05-24 13:13:17] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-24 13:13:17] [INFO ] Invariant cache hit.
[2024-05-24 13:13:17] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-24 13:13:17] [INFO ] Invariant cache hit.
[2024-05-24 13:13:17] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 34/45 places, 66/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144 ms. Remains : 34/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (AND p0 (NOT p1)) (AND p0 p3) (AND p0 p2)), (AND p0 p2), (AND p0 p3), (OR (AND p0 p2) (AND p0 p3)), (AND p0 (NOT p1)), (OR (AND p0 (NOT p1)) (AND p0 p3) (AND p0 p2))]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 1}, { cond=(AND p0 p3), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p3), acceptance={} source=2 dest: 2}, { cond=(AND p0 p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=3 dest: 1}, { cond=(AND p0 p3), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p0:(OR (AND (GEQ s10 1) (GEQ s11 4)) (AND (GEQ s4 1) (GEQ s11 4)) (AND (GEQ s3 1) (GEQ s11 4)) (AND (GEQ s6 1) (GEQ s11 4)) (AND (GEQ s9 1) (GEQ s11 4)) (...], 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 6614 reset in 365 ms.
Stack based approach found an accepted trace after 830 steps with 46 reset with depth 13 and stack size 13 in 12 ms.
FORMULA GlobalResAllocation-COL-11-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-11-LTLFireability-15 finished in 804 ms.
All properties solved by simple procedures.
Total runtime 52152 ms.
BK_STOP 1716556400585
--------------------
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-11"
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-11, 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-171640625600423"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GlobalResAllocation-COL-11.tgz
mv GlobalResAllocation-COL-11 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 '
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 ;