Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r096-oct2-158940144400001.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-oct2-158940144400001
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 4.3K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 28K Apr 27 15:14 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-03-00
FORMULA_NAME GlobalResAllocation-COL-03-01
FORMULA_NAME GlobalResAllocation-COL-03-02
FORMULA_NAME GlobalResAllocation-COL-03-03
FORMULA_NAME GlobalResAllocation-COL-03-04
FORMULA_NAME GlobalResAllocation-COL-03-05
FORMULA_NAME GlobalResAllocation-COL-03-06
FORMULA_NAME GlobalResAllocation-COL-03-07
FORMULA_NAME GlobalResAllocation-COL-03-08
FORMULA_NAME GlobalResAllocation-COL-03-09
FORMULA_NAME GlobalResAllocation-COL-03-10
FORMULA_NAME GlobalResAllocation-COL-03-11
FORMULA_NAME GlobalResAllocation-COL-03-12
FORMULA_NAME GlobalResAllocation-COL-03-13
FORMULA_NAME GlobalResAllocation-COL-03-14
FORMULA_NAME GlobalResAllocation-COL-03-15

=== Now, execution of the tool begins

BK_START 1589540513507

[2020-05-15 11:01:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-15 11:01:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 11:01:55] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-15 11:01:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 520 ms
[2020-05-15 11:01:55] [INFO ] sort/places :
Proc->processes,prin,prreleased,
Res->resources,
PR->incriticals,

[2020-05-15 11:01:55] [INFO ] r2 symmetric to r1 in transition enter2
[2020-05-15 11:01:55] [INFO ] r3 symmetric to r2 in transition enter3
[2020-05-15 11:01:55] [INFO ] r2 symmetric to r1 in transition enter3
[2020-05-15 11:01:55] [INFO ] r4 symmetric to r3 in transition enter4
[2020-05-15 11:01:55] [INFO ] r3 symmetric to r2 in transition enter4
[2020-05-15 11:01:55] [INFO ] r2 symmetric to r1 in transition enter4
[2020-05-15 11:01:55] [INFO ] r2 symmetric to r1 in transition release2
[2020-05-15 11:01:55] [INFO ] Imported 5 HL places and 7 HL transitions for a total of 33 PT places and 4791.0 transition bindings in 21 ms.
[2020-05-15 11:01:55] [INFO ] Computed order based on color domains.
[2020-05-15 11:01:55] [INFO ] Unfolded HLPN to a Petri net with 33 places and 711 transitions in 38 ms.
[2020-05-15 11:01:55] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 64 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 646 ms. (steps per millisecond=154 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1]
Normalized transition count is 693 out of 711 initially.
// Phase 1: matrix 693 rows 33 cols
[2020-05-15 11:01:56] [INFO ] Computed 12 place invariants in 16 ms
[2020-05-15 11:01:56] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned unsat
[2020-05-15 11:01:56] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned unsat
[2020-05-15 11:01:56] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned unsat
[2020-05-15 11:01:56] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-05-15 11:01:56] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 1 ms returned unsat
[2020-05-15 11:01:56] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2020-05-15 11:01:56] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 1 ms returned sat
[2020-05-15 11:01:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:01:56] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2020-05-15 11:01:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:01:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-05-15 11:01:56] [INFO ] [Nat]Absence check using 8 positive and 4 generalized place invariants in 2 ms returned unsat
[2020-05-15 11:01:56] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned unsat
[2020-05-15 11:01:56] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned unsat
[2020-05-15 11:01:56] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 11 simplifications.
[2020-05-15 11:01:57] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-15 11:01:57] [INFO ] Flatten gal took : 97 ms
FORMULA GlobalResAllocation-COL-03-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-03-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-03-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-03-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-03-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-03-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-15 11:01:57] [INFO ] Flatten gal took : 71 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 11:01:57] [INFO ] Applying decomposition
[2020-05-15 11:01:57] [INFO ] Flatten gal took : 82 ms
[2020-05-15 11:01:57] [INFO ] Input system was already deterministic with 711 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph14974676569183817743.txt, -o, /tmp/graph14974676569183817743.bin, -w, /tmp/graph14974676569183817743.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph14974676569183817743.bin, -l, -1, -v, -w, /tmp/graph14974676569183817743.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 11:01:57] [INFO ] Decomposing Gal with order
[2020-05-15 11:01:57] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 693 out of 711 initially.
// Phase 1: matrix 693 rows 33 cols
[2020-05-15 11:01:57] [INFO ] Computed 12 place invariants in 8 ms
inv : prin_1 - incriticals_6 - incriticals_7 - incriticals_8 - incriticals_9 - incriticals_10 - incriticals_11 = 0
inv : resources_3 + incriticals_3 + incriticals_9 + incriticals_15 = 1
inv : 4*processes_2 + incriticals_12 + incriticals_13 + incriticals_14 + incriticals_15 + incriticals_16 + incriticals_17 + prreleased_2 = 4
inv : resources_0 + prin_0 - incriticals_1 - incriticals_2 - incriticals_3 - incriticals_4 - incriticals_5 + incriticals_6 + incriticals_12 = 1
inv : resources_1 + incriticals_1 + incriticals_7 + incriticals_13 = 1
inv : -prin_0 + incriticals_0 + incriticals_1 + incriticals_2 + incriticals_3 + incriticals_4 + incriticals_5 = 0
inv : resources_5 + incriticals_5 + incriticals_11 + incriticals_17 = 1
inv : resources_2 + incriticals_2 + incriticals_8 + incriticals_14 = 1
inv : prin_2 - incriticals_12 - incriticals_13 - incriticals_14 - incriticals_15 - incriticals_16 - incriticals_17 = 0
inv : 4*processes_0 + prin_0 + prreleased_0 = 4
inv : resources_4 + incriticals_4 + incriticals_10 + incriticals_16 = 1
inv : 4*processes_1 + incriticals_6 + incriticals_7 + incriticals_8 + incriticals_9 + incriticals_10 + incriticals_11 + prreleased_1 = 4
Total of 12 invariants.
[2020-05-15 11:01:57] [INFO ] Computed 12 place invariants in 10 ms
[2020-05-15 11:01:58] [INFO ] Removed a total of 2107 redundant transitions.
[2020-05-15 11:01:58] [INFO ] Flatten gal took : 624 ms
[2020-05-15 11:01:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2020-05-15 11:01:58] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 14 ms
[2020-05-15 11:01:58] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 10 LTL properties
Checking formula 0 : !((X(!(F(G(F("((((((((((((((((((gu3.incriticals_0+gu3.incriticals_1)+gu3.incriticals_2)+gu3.incriticals_3)+gu3.incriticals_4)+gu3.incriticals_5)+gu3.incriticals_6)+gu3.incriticals_7)+gu3.incriticals_8)+gu3.incriticals_9)+gu3.incriticals_10)+gu3.incriticals_11)+gu3.incriticals_12)+gu3.incriticals_13)+gu3.incriticals_14)+gu3.incriticals_15)+gu3.incriticals_16)+gu3.incriticals_17)<=((gi0.gu0.processes_0+gi0.gu0.processes_1)+gi0.gu0.processes_2))")))))))
Formula 0 simplified : !X!FGF"((((((((((((((((((gu3.incriticals_0+gu3.incriticals_1)+gu3.incriticals_2)+gu3.incriticals_3)+gu3.incriticals_4)+gu3.incriticals_5)+gu3.incriticals_6)+gu3.incriticals_7)+gu3.incriticals_8)+gu3.incriticals_9)+gu3.incriticals_10)+gu3.incriticals_11)+gu3.incriticals_12)+gu3.incriticals_13)+gu3.incriticals_14)+gu3.incriticals_15)+gu3.incriticals_16)+gu3.incriticals_17)<=((gi0.gu0.processes_0+gi0.gu0.processes_1)+gi0.gu0.processes_2))"
[2020-05-15 11:01:59] [INFO ] Proved 33 variables to be positive in 1991 ms
[2020-05-15 11:01:59] [INFO ] Computing symmetric may disable matrix : 711 transitions.
[2020-05-15 11:01:59] [INFO ] Computation of disable matrix completed :0/711 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 11:01:59] [INFO ] Computation of Complete disable matrix. took 109 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
[2020-05-15 11:01:59] [INFO ] Computing symmetric may enable matrix : 711 transitions.
[2020-05-15 11:02:00] [INFO ] Computation of Complete enable matrix. took 55 ms. Total solver calls (SAT/UNSAT): 0(0/0)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
432 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.39481,128800,1,0,28,298918,24,11,10186,156061,63
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GlobalResAllocation-COL-03-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(X(X(("(((gi0.gu0.processes_0+gi0.gu0.processes_1)+gi0.gu0.processes_2)>=2)")||((("(((gi0.gu2.prin_0+gi0.gu2.prin_1)+gi0.gu2.prin_2)>=3)")U("(((gi0.gu4.prreleased_0+gi0.gu4.prreleased_1)+gi0.gu4.prreleased_2)>=3)"))&&(X((G("((((((gi0.gu1.resources_0+gi0.gu1.resources_1)+gi0.gu1.resources_2)+gi0.gu1.resources_3)+gi0.gu1.resources_4)+gi0.gu1.resources_5)<3)"))U("(((gi0.gu4.prreleased_0+gi0.gu4.prreleased_1)+gi0.gu4.prreleased_2)>=3)")))))))))
Formula 1 simplified : !GXX("(((gi0.gu0.processes_0+gi0.gu0.processes_1)+gi0.gu0.processes_2)>=2)" | (("(((gi0.gu2.prin_0+gi0.gu2.prin_1)+gi0.gu2.prin_2)>=3)" U "(((gi0.gu4.prreleased_0+gi0.gu4.prreleased_1)+gi0.gu4.prreleased_2)>=3)") & X(G"((((((gi0.gu1.resources_0+gi0.gu1.resources_1)+gi0.gu1.resources_2)+gi0.gu1.resources_3)+gi0.gu1.resources_4)+gi0.gu1.resources_5)<3)" U "(((gi0.gu4.prreleased_0+gi0.gu4.prreleased_1)+gi0.gu4.prreleased_2)>=3)")))
7 unique states visited
6 strongly connected components in search stack
8 transitions explored
6 items max in DFS search stack
144 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.84031,157660,1,0,38,338238,64,12,10383,190269,107
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA GlobalResAllocation-COL-03-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X((F(G("(((gi0.gu0.processes_0+gi0.gu0.processes_1)+gi0.gu0.processes_2)<=((gi0.gu2.prin_0+gi0.gu2.prin_1)+gi0.gu2.prin_2))")))U(("(((gi0.gu0.processes_0+gi0.gu0.processes_1)+gi0.gu0.processes_2)<=((gi0.gu2.prin_0+gi0.gu2.prin_1)+gi0.gu2.prin_2))")U("(((gi0.gu0.processes_0+gi0.gu0.processes_1)+gi0.gu0.processes_2)<=((gi0.gu2.prin_0+gi0.gu2.prin_1)+gi0.gu2.prin_2))")))))
Formula 2 simplified : !X(FG"(((gi0.gu0.processes_0+gi0.gu0.processes_1)+gi0.gu0.processes_2)<=((gi0.gu2.prin_0+gi0.gu2.prin_1)+gi0.gu2.prin_2))" U "(((gi0.gu0.processes_0+gi0.gu0.processes_1)+gi0.gu0.processes_2)<=((gi0.gu2.prin_0+gi0.gu2.prin_1)+gi0.gu2.prin_2))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
185 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.69613,212044,1,0,58,406631,77,23,10559,265592,168
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA GlobalResAllocation-COL-03-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X("(((gi0.gu2.prin_0+gi0.gu2.prin_1)+gi0.gu2.prin_2)>(((((gi0.gu1.resources_0+gi0.gu1.resources_1)+gi0.gu1.resources_2)+gi0.gu1.resources_3)+gi0.gu1.resources_4)+gi0.gu1.resources_5))")))
Formula 3 simplified : !X"(((gi0.gu2.prin_0+gi0.gu2.prin_1)+gi0.gu2.prin_2)>(((((gi0.gu1.resources_0+gi0.gu1.resources_1)+gi0.gu1.resources_2)+gi0.gu1.resources_3)+gi0.gu1.resources_4)+gi0.gu1.resources_5))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.73616,212836,1,0,60,407820,80,23,10647,266663,175
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA GlobalResAllocation-COL-03-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(F(X(F((((X("((((((((((((((((((gu3.incriticals_0+gu3.incriticals_1)+gu3.incriticals_2)+gu3.incriticals_3)+gu3.incriticals_4)+gu3.incriticals_5)+gu3.incriticals_6)+gu3.incriticals_7)+gu3.incriticals_8)+gu3.incriticals_9)+gu3.incriticals_10)+gu3.incriticals_11)+gu3.incriticals_12)+gu3.incriticals_13)+gu3.incriticals_14)+gu3.incriticals_15)+gu3.incriticals_16)+gu3.incriticals_17)>=3)"))U(X("((((((gi0.gu1.resources_0+gi0.gu1.resources_1)+gi0.gu1.resources_2)+gi0.gu1.resources_3)+gi0.gu1.resources_4)+gi0.gu1.resources_5)>=3)")))&&(G("((((((gi0.gu1.resources_0+gi0.gu1.resources_1)+gi0.gu1.resources_2)+gi0.gu1.resources_3)+gi0.gu1.resources_4)+gi0.gu1.resources_5)<=((gi0.gu4.prreleased_0+gi0.gu4.prreleased_1)+gi0.gu4.prreleased_2))")))&&(X("((((((gi0.gu1.resources_0+gi0.gu1.resources_1)+gi0.gu1.resources_2)+gi0.gu1.resources_3)+gi0.gu1.resources_4)+gi0.gu1.resources_5)<=((gi0.gu0.processes_0+gi0.gu0.processes_1)+gi0.gu0.processes_2))"))))))))
Formula 4 simplified : !XFXF((X"((((((((((((((((((gu3.incriticals_0+gu3.incriticals_1)+gu3.incriticals_2)+gu3.incriticals_3)+gu3.incriticals_4)+gu3.incriticals_5)+gu3.incriticals_6)+gu3.incriticals_7)+gu3.incriticals_8)+gu3.incriticals_9)+gu3.incriticals_10)+gu3.incriticals_11)+gu3.incriticals_12)+gu3.incriticals_13)+gu3.incriticals_14)+gu3.incriticals_15)+gu3.incriticals_16)+gu3.incriticals_17)>=3)" U X"((((((gi0.gu1.resources_0+gi0.gu1.resources_1)+gi0.gu1.resources_2)+gi0.gu1.resources_3)+gi0.gu1.resources_4)+gi0.gu1.resources_5)>=3)") & G"((((((gi0.gu1.resources_0+gi0.gu1.resources_1)+gi0.gu1.resources_2)+gi0.gu1.resources_3)+gi0.gu1.resources_4)+gi0.gu1.resources_5)<=((gi0.gu4.prreleased_0+gi0.gu4.prreleased_1)+gi0.gu4.prreleased_2))" & X"((((((gi0.gu1.resources_0+gi0.gu1.resources_1)+gi0.gu1.resources_2)+gi0.gu1.resources_3)+gi0.gu1.resources_4)+gi0.gu1.resources_5)<=((gi0.gu0.processes_0+gi0.gu0.processes_1)+gi0.gu0.processes_2))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
311 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.8524,275240,1,0,82,461939,98,29,11634,334828,232
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA GlobalResAllocation-COL-03-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(!(F(!(X("((((((((((((((((((gu3.incriticals_0+gu3.incriticals_1)+gu3.incriticals_2)+gu3.incriticals_3)+gu3.incriticals_4)+gu3.incriticals_5)+gu3.incriticals_6)+gu3.incriticals_7)+gu3.incriticals_8)+gu3.incriticals_9)+gu3.incriticals_10)+gu3.incriticals_11)+gu3.incriticals_12)+gu3.incriticals_13)+gu3.incriticals_14)+gu3.incriticals_15)+gu3.incriticals_16)+gu3.incriticals_17)>=1)")))))))
Formula 5 simplified : !X!F!X"((((((((((((((((((gu3.incriticals_0+gu3.incriticals_1)+gu3.incriticals_2)+gu3.incriticals_3)+gu3.incriticals_4)+gu3.incriticals_5)+gu3.incriticals_6)+gu3.incriticals_7)+gu3.incriticals_8)+gu3.incriticals_9)+gu3.incriticals_10)+gu3.incriticals_11)+gu3.incriticals_12)+gu3.incriticals_13)+gu3.incriticals_14)+gu3.incriticals_15)+gu3.incriticals_16)+gu3.incriticals_17)>=1)"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
68 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.5325,275500,1,0,91,481423,104,33,11835,360184,263
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA GlobalResAllocation-COL-03-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(X(F("((((gi0.gu4.prreleased_0+gi0.gu4.prreleased_1)+gi0.gu4.prreleased_2)>=2)&&(((gi0.gu2.prin_0+gi0.gu2.prin_1)+gi0.gu2.prin_2)<=(((((gi0.gu1.resources_0+gi0.gu1.resources_1)+gi0.gu1.resources_2)+gi0.gu1.resources_3)+gi0.gu1.resources_4)+gi0.gu1.resources_5)))")))))
Formula 6 simplified : !FXF"((((gi0.gu4.prreleased_0+gi0.gu4.prreleased_1)+gi0.gu4.prreleased_2)>=2)&&(((gi0.gu2.prin_0+gi0.gu2.prin_1)+gi0.gu2.prin_2)<=(((((gi0.gu1.resources_0+gi0.gu1.resources_1)+gi0.gu1.resources_2)+gi0.gu1.resources_3)+gi0.gu1.resources_4)+gi0.gu1.resources_5)))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
67 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.2042,289756,1,0,101,507451,113,38,12183,394977,292
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA GlobalResAllocation-COL-03-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(!((G("(((gi0.gu4.prreleased_0+gi0.gu4.prreleased_1)+gi0.gu4.prreleased_2)>(((((gi0.gu1.resources_0+gi0.gu1.resources_1)+gi0.gu1.resources_2)+gi0.gu1.resources_3)+gi0.gu1.resources_4)+gi0.gu1.resources_5))"))U(G("(((gi0.gu4.prreleased_0+gi0.gu4.prreleased_1)+gi0.gu4.prreleased_2)<=(((((gi0.gu1.resources_0+gi0.gu1.resources_1)+gi0.gu1.resources_2)+gi0.gu1.resources_3)+gi0.gu1.resources_4)+gi0.gu1.resources_5))"))))))
Formula 7 simplified : !G!(G"(((gi0.gu4.prreleased_0+gi0.gu4.prreleased_1)+gi0.gu4.prreleased_2)>(((((gi0.gu1.resources_0+gi0.gu1.resources_1)+gi0.gu1.resources_2)+gi0.gu1.resources_3)+gi0.gu1.resources_4)+gi0.gu1.resources_5))" U G"(((gi0.gu4.prreleased_0+gi0.gu4.prreleased_1)+gi0.gu4.prreleased_2)<=(((((gi0.gu1.resources_0+gi0.gu1.resources_1)+gi0.gu1.resources_2)+gi0.gu1.resources_3)+gi0.gu1.resources_4)+gi0.gu1.resources_5))")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.2365,290020,1,0,101,507451,122,38,12648,394977,300
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA GlobalResAllocation-COL-03-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(X((X("(((gi0.gu4.prreleased_0+gi0.gu4.prreleased_1)+gi0.gu4.prreleased_2)>((gi0.gu2.prin_0+gi0.gu2.prin_1)+gi0.gu2.prin_2))"))||(!(("(((gi0.gu4.prreleased_0+gi0.gu4.prreleased_1)+gi0.gu4.prreleased_2)<=((gi0.gu2.prin_0+gi0.gu2.prin_1)+gi0.gu2.prin_2))")U("(((((((gi0.gu1.resources_0+gi0.gu1.resources_1)+gi0.gu1.resources_2)+gi0.gu1.resources_3)+gi0.gu1.resources_4)+gi0.gu1.resources_5)>((gi0.gu0.processes_0+gi0.gu0.processes_1)+gi0.gu0.processes_2))&&((((((gi0.gu1.resources_0+gi0.gu1.resources_1)+gi0.gu1.resources_2)+gi0.gu1.resources_3)+gi0.gu1.resources_4)+gi0.gu1.resources_5)<=((gi0.gu2.prin_0+gi0.gu2.prin_1)+gi0.gu2.prin_2)))")))))))
Formula 8 simplified : !XX(X"(((gi0.gu4.prreleased_0+gi0.gu4.prreleased_1)+gi0.gu4.prreleased_2)>((gi0.gu2.prin_0+gi0.gu2.prin_1)+gi0.gu2.prin_2))" | !("(((gi0.gu4.prreleased_0+gi0.gu4.prreleased_1)+gi0.gu4.prreleased_2)<=((gi0.gu2.prin_0+gi0.gu2.prin_1)+gi0.gu2.prin_2))" U "(((((((gi0.gu1.resources_0+gi0.gu1.resources_1)+gi0.gu1.resources_2)+gi0.gu1.resources_3)+gi0.gu1.resources_4)+gi0.gu1.resources_5)>((gi0.gu0.processes_0+gi0.gu0.processes_1)+gi0.gu0.processes_2))&&((((((gi0.gu1.resources_0+gi0.gu1.resources_1)+gi0.gu1.resources_2)+gi0.gu1.resources_3)+gi0.gu1.resources_4)+gi0.gu1.resources_5)<=((gi0.gu2.prin_0+gi0.gu2.prin_1)+gi0.gu2.prin_2)))"))
9 unique states visited
9 strongly connected components in search stack
9 transitions explored
9 items max in DFS search stack
274 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,14.9823,367120,1,0,116,586200,138,40,13444,472509,349
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA GlobalResAllocation-COL-03-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(X(X(!(X(((G(F("(((gi0.gu4.prreleased_0+gi0.gu4.prreleased_1)+gi0.gu4.prreleased_2)>=2)")))&&("((((((((((((((((((gu3.incriticals_0+gu3.incriticals_1)+gu3.incriticals_2)+gu3.incriticals_3)+gu3.incriticals_4)+gu3.incriticals_5)+gu3.incriticals_6)+gu3.incriticals_7)+gu3.incriticals_8)+gu3.incriticals_9)+gu3.incriticals_10)+gu3.incriticals_11)+gu3.incriticals_12)+gu3.incriticals_13)+gu3.incriticals_14)+gu3.incriticals_15)+gu3.incriticals_16)+gu3.incriticals_17)>=2)"))||(F("(((gi0.gu4.prreleased_0+gi0.gu4.prreleased_1)+gi0.gu4.prreleased_2)>=2)")))))))))
Formula 9 simplified : !XXX!X(F"(((gi0.gu4.prreleased_0+gi0.gu4.prreleased_1)+gi0.gu4.prreleased_2)>=2)" | ("((((((((((((((((((gu3.incriticals_0+gu3.incriticals_1)+gu3.incriticals_2)+gu3.incriticals_3)+gu3.incriticals_4)+gu3.incriticals_5)+gu3.incriticals_6)+gu3.incriticals_7)+gu3.incriticals_8)+gu3.incriticals_9)+gu3.incriticals_10)+gu3.incriticals_11)+gu3.incriticals_12)+gu3.incriticals_13)+gu3.incriticals_14)+gu3.incriticals_15)+gu3.incriticals_16)+gu3.incriticals_17)>=2)" & GF"(((gi0.gu4.prreleased_0+gi0.gu4.prreleased_1)+gi0.gu4.prreleased_2)>=2)"))
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 items max in DFS search stack
30 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,15.282,375304,1,0,121,597604,144,43,13472,487583,373
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA GlobalResAllocation-COL-03-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-15 11:02:14] [INFO ] Built C files in 17628ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1589540535416

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-03"
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"

# 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-03, 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 r096-oct2-158940144400001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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