fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r197-smll-167840343900179
Last Updated
May 14, 2023

About the Execution of ITS-Tools for GlobalResAllocation-COL-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
326.604 16072.00 28044.00 555.10 FFFFFFFFFFFFFTFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 9.3K Feb 25 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 25 16:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 28K Mar 5 18:22 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-06-LTLCardinality-00
FORMULA_NAME GlobalResAllocation-COL-06-LTLCardinality-01
FORMULA_NAME GlobalResAllocation-COL-06-LTLCardinality-02
FORMULA_NAME GlobalResAllocation-COL-06-LTLCardinality-03
FORMULA_NAME GlobalResAllocation-COL-06-LTLCardinality-04
FORMULA_NAME GlobalResAllocation-COL-06-LTLCardinality-05
FORMULA_NAME GlobalResAllocation-COL-06-LTLCardinality-06
FORMULA_NAME GlobalResAllocation-COL-06-LTLCardinality-07
FORMULA_NAME GlobalResAllocation-COL-06-LTLCardinality-08
FORMULA_NAME GlobalResAllocation-COL-06-LTLCardinality-09
FORMULA_NAME GlobalResAllocation-COL-06-LTLCardinality-10
FORMULA_NAME GlobalResAllocation-COL-06-LTLCardinality-11
FORMULA_NAME GlobalResAllocation-COL-06-LTLCardinality-12
FORMULA_NAME GlobalResAllocation-COL-06-LTLCardinality-13
FORMULA_NAME GlobalResAllocation-COL-06-LTLCardinality-14
FORMULA_NAME GlobalResAllocation-COL-06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678500106093

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GlobalResAllocation-COL-06
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202303021504
[2023-03-11 02:01:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 02:01:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:01:49] [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.
[2023-03-11 02:01:49] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-11 02:01:50] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 771 ms
[2023-03-11 02:01:50] [INFO ] Imported 5 HL places and 7 HL transitions for a total of 102 PT places and 136662.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
[2023-03-11 02:01:50] [INFO ] Built PT skeleton of HLPN with 5 places and 7 transitions 29 arcs in 6 ms.
[2023-03-11 02:01:50] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 5 formulas.
FORMULA GlobalResAllocation-COL-06-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-06-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-06-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-06-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-06-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 20) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
Normalized transition count is 6 out of 7 initially.
// Phase 1: matrix 6 rows 5 cols
[2023-03-11 02:01:50] [INFO ] Computed 3 place invariants in 7 ms
[2023-03-11 02:01:50] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-11 02:01:50] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 02:01:50] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2023-03-11 02:01:50] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-11 02:01:50] [INFO ] Flatten gal took : 20 ms
FORMULA GlobalResAllocation-COL-06-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 02:01:50] [INFO ] Flatten gal took : 4 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 12
Transition release1 forces synchronizations/join behavior on parameter p of sort Proc
[2023-03-11 02:01:50] [INFO ] Unfolded HLPN to a Petri net with 25 places and 42 transitions 174 arcs in 14 ms.
[2023-03-11 02:01:50] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Support contains 25 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 42/42 transitions.
Reduce isomorphic (modulo) transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 25 transition count 36
Applied a total of 12 rules in 9 ms. Remains 25 /25 variables (removed 0) and now considering 36/42 (removed 6) transitions.
// Phase 1: matrix 36 rows 25 cols
[2023-03-11 02:01:50] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-11 02:01:51] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
[2023-03-11 02:01:51] [INFO ] Invariant cache hit.
[2023-03-11 02:01:51] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-11 02:01:51] [INFO ] Invariant cache hit.
[2023-03-11 02:01:51] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-11 02:01:51] [INFO ] Invariant cache hit.
[2023-03-11 02:01:51] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 25/25 places, 36/42 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 301 ms. Remains : 25/25 places, 36/42 transitions.
Support contains 25 out of 25 places after structural reductions.
[2023-03-11 02:01:51] [INFO ] Flatten gal took : 9 ms
[2023-03-11 02:01:51] [INFO ] Flatten gal took : 9 ms
[2023-03-11 02:01:51] [INFO ] Input system was already deterministic with 36 transitions.
Finished random walk after 84 steps, including 0 resets, run visited all 18 properties in 4 ms. (steps per millisecond=21 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X(p1))))'
Support contains 13 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 36/36 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 19 transition count 36
Applied a total of 6 rules in 2 ms. Remains 19 /25 variables (removed 6) and now considering 36/36 (removed 0) transitions.
// Phase 1: matrix 36 rows 19 cols
[2023-03-11 02:01:51] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-11 02:01:51] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
[2023-03-11 02:01:51] [INFO ] Invariant cache hit.
[2023-03-11 02:01:51] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-11 02:01:51] [INFO ] Invariant cache hit.
[2023-03-11 02:01:51] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-11 02:01:51] [INFO ] Invariant cache hit.
[2023-03-11 02:01:52] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/25 places, 36/36 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 221 ms. Remains : 19/25 places, 36/36 transitions.
Stuttering acceptance computed with spot in 336 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GlobalResAllocation-COL-06-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT 2 s6), p1:(LEQ (ADD s7 s8 s9 s10 s11 s12) (ADD s0 s1 s2 s3 s4 s5))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 14470 reset in 590 ms.
Stack based approach found an accepted trace after 75 steps with 11 reset with depth 19 and stack size 19 in 6 ms.
FORMULA GlobalResAllocation-COL-06-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-06-LTLCardinality-00 finished in 1222 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U (G(p1)||G((p2&&F(p3))))))'
Support contains 13 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 36/36 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 19 transition count 36
Applied a total of 6 rules in 2 ms. Remains 19 /25 variables (removed 6) and now considering 36/36 (removed 0) transitions.
[2023-03-11 02:01:53] [INFO ] Invariant cache hit.
[2023-03-11 02:01:53] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
[2023-03-11 02:01:53] [INFO ] Invariant cache hit.
[2023-03-11 02:01:53] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-11 02:01:53] [INFO ] Invariant cache hit.
[2023-03-11 02:01:53] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-11 02:01:53] [INFO ] Invariant cache hit.
[2023-03-11 02:01:53] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/25 places, 36/36 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 244 ms. Remains : 19/25 places, 36/36 transitions.
Stuttering acceptance computed with spot in 1166 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p0), true, (AND (NOT p3) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p3), (OR (NOT p3) (NOT p2)), (NOT p1), (AND (NOT p3) (NOT p1) p0), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2)))]
Running random walk in product with property : GlobalResAllocation-COL-06-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 5}, { cond=(AND p1 p2), acceptance={} source=0 dest: 7}], [{ cond=true, acceptance={} source=1 dest: 8}], [{ cond=(NOT p3), acceptance={} source=2 dest: 10}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 8}, { cond=p2, acceptance={} source=4 dest: 11}], [{ cond=(NOT p1), acceptance={} source=5 dest: 8}, { cond=p1, acceptance={} source=5 dest: 12}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=6 dest: 10}, { cond=(AND p1 (NOT p3)), acceptance={} source=6 dest: 13}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p1) p2), acceptance={} source=7 dest: 11}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 12}, { cond=(AND p1 p2), acceptance={} source=7 dest: 14}], [{ cond=(NOT p0), acceptance={} source=8 dest: 9}], [{ cond=true, acceptance={0, 1} source=9 dest: 9}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=10 dest: 15}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=11 dest: 9}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=11 dest: 15}, { cond=(AND p2 (NOT p0)), acceptance={} source=11 dest: 16}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=12 dest: 9}, { cond=(AND p1 (NOT p0)), acceptance={} source=12 dest: 17}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=13 dest: 15}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=13 dest: 18}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=14 dest: 9}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={} source=14 dest: 15}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=14 dest: 16}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=14 dest: 17}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=14 dest: 19}], [{ cond=(NOT p3), acceptance={0, 1} source=15 dest: 15}], [{ cond=(NOT p2), acceptance={} source=16 dest: 9}, { cond=(AND p2 (NOT p3)), acceptance={} source=16 dest: 15}, { cond=p2, acceptance={} source=16 dest: 16}], [{ cond=(NOT p1), acceptance={} source=17 dest: 9}, { cond=p1, acceptance={} source=17 dest: 17}], [{ cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=18 dest: 15}, { cond=(AND p1 (NOT p3) p0), acceptance={} source=18 dest: 18}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=19 dest: 9}, { cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={} source=19 dest: 15}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=19 dest: 16}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=19 dest: 17}, { cond=(AND p1 p2 p0), acceptance={} source=19 dest: 19}]], initial=0, aps=[p1:(LEQ 3 (ADD s7 s8 s9 s10 s11 s12)), p2:(LEQ 2 (ADD s7 s8 s9 s10 s11 s12)), p3:(LEQ 1 s6), p0:(AND (LEQ 1 s6) (LEQ s6 (ADD s13 s14 s15 s16 s17 s18)))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-COL-06-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-06-LTLCardinality-05 finished in 1464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U X((p2&&F(G(!p3))))))'
Support contains 25 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 36/36 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 36/36 (removed 0) transitions.
// Phase 1: matrix 36 rows 25 cols
[2023-03-11 02:01:54] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-11 02:01:54] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
[2023-03-11 02:01:54] [INFO ] Invariant cache hit.
[2023-03-11 02:01:54] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-11 02:01:54] [INFO ] Invariant cache hit.
[2023-03-11 02:01:54] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-11 02:01:54] [INFO ] Invariant cache hit.
[2023-03-11 02:01:54] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 234 ms. Remains : 25/25 places, 36/36 transitions.
Stuttering acceptance computed with spot in 602 ms :[(OR (NOT p2) p3), (OR (NOT p2) p3), (OR (AND p0 (NOT p1) p3) (AND (NOT p1) (NOT p2))), (OR (NOT p2) p3), true, p3, (NOT p1), (AND (NOT p1) p0 p3)]
Running random walk in product with property : GlobalResAllocation-COL-06-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}, { cond=p2, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 5}, { cond=p3, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) p0 p3), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5)), p0:(LEQ 3 (ADD s19 s20 s21 s22 s23 s24)), p2:(OR (LEQ s6 (ADD s7 s8 s9 s10 s11 s12)) (LEQ (ADD s13 s14 s15 s16 s17 s18...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 241 ms.
Stack based approach found an accepted trace after 229 steps with 0 reset with depth 230 and stack size 230 in 1 ms.
FORMULA GlobalResAllocation-COL-06-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-06-LTLCardinality-06 finished in 1114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!(p0 U p1)&&X(!((G(p2) U G(p0)) U p1))))))'
Support contains 7 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 36/36 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 19 transition count 36
Applied a total of 6 rules in 1 ms. Remains 19 /25 variables (removed 6) and now considering 36/36 (removed 0) transitions.
// Phase 1: matrix 36 rows 19 cols
[2023-03-11 02:01:55] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-11 02:01:55] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
[2023-03-11 02:01:55] [INFO ] Invariant cache hit.
[2023-03-11 02:01:55] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-11 02:01:55] [INFO ] Invariant cache hit.
[2023-03-11 02:01:55] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-11 02:01:55] [INFO ] Invariant cache hit.
[2023-03-11 02:01:55] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/25 places, 36/36 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 216 ms. Remains : 19/25 places, 36/36 transitions.
Stuttering acceptance computed with spot in 582 ms :[p1, p1, p1, p1, (AND p1 p2 p0), (AND p1 p0), (AND p1 p2 p0), (AND p1 p0 p2), (AND p1 p0 p2), (AND p1 p0)]
Running random walk in product with property : GlobalResAllocation-COL-06-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={} source=4 dest: 6}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 9}], [{ cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 4}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=6 dest: 7}, { cond=(AND p0 p1 p2), acceptance={} source=6 dest: 8}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=7 dest: 7}, { cond=(AND p0 p1 p2), acceptance={0} source=7 dest: 8}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=8 dest: 7}, { cond=(AND p0 p1 p2), acceptance={0} source=8 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=9 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p1:(LEQ (ADD s13 s14 s15 s16 s17 s18) s6), p0:(LEQ 2 s6), p2:(LEQ 1 (ADD s13 s14 s15 s16 s17 s18))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1101 reset in 441 ms.
Stack based approach found an accepted trace after 13513 steps with 145 reset with depth 4 and stack size 4 in 103 ms.
FORMULA GlobalResAllocation-COL-06-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-06-LTLCardinality-07 finished in 1400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U G(p1))))'
Support contains 19 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 36/36 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 19 transition count 36
Applied a total of 6 rules in 2 ms. Remains 19 /25 variables (removed 6) and now considering 36/36 (removed 0) transitions.
[2023-03-11 02:01:56] [INFO ] Invariant cache hit.
[2023-03-11 02:01:57] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
[2023-03-11 02:01:57] [INFO ] Invariant cache hit.
[2023-03-11 02:01:57] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-11 02:01:57] [INFO ] Invariant cache hit.
[2023-03-11 02:01:57] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-11 02:01:57] [INFO ] Invariant cache hit.
[2023-03-11 02:01:57] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/25 places, 36/36 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 211 ms. Remains : 19/25 places, 36/36 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-06-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ (ADD s13 s14 s15 s16 s17 s18) (ADD s0 s1 s2 s3 s4 s5)), p0:(OR (LEQ s6 (ADD s13 s14 s15 s16 s17 s18)) (GT (ADD s7 s8 s9 s10 s11 s12) s6))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22 reset in 511 ms.
Stack based approach found an accepted trace after 94 steps with 0 reset with depth 95 and stack size 95 in 1 ms.
FORMULA GlobalResAllocation-COL-06-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-06-LTLCardinality-08 finished in 874 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(p1)&&(X(!p2) U (X(G(!p2))||(!p1&&X(!p2)))))))'
Support contains 18 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 36/36 transitions.
Applied a total of 0 rules in 7 ms. Remains 25 /25 variables (removed 0) and now considering 36/36 (removed 0) transitions.
// Phase 1: matrix 36 rows 25 cols
[2023-03-11 02:01:57] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-11 02:01:57] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
[2023-03-11 02:01:57] [INFO ] Invariant cache hit.
[2023-03-11 02:01:57] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-11 02:01:57] [INFO ] Invariant cache hit.
[2023-03-11 02:01:58] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-11 02:01:58] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 02:01:58] [INFO ] Invariant cache hit.
[2023-03-11 02:01:58] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 239 ms. Remains : 25/25 places, 36/36 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p1) (NOT p0) p2), (NOT p1), p2, (OR (AND (NOT p0) p2) (AND (NOT p1) p2))]
Running random walk in product with property : GlobalResAllocation-COL-06-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={1} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={0, 1} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 0}, { cond=p1, acceptance={1} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 p1 p2), acceptance={1} source=2 dest: 1}, { cond=(AND p0 p1 p2), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={0, 1} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(GT 3 (ADD s13 s14 s15 s16 s17 s18)), p1:(LEQ 1 (ADD s19 s20 s21 s22 s23 s24)), p2:(LEQ 3 (ADD s7 s8 s9 s10 s11 s12))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 308 ms.
Stack based approach found an accepted trace after 87 steps with 1 reset with depth 58 and stack size 58 in 0 ms.
FORMULA GlobalResAllocation-COL-06-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-06-LTLCardinality-09 finished in 813 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 13 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 36/36 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 19 transition count 36
Applied a total of 6 rules in 3 ms. Remains 19 /25 variables (removed 6) and now considering 36/36 (removed 0) transitions.
// Phase 1: matrix 36 rows 19 cols
[2023-03-11 02:01:58] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-11 02:01:58] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
[2023-03-11 02:01:58] [INFO ] Invariant cache hit.
[2023-03-11 02:01:58] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-11 02:01:58] [INFO ] Invariant cache hit.
[2023-03-11 02:01:58] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-11 02:01:58] [INFO ] Invariant cache hit.
[2023-03-11 02:01:58] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/25 places, 36/36 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 198 ms. Remains : 19/25 places, 36/36 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : GlobalResAllocation-COL-06-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(GT 2 (ADD s13 s14 s15 s16 s17 s18)), p0:(LEQ (ADD s0 s1 s2 s3 s4 s5) s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-COL-06-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-06-LTLCardinality-10 finished in 371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&F(p1)&&(X(p2) U G(p2)))))'
Support contains 13 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 36/36 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 19 transition count 36
Applied a total of 6 rules in 2 ms. Remains 19 /25 variables (removed 6) and now considering 36/36 (removed 0) transitions.
[2023-03-11 02:01:59] [INFO ] Invariant cache hit.
[2023-03-11 02:01:59] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
[2023-03-11 02:01:59] [INFO ] Invariant cache hit.
[2023-03-11 02:01:59] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-11 02:01:59] [INFO ] Invariant cache hit.
[2023-03-11 02:01:59] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-11 02:01:59] [INFO ] Invariant cache hit.
[2023-03-11 02:01:59] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/25 places, 36/36 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 205 ms. Remains : 19/25 places, 36/36 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p2), (OR (NOT p1) (NOT p2) p0), (OR (NOT p2) (NOT p1)), true, (OR (NOT p2) (NOT p1) p0)]
Running random walk in product with property : GlobalResAllocation-COL-06-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p2:(LEQ (ADD s13 s14 s15 s16 s17 s18) (ADD s0 s1 s2 s3 s4 s5)), p0:(GT 2 s6), p1:(LEQ 3 (ADD s0 s1 s2 s3 s4 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][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-06-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-06-LTLCardinality-11 finished in 458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 36/36 transitions.
Ensure Unique test removed 6 places
Applied a total of 0 rules in 3 ms. Remains 19 /25 variables (removed 6) and now considering 36/36 (removed 0) transitions.
[2023-03-11 02:01:59] [INFO ] Invariant cache hit.
[2023-03-11 02:01:59] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
[2023-03-11 02:01:59] [INFO ] Invariant cache hit.
[2023-03-11 02:01:59] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-11 02:01:59] [INFO ] Invariant cache hit.
[2023-03-11 02:01:59] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-11 02:01:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 02:01:59] [INFO ] Invariant cache hit.
[2023-03-11 02:01:59] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 233 ms. Remains : 19/25 places, 36/36 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-06-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s7 s8 s9 s10 s11 s12))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 262 ms.
Product exploration explored 100000 steps with 50000 reset in 177 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GlobalResAllocation-COL-06-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-COL-06-LTLCardinality-13 finished in 994 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 36/36 transitions.
Ensure Unique test removed 6 places
Applied a total of 0 rules in 1 ms. Remains 19 /25 variables (removed 6) and now considering 36/36 (removed 0) transitions.
[2023-03-11 02:02:00] [INFO ] Invariant cache hit.
[2023-03-11 02:02:00] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
[2023-03-11 02:02:00] [INFO ] Invariant cache hit.
[2023-03-11 02:02:00] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-11 02:02:00] [INFO ] Invariant cache hit.
[2023-03-11 02:02:00] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-11 02:02:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 02:02:00] [INFO ] Invariant cache hit.
[2023-03-11 02:02:00] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 213 ms. Remains : 19/25 places, 36/36 transitions.
Stuttering acceptance computed with spot in 100 ms :[p0, p0]
Running random walk in product with property : GlobalResAllocation-COL-06-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 (ADD s7 s8 s9 s10 s11 s12))], 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 73 reset in 154 ms.
Stack based approach found an accepted trace after 108 steps with 0 reset with depth 109 and stack size 109 in 1 ms.
FORMULA GlobalResAllocation-COL-06-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-06-LTLCardinality-14 finished in 487 ms.
All properties solved by simple procedures.
Total runtime 11748 ms.

BK_STOP 1678500122165

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is GlobalResAllocation-COL-06, examination is LTLCardinality"
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-smll-167840343900179"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GlobalResAllocation-COL-06.tgz
mv GlobalResAllocation-COL-06 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;