Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2019-input.r085-csrt-155246555100844.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-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-3954
Executing tool itstools
Input is IBM703-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r085-csrt-155246555100844
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 4.6K Feb 11 05:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 11 05:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 7 05:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 7 05:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 101 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 339 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 3.8K Feb 5 00:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Feb 5 00:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 10K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 3 11:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 3 11:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jan 31 06:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Jan 31 06:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 193K Mar 10 17:31 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 IBM703-PT-none-LTLFireability-00
FORMULA_NAME IBM703-PT-none-LTLFireability-01
FORMULA_NAME IBM703-PT-none-LTLFireability-02
FORMULA_NAME IBM703-PT-none-LTLFireability-03
FORMULA_NAME IBM703-PT-none-LTLFireability-04
FORMULA_NAME IBM703-PT-none-LTLFireability-05
FORMULA_NAME IBM703-PT-none-LTLFireability-06
FORMULA_NAME IBM703-PT-none-LTLFireability-07
FORMULA_NAME IBM703-PT-none-LTLFireability-08
FORMULA_NAME IBM703-PT-none-LTLFireability-09
FORMULA_NAME IBM703-PT-none-LTLFireability-10
FORMULA_NAME IBM703-PT-none-LTLFireability-11
FORMULA_NAME IBM703-PT-none-LTLFireability-12
FORMULA_NAME IBM703-PT-none-LTLFireability-13
FORMULA_NAME IBM703-PT-none-LTLFireability-14
FORMULA_NAME IBM703-PT-none-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1552808732949

Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903111103/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.201903111103/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 16 LTL properties
Checking formula 0 : !(("(task_s00000743_output_s00000264>=1)"))
Formula 0 simplified : !"(task_s00000743_output_s00000264>=1)"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 284 rows 262 cols
invariant :alpha + merge_s00000320_activated + merge_s00000341_activated + merge_s00000450_activated + merge_s00000451_activated + merge_s00000461_activated + merge_s00000452_activated + merge_s00000462_activated + merge_s00000453_activated + merge_s00000454_activated + merge_s00000445_activated + merge_s00000319_activated + merge_s00000283_activated + merge_s00000806_activated + merge_s00000455_activated + merge_s00000446_activated + merge_s00000456_activated + merge_s00000457_activated + merge_s00000458_activated + merge_s00000449_activated + merge_s00000288_activated + task_s00000710_input_s00000263 + task_s00000720_input_s00000263 + task_s00000711_input_s00000263 + task_s00000730_input_s00000263 + task_s00000721_input_s00000263 + task_s00000740_input_s00000263 + task_s00000722_input_s00000263 + task_s00000704_input_s00000263 + task_s00000741_input_s00000263 + task_s00000723_input_s00000263 + task_s00000714_input_s00000263 + task_s00000705_input_s00000263 + task_s00000760_input_s00000263 + task_s00000724_input_s00000263 + task_s00000715_input_s00000263 + task_s00000706_input_s00000263 + fork_s00000464_input_s00000263 + task_s00000761_input_s00000263 + task_s00000725_input_s00000263 + task_s00000716_input_s00000263 + task_s00000707_input_s00000263 + fork_s00000465_input_s00000263 + task_s00000762_input_s00000263 + task_s00000753_input_s00000263 + task_s00000744_input_s00000263 + task_s00000726_input_s00000263 + task_s00000763_input_s00000263 + task_s00000745_input_s00000263 + task_s00000727_input_s00000263 + task_s00000709_input_s00000263 + task_s00000755_input_s00000263 + task_s00000746_input_s00000263 + task_s00000728_input_s00000263 + task_s00000719_input_s00000263 + task_s00000756_input_s00000263 + task_s00000738_input_s00000263 + task_s00000729_input_s00000263 + task_s00000757_input_s00000263 + task_s00000739_input_s00000263 + merge_s00000320_input_s00000290 + merge_s00000320_input_s00000263 + merge_s00000341_input_s00000263 + merge_s00000461_input_s00000263 + merge_s00000453_input_s00000290 + merge_s00000453_input_s00000263 + merge_s00000341_input_s00000285 + merge_s00000319_input_s00000290 + merge_s00000319_input_s00000263 + merge_s00000283_input_s00000263 + merge_s00000455_input_s00000290 + merge_s00000455_input_s00000263 + merge_s00000451_input_s00000285 + merge_s00000446_input_s00000290 + merge_s00000446_input_s00000263 + merge_s00000456_input_s00000290 + merge_s00000456_input_s00000263 + merge_s00000452_input_s00000285 + merge_s00000462_input_s00000285 + merge_s00000458_input_s00000263 + merge_s00000446_input_s00000447 + merge_s00000446_input_s00000285 + merge_s00000457_input_s00000285 + merge_s00000458_input_s00000285 + merge_s00000449_input_s00000285 + task_s00000710_output_s00000264 + task_s00000720_output_s00000264 + task_s00000711_output_s00000264 + task_s00000730_output_s00000264 + task_s00000721_output_s00000264 + task_s00000712_output_s00000264 + task_s00000740_output_s00000264 + task_s00000731_output_s00000264 + task_s00000722_output_s00000264 + task_s00000704_output_s00000264 + task_s00000741_output_s00000264 + task_s00000723_output_s00000264 + task_s00000714_output_s00000264 + task_s00000705_output_s00000264 + task_s00000760_output_s00000264 + task_s00000742_output_s00000264 + task_s00000724_output_s00000264 + task_s00000715_output_s00000264 + task_s00000706_output_s00000264 + task_s00000761_output_s00000264 + task_s00000752_output_s00000264 + task_s00000743_output_s00000264 + task_s00000725_output_s00000264 + task_s00000716_output_s00000264 + task_s00000707_output_s00000264 + task_s00000762_output_s00000264 + task_s00000753_output_s00000264 + task_s00000744_output_s00000264 + task_s00000726_output_s00000264 + task_s00000717_output_s00000264 + task_s00000708_output_s00000264 + task_s00000763_output_s00000264 + task_s00000745_output_s00000264 + task_s00000727_output_s00000264 + task_s00000718_output_s00000264 + task_s00000709_output_s00000264 + task_s00000755_output_s00000264 + task_s00000746_output_s00000264 + task_s00000737_output_s00000264 + task_s00000728_output_s00000264 + task_s00000719_output_s00000264 + task_s00000756_output_s00000264 + task_s00000738_output_s00000264 + task_s00000729_output_s00000264 + task_s00000757_output_s00000264 + task_s00000739_output_s00000264 + task_s00000758_output_s00000264 + task_s00000759_output_s00000264 + decision_s00000801_activated + decision_s00000802_activated + decision_s00000803_activated + decision_s00000804_activated + decision_s00000805_activated + decision_s00000780_activated + decision_s00000772_activated + decision_s00000773_activated + decision_s00000764_activated + decision_s00000792_activated + decision_s00000783_activated + decision_s00000774_activated + decision_s00000793_activated + decision_s00000784_activated + decision_s00000775_activated + decision_s00000776_activated + decision_s00000777_activated + decision_s00000768_activated + decision_s00000796_activated + decision_s00000787_activated + decision_s00000778_activated + decision_s00000788_activated + decision_s00000789_activated + decision_s00000799_activated + fork_s00000464_activated_s00000272 + fork_s00000465_activated_s00000272 + fork_s00000463_activated_s00000274 + fork_s00000466_activated_s00000272 + decision_s00000802_input_s00000263 + decision_s00000780_input_s00000263 + decision_s00000773_input_s00000263 + decision_s00000764_input_s00000263 + decision_s00000783_input_s00000263 + decision_s00000793_input_s00000263 + decision_s00000784_input_s00000263 + decision_s00000775_input_s00000263 + decision_s00000796_input_s00000263 + decision_s00000787_input_s00000263 + stopNode_s00000597_input_default + process_s00000030__s00000703_input_s00000263 + callToProcess_s00000807_input_s00000263 + callToProcess_s00000807_output_s00000264 + callToProcess_s00000348_output_s00000264 + callToProcess_s00000808_output_s00000264 + callToProcess_s00000596_output_s00000264 + task_s00000710_inputCriterion_s00000257_used + task_s00000720_inputCriterion_s00000257_used + task_s00000711_inputCriterion_s00000257_used + task_s00000730_inputCriterion_s00000257_used + task_s00000721_inputCriterion_s00000257_used + task_s00000712_inputCriterion_s00000257_used + task_s00000740_inputCriterion_s00000257_used + task_s00000731_inputCriterion_s00000257_used + task_s00000722_inputCriterion_s00000257_used + task_s00000704_inputCriterion_s00000257_used + task_s00000741_inputCriterion_s00000257_used + task_s00000723_inputCriterion_s00000257_used + task_s00000714_inputCriterion_s00000257_used + task_s00000705_inputCriterion_s00000257_used + task_s00000760_inputCriterion_s00000257_used + task_s00000742_inputCriterion_s00000257_used + task_s00000724_inputCriterion_s00000257_used + task_s00000715_inputCriterion_s00000257_used + task_s00000706_inputCriterion_s00000257_used + task_s00000761_inputCriterion_s00000257_used + task_s00000752_inputCriterion_s00000257_used + task_s00000743_inputCriterion_s00000257_used + task_s00000725_inputCriterion_s00000257_used + task_s00000716_inputCriterion_s00000257_used + task_s00000707_inputCriterion_s00000257_used + task_s00000762_inputCriterion_s00000257_used + task_s00000753_inputCriterion_s00000257_used + task_s00000744_inputCriterion_s00000257_used + task_s00000726_inputCriterion_s00000257_used + task_s00000717_inputCriterion_s00000257_used + task_s00000708_inputCriterion_s00000257_used + task_s00000763_inputCriterion_s00000257_used + task_s00000745_inputCriterion_s00000257_used + task_s00000727_inputCriterion_s00000257_used + task_s00000718_inputCriterion_s00000257_used + task_s00000709_inputCriterion_s00000257_used + task_s00000755_inputCriterion_s00000257_used + task_s00000746_inputCriterion_s00000257_used + task_s00000737_inputCriterion_s00000257_used + task_s00000728_inputCriterion_s00000257_used + task_s00000719_inputCriterion_s00000257_used + task_s00000756_inputCriterion_s00000257_used + task_s00000738_inputCriterion_s00000257_used + task_s00000729_inputCriterion_s00000257_used + task_s00000757_inputCriterion_s00000257_used + task_s00000739_inputCriterion_s00000257_used + task_s00000758_inputCriterion_s00000257_used + task_s00000759_inputCriterion_s00000257_used + callToProcess_s00000807_inputCriterion_s00000257_used + callToProcess_s00000348_inputCriterion_s00000257_used + callToProcess_s00000808_inputCriterion_s00000257_used + callToProcess_s00000596_inputCriterion_s00000257_used = 1
Reverse transition relation is NOT exact ! Due to transitions merge_s00000320_activate_s00000284, merge_s00000320_activate_s00000286, merge_s00000451_activate_s00000284, merge_s00000341_activate_s00000286, merge_s00000451_activate_s00000286, merge_s00000319_activate_s00000284, merge_s00000455_activate_s00000284, merge_s00000453_activate_s00000286, merge_s00000446_activate_s00000284, merge_s00000454_activate_s00000286, merge_s00000319_activate_s00000448, merge_s00000319_activate_s00000286, merge_s00000461_activate_s00000289, merge_s00000455_activate_s00000286, merge_s00000446_activate_s00000286, merge_s00000319_activate_s00000289, merge_s00000455_activate_s00000289, merge_s00000449_activate_s00000286, merge_s00000446_activate_s00000289, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/265/19/284
Computing Next relation with stutter on 9 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
213 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.18188,70376,1,0,539,204260,594,474,7239,255996,910
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G((X(F("(task_s00000757_inputCriterion_s00000257_used>=1)")))U(X("(task_s00000739_output_s00000264>=1)")))))
Formula 1 simplified : !G(XF"(task_s00000757_inputCriterion_s00000257_used>=1)" U X"(task_s00000739_output_s00000264>=1)")
Computing Next relation with stutter on 9 deadlock states
111 unique states visited
111 strongly connected components in search stack
112 transitions explored
111 items max in DFS search stack
37 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.55482,80532,1,0,539,205642,608,577,7243,351136,1241
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(((G(X(X("(decision_s00000776_activated>=1)"))))U(G(("(task_s00000712_inputCriterion_s00000257_used>=1)")U("(decision_s00000784_input_s00000263>=1)")))))
Formula 2 simplified : !(GXX"(decision_s00000776_activated>=1)" U G("(task_s00000712_inputCriterion_s00000257_used>=1)" U "(decision_s00000784_input_s00000263>=1)"))
Computing Next relation with stutter on 9 deadlock states
107 unique states visited
107 strongly connected components in search stack
107 transitions explored
107 items max in DFS search stack
139 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.95162,112532,1,0,811,322949,621,915,7250,575562,2436
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((G(F("(task_s00000758_inputCriterion_s00000257_used>=1)"))))
Formula 3 simplified : !GF"(task_s00000758_inputCriterion_s00000257_used>=1)"
Computing Next relation with stutter on 9 deadlock states
110 unique states visited
110 strongly connected components in search stack
111 transitions explored
110 items max in DFS search stack
62 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.57191,127844,1,0,1025,414927,630,1065,7251,677898,2899
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(((F(X(G("(fork_s00000465_activated_s00000272>=1)"))))U("(task_s00000727_output_s00000264>=1)")))
Formula 4 simplified : !(FXG"(fork_s00000465_activated_s00000272>=1)" U "(task_s00000727_output_s00000264>=1)")
Computing Next relation with stutter on 9 deadlock states
106 unique states visited
106 strongly connected components in search stack
106 transitions explored
106 items max in DFS search stack
262 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.18882,181228,1,0,1550,688070,640,1704,7253,1.16122e+06,4321
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(("(task_s00000709_input_s00000263>=1)"))
Formula 5 simplified : !"(task_s00000709_input_s00000263>=1)"
Computing Next relation with stutter on 9 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.1898,181228,1,0,1550,688070,643,1704,7254,1.16122e+06,4323
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((G(X(X(G(F("(task_s00000719_input_s00000263>=1)")))))))
Formula 6 simplified : !GXXGF"(task_s00000719_input_s00000263>=1)"
Computing Next relation with stutter on 9 deadlock states
110 unique states visited
110 strongly connected components in search stack
111 transitions explored
110 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,7.28993,184132,1,0,1694,703250,652,1803,7255,1.17927e+06,4694
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((G(G(G(("(decision_s00000793_input_s00000263>=1)")U("(task_s00000715_output_s00000264>=1)"))))))
Formula 7 simplified : !G("(decision_s00000793_input_s00000263>=1)" U "(task_s00000715_output_s00000264>=1)")
Computing Next relation with stutter on 9 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.29198,184392,1,0,1694,703250,668,1803,7264,1.17927e+06,4701
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !(("(merge_s00000446_input_s00000285>=1)"))
Formula 8 simplified : !"(merge_s00000446_input_s00000285>=1)"
Computing Next relation with stutter on 9 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.29238,184392,1,0,1694,703250,671,1803,7265,1.17927e+06,4703
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((G(G(X(("(merge_s00000319_input_s00000290>=1)")U("(task_s00000759_output_s00000264>=1)"))))))
Formula 9 simplified : !GX("(merge_s00000319_input_s00000290>=1)" U "(task_s00000759_output_s00000264>=1)")
Computing Next relation with stutter on 9 deadlock states
111 unique states visited
111 strongly connected components in search stack
112 transitions explored
111 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.29406,184392,1,0,1694,703250,681,1803,7271,1.17927e+06,4707
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(((X(G("(decision_s00000780_activated>=1)")))U(G(F("(decision_s00000784_activated>=1)")))))
Formula 10 simplified : !(XG"(decision_s00000780_activated>=1)" U GF"(decision_s00000784_activated>=1)")
Computing Next relation with stutter on 9 deadlock states
110 unique states visited
110 strongly connected components in search stack
111 transitions explored
110 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,7.39958,187028,1,0,1797,718254,690,1876,7272,1.19632e+06,5041
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((G(G((G("(task_s00000716_inputCriterion_s00000257_used>=1)"))U(X("(task_s00000756_inputCriterion_s00000257_used>=1)"))))))
Formula 11 simplified : !G(G"(task_s00000716_inputCriterion_s00000257_used>=1)" U X"(task_s00000756_inputCriterion_s00000257_used>=1)")
Computing Next relation with stutter on 9 deadlock states
111 unique states visited
111 strongly connected components in search stack
112 transitions explored
111 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,7.68812,193364,1,0,1852,748587,697,1917,7274,1.23079e+06,5327
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((X(("(task_s00000760_input_s00000263>=1)")U(("(decision_s00000793_activated>=1)")U("(merge_s00000457_activated>=1)")))))
Formula 12 simplified : !X("(task_s00000760_input_s00000263>=1)" U ("(decision_s00000793_activated>=1)" U "(merge_s00000457_activated>=1)"))
Computing Next relation with stutter on 9 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.69065,193628,1,0,1852,748587,716,1917,7288,1.23079e+06,5334
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((X(("(task_s00000739_output_s00000264>=1)")U(F("(task_s00000747_output_s00000264>=1)")))))
Formula 13 simplified : !X("(task_s00000739_output_s00000264>=1)" U F"(task_s00000747_output_s00000264>=1)")
Computing Next relation with stutter on 9 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
67 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.36522,208676,1,0,2379,827640,725,2353,7289,1.38847e+06,6293
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((F("(merge_s00000456_activated>=1)")))
Formula 14 simplified : !F"(merge_s00000456_activated>=1)"
Computing Next relation with stutter on 9 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
141 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.76451,233756,1,0,2800,955106,734,2766,7290,1.59304e+06,7190
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((("(decision_s00000768_activated>=1)")U(X(F("(fork_s00000464_input_s00000263>=1)")))))
Formula 15 simplified : !("(decision_s00000768_activated>=1)" U XF"(fork_s00000464_input_s00000263>=1)")
Computing Next relation with stutter on 9 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
135 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.1211,250916,1,0,3288,1.04266e+06,743,3214,7291,1.73742e+06,8161
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA IBM703-PT-none-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
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 1552808750709

--------------------
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/ -smt
+ 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/ -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Mar 17, 2019 7:45:35 AM fr.lip6.move.gal.application.Application start
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/, -smt]
Mar 17, 2019 7:45:35 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 17, 2019 7:45:35 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 126 ms
Mar 17, 2019 7:45:35 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 262 places.
Mar 17, 2019 7:45:36 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 284 transitions.
Mar 17, 2019 7:45:36 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 18 ms
Mar 17, 2019 7:45:36 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 73 ms
Mar 17, 2019 7:45:36 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 6 ms
Mar 17, 2019 7:45:36 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Mar 17, 2019 7:45:36 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 284 transitions.
Mar 17, 2019 7:45:36 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 1 place invariants in 85 ms
Mar 17, 2019 7:45:38 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 262 variables to be positive in 1804 ms
Mar 17, 2019 7:45:38 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 284 transitions.
Mar 17, 2019 7:45:38 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/284 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 17, 2019 7:45:38 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 17, 2019 7:45:38 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 284 transitions.
Mar 17, 2019 7:45:38 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 17, 2019 7:45:40 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 284 transitions.
Mar 17, 2019 7:45:42 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(2/284) took 1551 ms. Total solver calls (SAT/UNSAT): 509(0/509)
Mar 17, 2019 7:45:46 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(4/284) took 5324 ms. Total solver calls (SAT/UNSAT): 1014(0/1014)
Mar 17, 2019 7:45:49 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(9/284) took 8915 ms. Total solver calls (SAT/UNSAT): 1515(0/1515)
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:480)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
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:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Mar 17, 2019 7:45:50 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 13903ms conformant to PINS in folder :/home/mcc/execution

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="IBM703-PT-none"
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-3954"
echo " Executing tool itstools"
echo " Input is IBM703-PT-none, 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 r085-csrt-155246555100844"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IBM703-PT-none.tgz
mv IBM703-PT-none execution
cd execution
if [ "LTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "UpperBounds" ] ; 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
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 ;