Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r193-csrt-159033389200754.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 EGFr-PT-10421, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-csrt-159033389200754
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 892K
-rw-r--r-- 1 mcc users 4.2K May 14 00:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 14 00:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 13 17:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K May 13 17:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 12 20:53 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 12 20:53 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 14 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 14 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 13 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 13 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 13 07:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 07:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:53 equiv_col
-rw-r--r-- 1 mcc users 6 May 12 20:53 instance
-rw-r--r-- 1 mcc users 6 May 12 20:53 iscolored
-rw------- 1 mcc users 672K May 12 20:53 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 EGFr-PT-10421-00
FORMULA_NAME EGFr-PT-10421-01
FORMULA_NAME EGFr-PT-10421-02
FORMULA_NAME EGFr-PT-10421-03
FORMULA_NAME EGFr-PT-10421-04
FORMULA_NAME EGFr-PT-10421-05
FORMULA_NAME EGFr-PT-10421-06
FORMULA_NAME EGFr-PT-10421-07
FORMULA_NAME EGFr-PT-10421-08
FORMULA_NAME EGFr-PT-10421-09
FORMULA_NAME EGFr-PT-10421-10
FORMULA_NAME EGFr-PT-10421-11
FORMULA_NAME EGFr-PT-10421-12
FORMULA_NAME EGFr-PT-10421-13
FORMULA_NAME EGFr-PT-10421-14
FORMULA_NAME EGFr-PT-10421-15

=== Now, execution of the tool begins

BK_START 1590556278829

[2020-05-27 05:11:21] [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-27 05:11:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 05:11:21] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2020-05-27 05:11:21] [INFO ] Transformed 208 places.
[2020-05-27 05:11:21] [INFO ] Transformed 378 transitions.
[2020-05-27 05:11:21] [INFO ] Parsed PT model containing 208 places and 378 transitions in 289 ms.
Deduced a syphon composed of 49 places in 4 ms
Reduce places removed 77 places and 239 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 63 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 395 ms. (steps per millisecond=253 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0]
[2020-05-27 05:11:22] [INFO ] Flow matrix only has 106 transitions (discarded 33 similar events)
// Phase 1: matrix 106 rows 131 cols
[2020-05-27 05:11:22] [INFO ] Computed 76 place invariants in 7 ms
[2020-05-27 05:11:22] [INFO ] [Real]Absence check using 76 positive place invariants in 55 ms returned sat
[2020-05-27 05:11:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:11:22] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2020-05-27 05:11:22] [INFO ] State equation strengthened by 54 read => feed constraints.
[2020-05-27 05:11:22] [INFO ] [Real]Added 54 Read/Feed constraints in 24 ms returned sat
[2020-05-27 05:11:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:11:23] [INFO ] [Nat]Absence check using 76 positive place invariants in 72 ms returned sat
[2020-05-27 05:11:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:11:23] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2020-05-27 05:11:23] [INFO ] [Nat]Added 54 Read/Feed constraints in 6 ms returned sat
[2020-05-27 05:11:23] [INFO ] Computed and/alt/rep : 129/147/96 causal constraints in 33 ms.
[2020-05-27 05:11:23] [INFO ] Added : 69 causal constraints over 14 iterations in 377 ms. Result :sat
[2020-05-27 05:11:23] [INFO ] [Real]Absence check using 76 positive place invariants in 20 ms returned sat
[2020-05-27 05:11:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:11:23] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2020-05-27 05:11:23] [INFO ] [Real]Added 54 Read/Feed constraints in 9 ms returned sat
[2020-05-27 05:11:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:11:23] [INFO ] [Nat]Absence check using 76 positive place invariants in 25 ms returned sat
[2020-05-27 05:11:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:11:23] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2020-05-27 05:11:23] [INFO ] [Nat]Added 54 Read/Feed constraints in 7 ms returned sat
[2020-05-27 05:11:23] [INFO ] Computed and/alt/rep : 129/147/96 causal constraints in 9 ms.
[2020-05-27 05:11:23] [INFO ] Added : 69 causal constraints over 14 iterations in 146 ms. Result :sat
[2020-05-27 05:11:24] [INFO ] Found a total of 21 fixed domain variables (out of 131 variables) in GAL type petri
[2020-05-27 05:11:24] [INFO ] Found a total of 21 constant array cells/variables (out of 131 variables) in type petri
[2020-05-27 05:11:24] [INFO ] erbb14_equals_0,stat5_equals_0,rab5a_equals_0,raf1_equals_0,akt_equals_0,rin1_equals_0,stat3_equals_0,rntre_equals_0,sos1_equals_0,p70s6_2_equals_0,ras_equals_0,mtor_rap_equals_0,stat1_equals_0,pi34p2_equals_0,ship2d_equals_0,erbb34_equals_0,mtor_ric_equals_0,sos1_eps8_e3b1_equals_0,aktd_equals_0,ptend_equals_0,endocyt_degrad_equals_0,
[2020-05-27 05:11:24] [INFO ] Removed 21 constant variables :erbb14_equals_0=1, stat5_equals_0=1, rab5a_equals_0=1, raf1_equals_0=1, akt_equals_0=1, rin1_equals_0=1, stat3_equals_0=1, rntre_equals_0=1, sos1_equals_0=1, p70s6_2_equals_0=1, ras_equals_0=1, mtor_rap_equals_0=1, stat1_equals_0=1, pi34p2_equals_0=1, ship2d_equals_0=1, erbb34_equals_0=1, mtor_ric_equals_0=1, sos1_eps8_e3b1_equals_0=1, aktd_equals_0=1, ptend_equals_0=1, endocyt_degrad_equals_0=1
[2020-05-27 05:11:24] [INFO ] Simplified 23 expressions due to constant valuations.
[2020-05-27 05:11:24] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-05-27 05:11:24] [INFO ] Flatten gal took : 58 ms
FORMULA EGFr-PT-10421-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-10421-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-10421-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-10421-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-10421-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-10421-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-10421-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-10421-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 05:11:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-27 05:11:24] [INFO ] Flatten gal took : 15 ms
[2020-05-27 05:11:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA EGFr-PT-10421-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
[2020-05-27 05:11:24] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-27 05:11:24] [INFO ] Flatten gal took : 31 ms
[2020-05-27 05:11:24] [INFO ] Input system was already deterministic with 139 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/graph5671171675167836995.txt, -o, /tmp/graph5671171675167836995.bin, -w, /tmp/graph5671171675167836995.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/graph5671171675167836995.bin, -l, -1, -v, -w, /tmp/graph5671171675167836995.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 05:11:24] [INFO ] Decomposing Gal with order
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 106 out of 139 initially.
// Phase 1: matrix 106 rows 110 cols
[2020-05-27 05:11:24] [INFO ] Computed 55 place invariants in 2 ms
inv : erbb24_equals_0 + erbb24_equals_1 = 1
inv : shp2_equals_0 + shp2_equals_1 = 1
inv : elk1_equals_0 + elk1_equals_1 = 1
inv : actin_reorg_0 + actin_reorg_equals_1 = 1
inv : gsk3_equals_0 + gsk3_equals_1 = 1
inv : mkk4_equals_0 + mkk4_equals_1 = 1
inv : mkk7_equals_0 + mkk7_equals_1 = 1
inv : pip3_equals_0 + pip3_equals_1 = 1
inv : mekk4_equals_0 + mekk4_equals_1 = 1
inv : ca_equals_0 + ca_equals_1 = 1
inv : nucerk12_equals_0 + nucerk12_equals_1 = 1
inv : rasgap_equals_0 + rasgap_equals_1 = 1
inv : jnk_equals_0 + jnk_equals_1 = 1
inv : bad_equals_0 + bad_equals_1 = 1
inv : cmyc_equals_0 + cmyc_equals_1 = 1
inv : creb_equals_0 + creb_equals_1 = 1
inv : gab1_equals_0 + gab1_equals_1 = 1
inv : limk1_equals_0 + limk1_equals_1 = 1
inv : pak1_equals_0 + pak1_equals_1 = 1
inv : nck_equals_0 + nck_equals_1 = 1
inv : shp1_equals_0 + shp1_equals_1 = 1
inv : hsp27_equals_0 + hsp27_equals_1 = 1
inv : erbb13_equals_0 + erbb13_equals_1 = 1
inv : mkk3_equals_0 + mkk3_equals_1 = 1
inv : cfos_equals_0 + cfos_equals_1 = 1
inv : tsc1_tsc2_equals_0 + tsc1_tsc2_equals_1 = 1
inv : p70s6_1_equals_0 + p70s6_1_equals_1 = 1
inv : pro_apoptotic_equals_0 + pro_apoptotic_equals_1 = 1
inv : mkk6_equals_0 + mkk6_equals_1 = 1
inv : ccbl_equals_0 + ccbl_equals_1 = 1
inv : erbb23_equals_0 + erbb23_equals_1 = 1
inv : erbb44_equals_0 + erbb44_equals_1 = 1
inv : mekk1_equals_0 + mekk1_equals_1 = 1
inv : p38_equals_0 + p38_equals_1 = 1
inv : rac_cdc42_equals_0 + rac_cdc42_equals_1 = 1
inv : rheb_equals_0 + rheb_equals_1 = 1
inv : grb2_equals_0 + grb2_equals_1 = 1
inv : erbb11_equals_0 + erbb11_equals_1 = 1
inv : shp1d_equals_0 + shp1d_equals_1 = 1
inv : p90rskerk12d_equals_0 + p90rskerk12d_equals_1 = 1
inv : pkc_equals_0 + pkc_equals_1 = 1
inv : vav2_equals_0 + vav2_equals_1 = 1
inv : erbb12_equals_0 + erbb12_equals_1 = 1
inv : mk2_equals_0 + mk2_equals_1 = 1
inv : ip3_equals_0 + ip3_equals_1 = 1
inv : p90rsk_equals_0 + p90rsk_equals_1 = 1
inv : plcg_equals_0 + plcg_equals_1 = 1
inv : cjun_equals_0 + cjun_equals_1 = 1
inv : erk12_equals_0 + erk12_equals_1 = 1
inv : mek12_equals_0 + mek12_equals_1 = 1
inv : ap1_equals_0 + ap1_equals_1 = 1
inv : dag_equals_0 + dag_equals_1 = 1
inv : mlk3_equals_0 + mlk3_equals_1 = 1
inv : shc_equals_0 + shc_equals_1 = 1
inv : pi3k_equals_0 + pi3k_equals_1 = 1
Total of 55 invariants.
[2020-05-27 05:11:24] [INFO ] Computed 55 place invariants in 4 ms
[2020-05-27 05:11:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 05:11:24] [INFO ] Removed a total of 126 redundant transitions.
[2020-05-27 05:11:24] [INFO ] Flatten gal took : 76 ms
[2020-05-27 05:11:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 11 ms.
[2020-05-27 05:11:24] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 12 ms
[2020-05-27 05:11:24] [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 7 LTL properties
[2020-05-27 05:11:24] [INFO ] Proved 110 variables to be positive in 258 ms
[2020-05-27 05:11:24] [INFO ] Computing symmetric may disable matrix : 139 transitions.
[2020-05-27 05:11:24] [INFO ] Computation of disable matrix completed :0/139 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 05:11:24] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 05:11:24] [INFO ] Computing symmetric may enable matrix : 139 transitions.
[2020-05-27 05:11:24] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Checking formula 0 : !((X(G(F(((!(G(X(G("((i5.u33.mlk3_equals_1>=1)&&(i4.i1.u46.rac_cdc42_equals_0>=1))")))))&&("(i5.u33.mlk3_equals_1>=1)"))&&("(i4.i1.u46.rac_cdc42_equals_0>=1)"))))))
Formula 0 simplified : !XGF("(i4.i1.u46.rac_cdc42_equals_0>=1)" & "(i5.u33.mlk3_equals_1>=1)" & !GXG"((i5.u33.mlk3_equals_1>=1)&&(i4.i1.u46.rac_cdc42_equals_0>=1))")
built 20 ordering constraints for composite.
built 3 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 16 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 16 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 26 ordering constraints for composite.
built 13 ordering constraints for composite.
built 1 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions i1.i1.erbb11_equals_0_to_erbb11_equals_1_when_erbb1_equals_1_and_hbegf_equals_1_and_shp1d_equals_0, i1.i1.erbb11_equals_1_to_erbb11_equals_0_when_shp1d_equals_1, i1.i1.shp1_equals_0_to_shp1_equals_1_when_erbb11_equals_1, i1.i1.shp1_equals_1_to_shp1_equals_0_when_erbb11_equals_0, i1.i1.shp1d_equals_0_to_shp1d_equals_1_when_shp1_equals_1, i1.i1.shp1d_equals_1_to_shp1d_equals_0_when_shp1_equals_0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/128/6/134
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,0.365509,24092,1,0,11937,54,1840,33270,45,53,22152
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA EGFr-PT-10421-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(F((((X(F(G(F("(((i6.i0.u7.cmyc_equals_0>=1)&&(i6.i1.u20.gsk3_equals_0>=1))&&(i6.i0.u35.nucerk12_equals_1>=1))")))))&&("(i6.i0.u7.cmyc_equals_0>=1)"))&&("(i6.i1.u20.gsk3_equals_0>=1)"))&&("(i6.i0.u35.nucerk12_equals_1>=1)")))))
Formula 1 simplified : !XF("(i6.i0.u7.cmyc_equals_0>=1)" & "(i6.i0.u35.nucerk12_equals_1>=1)" & "(i6.i1.u20.gsk3_equals_0>=1)" & XFGF"(((i6.i0.u7.cmyc_equals_0>=1)&&(i6.i1.u20.gsk3_equals_0>=1))&&(i6.i0.u35.nucerk12_equals_1>=1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
9 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,0.454691,27576,1,0,18258,54,1888,52179,45,53,33510
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA EGFr-PT-10421-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(X(X("((i3.u1.ap1_equals_1>=1)&&(i3.u6.cjun_equals_0>=1))")))))
Formula 2 simplified : XX"((i3.u1.ap1_equals_1>=1)&&(i3.u6.cjun_equals_0>=1))"
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 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,0.455497,27840,1,0,18258,54,1897,52179,45,53,33540
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA EGFr-PT-10421-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((F(F("((i1.i1.u4.ccbl_equals_0<1)||(i1.i1.u11.erbb11_equals_1<1))")))&&(X("((i1.i1.u4.ccbl_equals_0>=1)&&(i1.i1.u11.erbb11_equals_1>=1))"))))
Formula 3 simplified : !(F"((i1.i1.u4.ccbl_equals_0<1)||(i1.i1.u11.erbb11_equals_1<1))" & X"((i1.i1.u4.ccbl_equals_0>=1)&&(i1.i1.u11.erbb11_equals_1>=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,0.4715,27840,1,0,18492,54,1920,52623,45,53,34351
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA EGFr-PT-10421-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((G("((i8.u12.erbb12_equals_1>=1)&&(i8.u19.grb2_equals_0>=1))"))U(X((((G(X("((i8.u12.erbb12_equals_1>=1)&&(i8.u19.grb2_equals_0>=1))")))&&("(i8.u12.erbb12_equals_1>=1)"))&&("(i8.u19.grb2_equals_0>=1)"))||("(((i3.u5.cfos_equals_0>=1)&&(i6.i1.u17.erk12_equals_0>=1))&&(i3.u23.jnk_equals_1>=1))")))))
Formula 4 simplified : !(G"((i8.u12.erbb12_equals_1>=1)&&(i8.u19.grb2_equals_0>=1))" U X("(((i3.u5.cfos_equals_0>=1)&&(i6.i1.u17.erk12_equals_0>=1))&&(i3.u23.jnk_equals_1>=1))" | ("(i8.u12.erbb12_equals_1>=1)" & "(i8.u19.grb2_equals_0>=1)" & GX"((i8.u12.erbb12_equals_1>=1)&&(i8.u19.grb2_equals_0>=1))")))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,0.503957,29456,1,0,20667,54,1986,57674,45,53,38165
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA EGFr-PT-10421-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G("((((i3.u5.cfos_equals_1<1)||(i6.i1.u17.erk12_equals_1<1))||(i3.u23.jnk_equals_0<1))||(i6.i1.u38.p90rsk_equals_0<1))")))
Formula 5 simplified : !G"((((i3.u5.cfos_equals_1<1)||(i6.i1.u17.erk12_equals_1<1))||(i3.u23.jnk_equals_0<1))||(i6.i1.u38.p90rsk_equals_0<1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
9 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,0.604938,33416,1,0,28639,54,2027,79219,45,53,49375
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA EGFr-PT-10421-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(F("((((i8.u13.erbb13_equals_0>=1)&&(i8.u14.erbb23_equals_0>=1))&&(i9.u18.gab1_equals_0>=1))&&(i9.u41.pi3k_equals_1>=1))"))))
Formula 6 simplified : F"((((i8.u13.erbb13_equals_0>=1)&&(i8.u14.erbb23_equals_0>=1))&&(i9.u18.gab1_equals_0>=1))&&(i9.u41.pi3k_equals_1>=1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
18 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,0.785203,39752,1,0,40547,54,2054,114027,45,53,63465
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA EGFr-PT-10421-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds Could not set logic :(error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
java.lang.RuntimeException: Could not set logic :(error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.buildSolver(NecessaryEnablingsolver.java:104)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:662)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:512)
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-27 05:11:25] [INFO ] Built C files in 1346ms 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 1590556285980

--------------------
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="EGFr-PT-10421"
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 EGFr-PT-10421, 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 r193-csrt-159033389200754"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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