fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r096-oct2-158940144500057
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for GlobalResAllocation-PT-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.680 21670.00 54486.00 136.20 FFFFFFFFFTFFFFFF normal

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-158940144500057.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-PT-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-oct2-158940144500057
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 7.7K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 35K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 122K 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 7.6K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 209K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 662K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.4M Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 5.7M 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-PT-03-00
FORMULA_NAME GlobalResAllocation-PT-03-01
FORMULA_NAME GlobalResAllocation-PT-03-02
FORMULA_NAME GlobalResAllocation-PT-03-03
FORMULA_NAME GlobalResAllocation-PT-03-04
FORMULA_NAME GlobalResAllocation-PT-03-05
FORMULA_NAME GlobalResAllocation-PT-03-06
FORMULA_NAME GlobalResAllocation-PT-03-07
FORMULA_NAME GlobalResAllocation-PT-03-08
FORMULA_NAME GlobalResAllocation-PT-03-09
FORMULA_NAME GlobalResAllocation-PT-03-10
FORMULA_NAME GlobalResAllocation-PT-03-11
FORMULA_NAME GlobalResAllocation-PT-03-12
FORMULA_NAME GlobalResAllocation-PT-03-13
FORMULA_NAME GlobalResAllocation-PT-03-14
FORMULA_NAME GlobalResAllocation-PT-03-15

=== Now, execution of the tool begins

BK_START 1589544237596

[2020-05-15 12:04:00] [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 12:04:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 12:04:01] [INFO ] Load time of PNML (sax parser for PT used): 475 ms
[2020-05-15 12:04:01] [INFO ] Transformed 33 places.
[2020-05-15 12:04:01] [INFO ] Transformed 4791 transitions.
[2020-05-15 12:04:01] [INFO ] Parsed PT model containing 33 places and 4791 transitions in 656 ms.
Ensure Unique test removed 4080 transitions
Reduce redundant transitions removed 4080 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 165 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1013 ms. (steps per millisecond=98 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 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 12:04:02] [INFO ] Computed 12 place invariants in 40 ms
[2020-05-15 12:04:02] [INFO ] [Real]Absence check using 7 positive place invariants in 44 ms returned unsat
[2020-05-15 12:04:03] [INFO ] [Real]Absence check using 7 positive place invariants in 37 ms returned unsat
[2020-05-15 12:04:03] [INFO ] [Real]Absence check using 7 positive place invariants in 55 ms returned unsat
[2020-05-15 12:04:03] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-05-15 12:04:03] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 1 ms returned unsat
[2020-05-15 12:04:03] [INFO ] [Real]Absence check using 7 positive place invariants in 22 ms returned sat
[2020-05-15 12:04:03] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 38 ms returned unsat
[2020-05-15 12:04:03] [INFO ] [Real]Absence check using 7 positive place invariants in 15 ms returned unsat
[2020-05-15 12:04:03] [INFO ] [Real]Absence check using 7 positive place invariants in 15 ms returned sat
[2020-05-15 12:04:03] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned unsat
[2020-05-15 12:04:03] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-15 12:04:03] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned unsat
[2020-05-15 12:04:03] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2020-05-15 12:04:03] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned unsat
[2020-05-15 12:04:03] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
Successfully simplified 10 atomic propositions for a total of 12 simplifications.
[2020-05-15 12:04:03] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-05-15 12:04:04] [INFO ] Flatten gal took : 310 ms
FORMULA GlobalResAllocation-PT-03-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-PT-03-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-PT-03-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-PT-03-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-PT-03-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-PT-03-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-PT-03-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-15 12:04:04] [INFO ] Flatten gal took : 69 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 12:04:04] [INFO ] Applying decomposition
[2020-05-15 12:04:04] [INFO ] Flatten gal took : 98 ms
[2020-05-15 12:04:04] [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/graph6173811647442253456.txt, -o, /tmp/graph6173811647442253456.bin, -w, /tmp/graph6173811647442253456.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/graph6173811647442253456.bin, -l, -1, -v, -w, /tmp/graph6173811647442253456.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 12:04:05] [INFO ] Decomposing Gal with order
[2020-05-15 12:04:05] [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 12:04:05] [INFO ] Computed 12 place invariants in 21 ms
inv : in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_1_6 - pr_in_1 = 0
inv : Resources_2 - in_critical_s_1_1 - in_critical_s_2_1 + in_critical_s_3_2 - in_critical_s_2_3 - in_critical_s_1_3 - in_critical_s_1_4 - in_critical_s_2_4 - in_critical_s_2_5 - in_critical_s_1_5 - in_critical_s_1_6 - in_critical_s_2_6 + pr_in_2 + pr_in_1 = 1
inv : in_critical_s_2_1 + in_critical_s_2_2 + in_critical_s_2_3 + in_critical_s_2_4 + in_critical_s_2_5 + in_critical_s_2_6 - pr_in_2 = 0
inv : 4*Processes_1 + pr_in_1 + pr_released_1 = 4
inv : Resources_5 + in_critical_s_2_5 + in_critical_s_1_5 + in_critical_s_3_5 = 1
inv : 4*Processes_3 + pr_released_3 + pr_in_3 = 4
inv : in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6 - pr_in_3 = 0
inv : Resources_3 + in_critical_s_2_3 + in_critical_s_1_3 + in_critical_s_3_3 = 1
inv : 4*Processes_2 + pr_in_2 + pr_released_2 = 4
inv : Resources_1 + in_critical_s_1_1 + in_critical_s_2_1 + in_critical_s_3_1 = 1
inv : Resources_6 + in_critical_s_1_6 + in_critical_s_3_6 + in_critical_s_2_6 = 1
inv : Resources_4 - in_critical_s_3_1 - in_critical_s_3_2 + in_critical_s_1_4 - in_critical_s_3_3 + in_critical_s_2_4 - in_critical_s_3_5 - in_critical_s_3_6 + pr_in_3 = 1
Total of 12 invariants.
[2020-05-15 12:04:05] [INFO ] Computed 12 place invariants in 22 ms
[2020-05-15 12:04:06] [INFO ] Removed a total of 2107 redundant transitions.
[2020-05-15 12:04:06] [INFO ] Flatten gal took : 1048 ms
[2020-05-15 12:04:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 30 ms.
[2020-05-15 12:04:06] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 14 ms
[2020-05-15 12:04:06] [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 9 LTL properties
Checking formula 0 : !((X(!(F(G(F("((((((((((((((((((gu2.in_critical_s_1_1+gu2.in_critical_s_2_1)+gu2.in_critical_s_3_1)+gu2.in_critical_s_1_2)+gu2.in_critical_s_3_2)+gu2.in_critical_s_2_2)+gu2.in_critical_s_2_3)+gu2.in_critical_s_1_3)+gu2.in_critical_s_1_4)+gu2.in_critical_s_3_3)+gu2.in_critical_s_3_4)+gu2.in_critical_s_2_4)+gu2.in_critical_s_2_5)+gu2.in_critical_s_1_5)+gu2.in_critical_s_1_6)+gu2.in_critical_s_3_5)+gu2.in_critical_s_3_6)+gu2.in_critical_s_2_6)<=((gi0.gu0.Processes_1+gi0.gu0.Processes_2)+gi0.gu0.Processes_3))")))))))
Formula 0 simplified : !X!FGF"((((((((((((((((((gu2.in_critical_s_1_1+gu2.in_critical_s_2_1)+gu2.in_critical_s_3_1)+gu2.in_critical_s_1_2)+gu2.in_critical_s_3_2)+gu2.in_critical_s_2_2)+gu2.in_critical_s_2_3)+gu2.in_critical_s_1_3)+gu2.in_critical_s_1_4)+gu2.in_critical_s_3_3)+gu2.in_critical_s_3_4)+gu2.in_critical_s_2_4)+gu2.in_critical_s_2_5)+gu2.in_critical_s_1_5)+gu2.in_critical_s_1_6)+gu2.in_critical_s_3_5)+gu2.in_critical_s_3_6)+gu2.in_critical_s_2_6)<=((gi0.gu0.Processes_1+gi0.gu0.Processes_2)+gi0.gu0.Processes_3))"
[2020-05-15 12:04:07] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
[2020-05-15 12:04:08] [INFO ] Proved 33 variables to be positive in 2985 ms
[2020-05-15 12:04:08] [INFO ] Computing symmetric may disable matrix : 711 transitions.
[2020-05-15 12:04:08] [INFO ] Computation of disable matrix completed :0/711 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 12:04:09] [INFO ] Computation of Complete disable matrix. took 176 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 12:04:09] [INFO ] Computing symmetric may enable matrix : 711 transitions.
[2020-05-15 12:04:09] [INFO ] Computation of Complete enable matrix. took 44 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
408 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.17066,136188,1,0,28,302412,24,11,9992,157813,65
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GlobalResAllocation-PT-03-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(X(X(("(((gi0.gu0.Processes_1+gi0.gu0.Processes_2)+gi0.gu0.Processes_3)>=2)")||((("(((gi0.gu3.pr_in_2+gi0.gu3.pr_in_1)+gi0.gu3.pr_in_3)>=3)")U("(((gi2.gu4.pr_released_2+gi2.gu4.pr_released_3)+gi2.gu4.pr_released_1)>=3)"))&&(X((G("((((((gi2.gu1.Resources_1+gi2.gu1.Resources_2)+gi2.gu1.Resources_3)+gi2.gu1.Resources_4)+gi2.gu1.Resources_5)+gi2.gu1.Resources_6)<3)"))U("(((gi2.gu4.pr_released_2+gi2.gu4.pr_released_3)+gi2.gu4.pr_released_1)>=3)")))))))))
Formula 1 simplified : !GXX("(((gi0.gu0.Processes_1+gi0.gu0.Processes_2)+gi0.gu0.Processes_3)>=2)" | (("(((gi0.gu3.pr_in_2+gi0.gu3.pr_in_1)+gi0.gu3.pr_in_3)>=3)" U "(((gi2.gu4.pr_released_2+gi2.gu4.pr_released_3)+gi2.gu4.pr_released_1)>=3)") & X(G"((((((gi2.gu1.Resources_1+gi2.gu1.Resources_2)+gi2.gu1.Resources_3)+gi2.gu1.Resources_4)+gi2.gu1.Resources_5)+gi2.gu1.Resources_6)<3)" U "(((gi2.gu4.pr_released_2+gi2.gu4.pr_released_3)+gi2.gu4.pr_released_1)>=3)")))
7 unique states visited
6 strongly connected components in search stack
8 transitions explored
6 items max in DFS search stack
139 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.57831,164068,1,0,38,341539,64,12,10174,192028,109
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA GlobalResAllocation-PT-03-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X((F(G("(((gi0.gu0.Processes_1+gi0.gu0.Processes_2)+gi0.gu0.Processes_3)<=((gi0.gu3.pr_in_2+gi0.gu3.pr_in_1)+gi0.gu3.pr_in_3))")))U(("(((gi0.gu0.Processes_1+gi0.gu0.Processes_2)+gi0.gu0.Processes_3)<=((gi0.gu3.pr_in_2+gi0.gu3.pr_in_1)+gi0.gu3.pr_in_3))")U("(((gi0.gu0.Processes_1+gi0.gu0.Processes_2)+gi0.gu0.Processes_3)<=((gi0.gu3.pr_in_2+gi0.gu3.pr_in_1)+gi0.gu3.pr_in_3))")))))
Formula 2 simplified : !X(FG"(((gi0.gu0.Processes_1+gi0.gu0.Processes_2)+gi0.gu0.Processes_3)<=((gi0.gu3.pr_in_2+gi0.gu3.pr_in_1)+gi0.gu3.pr_in_3))" U "(((gi0.gu0.Processes_1+gi0.gu0.Processes_2)+gi0.gu0.Processes_3)<=((gi0.gu3.pr_in_2+gi0.gu3.pr_in_1)+gi0.gu3.pr_in_3))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
184 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.41812,224524,1,0,60,411499,77,24,10356,270416,175
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA GlobalResAllocation-PT-03-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X("(((gi0.gu3.pr_in_2+gi0.gu3.pr_in_1)+gi0.gu3.pr_in_3)>(((((gi2.gu1.Resources_1+gi2.gu1.Resources_2)+gi2.gu1.Resources_3)+gi2.gu1.Resources_4)+gi2.gu1.Resources_5)+gi2.gu1.Resources_6))")))
Formula 3 simplified : !X"(((gi0.gu3.pr_in_2+gi0.gu3.pr_in_1)+gi0.gu3.pr_in_3)>(((((gi2.gu1.Resources_1+gi2.gu1.Resources_2)+gi2.gu1.Resources_3)+gi2.gu1.Resources_4)+gi2.gu1.Resources_5)+gi2.gu1.Resources_6))"
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.45759,225316,1,0,62,412688,80,24,10444,271487,182
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA GlobalResAllocation-PT-03-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(F(X(F((((X("((((((((((((((((((gu2.in_critical_s_1_1+gu2.in_critical_s_2_1)+gu2.in_critical_s_3_1)+gu2.in_critical_s_1_2)+gu2.in_critical_s_3_2)+gu2.in_critical_s_2_2)+gu2.in_critical_s_2_3)+gu2.in_critical_s_1_3)+gu2.in_critical_s_1_4)+gu2.in_critical_s_3_3)+gu2.in_critical_s_3_4)+gu2.in_critical_s_2_4)+gu2.in_critical_s_2_5)+gu2.in_critical_s_1_5)+gu2.in_critical_s_1_6)+gu2.in_critical_s_3_5)+gu2.in_critical_s_3_6)+gu2.in_critical_s_2_6)>=3)"))U(X("((((((gi2.gu1.Resources_1+gi2.gu1.Resources_2)+gi2.gu1.Resources_3)+gi2.gu1.Resources_4)+gi2.gu1.Resources_5)+gi2.gu1.Resources_6)>=3)")))&&(G("((((((gi2.gu1.Resources_1+gi2.gu1.Resources_2)+gi2.gu1.Resources_3)+gi2.gu1.Resources_4)+gi2.gu1.Resources_5)+gi2.gu1.Resources_6)<=((gi2.gu4.pr_released_2+gi2.gu4.pr_released_3)+gi2.gu4.pr_released_1))")))&&(X("((((((gi2.gu1.Resources_1+gi2.gu1.Resources_2)+gi2.gu1.Resources_3)+gi2.gu1.Resources_4)+gi2.gu1.Resources_5)+gi2.gu1.Resources_6)<=((gi0.gu0.Processes_1+gi0.gu0.Processes_2)+gi0.gu0.Processes_3))"))))))))
Formula 4 simplified : !XFXF((X"((((((((((((((((((gu2.in_critical_s_1_1+gu2.in_critical_s_2_1)+gu2.in_critical_s_3_1)+gu2.in_critical_s_1_2)+gu2.in_critical_s_3_2)+gu2.in_critical_s_2_2)+gu2.in_critical_s_2_3)+gu2.in_critical_s_1_3)+gu2.in_critical_s_1_4)+gu2.in_critical_s_3_3)+gu2.in_critical_s_3_4)+gu2.in_critical_s_2_4)+gu2.in_critical_s_2_5)+gu2.in_critical_s_1_5)+gu2.in_critical_s_1_6)+gu2.in_critical_s_3_5)+gu2.in_critical_s_3_6)+gu2.in_critical_s_2_6)>=3)" U X"((((((gi2.gu1.Resources_1+gi2.gu1.Resources_2)+gi2.gu1.Resources_3)+gi2.gu1.Resources_4)+gi2.gu1.Resources_5)+gi2.gu1.Resources_6)>=3)") & G"((((((gi2.gu1.Resources_1+gi2.gu1.Resources_2)+gi2.gu1.Resources_3)+gi2.gu1.Resources_4)+gi2.gu1.Resources_5)+gi2.gu1.Resources_6)<=((gi2.gu4.pr_released_2+gi2.gu4.pr_released_3)+gi2.gu4.pr_released_1))" & X"((((((gi2.gu1.Resources_1+gi2.gu1.Resources_2)+gi2.gu1.Resources_3)+gi2.gu1.Resources_4)+gi2.gu1.Resources_5)+gi2.gu1.Resources_6)<=((gi0.gu0.Processes_1+gi0.gu0.Processes_2)+gi0.gu0.Processes_3))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
237 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,9.82736,273676,1,0,84,466819,98,30,11901,339812,239
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA GlobalResAllocation-PT-03-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(X((!(G("(gu2.in_critical_s_1_1<=gi2.gu4.pr_released_2)")))||("(gu2.in_critical_s_1_1>gi2.gu4.pr_released_2)")))))
Formula 5 simplified : !GX("(gu2.in_critical_s_1_1>gi2.gu4.pr_released_2)" | !G"(gu2.in_critical_s_1_1<=gi2.gu4.pr_released_2)")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
17 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.0001,273936,1,0,85,471074,112,30,11919,343719,250
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA GlobalResAllocation-PT-03-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F("((gu2.in_critical_s_3_4>=1)||(gi0.gu0.Processes_2<=gi0.gu3.pr_in_3))")))
Formula 6 simplified : !F"((gu2.in_critical_s_3_4>=1)||(gi0.gu0.Processes_2<=gi0.gu3.pr_in_3))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3 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.0258,273936,1,0,90,474271,121,32,11933,348494,269
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA GlobalResAllocation-PT-03-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(F(X(G((X(X("(gi2.gu1.Resources_2<=gi2.gu4.pr_released_3)")))&&(X("(gi2.gu1.Resources_2<=gi2.gu4.pr_released_3)"))))))))
Formula 7 simplified : !GFXG(X"(gi2.gu1.Resources_2<=gi2.gu4.pr_released_3)" & XX"(gi2.gu1.Resources_2<=gi2.gu4.pr_released_3)")
3 unique states visited
2 strongly connected components in search stack
5 transitions explored
3 items max in DFS search stack
15 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.1774,276308,1,0,92,477782,126,33,11944,355059,280
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA GlobalResAllocation-PT-03-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!(F((F(X(F("(gi0.gu3.pr_in_1<=gi2.gu4.pr_released_2)"))))&&("(gi0.gu3.pr_in_1<=gi2.gu4.pr_released_2)")))))
Formula 8 simplified : F("(gi0.gu3.pr_in_1<=gi2.gu4.pr_released_2)" & FXF"(gi0.gu3.pr_in_1<=gi2.gu4.pr_released_2)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
87 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.0536,304556,1,0,105,511651,132,38,11953,395005,318
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA GlobalResAllocation-PT-03-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:768)
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 12:04:18] [INFO ] Built C files in 14191ms 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 1589544259266

--------------------
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-PT-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-PT-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-158940144500057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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