Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r121-tall-162075406800337.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 IBM703-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075406800337
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 50K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 195K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 31K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 105K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.1K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Mar 23 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 23 01:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 23 01:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 203K May 5 16:51 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-CTLCardinality-00
FORMULA_NAME IBM703-PT-none-CTLCardinality-01
FORMULA_NAME IBM703-PT-none-CTLCardinality-02
FORMULA_NAME IBM703-PT-none-CTLCardinality-03
FORMULA_NAME IBM703-PT-none-CTLCardinality-04
FORMULA_NAME IBM703-PT-none-CTLCardinality-05
FORMULA_NAME IBM703-PT-none-CTLCardinality-06
FORMULA_NAME IBM703-PT-none-CTLCardinality-07
FORMULA_NAME IBM703-PT-none-CTLCardinality-08
FORMULA_NAME IBM703-PT-none-CTLCardinality-09
FORMULA_NAME IBM703-PT-none-CTLCardinality-10
FORMULA_NAME IBM703-PT-none-CTLCardinality-11
FORMULA_NAME IBM703-PT-none-CTLCardinality-12
FORMULA_NAME IBM703-PT-none-CTLCardinality-13
FORMULA_NAME IBM703-PT-none-CTLCardinality-14
FORMULA_NAME IBM703-PT-none-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1620837620326

Running Version 0
[2021-05-12 16:40:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-12 16:40:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 16:40:29] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2021-05-12 16:40:29] [INFO ] Transformed 262 places.
[2021-05-12 16:40:29] [INFO ] Transformed 284 transitions.
[2021-05-12 16:40:29] [INFO ] Found NUPN structural information;
[2021-05-12 16:40:29] [INFO ] Completing missing partition info from NUPN : creating a component with [merge_s00000450_activated, merge_s00000462_activated, merge_s00000319_activated, merge_s00000446_activated, merge_s00000449_activated, task_s00000720_input_s00000263, task_s00000721_input_s00000263, task_s00000704_input_s00000263, task_s00000714_input_s00000263, task_s00000724_input_s00000263, fork_s00000464_input_s00000263, task_s00000716_input_s00000263, task_s00000762_input_s00000263, task_s00000726_input_s00000263, task_s00000754_input_s00000263, task_s00000727_input_s00000263, task_s00000746_input_s00000263, task_s00000756_input_s00000263, task_s00000757_input_s00000263, merge_s00000320_input_s00000263, merge_s00000453_input_s00000290, merge_s00000319_input_s00000290, merge_s00000455_input_s00000290, merge_s00000446_input_s00000290, merge_s00000456_input_s00000263, merge_s00000458_input_s00000263, merge_s00000457_input_s00000285, task_s00000710_output_s00000264, task_s00000730_output_s00000264, task_s00000740_output_s00000264, task_s00000704_output_s00000264, task_s00000732_output_s00000264, task_s00000714_output_s00000264, task_s00000733_output_s00000264, task_s00000724_output_s00000264, task_s00000752_output_s00000264, task_s00000716_output_s00000264, task_s00000707_output_s00000264, task_s00000744_output_s00000264, task_s00000708_output_s00000264, task_s00000736_output_s00000264, task_s00000727_output_s00000264, task_s00000755_output_s00000264, task_s00000728_output_s00000264, task_s00000738_output_s00000264, task_s00000739_output_s00000264, task_s00000749_output_s00000264, decision_s00000801_activated, decision_s00000804_activated, decision_s00000772_activated, decision_s00000792_activated, decision_s00000793_activated, decision_s00000776_activated, decision_s00000796_activated, decision_s00000788_activated, fork_s00000463_activated_s00000272, fork_s00000464_activated_s00000272, fork_s00000466_activated_s00000272, fork_s00000466_activated_s00000274, decision_s00000773_input_s00000263, decision_s00000793_input_s00000263, decision_s00000775_input_s00000263, decision_s00000787_input_s00000263, process_s00000030__s00000703_input_s00000263, callToProcess_s00000807_output_s00000264, callToProcess_s00000808_output_s00000264, task_s00000710_inputCriterion_s00000257_used, task_s00000711_inputCriterion_s00000257_used, task_s00000721_inputCriterion_s00000257_used, task_s00000740_inputCriterion_s00000257_used, task_s00000722_inputCriterion_s00000257_used, task_s00000741_inputCriterion_s00000257_used, task_s00000732_inputCriterion_s00000257_used, task_s00000714_inputCriterion_s00000257_used, task_s00000760_inputCriterion_s00000257_used, task_s00000733_inputCriterion_s00000257_used, task_s00000724_inputCriterion_s00000257_used, task_s00000706_inputCriterion_s00000257_used, task_s00000752_inputCriterion_s00000257_used, task_s00000725_inputCriterion_s00000257_used, task_s00000707_inputCriterion_s00000257_used, task_s00000753_inputCriterion_s00000257_used, task_s00000735_inputCriterion_s00000257_used, task_s00000726_inputCriterion_s00000257_used, task_s00000708_inputCriterion_s00000257_used, task_s00000745_inputCriterion_s00000257_used, task_s00000736_inputCriterion_s00000257_used, task_s00000718_inputCriterion_s00000257_used, task_s00000755_inputCriterion_s00000257_used, task_s00000737_inputCriterion_s00000257_used, task_s00000719_inputCriterion_s00000257_used, task_s00000738_inputCriterion_s00000257_used, task_s00000757_inputCriterion_s00000257_used, task_s00000748_inputCriterion_s00000257_used, task_s00000758_inputCriterion_s00000257_used, callToProcess_s00000807_inputCriterion_s00000257_used, callToProcess_s00000808_inputCriterion_s00000257_used]
[2021-05-12 16:40:29] [INFO ] Parsed PT model containing 262 places and 284 transitions in 108 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
Support contains 260 out of 262 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 262/262 places, 284/284 transitions.
Applied a total of 0 rules in 13 ms. Remains 262 /262 variables (removed 0) and now considering 284/284 (removed 0) transitions.
// Phase 1: matrix 284 rows 262 cols
[2021-05-12 16:40:29] [INFO ] Computed 1 place invariants in 14 ms
[2021-05-12 16:40:29] [INFO ] Implicit Places using invariants in 190 ms returned []
// Phase 1: matrix 284 rows 262 cols
[2021-05-12 16:40:29] [INFO ] Computed 1 place invariants in 10 ms
[2021-05-12 16:40:29] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
// Phase 1: matrix 284 rows 262 cols
[2021-05-12 16:40:29] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-12 16:40:29] [INFO ] Dead Transitions using invariants and state equation in 155 ms returned []
Finished structural reductions, in 1 iterations. Remains : 262/262 places, 284/284 transitions.
[2021-05-12 16:40:29] [INFO ] Flatten gal took : 48 ms
[2021-05-12 16:40:29] [INFO ] Flatten gal took : 19 ms
[2021-05-12 16:40:30] [INFO ] Input system was already deterministic with 284 transitions.
Incomplete random walk after 100000 steps, including 1735 resets, run finished after 1399 ms. (steps per millisecond=71 ) properties (out of 115) seen :35
Running SMT prover for 80 properties.
// Phase 1: matrix 284 rows 262 cols
[2021-05-12 16:40:31] [INFO ] Computed 1 place invariants in 4 ms
[2021-05-12 16:40:31] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2021-05-12 16:40:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:40:31] [INFO ] SMT Verify possible in real domain returnedunsat :72 sat :0 real:8
[2021-05-12 16:40:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2021-05-12 16:40:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:40:31] [INFO ] SMT Verify possible in nat domain returned unsat :8 sat :72
Successfully simplified 80 atomic propositions for a total of 16 simplifications.
[2021-05-12 16:40:31] [INFO ] Initial state test concluded for 4 properties.
FORMULA IBM703-PT-none-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Graph (complete) has 288 edges and 262 vertex of which 258 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.7 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 112 place count 258 transition count 173
Reduce places removed 111 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 135 rules applied. Total rules applied 247 place count 147 transition count 149
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 273 place count 123 transition count 147
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 273 place count 123 transition count 132
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 303 place count 108 transition count 132
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 310 place count 101 transition count 124
Iterating global reduction 3 with 7 rules applied. Total rules applied 317 place count 101 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 321 place count 101 transition count 120
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 323 place count 99 transition count 120
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 347 place count 87 transition count 108
Performed 3 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 353 place count 84 transition count 112
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 357 place count 84 transition count 112
Applied a total of 357 rules in 49 ms. Remains 84 /262 variables (removed 178) and now considering 112/284 (removed 172) transitions.
[2021-05-12 16:40:32] [INFO ] Flatten gal took : 5 ms
[2021-05-12 16:40:32] [INFO ] Flatten gal took : 5 ms
[2021-05-12 16:40:32] [INFO ] Input system was already deterministic with 112 transitions.
[2021-05-12 16:40:32] [INFO ] Flatten gal took : 7 ms
[2021-05-12 16:40:32] [INFO ] Flatten gal took : 7 ms
[2021-05-12 16:40:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality4617124779550124340.gal : 6 ms
[2021-05-12 16:40:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality10701812616936464602.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLCardinality4617124779550124340.gal, -t, CGAL, -ctl, /tmp/CTLCardinality10701812616936464602.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLCardinality4617124779550124340.gal -t CGAL -ctl /tmp/CTLCardinality10701812616936464602.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,536,0.029284,5304,2,390,5,2533,6,0,441,3312,0


Converting to forward existential form...Done !
original formula: (A((EF((((((task_s00000724_inputCriterion_s00000257_used+task_s00000735_inputCriterion_s00000257_used)+process_s00000030__s00000703_input_s00000263)+merge_s00000446_input_s00000285)>(((decision_s00000804_activated+task_s00000724_output_s00000264)+fork_s00000464_activated_s00000272)+decision_s00000803_activated))&&((task_s00000724_output_s00000264+merge_s00000456_input_s00000290)<=((task_s00000719_input_s00000263+decision_s00000792_activated)+task_s00000717_inputCriterion_s00000257_used)))) * EG(AF((((((((((task_s00000707_input_s00000263+task_s00000754_output_s00000264)+merge_s00000458_activated)+task_s00000717_output_s00000264)+task_s00000746_output_s00000264)+merge_s00000319_activated)+task_s00000715_inputCriterion_s00000257_used)+task_s00000722_output_s00000264)+task_s00000745_output_s00000264)<=(((((decision_s00000780_input_s00000263+task_s00000738_output_s00000264)+task_s00000713_inputCriterion_s00000257_used)+task_s00000707_input_s00000263)+task_s00000708_inputCriterion_s00000257_used)+decision_s00000764_activated))))) U EG(((((((task_s00000757_inputCriterion_s00000257_used+decision_s00000768_activated)+task_s00000711_input_s00000263)+task_s00000736_output_s00000264)+task_s00000715_output_s00000264)+merge_s00000806_activated)<=((((merge_s00000449_input_s00000285+task_s00000740_input_s00000263)+task_s00000756_input_s00000263)+callToProcess_s00000808_output_s00000264)+merge_s00000319_activated)))) * EF(((((task_s00000761_input_s00000263==0)||(task_s00000761_input_s00000263==1))&&(task_s00000746_output_s00000264>(((((((((task_s00000707_input_s00000263+task_s00000704_output_s00000264)+task_s00000727_inputCriterion_s00000257_used)+task_s00000743_output_s00000264)+task_s00000722_inputCriterion_s00000257_used)+decision_s00000788_activated)+task_s00000708_inputCriterion_s00000257_used)+task_s00000746_inputCriterion_s00000257_used)+task_s00000723_output_s00000264)+merge_s00000451_input_s00000285)))||((merge_s00000461_activated+task_s00000741_input_s00000263)>50))))
=> equivalent forward existential formula: [(FwdU((Init * !((E(!(EG(((((((task_s00000757_inputCriterion_s00000257_used+decision_s00000768_activated)+task_s00000711_input_s00000263)+task_s00000736_output_s00000264)+task_s00000715_output_s00000264)+merge_s00000806_activated)<=((((merge_s00000449_input_s00000285+task_s00000740_input_s00000263)+task_s00000756_input_s00000263)+callToProcess_s00000808_output_s00000264)+merge_s00000319_activated)))) U (!((E(TRUE U (((((task_s00000724_inputCriterion_s00000257_used+task_s00000735_inputCriterion_s00000257_used)+process_s00000030__s00000703_input_s00000263)+merge_s00000446_input_s00000285)>(((decision_s00000804_activated+task_s00000724_output_s00000264)+fork_s00000464_activated_s00000272)+decision_s00000803_activated))&&((task_s00000724_output_s00000264+merge_s00000456_input_s00000290)<=((task_s00000719_input_s00000263+decision_s00000792_activated)+task_s00000717_inputCriterion_s00000257_used)))) * EG(!(EG(!((((((((((task_s00000707_input_s00000263+task_s00000754_output_s00000264)+merge_s00000458_activated)+task_s00000717_output_s00000264)+task_s00000746_output_s00000264)+merge_s00000319_activated)+task_s00000715_inputCriterion_s00000257_used)+task_s00000722_output_s00000264)+task_s00000745_output_s00000264)<=(((((decision_s00000780_input_s00000263+task_s00000738_output_s00000264)+task_s00000713_inputCriterion_s00000257_used)+task_s00000707_input_s00000263)+task_s00000708_inputCriterion_s00000257_used)+decision_s00000764_activated)))))))) * !(EG(((((((task_s00000757_inputCriterion_s00000257_used+decision_s00000768_activated)+task_s00000711_input_s00000263)+task_s00000736_output_s00000264)+task_s00000715_output_s00000264)+merge_s00000806_activated)<=((((merge_s00000449_input_s00000285+task_s00000740_input_s00000263)+task_s00000756_input_s00000263)+callToProcess_s00000808_output_s00000264)+merge_s00000319_activated)))))) + EG(!(EG(((((((task_s00000757_inputCriterion_s00000257_used+decision_s00000768_activated)+task_s00000711_input_s00000263)+task_s00000736_output_s00000264)+task_s00000715_output_s00000264)+merge_s00000806_activated)<=((((merge_s00000449_input_s00000285+task_s00000740_input_s00000263)+task_s00000756_input_s00000263)+callToProcess_s00000808_output_s00000264)+merge_s00000319_activated)))))))),TRUE) * ((((task_s00000761_input_s00000263==0)||(task_s00000761_input_s00000263==1))&&(task_s00000746_output_s00000264>(((((((((task_s00000707_input_s00000263+task_s00000704_output_s00000264)+task_s00000727_inputCriterion_s00000257_used)+task_s00000743_output_s00000264)+task_s00000722_inputCriterion_s00000257_used)+decision_s00000788_activated)+task_s00000708_inputCriterion_s00000257_used)+task_s00000746_inputCriterion_s00000257_used)+task_s00000723_output_s00000264)+merge_s00000451_input_s00000285)))||((merge_s00000461_activated+task_s00000741_input_s00000263)>50)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t17, t19, t22, t25, t26, t38, t53, t54, t55, t56, t69, t74, t81, t91, t92, t93, t96, t97, t100, t101, t102, t103, t107, t109, t110, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/86/26/112
(forward)formula 0,0,0.619419,27908,1,0,718,155483,263,442,2681,127270,800
FORMULA IBM703-PT-none-CTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Graph (complete) has 288 edges and 262 vertex of which 256 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 182 transitions
Trivial Post-agglo rules discarded 182 transitions
Performed 182 trivial Post agglomeration. Transition count delta: 182
Iterating post reduction 0 with 182 rules applied. Total rules applied 183 place count 255 transition count 101
Reduce places removed 182 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 198 rules applied. Total rules applied 381 place count 73 transition count 85
Reduce places removed 10 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 16 rules applied. Total rules applied 397 place count 63 transition count 79
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 403 place count 57 transition count 79
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 403 place count 57 transition count 69
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 423 place count 47 transition count 69
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 429 place count 41 transition count 62
Iterating global reduction 4 with 6 rules applied. Total rules applied 435 place count 41 transition count 62
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 436 place count 40 transition count 61
Iterating global reduction 4 with 1 rules applied. Total rules applied 437 place count 40 transition count 61
Performed 18 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 473 place count 22 transition count 40
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 477 place count 22 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 479 place count 21 transition count 35
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 480 place count 21 transition count 34
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 484 place count 19 transition count 36
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 485 place count 19 transition count 35
Applied a total of 485 rules in 15 ms. Remains 19 /262 variables (removed 243) and now considering 35/284 (removed 249) transitions.
[2021-05-12 16:40:32] [INFO ] Flatten gal took : 2 ms
[2021-05-12 16:40:32] [INFO ] Flatten gal took : 2 ms
[2021-05-12 16:40:32] [INFO ] Input system was already deterministic with 35 transitions.
[2021-05-12 16:40:32] [INFO ] Flatten gal took : 2 ms
[2021-05-12 16:40:32] [INFO ] Flatten gal took : 1 ms
[2021-05-12 16:40:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality15333644425644020260.gal : 0 ms
[2021-05-12 16:40:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality16403867735811128514.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLCardinality15333644425644020260.gal, -t, CGAL, -ctl, /tmp/CTLCardinality16403867735811128514.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLCardinality15333644425644020260.gal -t CGAL -ctl /tmp/CTLCardinality16403867735811128514.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,32,0.005092,4496,2,50,5,262,6,0,108,259,0


Converting to forward existential form...Done !
original formula: EG(((merge_s00000461_input_s00000263+task_s00000726_output_s00000264)<=((((((task_s00000734_inputCriterion_s00000257_used+task_s00000709_output_s00000264)+task_s00000760_output_s00000264)+task_s00000758_inputCriterion_s00000257_used)+task_s00000730_inputCriterion_s00000257_used)+task_s00000746_input_s00000263)+decision_s00000787_input_s00000263)))
=> equivalent forward existential formula: [FwdG(Init,((merge_s00000461_input_s00000263+task_s00000726_output_s00000264)<=((((((task_s00000734_inputCriterion_s00000257_used+task_s00000709_output_s00000264)+task_s00000760_output_s00000264)+task_s00000758_inputCriterion_s00000257_used)+task_s00000730_inputCriterion_s00000257_used)+task_s00000746_input_s00000263)+decision_s00000787_input_s00000263)))] != FALSE
Hit Full ! (commute/partial/dont) 11/0/24
(forward)formula 0,1,0.012102,4936,1,0,18,1380,18,3,500,1358,18
FORMULA IBM703-PT-none-CTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Graph (complete) has 288 edges and 262 vertex of which 256 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 0 with 202 rules applied. Total rules applied 203 place count 255 transition count 81
Reduce places removed 202 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 229 rules applied. Total rules applied 432 place count 53 transition count 54
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 20 rules applied. Total rules applied 452 place count 36 transition count 51
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 454 place count 34 transition count 51
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 454 place count 34 transition count 46
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 464 place count 29 transition count 46
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 472 place count 21 transition count 37
Iterating global reduction 4 with 8 rules applied. Total rules applied 480 place count 21 transition count 37
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 484 place count 21 transition count 33
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 488 place count 19 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 489 place count 18 transition count 31
Performed 16 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 521 place count 2 transition count 12
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 10 rules applied. Total rules applied 531 place count 2 transition count 2
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 533 place count 1 transition count 1
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 534 place count 0 transition count 0
Applied a total of 534 rules in 10 ms. Remains 0 /262 variables (removed 262) and now considering 0/284 (removed 284) transitions.
[2021-05-12 16:40:32] [INFO ] Removed 1 GAL types that were empty due to variable simplifications.
petri,
[2021-05-12 16:40:32] [INFO ] Flatten gal took : 1 ms
[2021-05-12 16:40:32] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA IBM703-PT-none-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 16:40:32] [INFO ] Flatten gal took : 0 ms
[2021-05-12 16:40:32] [INFO ] Input system was already deterministic with 0 transitions.
Graph (complete) has 288 edges and 262 vertex of which 257 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 168 transitions
Trivial Post-agglo rules discarded 168 transitions
Performed 168 trivial Post agglomeration. Transition count delta: 168
Iterating post reduction 0 with 168 rules applied. Total rules applied 169 place count 257 transition count 116
Reduce places removed 168 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 188 rules applied. Total rules applied 357 place count 89 transition count 96
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 372 place count 77 transition count 93
Reduce places removed 2 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 3 with 14 rules applied. Total rules applied 386 place count 75 transition count 81
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 398 place count 63 transition count 81
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 398 place count 63 transition count 72
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 416 place count 54 transition count 72
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 421 place count 49 transition count 66
Iterating global reduction 5 with 5 rules applied. Total rules applied 426 place count 49 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 429 place count 49 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 430 place count 48 transition count 63
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 430 place count 48 transition count 62
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 432 place count 47 transition count 62
Performed 13 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 458 place count 34 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 459 place count 34 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 461 place count 33 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 462 place count 33 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 466 place count 31 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 467 place count 31 transition count 45
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 470 place count 31 transition count 45
Applied a total of 470 rules in 18 ms. Remains 31 /262 variables (removed 231) and now considering 45/284 (removed 239) transitions.
[2021-05-12 16:40:32] [INFO ] Flatten gal took : 2 ms
[2021-05-12 16:40:32] [INFO ] Flatten gal took : 2 ms
[2021-05-12 16:40:32] [INFO ] Input system was already deterministic with 45 transitions.
[2021-05-12 16:40:32] [INFO ] Flatten gal took : 2 ms
[2021-05-12 16:40:32] [INFO ] Flatten gal took : 2 ms
[2021-05-12 16:40:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality2520838282949918462.gal : 0 ms
[2021-05-12 16:40:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality1692705880661251197.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLCardinality2520838282949918462.gal, -t, CGAL, -ctl, /tmp/CTLCardinality1692705880661251197.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLCardinality2520838282949918462.gal -t CGAL -ctl /tmp/CTLCardinality1692705880661251197.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,58,0.007153,4556,2,103,5,450,6,0,163,487,0


Converting to forward existential form...Done !
original formula: AG(AF((((((((merge_s00000455_input_s00000290+task_s00000732_inputCriterion_s00000257_used)+task_s00000750_output_s00000264)+merge_s00000451_input_s00000285)+task_s00000716_output_s00000264)+task_s00000728_output_s00000264)+task_s00000754_inputCriterion_s00000257_used)>=1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((((((((merge_s00000455_input_s00000290+task_s00000732_inputCriterion_s00000257_used)+task_s00000750_output_s00000264)+merge_s00000451_input_s00000285)+task_s00000716_output_s00000264)+task_s00000728_output_s00000264)+task_s00000754_inputCriterion_s00000257_used)>=1)))] = FALSE
Hit Full ! (commute/partial/dont) 25/0/20
(forward)formula 0,0,0.018768,5260,1,0,26,2660,19,2,759,2264,25
FORMULA IBM703-PT-none-CTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

[2021-05-12 16:40:32] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-12 16:40:32] [INFO ] Flatten gal took : 20 ms
[2021-05-12 16:40:32] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA IBM703-PT-none-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 16:40:32] [INFO ] Flatten gal took : 12 ms
[2021-05-12 16:40:32] [INFO ] Applying decomposition
[2021-05-12 16:40:32] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14715081382884433269.txt, -o, /tmp/graph14715081382884433269.bin, -w, /tmp/graph14715081382884433269.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14715081382884433269.bin, -l, -1, -v, -w, /tmp/graph14715081382884433269.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 16:40:41] [INFO ] Decomposing Gal with order
[2021-05-12 16:40:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 16:40:41] [INFO ] Removed a total of 27 redundant transitions.
[2021-05-12 16:40:41] [INFO ] Flatten gal took : 121 ms
[2021-05-12 16:40:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 11 ms.
[2021-05-12 16:40:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality11323906289747954470.gal : 22 ms
[2021-05-12 16:40:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality9941296383846410482.ctl : 159 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLCardinality11323906289747954470.gal, -t, CGAL, -ctl, /tmp/CTLCardinality9941296383846410482.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLCardinality11323906289747954470.gal -t CGAL -ctl /tmp/CTLCardinality9941296383846410482.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8370,0.198504,9676,2,1668,5,14913,6,0,1316,22379,0


Converting to forward existential form...Done !
original formula: AF(((AG((((((((((gi10.gu33.merge_s00000458_activated+gi10.gu33.task_s00000761_output_s00000264)+gi10.gu12.task_s00000729_inputCriterion_s00000257_used)+gi10.gu33.decision_s00000804_activated)+gi10.gu33.task_s00000743_output_s00000264)+gi10.gu33.task_s00000707_output_s00000264)+gi10.gu33.decision_s00000793_activated)+gi10.gu33.task_s00000762_inputCriterion_s00000257_used)+gi5.gi1.gu14.task_s00000740_inputCriterion_s00000257_used)<=gi10.gu33.fork_s00000464_activated_s00000274)) * AF(!(EX((((((((gi2.gu9.task_s00000757_output_s00000264+gi2.gu9.task_s00000729_output_s00000264)+gi2.gu9.task_s00000707_inputCriterion_s00000257_used)+gi2.gu9.decision_s00000802_activated)+gi2.gu9.task_s00000704_inputCriterion_s00000257_used)+gi7.gu8.decision_s00000787_input_s00000263)+gi2.gu9.task_s00000739_inputCriterion_s00000257_used)<=(((((((gi2.gu9.decision_s00000799_activated+gi2.gu9.task_s00000726_input_s00000263)+gi2.gu9.fork_s00000464_input_s00000263)+gi2.gu9.fork_s00000465_activated_s00000274)+gi2.gu9.task_s00000731_output_s00000264)+gi2.gu9.decision_s00000792_activated)+gi2.gu9.task_s00000716_inputCriterion_s00000257_used)+gi2.gu9.task_s00000715_output_s00000264)))))) * ((((gi8.gu36.task_s00000721_output_s00000264<=((((gi8.gu36.callToProcess_s00000807_inputCriterion_s00000257_used+gi7.gu8.task_s00000757_input_s00000263)+gi8.gu36.callToProcess_s00000808_output_s00000264)+gi8.gu36.task_s00000742_inputCriterion_s00000257_used)+gi8.gu36.merge_s00000449_activated))||((((((gi5.gi1.gu15.merge_s00000446_input_s00000290+gi7.gu8.task_s00000724_inputCriterion_s00000257_used)+gi5.gi1.gu15.callToProcess_s00000807_output_s00000264)+gi7.gu8.decision_s00000787_input_s00000263)+gi5.gi1.gu15.decision_s00000773_activated)+gi5.gi1.gu15.task_s00000709_output_s00000264)>(((((gi5.gi1.gu15.merge_s00000446_input_s00000290+gi5.gi1.gu15.task_s00000761_inputCriterion_s00000257_used)+gi5.gi1.gu14.merge_s00000455_activated)+gi5.gi1.gu15.task_s00000747_output_s00000264)+gi5.gi1.gu15.merge_s00000449_input_s00000285)+gi5.gi1.gu14.task_s00000749_output_s00000264)))||((((((gi4.gu4.decision_s00000764_input_s00000263+gi4.gu4.task_s00000763_input_s00000263)+gi4.gu4.task_s00000762_output_s00000264)+gi4.gu4.merge_s00000288_activated)+gi4.gu4.task_s00000716_input_s00000263)+gi4.gu4.task_s00000711_inputCriterion_s00000257_used)>(((((((((gi4.gu4.task_s00000719_inputCriterion_s00000257_used+gi4.gu4.merge_s00000446_activated)+gi4.gu4.callToProcess_s00000808_inputCriterion_s00000257_used)+gi4.gu4.task_s00000740_input_s00000263)+gi4.gu4.task_s00000756_input_s00000263)+gi4.gu4.task_s00000723_inputCriterion_s00000257_used)+gi4.gu4.decision_s00000783_activated)+gi4.gu4.task_s00000751_output_s00000264)+gi4.gu4.task_s00000721_inputCriterion_s00000257_used)+gi7.gu8.task_s00000757_input_s00000263)))||((((((((((gi7.gu8.task_s00000713_inputCriterion_s00000257_used+gi7.gu8.task_s00000741_input_s00000263)+gi7.gu8.task_s00000714_input_s00000263)+gi7.gu8.task_s00000758_inputCriterion_s00000257_used)+gi7.gu8.merge_s00000806_activated)+gi7.gu8.task_s00000724_inputCriterion_s00000257_used)+gi7.gu8.task_s00000757_inputCriterion_s00000257_used)+gi7.gu8.task_s00000706_inputCriterion_s00000257_used)+gi7.gu8.decision_s00000787_input_s00000263)+gi7.gu8.task_s00000737_output_s00000264)>(((((gi7.gu8.decision_s00000789_activated+gi7.gu8.decision_s00000796_activated)+gi7.gu8.task_s00000714_output_s00000264)+gi7.gu8.task_s00000757_input_s00000263)+gi7.gu8.decision_s00000773_input_s00000263)+gi7.gu8.task_s00000740_output_s00000264)))))
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(TRUE U !((((((((((gi10.gu33.merge_s00000458_activated+gi10.gu33.task_s00000761_output_s00000264)+gi10.gu12.task_s00000729_inputCriterion_s00000257_used)+gi10.gu33.decision_s00000804_activated)+gi10.gu33.task_s00000743_output_s00000264)+gi10.gu33.task_s00000707_output_s00000264)+gi10.gu33.decision_s00000793_activated)+gi10.gu33.task_s00000762_inputCriterion_s00000257_used)+gi5.gi1.gu14.task_s00000740_inputCriterion_s00000257_used)<=gi10.gu33.fork_s00000464_activated_s00000274)))) * !(EG(!(!(EX((((((((gi2.gu9.task_s00000757_output_s00000264+gi2.gu9.task_s00000729_output_s00000264)+gi2.gu9.task_s00000707_inputCriterion_s00000257_used)+gi2.gu9.decision_s00000802_activated)+gi2.gu9.task_s00000704_inputCriterion_s00000257_used)+gi7.gu8.decision_s00000787_input_s00000263)+gi2.gu9.task_s00000739_inputCriterion_s00000257_used)<=(((((((gi2.gu9.decision_s00000799_activated+gi2.gu9.task_s00000726_input_s00000263)+gi2.gu9.fork_s00000464_input_s00000263)+gi2.gu9.fork_s00000465_activated_s00000274)+gi2.gu9.task_s00000731_output_s00000264)+gi2.gu9.decision_s00000792_activated)+gi2.gu9.task_s00000716_inputCriterion_s00000257_used)+gi2.gu9.task_s00000715_output_s00000264)))))))) * ((((gi8.gu36.task_s00000721_output_s00000264<=((((gi8.gu36.callToProcess_s00000807_inputCriterion_s00000257_used+gi7.gu8.task_s00000757_input_s00000263)+gi8.gu36.callToProcess_s00000808_output_s00000264)+gi8.gu36.task_s00000742_inputCriterion_s00000257_used)+gi8.gu36.merge_s00000449_activated))||((((((gi5.gi1.gu15.merge_s00000446_input_s00000290+gi7.gu8.task_s00000724_inputCriterion_s00000257_used)+gi5.gi1.gu15.callToProcess_s00000807_output_s00000264)+gi7.gu8.decision_s00000787_input_s00000263)+gi5.gi1.gu15.decision_s00000773_activated)+gi5.gi1.gu15.task_s00000709_output_s00000264)>(((((gi5.gi1.gu15.merge_s00000446_input_s00000290+gi5.gi1.gu15.task_s00000761_inputCriterion_s00000257_used)+gi5.gi1.gu14.merge_s00000455_activated)+gi5.gi1.gu15.task_s00000747_output_s00000264)+gi5.gi1.gu15.merge_s00000449_input_s00000285)+gi5.gi1.gu14.task_s00000749_output_s00000264)))||((((((gi4.gu4.decision_s00000764_input_s00000263+gi4.gu4.task_s00000763_input_s00000263)+gi4.gu4.task_s00000762_output_s00000264)+gi4.gu4.merge_s00000288_activated)+gi4.gu4.task_s00000716_input_s00000263)+gi4.gu4.task_s00000711_inputCriterion_s00000257_used)>(((((((((gi4.gu4.task_s00000719_inputCriterion_s00000257_used+gi4.gu4.merge_s00000446_activated)+gi4.gu4.callToProcess_s00000808_inputCriterion_s00000257_used)+gi4.gu4.task_s00000740_input_s00000263)+gi4.gu4.task_s00000756_input_s00000263)+gi4.gu4.task_s00000723_inputCriterion_s00000257_used)+gi4.gu4.decision_s00000783_activated)+gi4.gu4.task_s00000751_output_s00000264)+gi4.gu4.task_s00000721_inputCriterion_s00000257_used)+gi7.gu8.task_s00000757_input_s00000263)))||((((((((((gi7.gu8.task_s00000713_inputCriterion_s00000257_used+gi7.gu8.task_s00000741_input_s00000263)+gi7.gu8.task_s00000714_input_s00000263)+gi7.gu8.task_s00000758_inputCriterion_s00000257_used)+gi7.gu8.merge_s00000806_activated)+gi7.gu8.task_s00000724_inputCriterion_s00000257_used)+gi7.gu8.task_s00000757_inputCriterion_s00000257_used)+gi7.gu8.task_s00000706_inputCriterion_s00000257_used)+gi7.gu8.decision_s00000787_input_s00000263)+gi7.gu8.task_s00000737_output_s00000264)>(((((gi7.gu8.decision_s00000789_activated+gi7.gu8.decision_s00000796_activated)+gi7.gu8.task_s00000714_output_s00000264)+gi7.gu8.task_s00000757_input_s00000263)+gi7.gu8.decision_s00000773_input_s00000263)+gi7.gu8.task_s00000740_output_s00000264))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions gi0.t85, gi3.t88, gi4.gu4.t106, gi4.gu23.t108, gi5.gi0.t114, gi5.gi1.t116, gi7.gu42.t110, gi7.gu42.t111, gi7.gu42.t123, gi10.gu13.t105, t84, t89, t95, t100, t118, t126, t127, t128, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/265/18/283
dead was empty
(forward)formula 0,1,2.34592,83676,1,0,450,328255,595,270,7160,293152,699
FORMULA IBM703-PT-none-CTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AG((AX(AF(((gi3.gi0.gu30.decision_s00000796_input_s00000263+gi3.gi0.gu30.merge_s00000283_activated)<=((((((gi3.gi0.gu30.decision_s00000768_activated+gi3.gi0.gu30.merge_s00000450_activated)+gi3.gi0.gu30.decision_s00000774_activated)+gi3.gi0.gu30.task_s00000708_output_s00000264)+gi2.gu9.decision_s00000792_activated)+gi3.gi0.gu30.task_s00000729_input_s00000263)+gi3.gi0.gu30.task_s00000759_output_s00000264)))) + EG((((((((gi3.gi0.gu11.task_s00000749_inputCriterion_s00000257_used+gi3.gi0.gu30.task_s00000729_input_s00000263)+gi3.gi0.gu11.task_s00000755_inputCriterion_s00000257_used)+gi3.gi0.gu11.decision_s00000772_activated)+gi5.gi1.gu14.task_s00000733_inputCriterion_s00000257_used)+gi3.gi0.gu11.task_s00000744_inputCriterion_s00000257_used)+gi4.gu4.task_s00000756_input_s00000263)>(((gi3.gi0.gu11.task_s00000738_inputCriterion_s00000257_used+gi3.gi0.gu11.task_s00000746_input_s00000263)+gi0.gu2.merge_s00000461_input_s00000263)+gi3.gi0.gu10.task_s00000713_output_s00000264)))))
=> equivalent forward existential formula: [FwdG(EY((FwdU(Init,TRUE) * !(EG((((((((gi3.gi0.gu11.task_s00000749_inputCriterion_s00000257_used+gi3.gi0.gu30.task_s00000729_input_s00000263)+gi3.gi0.gu11.task_s00000755_inputCriterion_s00000257_used)+gi3.gi0.gu11.decision_s00000772_activated)+gi5.gi1.gu14.task_s00000733_inputCriterion_s00000257_used)+gi3.gi0.gu11.task_s00000744_inputCriterion_s00000257_used)+gi4.gu4.task_s00000756_input_s00000263)>(((gi3.gi0.gu11.task_s00000738_inputCriterion_s00000257_used+gi3.gi0.gu11.task_s00000746_input_s00000263)+gi0.gu2.merge_s00000461_input_s00000263)+gi3.gi0.gu10.task_s00000713_output_s00000264)))))),!(((gi3.gi0.gu30.decision_s00000796_input_s00000263+gi3.gi0.gu30.merge_s00000283_activated)<=((((((gi3.gi0.gu30.decision_s00000768_activated+gi3.gi0.gu30.merge_s00000450_activated)+gi3.gi0.gu30.decision_s00000774_activated)+gi3.gi0.gu30.task_s00000708_output_s00000264)+gi2.gu9.decision_s00000792_activated)+gi3.gi0.gu30.task_s00000729_input_s00000263)+gi3.gi0.gu30.task_s00000759_output_s00000264))))] = FALSE
dead was empty
(forward)formula 1,1,2.35425,84204,1,0,452,328956,601,272,7238,293475,702
FORMULA IBM703-PT-none-CTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: (EG((((EX(TRUE) * (((((gi7.gu19.task_s00000738_output_s00000264+gi7.gu8.task_s00000714_output_s00000264)+gi7.gu19.task_s00000760_output_s00000264)+gi7.gu19.task_s00000744_output_s00000264)+gi7.gu19.task_s00000726_inputCriterion_s00000257_used)>((((((gi3.gi0.gu30.merge_s00000450_activated+gi2.gu9.decision_s00000802_activated)+gi7.gu19.task_s00000739_output_s00000264)+gi7.gu19.merge_s00000445_activated)+gi7.gu8.merge_s00000806_activated)+gi7.gu8.task_s00000757_inputCriterion_s00000257_used)+gi7.gu19.task_s00000734_output_s00000264))) * ((((((((gi10.gu24.decision_s00000783_input_s00000263+gi2.gu9.task_s00000726_input_s00000263)+gi10.gu24.task_s00000732_output_s00000264)+gi7.gu19.task_s00000738_output_s00000264)+gi10.gu24.merge_s00000453_input_s00000263)+gi10.gu12.merge_s00000341_activated)+gi10.gu24.task_s00000717_output_s00000264)+gi10.gu24.decision_s00000805_activated)<=43)) * ((((((((((gi10.gu12.task_s00000745_inputCriterion_s00000257_used+gi10.gu12.merge_s00000452_activated)+gi10.gu12.task_s00000711_input_s00000263)+gi10.gu12.merge_s00000320_input_s00000290)+gi10.gu12.merge_s00000341_activated)+gi10.gu12.task_s00000752_inputCriterion_s00000257_used)+gi10.gu12.task_s00000718_inputCriterion_s00000257_used)+gi10.gu12.task_s00000763_inputCriterion_s00000257_used)+gi10.gu12.task_s00000721_input_s00000263)+gi10.gu12.task_s00000729_inputCriterion_s00000257_used)<=gi10.gu12.task_s00000746_output_s00000264))) + !(AX(EG((((((gi7.gu8.task_s00000714_output_s00000264+gi7.gu8.merge_s00000455_input_s00000290)>=45)||((((((((((gi7.gu42.merge_s00000319_activated+gi7.gu42.task_s00000753_inputCriterion_s00000257_used)+gi7.gu19.task_s00000738_output_s00000264)+gi7.gu42.task_s00000723_input_s00000263)+gi3.gi0.gu11.task_s00000755_inputCriterion_s00000257_used)+gi7.gu8.merge_s00000806_activated)+gi10.gu12.task_s00000721_input_s00000263)+gi7.gu8.task_s00000757_input_s00000263)+gi7.gu8.task_s00000706_inputCriterion_s00000257_used)+gi7.gu42.task_s00000709_inputCriterion_s00000257_used)>=42))||((((((((((gi3.gi0.gu10.task_s00000713_output_s00000264+gi3.gi0.gu10.merge_s00000451_activated)+gi3.gi0.gu10.task_s00000725_input_s00000263)+gi3.gi0.gu10.task_s00000732_input_s00000263)+gi3.gi0.gu10.merge_s00000458_input_s00000263)+gi2.gu9.task_s00000726_input_s00000263)+gi5.gi1.gu14.task_s00000733_inputCriterion_s00000257_used)+gi3.gi0.gu10.decision_s00000784_input_s00000263)+gi3.gi0.gu10.decision_s00000802_input_s00000263)+gi7.gu8.task_s00000741_input_s00000263)>=7))||(gi5.gi1.gu14.decision_s00000780_activated<=(((((((((gi5.gi1.gu14.task_s00000740_inputCriterion_s00000257_used+gi5.gi1.gu14.task_s00000741_output_s00000264)+gi5.gi1.gu14.task_s00000726_output_s00000264)+gi5.gi1.gu14.merge_s00000455_activated)+gi5.gi1.gu14.task_s00000714_inputCriterion_s00000257_used)+gi5.gi1.gu14.merge_s00000451_input_s00000285)+gi5.gi1.gu14.task_s00000749_output_s00000264)+gi5.gi1.gu14.task_s00000733_inputCriterion_s00000257_used)+gi5.gi1.gu14.task_s00000711_output_s00000264)+gi5.gi1.gu14.task_s00000750_output_s00000264)))))))
=> equivalent forward existential formula: ([FwdG(Init,(((EX(TRUE) * (((((gi7.gu19.task_s00000738_output_s00000264+gi7.gu8.task_s00000714_output_s00000264)+gi7.gu19.task_s00000760_output_s00000264)+gi7.gu19.task_s00000744_output_s00000264)+gi7.gu19.task_s00000726_inputCriterion_s00000257_used)>((((((gi3.gi0.gu30.merge_s00000450_activated+gi2.gu9.decision_s00000802_activated)+gi7.gu19.task_s00000739_output_s00000264)+gi7.gu19.merge_s00000445_activated)+gi7.gu8.merge_s00000806_activated)+gi7.gu8.task_s00000757_inputCriterion_s00000257_used)+gi7.gu19.task_s00000734_output_s00000264))) * ((((((((gi10.gu24.decision_s00000783_input_s00000263+gi2.gu9.task_s00000726_input_s00000263)+gi10.gu24.task_s00000732_output_s00000264)+gi7.gu19.task_s00000738_output_s00000264)+gi10.gu24.merge_s00000453_input_s00000263)+gi10.gu12.merge_s00000341_activated)+gi10.gu24.task_s00000717_output_s00000264)+gi10.gu24.decision_s00000805_activated)<=43)) * ((((((((((gi10.gu12.task_s00000745_inputCriterion_s00000257_used+gi10.gu12.merge_s00000452_activated)+gi10.gu12.task_s00000711_input_s00000263)+gi10.gu12.merge_s00000320_input_s00000290)+gi10.gu12.merge_s00000341_activated)+gi10.gu12.task_s00000752_inputCriterion_s00000257_used)+gi10.gu12.task_s00000718_inputCriterion_s00000257_used)+gi10.gu12.task_s00000763_inputCriterion_s00000257_used)+gi10.gu12.task_s00000721_input_s00000263)+gi10.gu12.task_s00000729_inputCriterion_s00000257_used)<=gi10.gu12.task_s00000746_output_s00000264)))] != FALSE + [(EY(Init) * !(EG((((((gi7.gu8.task_s00000714_output_s00000264+gi7.gu8.merge_s00000455_input_s00000290)>=45)||((((((((((gi7.gu42.merge_s00000319_activated+gi7.gu42.task_s00000753_inputCriterion_s00000257_used)+gi7.gu19.task_s00000738_output_s00000264)+gi7.gu42.task_s00000723_input_s00000263)+gi3.gi0.gu11.task_s00000755_inputCriterion_s00000257_used)+gi7.gu8.merge_s00000806_activated)+gi10.gu12.task_s00000721_input_s00000263)+gi7.gu8.task_s00000757_input_s00000263)+gi7.gu8.task_s00000706_inputCriterion_s00000257_used)+gi7.gu42.task_s00000709_inputCriterion_s00000257_used)>=42))||((((((((((gi3.gi0.gu10.task_s00000713_output_s00000264+gi3.gi0.gu10.merge_s00000451_activated)+gi3.gi0.gu10.task_s00000725_input_s00000263)+gi3.gi0.gu10.task_s00000732_input_s00000263)+gi3.gi0.gu10.merge_s00000458_input_s00000263)+gi2.gu9.task_s00000726_input_s00000263)+gi5.gi1.gu14.task_s00000733_inputCriterion_s00000257_used)+gi3.gi0.gu10.decision_s00000784_input_s00000263)+gi3.gi0.gu10.decision_s00000802_input_s00000263)+gi7.gu8.task_s00000741_input_s00000263)>=7))||(gi5.gi1.gu14.decision_s00000780_activated<=(((((((((gi5.gi1.gu14.task_s00000740_inputCriterion_s00000257_used+gi5.gi1.gu14.task_s00000741_output_s00000264)+gi5.gi1.gu14.task_s00000726_output_s00000264)+gi5.gi1.gu14.merge_s00000455_activated)+gi5.gi1.gu14.task_s00000714_inputCriterion_s00000257_used)+gi5.gi1.gu14.merge_s00000451_input_s00000285)+gi5.gi1.gu14.task_s00000749_output_s00000264)+gi5.gi1.gu14.task_s00000733_inputCriterion_s00000257_used)+gi5.gi1.gu14.task_s00000711_output_s00000264)+gi5.gi1.gu14.task_s00000750_output_s00000264))))))] != FALSE)
dead was empty
(forward)formula 2,0,4.7563,148128,1,0,709,871505,608,422,7474,565247,1029
FORMULA IBM703-PT-none-CTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: !(AF(!(EX(EF((gi0.gu2.decision_s00000801_activated<=(((((((((gi0.gu2.merge_s00000461_input_s00000263+gi2.gu9.decision_s00000799_activated)+gi0.gu2.fork_s00000466_activated_s00000274)+gi0.gu2.task_s00000747_inputCriterion_s00000257_used)+gi0.gu2.merge_s00000283_input_s00000263)+gi0.gu2.decision_s00000776_activated)+gi0.gu2.decision_s00000787_activated)+gi0.gu2.task_s00000710_input_s00000263)+gi0.gu2.merge_s00000320_activated)+gi0.gu2.merge_s00000446_input_s00000263)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(E(TRUE U (gi0.gu2.decision_s00000801_activated<=(((((((((gi0.gu2.merge_s00000461_input_s00000263+gi2.gu9.decision_s00000799_activated)+gi0.gu2.fork_s00000466_activated_s00000274)+gi0.gu2.task_s00000747_inputCriterion_s00000257_used)+gi0.gu2.merge_s00000283_input_s00000263)+gi0.gu2.decision_s00000776_activated)+gi0.gu2.decision_s00000787_activated)+gi0.gu2.task_s00000710_input_s00000263)+gi0.gu2.merge_s00000320_activated)+gi0.gu2.merge_s00000446_input_s00000263)))))))] != FALSE
dead was empty
(forward)formula 3,0,4.78013,148656,1,0,711,875851,609,424,7512,568838,1035
FORMULA IBM703-PT-none-CTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EX(!(EF(EG(((gi5.gi1.gu7.fork_s00000466_activated_s00000272+gi5.gi1.gu7.task_s00000704_input_s00000263)<=((((((gi5.gi1.gu7.task_s00000705_inputCriterion_s00000257_used+gi0.gu2.merge_s00000461_input_s00000263)+gi3.gi0.gu11.task_s00000738_inputCriterion_s00000257_used)+gi10.gu24.decision_s00000805_activated)+gi4.gu4.task_s00000763_input_s00000263)+gi5.gi1.gu15.task_s00000747_output_s00000264)+gi5.gi1.gu15.merge_s00000449_input_s00000285))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U EG(((gi5.gi1.gu7.fork_s00000466_activated_s00000272+gi5.gi1.gu7.task_s00000704_input_s00000263)<=((((((gi5.gi1.gu7.task_s00000705_inputCriterion_s00000257_used+gi0.gu2.merge_s00000461_input_s00000263)+gi3.gi0.gu11.task_s00000738_inputCriterion_s00000257_used)+gi10.gu24.decision_s00000805_activated)+gi4.gu4.task_s00000763_input_s00000263)+gi5.gi1.gu15.task_s00000747_output_s00000264)+gi5.gi1.gu15.merge_s00000449_input_s00000285))))))] != FALSE
(forward)formula 4,0,5.06862,158424,1,0,835,963061,613,491,7544,614502,1259
FORMULA IBM703-PT-none-CTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************


BK_STOP 1620837661004

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 IBM703-PT-none, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r121-tall-162075406800337"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;