Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r066-tajo-158922814200329.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Dekker-PT-050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814200329
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 3.7K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 4 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rw-r--r-- 1 mcc users 1.5M Apr 27 14:36 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 Dekker-PT-050-00
FORMULA_NAME Dekker-PT-050-01
FORMULA_NAME Dekker-PT-050-02
FORMULA_NAME Dekker-PT-050-03
FORMULA_NAME Dekker-PT-050-04
FORMULA_NAME Dekker-PT-050-05
FORMULA_NAME Dekker-PT-050-06
FORMULA_NAME Dekker-PT-050-07
FORMULA_NAME Dekker-PT-050-08
FORMULA_NAME Dekker-PT-050-09
FORMULA_NAME Dekker-PT-050-10
FORMULA_NAME Dekker-PT-050-11
FORMULA_NAME Dekker-PT-050-12
FORMULA_NAME Dekker-PT-050-13
FORMULA_NAME Dekker-PT-050-14
FORMULA_NAME Dekker-PT-050-15

=== Now, execution of the tool begins

BK_START 1590110988583

[2020-05-22 01:29:50] [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-22 01:29:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 01:29:50] [INFO ] Load time of PNML (sax parser for PT used): 195 ms
[2020-05-22 01:29:50] [INFO ] Transformed 250 places.
[2020-05-22 01:29:50] [INFO ] Transformed 2600 transitions.
[2020-05-22 01:29:50] [INFO ] Found NUPN structural information;
[2020-05-22 01:29:50] [INFO ] Parsed PT model containing 250 places and 2600 transitions in 248 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 725 ms. (steps per millisecond=137 ) properties seen :[0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0]
[2020-05-22 01:29:51] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2020-05-22 01:29:51] [INFO ] Computed 150 place invariants in 25 ms
[2020-05-22 01:29:51] [INFO ] [Real]Absence check using 100 positive place invariants in 63 ms returned sat
[2020-05-22 01:29:51] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 20 ms returned sat
[2020-05-22 01:29:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:29:51] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2020-05-22 01:29:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:29:52] [INFO ] [Nat]Absence check using 100 positive place invariants in 44 ms returned sat
[2020-05-22 01:29:52] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 20 ms returned sat
[2020-05-22 01:29:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:29:52] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2020-05-22 01:29:52] [INFO ] State equation strengthened by 50 read => feed constraints.
[2020-05-22 01:29:52] [INFO ] [Nat]Added 50 Read/Feed constraints in 28 ms returned sat
[2020-05-22 01:29:52] [INFO ] Deduced a trap composed of 4 places in 103 ms
[2020-05-22 01:29:52] [INFO ] Deduced a trap composed of 6 places in 53 ms
[2020-05-22 01:29:52] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2020-05-22 01:29:52] [INFO ] Deduced a trap composed of 6 places in 45 ms
[2020-05-22 01:29:52] [INFO ] Deduced a trap composed of 4 places in 40 ms
[2020-05-22 01:29:52] [INFO ] Deduced a trap composed of 4 places in 35 ms
[2020-05-22 01:29:52] [INFO ] Deduced a trap composed of 5 places in 31 ms
[2020-05-22 01:29:52] [INFO ] Deduced a trap composed of 4 places in 22 ms
[2020-05-22 01:29:52] [INFO ] Deduced a trap composed of 5 places in 30 ms
[2020-05-22 01:29:52] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2020-05-22 01:29:52] [INFO ] Deduced a trap composed of 5 places in 17 ms
[2020-05-22 01:29:52] [INFO ] Deduced a trap composed of 4 places in 17 ms
[2020-05-22 01:29:53] [INFO ] Deduced a trap composed of 4 places in 15 ms
[2020-05-22 01:29:53] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 656 ms
[2020-05-22 01:29:53] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 57 ms.
[2020-05-22 01:29:53] [INFO ] Added : 51 causal constraints over 11 iterations in 525 ms. Result :sat
[2020-05-22 01:29:53] [INFO ] [Real]Absence check using 100 positive place invariants in 55 ms returned sat
[2020-05-22 01:29:53] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 19 ms returned sat
[2020-05-22 01:29:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:29:53] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2020-05-22 01:29:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:29:54] [INFO ] [Nat]Absence check using 100 positive place invariants in 14 ms returned unsat
[2020-05-22 01:29:54] [INFO ] [Real]Absence check using 100 positive place invariants in 41 ms returned sat
[2020-05-22 01:29:54] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 19 ms returned sat
[2020-05-22 01:29:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:29:54] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2020-05-22 01:29:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:29:54] [INFO ] [Nat]Absence check using 100 positive place invariants in 11 ms returned unsat
[2020-05-22 01:29:54] [INFO ] [Real]Absence check using 100 positive place invariants in 45 ms returned sat
[2020-05-22 01:29:54] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 22 ms returned sat
[2020-05-22 01:29:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:29:54] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2020-05-22 01:29:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:29:54] [INFO ] [Nat]Absence check using 100 positive place invariants in 12 ms returned unsat
[2020-05-22 01:29:54] [INFO ] [Real]Absence check using 100 positive place invariants in 37 ms returned sat
[2020-05-22 01:29:54] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 18 ms returned sat
[2020-05-22 01:29:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:29:55] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2020-05-22 01:29:55] [INFO ] [Real]Added 50 Read/Feed constraints in 15 ms returned sat
[2020-05-22 01:29:55] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-05-22 01:29:55] [INFO ] Deduced a trap composed of 5 places in 60 ms
[2020-05-22 01:29:55] [INFO ] Deduced a trap composed of 5 places in 44 ms
[2020-05-22 01:29:55] [INFO ] Deduced a trap composed of 4 places in 32 ms
[2020-05-22 01:29:55] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2020-05-22 01:29:55] [INFO ] Deduced a trap composed of 6 places in 26 ms
[2020-05-22 01:29:55] [INFO ] Deduced a trap composed of 4 places in 27 ms
[2020-05-22 01:29:55] [INFO ] Deduced a trap composed of 5 places in 41 ms
[2020-05-22 01:29:55] [INFO ] Deduced a trap composed of 4 places in 33 ms
[2020-05-22 01:29:55] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2020-05-22 01:29:55] [INFO ] Deduced a trap composed of 6 places in 25 ms
[2020-05-22 01:29:55] [INFO ] Deduced a trap composed of 4 places in 20 ms
[2020-05-22 01:29:55] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2020-05-22 01:29:55] [INFO ] Deduced a trap composed of 6 places in 23 ms
[2020-05-22 01:29:55] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2020-05-22 01:29:55] [INFO ] Deduced a trap composed of 6 places in 20 ms
[2020-05-22 01:29:55] [INFO ] Deduced a trap composed of 4 places in 16 ms
[2020-05-22 01:29:55] [INFO ] Deduced a trap composed of 4 places in 16 ms
[2020-05-22 01:29:56] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 839 ms
[2020-05-22 01:29:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:29:56] [INFO ] [Nat]Absence check using 100 positive place invariants in 34 ms returned sat
[2020-05-22 01:29:56] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 17 ms returned sat
[2020-05-22 01:29:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:29:56] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2020-05-22 01:29:56] [INFO ] [Nat]Added 50 Read/Feed constraints in 12 ms returned sat
[2020-05-22 01:29:56] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-05-22 01:29:56] [INFO ] Deduced a trap composed of 5 places in 59 ms
[2020-05-22 01:29:56] [INFO ] Deduced a trap composed of 5 places in 49 ms
[2020-05-22 01:29:56] [INFO ] Deduced a trap composed of 4 places in 40 ms
[2020-05-22 01:29:56] [INFO ] Deduced a trap composed of 4 places in 28 ms
[2020-05-22 01:29:56] [INFO ] Deduced a trap composed of 6 places in 23 ms
[2020-05-22 01:29:56] [INFO ] Deduced a trap composed of 4 places in 17 ms
[2020-05-22 01:29:56] [INFO ] Deduced a trap composed of 5 places in 33 ms
[2020-05-22 01:29:56] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2020-05-22 01:29:56] [INFO ] Deduced a trap composed of 4 places in 40 ms
[2020-05-22 01:29:56] [INFO ] Deduced a trap composed of 6 places in 29 ms
[2020-05-22 01:29:56] [INFO ] Deduced a trap composed of 4 places in 27 ms
[2020-05-22 01:29:56] [INFO ] Deduced a trap composed of 4 places in 38 ms
[2020-05-22 01:29:57] [INFO ] Deduced a trap composed of 6 places in 34 ms
[2020-05-22 01:29:57] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2020-05-22 01:29:57] [INFO ] Deduced a trap composed of 6 places in 25 ms
[2020-05-22 01:29:57] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2020-05-22 01:29:57] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2020-05-22 01:29:57] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 871 ms
[2020-05-22 01:29:57] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 95 ms.
[2020-05-22 01:29:57] [INFO ] Added : 51 causal constraints over 11 iterations in 503 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 5 simplifications.
[2020-05-22 01:29:58] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2020-05-22 01:29:58] [INFO ] Flatten gal took : 328 ms
FORMULA Dekker-PT-050-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 01:29:58] [INFO ] Flatten gal took : 206 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 01:29:58] [INFO ] Applying decomposition
[2020-05-22 01:29:58] [INFO ] Flatten gal took : 170 ms
[2020-05-22 01:29:59] [INFO ] Input system was already deterministic with 2600 transitions.
[2020-05-22 01:29:59] [INFO ] Too many transitions (2600) to apply POR reductions. Disabling POR matrices.
[2020-05-22 01:29:59] [INFO ] Built C files in 450ms 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]
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/graph16113638496294249432.txt, -o, /tmp/graph16113638496294249432.bin, -w, /tmp/graph16113638496294249432.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/graph16113638496294249432.bin, -l, -1, -v, -w, /tmp/graph16113638496294249432.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 01:29:59] [INFO ] Decomposing Gal with order
[2020-05-22 01:29:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 01:29:59] [INFO ] Removed a total of 8033 redundant transitions.
[2020-05-22 01:30:00] [INFO ] Flatten gal took : 332 ms
[2020-05-22 01:30:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 64 ms.
[2020-05-22 01:30:00] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 23 ms
[2020-05-22 01:30:00] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 5 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], 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
Read 6 LTL properties
Checking formula 0 : !(((X("((u22.p3_28==0)||(u45.p1_2==1))"))&&(X("((u21.p1_26==0)||(u17.p3_22==1))"))))
Formula 0 simplified : !(X"((u22.p3_28==0)||(u45.p1_2==1))" & X"((u21.p1_26==0)||(u17.p3_22==1))")
built 1226 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions u0.exit_0, u1.exit_3, u2.exit_4, u5.exit_7, u6.exit_9, u11.exit_14, u12.exit_16, u13.exit_18, u14.exit_19, u15.exit_20, u16.exit_21, u17.exit_22, u18.exit_23, u19.exit_24, u20.exit_25, u21.exit_26, u22.exit_28, u23.exit_29, u29.exit_35, u30.exit_37, u31.exit_38, u32.exit_39, u36.exit_43, u41.exit_47, u43.exit_49, u44.exit_1, u45.exit_2, u48.exit_8, u53.exit_15, u54.exit_17, u55.exit_27, u56.exit_30, u60.exit_36, i3.exit_5, i4.exit_6, i7.exit_13, i21.exit_31, i22.exit_32, i23.exit_34, i28.exit_40, i30.exit_45, i31.exit_46, i37.exit_10, i38.exit_11, i39.exit_12, i44.exit_33, i46.exit_41, i47.exit_42, i48.exit_44, i49.exit_48, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/2550/50/2600
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
158 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,1.69694,72396,1,0,157444,1361,20774,74572,421,1808,204006
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Dekker-PT-050-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(!(X(F(G((X("((u16.flag_1_21==0)||(i47.u35.flag_1_42==1))"))U("((u15.flag_0_20==0)||(u20.p1_25==1))"))))))))
Formula 1 simplified : !X!XFG(X"((u16.flag_1_21==0)||(i47.u35.flag_1_42==1))" U "((u15.flag_0_20==0)||(u20.p1_25==1))")
2 unique states visited
2 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
29 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,1.99648,79760,1,0,161609,1361,22006,79490,424,1808,211977
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Dekker-PT-050-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((G((X(G("((u36.flag_1_43==0)||(u23.flag_0_29==1))")))U(X("((u36.flag_1_43==0)||(u23.flag_0_29==1))"))))||(X("((u36.flag_1_43==0)||(u23.flag_0_29==1))"))))
Formula 2 simplified : !(X"((u36.flag_1_43==0)||(u23.flag_0_29==1))" | G(XG"((u36.flag_1_43==0)||(u23.flag_0_29==1))" U X"((u36.flag_1_43==0)||(u23.flag_0_29==1))"))
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1 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,1.99999,80460,1,0,161617,1361,22012,79499,425,1808,212041
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Dekker-PT-050-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((X("((i37.u7.p1_10==0)||(u21.p3_26==1))"))||(G("((i37.u7.p1_10==0)||(u21.p3_26==1))"))))
Formula 3 simplified : !(X"((i37.u7.p1_10==0)||(u21.p3_26==1))" | G"((i37.u7.p1_10==0)||(u21.p3_26==1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 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,2.00847,80460,1,0,161943,1361,22018,79821,425,1808,213039
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Dekker-PT-050-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(!(X(G(X("((u31.p0_38==0)||(u44.p3_1==1))")))))))
Formula 4 simplified : !F!XGX"((u31.p0_38==0)||(u44.p3_1==1))"
4 unique states visited
4 strongly connected components in search stack
4 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,2.18546,82304,1,0,162961,1361,22332,81309,426,1808,216523
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Dekker-PT-050-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(F(X((G((((F("((u45.p0_2==0)||(u17.p1_22==1))"))U("((u45.p0_2==0)||(u17.p1_22==1))"))||("(i48.u37.flag_0_44==0)"))||("(i44.u27.flag_0_33==1)")))U(("(u6.flag_0_9==1)")U("(i30.u38.p3_45==1)")))))))
Formula 5 simplified : !XFX(G("(i44.u27.flag_0_33==1)" | "(i48.u37.flag_0_44==0)" | (F"((u45.p0_2==0)||(u17.p1_22==1))" U "((u45.p0_2==0)||(u17.p1_22==1))")) U ("(u6.flag_0_9==1)" U "(i30.u38.p3_45==1)"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
10 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,2.28,85420,1,0,164630,1361,22686,83260,428,1808,220776
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Dekker-PT-050-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1590111003555

--------------------
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="Dekker-PT-050"
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 Dekker-PT-050, 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 r066-tajo-158922814200329"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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