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-158922814200338.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-100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814200338
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.1M
-rw-r--r-- 1 mcc users 3.2K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.8K 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 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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 5.9M 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-100-00
FORMULA_NAME Dekker-PT-100-01
FORMULA_NAME Dekker-PT-100-02
FORMULA_NAME Dekker-PT-100-03
FORMULA_NAME Dekker-PT-100-04
FORMULA_NAME Dekker-PT-100-05
FORMULA_NAME Dekker-PT-100-06
FORMULA_NAME Dekker-PT-100-07
FORMULA_NAME Dekker-PT-100-08
FORMULA_NAME Dekker-PT-100-09
FORMULA_NAME Dekker-PT-100-10
FORMULA_NAME Dekker-PT-100-11
FORMULA_NAME Dekker-PT-100-12
FORMULA_NAME Dekker-PT-100-13
FORMULA_NAME Dekker-PT-100-14
FORMULA_NAME Dekker-PT-100-15

=== Now, execution of the tool begins

BK_START 1590111230610

[2020-05-22 01:33:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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:33:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 01:33:52] [INFO ] Load time of PNML (sax parser for PT used): 436 ms
[2020-05-22 01:33:52] [INFO ] Transformed 500 places.
[2020-05-22 01:33:52] [INFO ] Transformed 10200 transitions.
[2020-05-22 01:33:52] [INFO ] Found NUPN structural information;
[2020-05-22 01:33:52] [INFO ] Parsed PT model containing 500 places and 10200 transitions in 555 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 79 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 2414 ms. (steps per millisecond=41 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-05-22 01:33:55] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2020-05-22 01:33:55] [INFO ] Computed 300 place invariants in 22 ms
[2020-05-22 01:33:55] [INFO ] [Real]Absence check using 200 positive place invariants in 106 ms returned sat
[2020-05-22 01:33:55] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 51 ms returned sat
[2020-05-22 01:33:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:33:56] [INFO ] [Real]Absence check using state equation in 560 ms returned sat
[2020-05-22 01:33:56] [INFO ] State equation strengthened by 100 read => feed constraints.
[2020-05-22 01:33:56] [INFO ] [Real]Added 100 Read/Feed constraints in 41 ms returned sat
[2020-05-22 01:33:56] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 260 ms.
[2020-05-22 01:33:57] [INFO ] Added : 0 causal constraints over 0 iterations in 329 ms. Result :sat
[2020-05-22 01:33:58] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-22 01:33:58] [INFO ] Flatten gal took : 909 ms
FORMULA Dekker-PT-100-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 01:33:59] [INFO ] Flatten gal took : 661 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 01:34:00] [INFO ] Applying decomposition
[2020-05-22 01:34:01] [INFO ] Input system was already deterministic with 10200 transitions.
[2020-05-22 01:34:01] [INFO ] Too many transitions (10200) to apply POR reductions. Disabling POR matrices.
[2020-05-22 01:34:01] [INFO ] Flatten gal took : 651 ms
[2020-05-22 01:34:01] [INFO ] Built C files in 1738ms 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/graph15479730122213220320.txt, -o, /tmp/graph15479730122213220320.bin, -w, /tmp/graph15479730122213220320.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/graph15479730122213220320.bin, -l, -1, -v, -w, /tmp/graph15479730122213220320.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 01:34:02] [INFO ] Decomposing Gal with order
[2020-05-22 01:34:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 01:34:03] [INFO ] Removed a total of 33261 redundant transitions.
[2020-05-22 01:34:03] [INFO ] Flatten gal took : 836 ms
[2020-05-22 01:34:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 261 ms.
[2020-05-22 01:34:04] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 56 ms
[2020-05-22 01:34:04] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.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/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.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/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 12 LTL properties
Checking formula 0 : !((X((G("(((u34.flag_1_40!=1)||(i32.u111.flag_1_49!=1))||(u34.p1_40!=1))"))&&(((G("(((u34.flag_1_40==1)&&(i93.u127.flag_1_79==1))&&(u34.p1_40==1))"))||("(((i30.u106.flag_1_43==1)&&(u51.flag_1_62==1))&&(u51.p1_62==1))"))||("(((u4.flag_1_7==1)&&(u15.flag_1_20==1))&&(u4.p1_7==1))")))))
Formula 0 simplified : !X(G"(((u34.flag_1_40!=1)||(i32.u111.flag_1_49!=1))||(u34.p1_40!=1))" & ("(((i30.u106.flag_1_43==1)&&(u51.flag_1_62==1))&&(u51.p1_62==1))" | "(((u4.flag_1_7==1)&&(u15.flag_1_20==1))&&(u4.p1_7==1))" | G"(((u34.flag_1_40==1)&&(i93.u127.flag_1_79==1))&&(u34.p1_40==1))"))
built 4951 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.
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.
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_1, u2.exit_5, u4.exit_7, u7.exit_11, u9.exit_13, u12.exit_17, u13.exit_18, u14.exit_19, u15.exit_20, u16.exit_21, u18.exit_23, u19.exit_24, u20.exit_25, u21.exit_26, u26.exit_32, u27.exit_34, u29.exit_36, u34.exit_40, u35.exit_41, u42.exit_50, u46.exit_53, u47.exit_54, u50.exit_61, u51.exit_62, u54.exit_65, u55.exit_67, u56.exit_68, u58.exit_72, u60.exit_74, u61.exit_75, u62.exit_76, u64.exit_78, u67.exit_81, u69.exit_84, u70.exit_85, u75.exit_89, u76.exit_90, u77.exit_92, u78.exit_93, u80.exit_95, u84.exit_2, u85.exit_3, u86.exit_4, u89.exit_9, u92.exit_14, u97.exit_28, u101.exit_33, u105.exit_42, u107.exit_44, u108.exit_45, u114.exit_56, u115.exit_57, u116.exit_58, u118.exit_60, u121.exit_66, u123.exit_70, u124.exit_71, u130.exit_83, u133.exit_91, u138.exit_99, i4.exit_8, i5.exit_10, i8.exit_15, i9.exit_16, i15.exit_22, i20.exit_27, i21.exit_29, i22.exit_30, i23.exit_31, i27.exit_39, i30.exit_43, i31.exit_47, i32.exit_49, i34.exit_51, i48.exit_82, i51.exit_86, i52.exit_88, i58.exit_96, i59.exit_97, i60.exit_98, i64.exit_6, i66.exit_12, i70.exit_35, i71.exit_37, i72.exit_38, i76.exit_46, i77.exit_48, i78.exit_52, i79.exit_55, i83.exit_59, i85.exit_63, i86.exit_64, i88.exit_69, i91.exit_73, i92.exit_77, i93.exit_79, i94.exit_80, i96.exit_87, i98.exit_94, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/10100/100/10200
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1689 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,17.8569,426752,1,0,1.20648e+06,5186,79541,540532,433,7525,1466131
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Dekker-PT-100-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((("(((u123.flag_1_70==1)&&(u75.flag_1_89==1))&&(u75.p1_89==1))")U((X(((F("(((i88.u122.flag_1_69==1)&&(u138.flag_1_99==1))&&(i88.u57.p1_69==1))"))U(X("(((u85.flag_1_3==1)&&(i23.u25.flag_1_31==1))&&(u85.p1_3==1))")))||("(((u123.flag_1_70==1)&&(u75.flag_1_89==1))&&(u75.p1_89==1))")))||(X(G(X("(((i88.u122.flag_1_69==1)&&(u138.flag_1_99==1))&&(i88.u57.p1_69==1))")))))))
Formula 1 simplified : !("(((u123.flag_1_70==1)&&(u75.flag_1_89==1))&&(u75.p1_89==1))" U (X("(((u123.flag_1_70==1)&&(u75.flag_1_89==1))&&(u75.p1_89==1))" | (F"(((i88.u122.flag_1_69==1)&&(u138.flag_1_99==1))&&(i88.u57.p1_69==1))" U X"(((u85.flag_1_3==1)&&(i23.u25.flag_1_31==1))&&(u85.p1_3==1))")) | XGX"(((i88.u122.flag_1_69==1)&&(u138.flag_1_99==1))&&(i88.u57.p1_69==1))"))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
168 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,19.5418,458872,1,0,1.211e+06,5186,81187,548146,433,7525,1479522
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Dekker-PT-100-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((G("(((i15.u17.flag_1_22!=1)||(i59.u82.flag_1_97!=1))||(i15.u95.p1_22!=1))"))U(F(G((((G((F("(((u84.flag_1_2==1)&&(i76.u37.flag_1_46==1))&&(u84.p1_2==1))"))||("(((u15.flag_1_20==1)&&(u70.flag_1_85==1))&&(u70.p1_85==1))")))&&("(u2.flag_1_5==1)"))&&("(u69.flag_1_84==1)"))&&("(u2.p1_5==1)"))))))
Formula 2 simplified : !(G"(((i15.u17.flag_1_22!=1)||(i59.u82.flag_1_97!=1))||(i15.u95.p1_22!=1))" U FG("(u2.flag_1_5==1)" & "(u2.p1_5==1)" & "(u69.flag_1_84==1)" & G("(((u15.flag_1_20==1)&&(u70.flag_1_85==1))&&(u70.p1_85==1))" | F"(((u84.flag_1_2==1)&&(i76.u37.flag_1_46==1))&&(u84.p1_2==1))")))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
255 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,22.0976,482428,1,0,1.21648e+06,5186,82703,555169,435,7525,1491963
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Dekker-PT-100-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(((F("(((u92.flag_1_14==1)&&(u69.flag_1_84==1))&&(u69.p1_84==1))"))U("(((i71.u103.flag_1_37==1)&&(u64.flag_1_78==1))&&(u64.p1_78==1))"))U(!(X(G(!(G((X("(((u58.flag_1_72==1)&&(i93.u127.flag_1_79==1))&&(u58.p1_72==1))"))U("(((i71.u103.flag_1_37==1)&&(u64.flag_1_78==1))&&(u64.p1_78==1))"))))))))))
Formula 3 simplified : (F"(((u92.flag_1_14==1)&&(u69.flag_1_84==1))&&(u69.p1_84==1))" U "(((i71.u103.flag_1_37==1)&&(u64.flag_1_78==1))&&(u64.p1_78==1))") U !XG!G(X"(((u58.flag_1_72==1)&&(i93.u127.flag_1_79==1))&&(u58.p1_72==1))" U "(((i71.u103.flag_1_37==1)&&(u64.flag_1_78==1))&&(u64.p1_78==1))")
2 unique states visited
2 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
136 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,23.4508,514096,1,0,1.22077e+06,5186,84350,560690,435,7525,1500651
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Dekker-PT-100-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((X(X(((((((!(F("(((u9.flag_1_13==1)&&(u47.flag_1_54==1))&&(u9.p1_13==1))")))||("(u20.flag_1_25!=1)"))||("(u77.flag_1_92!=1)"))||("(u20.p1_25!=1)"))||("(u9.flag_1_13!=1)"))||("(u47.flag_1_54!=1)"))||("(u9.p1_13!=1)"))))&&(F((((G("(((u20.flag_1_25==1)&&(u77.flag_1_92==1))&&(u20.p1_25==1))"))&&("(u9.flag_1_13==1)"))&&("(u47.flag_1_54==1)"))&&("(u9.p1_13==1)")))))
Formula 4 simplified : !(XX("(u9.flag_1_13!=1)" | "(u9.p1_13!=1)" | "(u20.flag_1_25!=1)" | "(u20.p1_25!=1)" | "(u47.flag_1_54!=1)" | "(u77.flag_1_92!=1)" | !F"(((u9.flag_1_13==1)&&(u47.flag_1_54==1))&&(u9.p1_13==1))") & F("(u9.flag_1_13==1)" & "(u9.p1_13==1)" & "(u47.flag_1_54==1)" & G"(((u20.flag_1_25==1)&&(u77.flag_1_92==1))&&(u20.p1_25==1))"))
5 unique states visited
3 strongly connected components in search stack
5 transitions explored
3 items max in DFS search stack
296 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,26.4339,559768,1,0,1.23897e+06,5186,87185,583675,438,7525,1539428
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Dekker-PT-100-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(G("(((u76.flag_1_90==1)&&(i58.u135.flag_1_96==1))&&(u76.p1_90==1))"))))
Formula 5 simplified : !FG"(((u76.flag_1_90==1)&&(i58.u135.flag_1_96==1))&&(u76.p1_90==1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
223 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,28.6697,632632,1,0,1.41772e+06,5186,87230,801946,438,7525,1885815
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Dekker-PT-100-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(!(F(!(X(!(F("(((u84.flag_1_2==1)&&(u138.flag_1_99==1))&&(u138.p1_99==1))")))))))))
Formula 6 simplified : !G!F!X!F"(((u84.flag_1_2==1)&&(u138.flag_1_99==1))&&(u138.p1_99==1))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,29.3425,647416,1,0,1.41976e+06,5186,87607,805938,438,7525,1894166
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Dekker-PT-100-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X((!(F(("(((i30.u106.flag_1_43==1)&&(u47.flag_1_54==1))&&(i30.u36.p1_43==1))")U("(((i66.u8.flag_1_12==1)&&(i20.u22.flag_1_27==1))&&(i66.u91.p1_12==1))"))))&&("(((i30.u106.flag_1_43!=1)||(u47.flag_1_54!=1))||(i30.u36.p1_43!=1))"))))
Formula 7 simplified : !X("(((i30.u106.flag_1_43!=1)||(u47.flag_1_54!=1))||(i30.u36.p1_43!=1))" & !F("(((i30.u106.flag_1_43==1)&&(u47.flag_1_54==1))&&(i30.u36.p1_43==1))" U "(((i66.u8.flag_1_12==1)&&(i20.u22.flag_1_27==1))&&(i66.u91.p1_12==1))"))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
373 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,33.0716,671968,1,0,1.42801e+06,5186,88961,817628,438,7525,1913591
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Dekker-PT-100-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((G(X(X("(((i64.u3.flag_1_6!=1)||(u46.flag_1_53!=1))||(u46.p1_53!=1))"))))U(F("(((u115.flag_1_57==1)&&(u121.flag_1_66==1))&&(u121.p1_66==1))"))))
Formula 8 simplified : !(GXX"(((i64.u3.flag_1_6!=1)||(u46.flag_1_53!=1))||(u46.p1_53!=1))" U F"(((u115.flag_1_57==1)&&(u121.flag_1_66==1))&&(u121.p1_66==1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
16 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,33.2375,673816,1,0,1.42865e+06,5186,89099,818563,438,7525,1915296
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Dekker-PT-100-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(!(F("(((i72.u104.flag_1_38==1)&&(u78.flag_1_93==1))&&(u78.p1_93==1))")))))
Formula 9 simplified : !F!F"(((i72.u104.flag_1_38==1)&&(u78.flag_1_93==1))&&(u78.p1_93==1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
134 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,34.5734,705496,1,0,1.47167e+06,5186,89753,873592,438,7525,1993937
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Dekker-PT-100-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G((((G((F(X("(((u20.flag_1_25==1)&&(i72.u104.flag_1_38==1))&&(i72.u31.p1_38==1))")))||("((u101.flag_0_33==1)&&(u101.p0_33==1))")))||(G("(((u20.flag_1_25==1)&&(i72.u104.flag_1_38==1))&&(i72.u31.p1_38==1))")))||("(((u29.flag_1_36==1)&&(i76.u37.flag_1_46==1))&&(u29.p1_36==1))"))||("(((u89.flag_1_9==1)&&(i30.u106.flag_1_43==1))&&(i30.u36.p1_43==1))"))))
Formula 10 simplified : !G("(((u29.flag_1_36==1)&&(i76.u37.flag_1_46==1))&&(u29.p1_36==1))" | "(((u89.flag_1_9==1)&&(i30.u106.flag_1_43==1))&&(i30.u36.p1_43==1))" | G("((u101.flag_0_33==1)&&(u101.p0_33==1))" | FX"(((u20.flag_1_25==1)&&(i72.u104.flag_1_38==1))&&(i72.u31.p1_38==1))") | G"(((u20.flag_1_25==1)&&(i72.u104.flag_1_38==1))&&(i72.u31.p1_38==1))")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
69 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,35.2548,724240,1,0,1.4752e+06,5186,90501,878432,443,7525,2001487
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Dekker-PT-100-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F((F("(((i5.u90.flag_1_10==1)&&(i86.u53.flag_1_64==1))&&(i86.u120.p1_64==1))"))U("(((i52.u74.flag_1_88==1)&&(i60.u83.flag_1_98==1))&&(i52.u132.p1_88==1))"))))
Formula 11 simplified : !F(F"(((i5.u90.flag_1_10==1)&&(i86.u53.flag_1_64==1))&&(i86.u120.p1_64==1))" U "(((i52.u74.flag_1_88==1)&&(i60.u83.flag_1_98==1))&&(i52.u132.p1_88==1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
95 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,36.207,743248,1,0,1.48012e+06,5186,91473,883991,443,7525,2012173
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Dekker-PT-100-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1590111284243

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-100"
export BK_EXAMINATION="LTLFireability"
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-100, examination is LTLFireability"
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-158922814200338"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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