fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r114-smll-165264477100011
Last Updated
Jun 22, 2022

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
296.544 26249.00 45308.00 368.20 FFTFFFTFTFFFFFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 6.5K Apr 30 05:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 30 05:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 30 05:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 30 05:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K May 9 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 28K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME GlobalResAllocation-COL-05-LTLCardinality-00
FORMULA_NAME GlobalResAllocation-COL-05-LTLCardinality-01
FORMULA_NAME GlobalResAllocation-COL-05-LTLCardinality-02
FORMULA_NAME GlobalResAllocation-COL-05-LTLCardinality-03
FORMULA_NAME GlobalResAllocation-COL-05-LTLCardinality-04
FORMULA_NAME GlobalResAllocation-COL-05-LTLCardinality-05
FORMULA_NAME GlobalResAllocation-COL-05-LTLCardinality-06
FORMULA_NAME GlobalResAllocation-COL-05-LTLCardinality-07
FORMULA_NAME GlobalResAllocation-COL-05-LTLCardinality-08
FORMULA_NAME GlobalResAllocation-COL-05-LTLCardinality-09
FORMULA_NAME GlobalResAllocation-COL-05-LTLCardinality-10
FORMULA_NAME GlobalResAllocation-COL-05-LTLCardinality-11
FORMULA_NAME GlobalResAllocation-COL-05-LTLCardinality-12
FORMULA_NAME GlobalResAllocation-COL-05-LTLCardinality-13
FORMULA_NAME GlobalResAllocation-COL-05-LTLCardinality-14
FORMULA_NAME GlobalResAllocation-COL-05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652681799269

Running Version 202205111006
[2022-05-16 06:16:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 06:16:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 06:16:41] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-16 06:16:42] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 06:16:43] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1342 ms
[2022-05-16 06:16:43] [INFO ] Imported 5 HL places and 7 HL transitions for a total of 75 PT places and 56105.0 transition bindings in 35 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
[2022-05-16 06:16:43] [INFO ] Built PT skeleton of HLPN with 5 places and 7 transitions 29 arcs in 11 ms.
[2022-05-16 06:16:43] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA GlobalResAllocation-COL-05-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-05-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-05-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 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 115 ms. (steps per millisecond=86 ) properties (out of 18) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) 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
[2022-05-16 06:16:43] [INFO ] Computed 3 place invariants in 10 ms
[2022-05-16 06:16:43] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 06:16:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-16 06:16:44] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 06:16:44] [INFO ] After 50ms 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 1 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2022-05-16 06:16:44] [INFO ] Flatten gal took : 32 ms
[2022-05-16 06:16:44] [INFO ] Flatten gal took : 7 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 10
Transition release1 forces synchronizations/join behavior on parameter p of sort Proc
[2022-05-16 06:16:44] [INFO ] Unfolded HLPN to a Petri net with 21 places and 35 transitions 145 arcs in 20 ms.
[2022-05-16 06:16:44] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Support contains 21 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 35/35 transitions.
Reduce isomorphic (modulo) transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 21 transition count 30
Applied a total of 10 rules in 11 ms. Remains 21 /21 variables (removed 0) and now considering 30/35 (removed 5) transitions.
// Phase 1: matrix 30 rows 21 cols
[2022-05-16 06:16:44] [INFO ] Computed 11 place invariants in 7 ms
[2022-05-16 06:16:44] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
// Phase 1: matrix 30 rows 21 cols
[2022-05-16 06:16:44] [INFO ] Computed 11 place invariants in 7 ms
[2022-05-16 06:16:44] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 30 rows 21 cols
[2022-05-16 06:16:44] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-16 06:16:44] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
// Phase 1: matrix 30 rows 21 cols
[2022-05-16 06:16:44] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-16 06:16:44] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/21 places, 30/35 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 30/35 transitions.
Support contains 21 out of 21 places after structural reductions.
[2022-05-16 06:16:44] [INFO ] Flatten gal took : 13 ms
[2022-05-16 06:16:44] [INFO ] Flatten gal took : 14 ms
[2022-05-16 06:16:44] [INFO ] Input system was already deterministic with 30 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 18) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 30 rows 21 cols
[2022-05-16 06:16:44] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-16 06:16:44] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 06:16:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 16 ms returned sat
[2022-05-16 06:16:45] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-16 06:16:45] [INFO ] After 61ms 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.
FORMULA GlobalResAllocation-COL-05-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA GlobalResAllocation-COL-05-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(X(F(G((X(p1) U (p0 U p2)))))&&F(p1))))'
Support contains 11 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 16 transition count 30
Applied a total of 5 rules in 2 ms. Remains 16 /21 variables (removed 5) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:16:45] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 06:16:45] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:16:45] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 06:16:45] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:16:45] [INFO ] Computed 6 place invariants in 5 ms
[2022-05-16 06:16:45] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:16:45] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 06:16:45] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 16/21 places, 30/30 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 822 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 4}, { cond=(NOT p2), acceptance={0} source=3 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(LEQ 1 (ADD s0 s1 s2 s3 s4)), p0:(LEQ s5 (ADD s0 s1 s2 s3 s4)), p2:(LEQ s5 (ADD s11 s12 s13 s14 s15))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3596 reset in 793 ms.
Product exploration explored 100000 steps with 3285 reset in 451 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 p1 (NOT p0) (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT p2))), (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 7 factoid took 658 ms. Reduced automaton from 9 states, 19 edges and 3 AP to 7 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 403 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:16:49] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 06:16:49] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 06:16:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 06:16:49] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT p2))), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (G (NOT (AND p0 (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2) p1))), (F (NOT p1)), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2) p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 858 ms. Reduced automaton from 7 states, 14 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 229 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 223 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:16:50] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 06:16:50] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-16 06:16:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:16:50] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-16 06:16:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 06:16:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned unsat
Proved EG (AND p1 (NOT p2))
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT p2))), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (G (NOT (AND p0 (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2) p1))), (F (NOT p1)), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2) p1)), (G (AND p1 (NOT p2)))]
Property proved to be false thanks to negative knowledge :(G (AND p1 (NOT p2)))
Knowledge based reduction with 9 factoid took 523 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA GlobalResAllocation-COL-05-LTLCardinality-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-COL-05-LTLCardinality-00 finished in 6030 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((G(p0) U !X((F(p1)&&G(p0)))) U X(p1))))'
Support contains 11 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 16 transition count 30
Applied a total of 5 rules in 2 ms. Remains 16 /21 variables (removed 5) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:16:51] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 06:16:51] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:16:51] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 06:16:51] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:16:51] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 06:16:51] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:16:51] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 06:16:51] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 16/21 places, 30/30 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 354 ms :[(NOT p1), false, (NOT p1), false, (AND p0 p1), p0, (AND p0 p1)]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND p0 p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ (ADD s6 s7 s8 s9 s10) (ADD s0 s1 s2 s3 s4)), p1:(LEQ s5 (ADD s6 s7 s8 s9 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 28395 reset in 406 ms.
Stack based approach found an accepted trace after 79869 steps with 22676 reset with depth 4 and stack size 4 in 341 ms.
FORMULA GlobalResAllocation-COL-05-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-05-LTLCardinality-01 finished in 1376 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(p0))))'
Support contains 6 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 16 transition count 30
Applied a total of 5 rules in 1 ms. Remains 16 /21 variables (removed 5) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:16:52] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 06:16:53] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:16:53] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 06:16:53] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:16:53] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 06:16:53] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:16:53] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 06:16:53] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 16/21 places, 30/30 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLCardinality-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:(GT s5 (ADD s0 s1 s2 s3 s4))], 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 4 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-COL-05-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-05-LTLCardinality-03 finished in 353 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(F(p0))) U G(p1)))'
Support contains 11 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 4 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 21 cols
[2022-05-16 06:16:53] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 06:16:53] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
// Phase 1: matrix 30 rows 21 cols
[2022-05-16 06:16:53] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 06:16:53] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 30 rows 21 cols
[2022-05-16 06:16:53] [INFO ] Computed 11 place invariants in 5 ms
[2022-05-16 06:16:53] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2022-05-16 06:16:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 30 rows 21 cols
[2022-05-16 06:16:53] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 06:16:53] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s5 (ADD s6 s7 s8 s9 s10)), p0:(GT 3 (ADD s11 s12 s13 s14 s15))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2836 reset in 386 ms.
Stack based approach found an accepted trace after 33 steps with 0 reset with depth 34 and stack size 34 in 1 ms.
FORMULA GlobalResAllocation-COL-05-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-05-LTLCardinality-05 finished in 705 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U X(p1))||F(p2))))'
Support contains 20 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 21 cols
[2022-05-16 06:16:53] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 06:16:54] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
// Phase 1: matrix 30 rows 21 cols
[2022-05-16 06:16:54] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-16 06:16:54] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 30 rows 21 cols
[2022-05-16 06:16:54] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 06:16:54] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
// Phase 1: matrix 30 rows 21 cols
[2022-05-16 06:16:54] [INFO ] Computed 11 place invariants in 8 ms
[2022-05-16 06:16:54] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ 1 (ADD s16 s17 s18 s19 s20)), p0:(LEQ 3 (ADD s6 s7 s8 s9 s10)), p1:(LEQ (ADD s11 s12 s13 s14 s15) (ADD s0 s1 s2 s3 s4))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 43312 reset in 599 ms.
Product exploration explored 100000 steps with 43314 reset in 534 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) p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 309 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 5 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 30 rows 21 cols
[2022-05-16 06:16:56] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 06:16:56] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 06:16:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-16 06:16:56] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-16 06:16:56] [INFO ] After 37ms 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) p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 460 ms. Reduced automaton from 5 states, 6 edges and 3 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 15 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 21 cols
[2022-05-16 06:16:57] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 06:16:57] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
// Phase 1: matrix 30 rows 21 cols
[2022-05-16 06:16:57] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 06:16:57] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 30 rows 21 cols
[2022-05-16 06:16:57] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 06:16:57] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
// Phase 1: matrix 30 rows 21 cols
[2022-05-16 06:16:57] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-16 06:16:57] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 30/30 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 p2) p1)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 1 factoid took 185 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Finished random walk after 8288 steps, including 2 resets, run visited all 2 properties in 26 ms. (steps per millisecond=318 )
Knowledge obtained : [(AND (NOT p2) p1)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F p2), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 1 factoid took 375 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 43294 reset in 271 ms.
Product exploration explored 100000 steps with 43347 reset in 291 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 15 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Ensure Unique test removed 5 places
Applied a total of 0 rules in 3 ms. Remains 16 /21 variables (removed 5) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:16:59] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 06:16:59] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
[2022-05-16 06:16:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:16:59] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 06:16:59] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/21 places, 30/30 transitions.
Product exploration explored 100000 steps with 43284 reset in 483 ms.
Product exploration explored 100000 steps with 43354 reset in 508 ms.
Built C files in :
/tmp/ltsmin177226892384027641
[2022-05-16 06:17:00] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin177226892384027641
Running compilation step : cd /tmp/ltsmin177226892384027641;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 430 ms.
Running link step : cd /tmp/ltsmin177226892384027641;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin177226892384027641;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8210013596505172056.hoa' '--buchi-type=spotba'
LTSmin run took 238 ms.
FORMULA GlobalResAllocation-COL-05-LTLCardinality-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GlobalResAllocation-COL-05-LTLCardinality-08 finished in 7762 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(G(F(X(F(G(p0)))))))&&F(X(!p0)))))'
Support contains 6 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 16 transition count 30
Applied a total of 5 rules in 3 ms. Remains 16 /21 variables (removed 5) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:17:01] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 06:17:01] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:17:01] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 06:17:01] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:17:01] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 06:17:01] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:17:01] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 06:17:01] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 16/21 places, 30/30 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 247 ms :[true, true, true, p0, (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT (ADD s6 s7 s8 s9 s10) s5)], 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 0 reset in 289 ms.
Stack based approach found an accepted trace after 146 steps with 0 reset with depth 147 and stack size 145 in 8 ms.
FORMULA GlobalResAllocation-COL-05-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-05-LTLCardinality-09 finished in 787 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 16 transition count 30
Applied a total of 5 rules in 2 ms. Remains 16 /21 variables (removed 5) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:17:02] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 06:17:02] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:17:02] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 06:17:02] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:17:02] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 06:17:02] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:17:02] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-16 06:17:02] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 16/21 places, 30/30 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 347 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLCardinality-10 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}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(LEQ 1 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA GlobalResAllocation-COL-05-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-05-LTLCardinality-10 finished in 581 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 16 transition count 30
Applied a total of 5 rules in 2 ms. Remains 16 /21 variables (removed 5) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:17:03] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 06:17:03] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:17:03] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 06:17:03] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:17:03] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 06:17:03] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:17:03] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 06:17:03] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 16/21 places, 30/30 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s6 s7 s8 s9 s10))], 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 44060 reset in 257 ms.
Stack based approach found an accepted trace after 679 steps with 301 reset with depth 4 and stack size 4 in 2 ms.
FORMULA GlobalResAllocation-COL-05-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-05-LTLCardinality-11 finished in 584 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(!p0)) U (G(p0) U p1)))'
Support contains 16 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 16 transition count 30
Applied a total of 5 rules in 1 ms. Remains 16 /21 variables (removed 5) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:17:03] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 06:17:03] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:17:03] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 06:17:03] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:17:03] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 06:17:03] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:17:03] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 06:17:03] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 16/21 places, 30/30 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 218 ms :[(NOT p1), p0, (AND (NOT p1) p0), true, (NOT p0), (NOT p1)]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s5 (ADD s0 s1 s2 s3 s4)), p0:(LEQ (ADD s11 s12 s13 s14 s15) (ADD s6 s7 s8 s9 s10))], 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]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-COL-05-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-05-LTLCardinality-12 finished in 435 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p0) U G(F(X(p1)))))||(X(p2)&&p3))))'
Support contains 16 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 16 transition count 30
Applied a total of 5 rules in 5 ms. Remains 16 /21 variables (removed 5) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:17:04] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-16 06:17:04] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:17:04] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 06:17:04] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:17:04] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 06:17:04] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:17:04] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 06:17:04] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 16/21 places, 30/30 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 0}, { cond=p3, acceptance={} source=0 dest: 1}, { cond=(AND p3 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p3 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p3 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p3 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(LEQ 1 (ADD s11 s12 s13 s14 s15)), p1:(LEQ s5 (ADD s0 s1 s2 s3 s4)), p2:(GT 3 (ADD s6 s7 s8 s9 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 11500 reset in 401 ms.
Stack based approach found an accepted trace after 43 steps with 4 reset with depth 13 and stack size 13 in 1 ms.
FORMULA GlobalResAllocation-COL-05-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-05-LTLCardinality-13 finished in 744 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(X((G(p0)||p1))))))'
Support contains 11 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Ensure Unique test removed 5 places
Applied a total of 0 rules in 3 ms. Remains 16 /21 variables (removed 5) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:17:04] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 06:17:04] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:17:04] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 06:17:04] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:17:04] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 06:17:05] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2022-05-16 06:17:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 16 cols
[2022-05-16 06:17:05] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 06:17:05] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s6 s7 s8 s9 s10) (ADD s0 s1 s2 s3 s4)), p1:(LEQ s5 (ADD s0 s1 s2 s3 s4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4833 reset in 220 ms.
Stack based approach found an accepted trace after 139 steps with 8 reset with depth 13 and stack size 13 in 0 ms.
FORMULA GlobalResAllocation-COL-05-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-05-LTLCardinality-14 finished in 494 ms.
All properties solved by simple procedures.
Total runtime 23807 ms.

BK_STOP 1652681825518

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GlobalResAllocation-COL-05"
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-4028"
echo " Executing tool itstools"
echo " Input is GlobalResAllocation-COL-05, 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 r114-smll-165264477100011"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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