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-162075406800346.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 IBMB2S565S3960-PT-none, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075406800346
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 38K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 140K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 93K 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.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.2K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K 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 6.4K Mar 23 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 23 01:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 01:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K 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 127K 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 IBMB2S565S3960-PT-none-CTLFireability-00
FORMULA_NAME IBMB2S565S3960-PT-none-CTLFireability-01
FORMULA_NAME IBMB2S565S3960-PT-none-CTLFireability-02
FORMULA_NAME IBMB2S565S3960-PT-none-CTLFireability-03
FORMULA_NAME IBMB2S565S3960-PT-none-CTLFireability-04
FORMULA_NAME IBMB2S565S3960-PT-none-CTLFireability-05
FORMULA_NAME IBMB2S565S3960-PT-none-CTLFireability-06
FORMULA_NAME IBMB2S565S3960-PT-none-CTLFireability-07
FORMULA_NAME IBMB2S565S3960-PT-none-CTLFireability-08
FORMULA_NAME IBMB2S565S3960-PT-none-CTLFireability-09
FORMULA_NAME IBMB2S565S3960-PT-none-CTLFireability-10
FORMULA_NAME IBMB2S565S3960-PT-none-CTLFireability-11
FORMULA_NAME IBMB2S565S3960-PT-none-CTLFireability-12
FORMULA_NAME IBMB2S565S3960-PT-none-CTLFireability-13
FORMULA_NAME IBMB2S565S3960-PT-none-CTLFireability-14
FORMULA_NAME IBMB2S565S3960-PT-none-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620837759283

Running Version 0
[2021-05-12 16:42:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -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:42:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 16:42:44] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2021-05-12 16:42:44] [INFO ] Transformed 273 places.
[2021-05-12 16:42:44] [INFO ] Transformed 179 transitions.
[2021-05-12 16:42:44] [INFO ] Parsed PT model containing 273 places and 179 transitions in 89 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
[2021-05-12 16:42:44] [INFO ] Reduced 1 identical enabling conditions.
Support contains 250 out of 273 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 273/273 places, 179/179 transitions.
Ensure Unique test removed 3 places
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 260 transition count 178
Applied a total of 14 rules in 17 ms. Remains 260 /273 variables (removed 13) and now considering 178/179 (removed 1) transitions.
// Phase 1: matrix 178 rows 260 cols
[2021-05-12 16:42:44] [INFO ] Computed 94 place invariants in 24 ms
[2021-05-12 16:42:44] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 178 rows 260 cols
[2021-05-12 16:42:44] [INFO ] Computed 94 place invariants in 18 ms
[2021-05-12 16:42:45] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
// Phase 1: matrix 178 rows 260 cols
[2021-05-12 16:42:45] [INFO ] Computed 94 place invariants in 4 ms
[2021-05-12 16:42:45] [INFO ] Dead Transitions using invariants and state equation in 146 ms returned []
Finished structural reductions, in 1 iterations. Remains : 260/273 places, 178/179 transitions.
[2021-05-12 16:42:45] [INFO ] Flatten gal took : 47 ms
[2021-05-12 16:42:45] [INFO ] Flatten gal took : 20 ms
[2021-05-12 16:42:45] [INFO ] Input system was already deterministic with 178 transitions.
Incomplete random walk after 100000 steps, including 404 resets, run finished after 239 ms. (steps per millisecond=418 ) properties (out of 76) seen :75
Running SMT prover for 1 properties.
// Phase 1: matrix 178 rows 260 cols
[2021-05-12 16:42:45] [INFO ] Computed 94 place invariants in 5 ms
[2021-05-12 16:42:45] [INFO ] [Real]Absence check using 0 positive and 94 generalized place invariants in 14 ms returned sat
[2021-05-12 16:42:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:42:46] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2021-05-12 16:42:46] [INFO ] Computed and/alt/rep : 177/295/177 causal constraints (skipped 0 transitions) in 14 ms.
[2021-05-12 16:42:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:42:46] [INFO ] [Nat]Absence check using 0 positive and 94 generalized place invariants in 15 ms returned sat
[2021-05-12 16:42:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:42:46] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2021-05-12 16:42:46] [INFO ] Computed and/alt/rep : 177/295/177 causal constraints (skipped 0 transitions) in 20 ms.
[2021-05-12 16:42:46] [INFO ] Added : 116 causal constraints over 24 iterations in 318 ms. Result :sat
Ensure Unique test removed 79 places
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 181 transition count 110
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 82 rules applied. Total rules applied 150 place count 113 transition count 96
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 163 place count 100 transition count 96
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 163 place count 100 transition count 73
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 210 place count 76 transition count 73
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 215 place count 71 transition count 68
Iterating global reduction 3 with 5 rules applied. Total rules applied 220 place count 71 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 221 place count 71 transition count 67
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 223 place count 70 transition count 66
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 25 rules applied. Total rules applied 248 place count 56 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 250 place count 56 transition count 52
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 251 place count 55 transition count 51
Iterating global reduction 6 with 1 rules applied. Total rules applied 252 place count 55 transition count 51
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 6 with 2 rules applied. Total rules applied 254 place count 54 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 256 place count 53 transition count 52
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 258 place count 53 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 259 place count 53 transition count 51
Applied a total of 259 rules in 38 ms. Remains 53 /260 variables (removed 207) and now considering 51/178 (removed 127) transitions.
[2021-05-12 16:42:46] [INFO ] Flatten gal took : 4 ms
[2021-05-12 16:42:46] [INFO ] Flatten gal took : 4 ms
[2021-05-12 16:42:46] [INFO ] Input system was already deterministic with 51 transitions.
[2021-05-12 16:42:46] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:42:46] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:42:47] [INFO ] Time to serialize gal into /tmp/CTLFireability885677588406208745.gal : 3 ms
[2021-05-12 16:42:47] [INFO ] Time to serialize properties into /tmp/CTLFireability2903200150666888927.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/CTLFireability885677588406208745.gal, -t, CGAL, -ctl, /tmp/CTLFireability2903200150666888927.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/CTLFireability885677588406208745.gal -t CGAL -ctl /tmp/CTLFireability2903200150666888927.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,3.78445e+09,12.0286,256532,2,66787,5,1.08321e+06,6,0,264,1.78365e+06,0


Converting to forward existential form...Done !
original formula: !(A(EF(((((((merge.s00002240.activated>=1)||(callToProcess.s00003904.inputCriterion.s00001053.used>=1))||((callToTask.s00003963.input.s00001052>=1)&&(callToTask.s00003963.input.s00001066>=1)))||(decision.s00001840.activated>=1))||(decision.s00002761.activated>=1))&&((((((callToTask.s00003980.output.s00001077>=1)&&(callToTask.s00003980.output.s00001080>=1))&&(callToTask.s00003980.output.s00001083>=1))||(decision.s00002948.activated>=1))||(callToTask.s00003966.inputCriterion.s00001053.used>=1))||(decision.s00002761.activated>=1)))) U EG(((((((((((merge.s00002240.activated>=1)||(merge.s00002238.activated>=1))||(((merge.s00001161.input.s00001066>=1)&&(merge.s00001161.input.s00001127>=1))&&(merge.s00001161.input.s00001129>=1)))||(merge.s00002238.input.s00001052>=1))||(callToProcess.s00003859.inputCriterion.s00001053.used>=1))||(((callToTask.s00003968.output.s00001054>=1)&&(callToTask.s00003968.output.s00001077>=1))&&(callToTask.s00003968.output.s00001080>=1)))||(merge.s00001162.input.s00001127>=1))||((join.s00002243.input.s00001052>=1)&&(join.s00002243.input.s00001127>=1)))||(callToTask.s00001360.inputCriterion.s00001053.used>=1))||(((callToTask.s00003981.input.s00001052>=1)&&(callToTask.s00003981.input.s00001066>=1))&&(callToTask.s00003981.input.s00001068>=1))))))
=> equivalent forward existential formula: ([((FwdU(Init,!(EG(((((((((((merge.s00002240.activated>=1)||(merge.s00002238.activated>=1))||(((merge.s00001161.input.s00001066>=1)&&(merge.s00001161.input.s00001127>=1))&&(merge.s00001161.input.s00001129>=1)))||(merge.s00002238.input.s00001052>=1))||(callToProcess.s00003859.inputCriterion.s00001053.used>=1))||(((callToTask.s00003968.output.s00001054>=1)&&(callToTask.s00003968.output.s00001077>=1))&&(callToTask.s00003968.output.s00001080>=1)))||(merge.s00001162.input.s00001127>=1))||((join.s00002243.input.s00001052>=1)&&(join.s00002243.input.s00001127>=1)))||(callToTask.s00001360.inputCriterion.s00001053.used>=1))||(((callToTask.s00003981.input.s00001052>=1)&&(callToTask.s00003981.input.s00001066>=1))&&(callToTask.s00003981.input.s00001068>=1)))))) * !(E(TRUE U ((((((merge.s00002240.activated>=1)||(callToProcess.s00003904.inputCriterion.s00001053.used>=1))||((callToTask.s00003963.input.s00001052>=1)&&(callToTask.s00003963.input.s00001066>=1)))||(decision.s00001840.activated>=1))||(decision.s00002761.activated>=1))&&((((((callToTask.s00003980.output.s00001077>=1)&&(callToTask.s00003980.output.s00001080>=1))&&(callToTask.s00003980.output.s00001083>=1))||(decision.s00002948.activated>=1))||(callToTask.s00003966.inputCriterion.s00001053.used>=1))||(decision.s00002761.activated>=1)))))) * !(EG(((((((((((merge.s00002240.activated>=1)||(merge.s00002238.activated>=1))||(((merge.s00001161.input.s00001066>=1)&&(merge.s00001161.input.s00001127>=1))&&(merge.s00001161.input.s00001129>=1)))||(merge.s00002238.input.s00001052>=1))||(callToProcess.s00003859.inputCriterion.s00001053.used>=1))||(((callToTask.s00003968.output.s00001054>=1)&&(callToTask.s00003968.output.s00001077>=1))&&(callToTask.s00003968.output.s00001080>=1)))||(merge.s00001162.input.s00001127>=1))||((join.s00002243.input.s00001052>=1)&&(join.s00002243.input.s00001127>=1)))||(callToTask.s00001360.inputCriterion.s00001053.used>=1))||(((callToTask.s00003981.input.s00001052>=1)&&(callToTask.s00003981.input.s00001066>=1))&&(callToTask.s00003981.input.s00001068>=1))))))] != FALSE + [FwdG(Init,!(EG(((((((((((merge.s00002240.activated>=1)||(merge.s00002238.activated>=1))||(((merge.s00001161.input.s00001066>=1)&&(merge.s00001161.input.s00001127>=1))&&(merge.s00001161.input.s00001129>=1)))||(merge.s00002238.input.s00001052>=1))||(callToProcess.s00003859.inputCriterion.s00001053.used>=1))||(((callToTask.s00003968.output.s00001054>=1)&&(callToTask.s00003968.output.s00001077>=1))&&(callToTask.s00003968.output.s00001080>=1)))||(merge.s00001162.input.s00001127>=1))||((join.s00002243.input.s00001052>=1)&&(join.s00002243.input.s00001127>=1)))||(callToTask.s00001360.inputCriterion.s00001053.used>=1))||(((callToTask.s00003981.input.s00001052>=1)&&(callToTask.s00003981.input
Detected timeout of ITS tools.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:176)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:342)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:284)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:326)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:178)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:185)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:161)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:326)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:392)
at fr.lip6.move.gal.application.ITSRunner$ITSInterpreter.run(ITSRunner.java:182)
at java.base/java.lang.Thread.run(Thread.java:834)
[2021-05-12 16:43:27] [INFO ] Flatten gal took : 4 ms
[2021-05-12 16:43:27] [INFO ] Applying decomposition
[2021-05-12 16:43:27] [INFO ] Flatten gal took : 3 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/graph14259225485505953142.txt, -o, /tmp/graph14259225485505953142.bin, -w, /tmp/graph14259225485505953142.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/graph14259225485505953142.bin, -l, -1, -v, -w, /tmp/graph14259225485505953142.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 16:43:27] [INFO ] Decomposing Gal with order
[2021-05-12 16:43:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 16:43:27] [INFO ] Removed a total of 2 redundant transitions.
[2021-05-12 16:43:27] [INFO ] Flatten gal took : 54 ms
[2021-05-12 16:43:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 16:43:27] [INFO ] Time to serialize gal into /tmp/CTLFireability4019721200734389841.gal : 22 ms
[2021-05-12 16:43:27] [INFO ] Time to serialize properties into /tmp/CTLFireability17169696556350816631.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/CTLFireability4019721200734389841.gal, -t, CGAL, -ctl, /tmp/CTLFireability17169696556350816631.ctl], 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/CTLFireability4019721200734389841.gal -t CGAL -ctl /tmp/CTLFireability17169696556350816631.ctl
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,3.78445e+09,0.793403,23232,1013,1252,17918,29221,145,66245,99,144270,0


Converting to forward existential form...Done !
original formula: !(A(EF(((((((u0.merge.s00002240.activated>=1)||(i6.u5.callToProcess.s00003904.inputCriterion.s00001053.used>=1))||((i1.u12.callToTask.s00003963.input.s00001052>=1)&&(i1.u12.callToTask.s00003963.input.s00001066>=1)))||(u8.decision.s00001840.activated>=1))||(i1.u2.decision.s00002761.activated>=1))&&((((((u0.callToTask.s00003980.output.s00001077>=1)&&(u0.callToTask.s00003980.output.s00001080>=1))&&(u0.callToTask.s00003980.output.s00001083>=1))||(u0.decision.s00002948.activated>=1))||(u8.callToTask.s00003966.inputCriterion.s00001053.used>=1))||(i1.u2.decision.s00002761.activated>=1)))) U EG(((((((((((u0.merge.s00002240.activated>=1)||(u11.merge.s00002238.activated>=1))||(((u9.merge.s00001161.input.s00001066>=1)&&(u9.merge.s00001161.input.s00001127>=1))&&(u9.merge.s00001161.input.s00001129>=1)))||(u11.merge.s00002238.input.s00001052>=1))||(i6.u10.callToProcess.s00003859.inputCriterion.s00001053.used>=1))||(((u9.callToTask.s00003968.output.s00001054>=1)&&(u9.callToTask.s00003968.output.s00001077>=1))&&(u9.callToTask.s00003968.output.s00001080>=1)))||(i6.u10.merge.s00001162.input.s00001127>=1))||((i3.u7.join.s00002243.input.s00001052>=1)&&(i3.u6.join.s00002243.input.s00001127>=1)))||(i2.u4.callToTask.s00001360.inputCriterion.s00001053.used>=1))||(((i2.u1.callToTask.s00003981.input.s00001052>=1)&&(i2.u1.callToTask.s00003981.input.s00001066>=1))&&(i2.u3.callToTask.s00003981.input.s00001068>=1))))))
=> equivalent forward existential formula: ([((FwdU(Init,!(EG(((((((((((u0.merge.s00002240.activated>=1)||(u11.merge.s00002238.activated>=1))||(((u9.merge.s00001161.input.s00001066>=1)&&(u9.merge.s00001161.input.s00001127>=1))&&(u9.merge.s00001161.input.s00001129>=1)))||(u11.merge.s00002238.input.s00001052>=1))||(i6.u10.callToProcess.s00003859.inputCriterion.s00001053.used>=1))||(((u9.callToTask.s00003968.output.s00001054>=1)&&(u9.callToTask.s00003968.output.s00001077>=1))&&(u9.callToTask.s00003968.output.s00001080>=1)))||(i6.u10.merge.s00001162.input.s00001127>=1))||((i3.u7.join.s00002243.input.s00001052>=1)&&(i3.u6.join.s00002243.input.s00001127>=1)))||(i2.u4.callToTask.s00001360.inputCriterion.s00001053.used>=1))||(((i2.u1.callToTask.s00003981.input.s00001052>=1)&&(i2.u1.callToTask.s00003981.input.s00001066>=1))&&(i2.u3.callToTask.s00003981.input.s00001068>=1)))))) * !(E(TRUE U ((((((u0.merge.s00002240.activated>=1)||(i6.u5.callToProcess.s00003904.inputCriterion.s00001053.used>=1))||((i1.u12.callToTask.s00003963.input.s00001052>=1)&&(i1.u12.callToTask.s00003963.input.s00001066>=1)))||(u8.decision.s00001840.activated>=1))||(i1.u2.decision.s00002761.activated>=1))&&((((((u0.callToTask.s00003980.output.s00001077>=1)&&(u0.callToTask.s00003980.output.s00001080>=1))&&(u0.callToTask.s00003980.output.s00001083>=1))||(u0.decision.s00002948.activated>=1))||(u8.callToTask.s00003966.inputCriterion.s00001053.used>=1))||(i1.u2.decision.s00002761.activated>=1)))))) * !(EG(((((((((((u0.merge.s00002240.activated>=1)||(u11.merge.s00002238.activated>=1))||(((u9.merge.s00001161.input.s00001066>=1)&&(u9.merge.s00001161.input.s00001127>=1))&&(u9.merge.s00001161.input.s00001129>=1)))||(u11.merge.s00002238.input.s00001052>=1))||(i6.u10.callToProcess.s00003859.inputCriterion.s00001053.used>=1))||(((u9.callToTask.s00003968.output.s00001054>=1)&&(u9.callToTask.s00003968.output.s00001077>=1))&&(u9.callToTask.s00003968.output.s00001080>=1)))||(i6.u10.merge.s00001162.input.s00001127>=1))||((i3.u7.join.s00002243.input.s00001052>=1)&&(i3.u6.join.s00002243.input.s00001127>=1)))||(i2.u4.callToTask.s00001360.inputCriterion.s00001053.used>=1))||(((i2.u1.callToTask.s00003981.input.s00001052>=1)&&(i2.u1.callToTask.s00003981.input.s00001066>=1))&&(i2.u3.callToTask.s00003981.input.s00001068>=1))))))] != FALSE + [FwdG(Init,!(EG(((((((((((u0.merge.s00002240.activated>=1)||(u11.merge.s00002238.activated>=1))||(((u9.merge.s00001161.input.s00001066>=1)&&(u9.merge.s00001161.input.s00001127>=1))&&(u9.merge.s00001161.input.s00001129>=1)))||(u11.merge.s00002238.input.s00001052>=1))||(i6.u10.callToProcess.s00003859.inputCriterion.s00001053.used>=1))||(((u9.callToTask.s00003968.output.s00001054>=1)&&(u9.callToTask.s00003968.output.s00001077>=1))&&(u9.callToTask.s00003968.output.s00001080>=1)))||(i6.u10.merge.s00001162.input.s00001127>=1))||((i3.u7.join.s00002243.input.s00001052>=1)&&(i3.u6.join.s00002243.input.s00001127>=1)))||(i2.u4.callToTask.s00001360.inputCriterion.s00001053.used>=1))||(((i2.u1.callToTask.s00003981.input.s00001052>=1)&&(i2.u1.callToTask.s00003981.input.s00001066>=1))&&(i2.u3.callToTask.s00003981.input.s00001068>=1))))))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t25, t26, t28, t33, u0.t38, u0.t39, u8.t1, u8.t34, u8.t50, u9.t29, i1.u12.t15, i6.t37, i6.u5.t36, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/38/13/51
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Ensure Unique test removed 84 places
Reduce places removed 85 places and 1 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 175 transition count 85
Reduce places removed 92 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 99 rules applied. Total rules applied 191 place count 83 transition count 78
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 197 place count 77 transition count 78
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 197 place count 77 transition count 54
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 51 rules applied. Total rules applied 248 place count 50 transition count 54
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 248 place count 50 transition count 53
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 251 place count 48 transition count 53
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 258 place count 41 transition count 46
Iterating global reduction 3 with 7 rules applied. Total rules applied 265 place count 41 transition count 46
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 287 place count 30 transition count 34
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 291 place count 30 transition count 30
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 297 place count 27 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 298 place count 27 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 299 place count 26 transition count 30
Ensure Unique test removed 2 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 301 place count 24 transition count 30
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 303 place count 22 transition count 25
Iterating global reduction 6 with 2 rules applied. Total rules applied 305 place count 22 transition count 25
Applied a total of 305 rules in 25 ms. Remains 22 /260 variables (removed 238) and now considering 25/178 (removed 153) transitions.
[2021-05-12 16:43:57] [INFO ] Flatten gal took : 1 ms
[2021-05-12 16:43:57] [INFO ] Flatten gal took : 1 ms
[2021-05-12 16:43:57] [INFO ] Input system was already deterministic with 25 transitions.
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
FORMULA IBMB2S565S3960-PT-none-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ensure Unique test removed 51 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 209 transition count 153
Reduce places removed 25 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 44 rules applied. Total rules applied 69 place count 184 transition count 134
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 89 place count 165 transition count 133
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 89 place count 165 transition count 124
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 107 place count 156 transition count 124
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 111 place count 152 transition count 120
Iterating global reduction 3 with 4 rules applied. Total rules applied 115 place count 152 transition count 120
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 127 place count 146 transition count 114
Applied a total of 127 rules in 21 ms. Remains 146 /260 variables (removed 114) and now considering 114/178 (removed 64) transitions.
[2021-05-12 16:43:57] [INFO ] Flatten gal took : 6 ms
[2021-05-12 16:43:57] [INFO ] Flatten gal took : 8 ms
[2021-05-12 16:43:57] [INFO ] Input system was already deterministic with 114 transitions.
[2021-05-12 16:43:57] [INFO ] Flatten gal took : 7 ms
[2021-05-12 16:43:57] [INFO ] Flatten gal took : 6 ms
[2021-05-12 16:43:57] [INFO ] Time to serialize gal into /tmp/CTLFireability434356353877438250.gal : 2 ms
[2021-05-12 16:43:57] [INFO ] Time to serialize properties into /tmp/CTLFireability6156196403344316692.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/CTLFireability434356353877438250.gal, -t, CGAL, -ctl, /tmp/CTLFireability6156196403344316692.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/CTLFireability434356353877438250.gal -t CGAL -ctl /tmp/CTLFireability6156196403344316692.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-12 16:44:27] [INFO ] Flatten gal took : 7 ms
[2021-05-12 16:44:27] [INFO ] Applying decomposition
[2021-05-12 16:44:27] [INFO ] Flatten gal took : 7 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/graph7755069973157654740.txt, -o, /tmp/graph7755069973157654740.bin, -w, /tmp/graph7755069973157654740.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/graph7755069973157654740.bin, -l, -1, -v, -w, /tmp/graph7755069973157654740.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 16:44:27] [INFO ] Decomposing Gal with order
[2021-05-12 16:44:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 16:44:27] [INFO ] Removed a total of 7 redundant transitions.
[2021-05-12 16:44:27] [INFO ] Flatten gal took : 13 ms
[2021-05-12 16:44:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-12 16:44:27] [INFO ] Time to serialize gal into /tmp/CTLFireability12688988602101367345.gal : 3 ms
[2021-05-12 16:44:27] [INFO ] Time to serialize properties into /tmp/CTLFireability13549562646125462076.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/CTLFireability12688988602101367345.gal, -t, CGAL, -ctl, /tmp/CTLFireability13549562646125462076.ctl], 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/CTLFireability12688988602101367345.gal -t CGAL -ctl /tmp/CTLFireability13549562646125462076.ctl
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,3.19746e+14,4.09128,78876,4368,1039,75919,11451,431,608399,127,69421,0


Converting to forward existential form...Done !
original formula: (A(((((((((((!(A((((((i2.u0.callToProcess.s00001108.input.s00001066>=1)||(((i6.i0.u25.join.s00001163.activated.s00001062>=1)&&(i7.i1.u27.join.s00001163.activated.s00001064>=1))&&(i6.i1.u26.join.s00001163.activated.s00001065>=1)))||(i6.i1.u15.callToTask.s00003981.inputCriterion.s00001053.used>=1))||(i5.i1.u35.merge.s00001162.input.s00001068>=1))||((i0.u32.join.s00002243.input.s00001066>=1)&&(i0.u33.join.s00002243.input.s00001166>=1))) U ((((((((((i2.u22.fork.s00002500.activated.s00001073>=1)||(i6.i1.u15.callToTask.s00003981.inputCriterion.s00001053.used>=1))||(i6.i0.u29.fork.s00002501.activated.s00001073>=1))||(i4.i1.u31.decision.s00001158.activated>=1))||(((i2.u17.callToProcess.s00003957.input.s00001052>=1)&&(i2.u22.callToProcess.s00003957.input.s00001066>=1))&&(i2.u17.callToProcess.s00003957.input.s00001068>=1)))||(i5.i0.u24.process.s00000565__s00003960.input.s00001052>=1))||(((i3.i1.u19.callToProcess.s00003859.input.s00001052>=1)&&(i3.i1.u19.callToProcess.s00003859.input.s00001066>=1))&&(i3.i1.u19.callToProcess.s00003859.input.s00001068>=1)))||(((i4.i0.u34.fork.s00001298.input.s00001052>=1)&&(i4.i0.u34.fork.s00001298.input.s00001066>=1))&&(i4.i0.u34.fork.s00001298.input.s00001068>=1)))||(i5.i1.u35.merge.s00001162.input.s00001068>=1))||(i5.i1.u37.decision.s00002760.activated>=1)))) * (i3.i1.u12.callToTask.s00003975.inputCriterion.s00001053.used<1)) * ((i7.i0.u4.callToProcess.s00003884.output.s00001054<1)||(i7.i0.u4.callToProcess.s00003884.output.s00001083<1))) * ((i7.i0.u3.callToProcess.s00003880.input.s00001052<1)||(i7.i0.u3.callToProcess.s00003880.input.s00001066<1))) * (i5.i1.u35.merge.s00001162.input.s00001165<1)) * ((i2.u7.callToTask.s00003964.output.s00001054<1)||(i2.u7.callToTask.s00003964.output.s00001077<1))) * (i3.i0.u40.merge.s00002241.activated<1)) * (i4.i1.u20.callToTask.s00003971.inputCriterion.s00001053.used<1)) * ((i4.i1.u31.join.s00002243.input.s00001052<1)||(i4.i1.u31.join.s00002243.input.s00001127<1))) * EG((i4.i0.u8.callToTask.s00003966.inputCriterion.s00001053.used>=1))) * ((i5.i1.u30.join.s00001164.input.s00001052>=1) + AG(((((((((i7.i1.u27.join.s00001163.input.s00001066>=1)&&(i7.i1.u28.join.s00001163.input.s00001128>=1))||((i5.i1.u38.merge.s00002239.input.s00001052>=1)&&(i5.i1.u38.merge.s00002239.input.s00001068>=1)))||(i3.i0.u40.callToTask.s00003980.output.s00001054>=1))||(i5.i0.u23.fork.s00002755.activated.s00001073>=1))||(i1.i0.u9.callToTask.s00003968.inputCriterion.s00001053.used>=1))||(i2.u0.decision.s00002762.activated>=1))||(i6.i1.u26.callToTask.s00001360.inputCriterion.s00001053.used>=1))))) U (((((((((i5.i1.u37.callToProcess.s00003904.output.s00001054>=1)&&(i5.i1.u37.callToProcess.s00003904.output.s00001077>=1))||(((i8.u13.callToTask.s00003980.output.s00001077>=1)&&(i8.u13.callToTask.s00003980.output.s00001080>=1))&&(i8.u13.callToTask.s00003980.output.s00001083>=1)))||(i1.i0.u10.callToTask.s00003969.inputCriterion.s00001053.used>=1))||(i8.u6.decision.s00003020.activated>=1))||(i7.i0.u36.merge.s00002238.activated>=1))||((i6.i1.u15.callToTask.s00003981.output.s00001054>=1)&&(i6.i1.u15.callToTask.s00003981.output.s00001077>=1)))||(i8.u13.callToTask.s00003978.inputCriterion.s00001053.used>=1))||(i5.i1.u37.decision.s00002760.activated>=1))) + !(E(AF((((((((((((((((((((((((((((((((i8.u6.callToTask.s00003913.input.s00001052>=1)&&(i8.u6.callToTask.s00003913.input.s00001066>=1))||(i1.i1.u16.decision.s00001126.activated>=1))||(i4.i0.u8.merge.s00001061.activated>=1))||(((i1.i1.u16.callToTask.s00003962.input.s00001052>=1)&&(i1.i1.u16.callToTask.s00003962.input.s00001066>=1))&&(i1.i1.u16.callToTask.s00003962.input.s00001068>=1)))||((i1.i0.u10.callToTask.s00003969.input.s00001052>=1)&&(i1.i0.u10.callToTask.s00003969.input.s00001066>=1)))||((i4.i0.u8.callToTask.s00003966.input.s00001052>=1)&&(i4.i0.u8.callToTask.s00003966.input.s00001068>=1)))||((i2.u0.callToTask.s00003965.input.s00001052>=1)&&(i2.u0.callToTask.s00003965.input.s00001066>=1)))||((i6.i1.u26.callToTask.s00001360.output.s00001054>=1)&&(i6.i1.u26.callToTask.s00001360.output.s00001077>=1)))||(i7.i0.u3.callToProcess.s00003880.inputCriterion.s00001053.used>=1))||(i4.i1.u20.fork.s00001298.activated.s00001073>=1))||(i4.i1.u20.callToTask.s00003971.inputCriterion.s00001053.used>=1))||(i2.u17.decision.s00002056.activated>=1))||(((i3.i1.u12.callToTask.s00003975.output.s00001054>=1)&&(i3.i1.u12.callToTask.s00003975.output.s00001077>=1))&&(i3.i1.u12.callToTask.s00003975.output.s00001080>=1)))||(i2.u0.callToProcess.s00001108.input.s00001066>=1))||(i7.i0.u36.merge.s00002238.input.s00001052>=1))||((i8.u2.callToProcess.s00003876.output.s00001054>=1)&&(i8.u2.callToProcess.s00003876.output.s00001077>=1)))||(i5.i1.u38.merge.s00002239.activated>=1))||(((i4.i0.u5.callToTask.s00003908.output.s00001054>=1)&&(i4.i0.u5.callToTask.s00003908.output.s00001077>=1))&&(i4.i0.u5.callToTask.s00003908.output.s00001083>=1)))||(i1.i1.u11.decision.s00001159.activated>=1))||(i5.i0.u23.fork.s00002755.activated.s00001073>=1))||(i6.i1.u14.fork.s00001403.activated.s00001078>=1))||(i8.u39.decision.s00003021.activated>=1))||(i4.i0.u5.callToTask.s00003908.inputCriterion.s00001053.used>=1))||((i6.i1.u26.callToTask.s00001360.output.s00001054>=1)&&(i6.i1.u26.callToTask.s00001360.output.s00001077>=1)))||((i6.i1.u15.callToTask.s00003981.output.s00001054>=1)&&(i6.i1.u15.callToTask.s00003981.output.s00001077>=1)))||(((i2.u17.callToProcess.s00003876.input.s00001052>=1)&&(i2.u1.callToProcess.s00003876.input.s00001066>=1))&&(i2.u17.callToProcess.s00003876.input.s00001068>=1)))||(i4.i0.u34.decision.s00001841.activated>=1))||(((i1.i0.u9.callToTask.s00003968.output.s00001054>=1)&&(i1.i0.u9.callToTask.s00003968.output.s00001077>=1))&&(i1.i0.u9.callToTask.s00003968.output.s00001080>=1)))||(i3.i0.u18.decision.s00002761.activated>=1))||(((i1.i0.u9.callToTask.s00003969.output.s00001054>=1)&&(i1.i0.u10.callToTask.s00003969.output.s00001077>=1))&&(i1.i0.u10.callToTask.s00003969.output.s00001080>=1)))) U AG((!(EG(((((((((i1.i1.u16.callToTask.s00003970.output.s00001054>=1)&&(i1.i1.u16.callToTask.s00003970.output.s00001077>=1))||(((i3.i1.u12.callToTask.s00003975.output.s00001054>=1)&&(i3.i1.u12.callToTask.s00003975.output.s00001077>=1))&&(i3.i1.u12.callToTask.s00003975.output.s00001080>=1)))||((i8.u13.callToTask.s00003978.output.s00001077>=1)&&(i8.u13.callToTask.s00003978.output.s00001080>=1)))||(i5.i1.u38.merge.s00002239.activated>=1))||((i6.i0.u25.join.s00001163.input.s00001052>=1)&&(i6.i0.u29.join.s00001163.input.s00001259>=1)))||(i8.u13.callToTask.s00003978.inputCriterion.s00001053.used>=1))||((i1.i0.u10.callToTask.s00003969.input.s00001052>=1)&&(i1.i0.u10.callToTask.s00003969.input.s00001066>=1))))) + ((i1.i1.u11.callToTask.s00003976.input.s00001052>=1)&&(i1.i1.u11.callToTask.s00003976.input.s00001066>=1)))))))
=> equivalent forward existential formula: [(FwdU((Init * !(!((E(!((((((((((i5.i1.u37.callToProcess.s00003904.output.s00001054>=1)&&(i5.i1.u37.callToProcess.s00003904.output.s00001077>=1))||(((i8.u13.callToTask.s00003980.output.s00001077>=1)&&(i8.u13.callToTask.s00003980.output.s00001080>=1))&&(i8.u13.callToTask.s00003980.output.s00001083>=1)))||(i1.i0.u10.callToTask.s00003969.inputCriterion.s00001053.used>=1))||(i8.u6.decision.s00003020.activated>=1))||(i7.i0.u36.merge.s00002238.activated>=1))||((i6.i1.u15.callToTask.s00003981.output.s00001054>=1)&&(i6.i1.u15.callToTask.s00003981.output.s00001077>=1)))||(i8.u13.callToTask.s00003978.inputCriterion.s00001053.used>=1))||(i5.i1.u37.decision.s00002760.activated>=1))) U (!(((((((((((!(!((E(!(((((((((((i2.u22.fork.s00002500.activated.s00001073>=1)||(i6.i1.u15.callToTask.s00003981.inputCriterion.s00001053.used>=1))||(i6.i0.u29.fork.s00002501.activated.s00001073>=1))||(i4.i1.u31.decision.s00001158.activated>=1))||(((i2.u17.callToProcess.s00003957.input.s00001052>=1)&&(i2.u22.callToProcess.s00003957.input.s00001066>=1))&&(i2.u17.callToProcess.s00003957.input.s00001068>=1)))||(i5.i0.u24.process.s00000565__s00003960.input.s00001052>=1))||(((i3.i1.u19.callToProcess.s00003859.input.s00001052>=1)&&(i3.i1.u19.callToProcess.s00003859.input.s00001066>=1))&&(i3.i1.u19.callToProcess.s00003859.input.s00001068>=1)))||(((i4.i0.u34.fork.s00001298.input.s00001052>=1)&&(i4.i0.u34.fork.s00001298.input.s00001066>=1))&&(i4.i0.u34.fork.s00001298.input.s00001068>=1)))||(i5.i1.u35.merge.s00001162.input.s00001068>=1))||(i5.i1.u37.decision.s00002760.activated>=1))) U (!((((((i2.u0.callToProcess.s00001108.input.s00001066>=1)||(((i6.i0.u25.join.s00001163.activated.s00001062>=1)&&(i7.i1.u27.join.s00001163.activated.s00001064>=1))&&(i6.i1.u26.join.s00001163.activated.s00001065>=1)))||(i6.i1.u15.callToTask.s00003981.inputCriterion.s00001053.used>=1))||(i5.i1.u35.merge.s00001162.input.s00001068>=1))||((i0.u32.join.s00002243.input.s00001066>=1)&&(i0.u33.join.s00002243.input.s00001166>=1)))) * !(((((((((((i2.u22.fork.s00002500.activated.s00001073>=1)||(i6.i1.u15.callToTask.s00003981.inputCriterion.s00001053.used>=1))||(i6.i0.u29.fork.s00002501.activated.s00001073>=1))||(i4.i1.u31.decision.s00001158.activated>=1))||(((i2.u17.callToProcess.s00003957.input.s00001052>=1)&&(i2.u22.callToProcess.s00003957.input.s00001066>=1))&&(i2.u17.callToProcess.s00003957.input.s00001068>=1)))||(i5.i0.u24.process.s00000565__s00003960.input.s00001052>=1))||(((i3.i1.u19.callToProcess.s00003859.input.s00001052>=1)&&(i3.i1.u19.callToProcess.s00003859.input.s00001066>=1))&&(i3.i1.u19.callToProcess.s00003859.input.s00001068>=1)))||(((i4.i0.u34.fork.s00001298.input.s00001052>=1)&&(i4.i0.u34.fork.s00001298.input.s00001066>=1))&&(i4.i0.u34.fork.s00001298.input.s00001068>=1)))||(i5.i1.u35.merge.s00001162.input.s00001068>=1))||(i5.i1.u37.decision.s00002760.activated>=1))))) + EG(!(((((((((((i2.u22.fork.s00002500.activated.s00001073>=1)||(i6.i1.u15.callToTask.s00003981.inputCriterion.s00001053.used>=1))||(i6.i0.u29.fork.s00002501.activated.s00001073>=1))||(i4.i1.u31.decision.s00001158.activated>=1))||(((i2.u17.callToProcess.s00003957.input.s00001052>=1)&&(i2.u22.callToProcess.s00003957.input.s00001066>=1))&&(i2.u17.callToProcess.s00003957.input.s00001068>=1)))||(i5.i0.u24.process.s00000565__s00003960.input.s00001052>=1))||(((i3.i1.u19.callToProcess.s00003859.input.s00001052>=1)&&(i3.i1.u19.callToProcess.s00003859.input.s00001066>=1))&&(i3.i1.u19.callToProcess.s00003859.input.s00001068>=1)))||(((i4.i0.u34.fork.s00001298.input.s00001052>=1)&&(i4.i0.u34.fork.s00001298.input.s00001066>=1))&&(i4.i0.u34.fork.s00001298.input.s00001068>=1)))||(i5.i1.u35.merge.s00001162.input.s00001068>=1))||(i5.i1.u37.decision.s00002760.activated>=1))))))) * (i3.i1.u12.callToTask.s00003975.inputCriterion.s00001053.used<1)) * ((i7.i0.u4.callToProcess.s00003884.output.s00001054<1)||(i7.i0.u4.callToProcess.s00003884.output.s00001083<1))) * ((i7.i0.u3.callToProcess.s00003880.input.s00001052<1)||(i7.i0.u3.callToProcess.s00003880.input.s00001066<1))) * (i5.i1.u35.merge.s00001162.input.s00001165<1)) * ((i2.u7.callToTask.s00003964.output.s00001054<1)||(i2.u7.callToTask.s00003964.output.s00001077<1))) * (i3.i0.u40.merge.s00002241.activated<1)) * (i4.i1.u20.callToTask.s00003971.inputCriterion.s00001053.used<1)) * ((i4.i1.u31.join.s00002243.input.s00001052<1)||(i4.i1.u31.join.s00002243.input.s00001127<1))) * EG((i4.i0.u8.callToTask.s00003966.inputCriterion.s00001053.used>=1))) * ((i5.i1.u30.join.s00001164.input.s00001052>=1) + !(E(TRUE U !(((((((((i7.i1.u27.join.s00001163.input.s00001066>=1)&&(i7.i1.u28.join.s00001163.input.s00001128>=1))||((i5.i1.u38.merge.s00002239.input.s00001052>=1)&&(i5.i1.u38.merge.s00002239.input.s00001068>=1)))||(i3.i0.u40.callToTask.s00003980.output.s00001054>=1))||(i5.i0.u23.fork.s00002755.activated.s00001073>=1))||(i1.i0.u9.callToTask.s00003968.inputCriterion.s00001053.used>=1))||(i2.u0.decision.s00002762.activated>=1))||(i6.i1.u26.callToTask.s00001360.inputCriterion.s00001053.used>=1)))))))) * !((((((((((i5.i1.u37.callToProcess.s00003904.output.s00001054>=1)&&(i5.i1.u37.callToProcess.s00003904.output.s00001077>=1))||(((i8.u13.callToTask.s00003980.output.s00001077>=1)&&(i8.u13.callToTask.s00003980.output.s00001080>=1))&&(i8.u13.callToTask.s00003980.output.s00001083>=1)))||(i1.i0.u10.callToTask.s00003969.inputCriterion.s00001053.used>=1))||(i8.u6.decision.s00003020.activated>=1))||(i7.i0.u36.merge.s00002238.activated>=1))||((i6.i1.u15.callToTask.s00003981.output.s00001054>=1)&&(i6.i1.u15.callToTask.s00003981.output.s00001077>=1)))||(i8.u13.callToTask.s00003978.inputCriterion.s00001053.used>=1))||(i5.i1.u37.decision.s00002760.activated>=1))))) + EG(!((((((((((i5.i1.u37.callToProcess.s00003904.output.s00001054>=1)&&(i5.i1.u37.callToProcess.s00003904.output.s00001077>=1))||(((i8.u13.callToTask.s00003980.output.s00001077>=1)&&(i8.u13.callToTask.s00003980.output.s00001080>=1))&&(i8.u13.callToTask.s00003980.output.s00001083>=1)))||(i1.i0.u10.callToTask.s00003969.inputCriterion.s00001053.used>=1))||(i8.u6.decision.s00003020.activated>=1))||(i7.i0.u36.merge.s00002238.activated>=1))||((i6.i1.u15.callToTask.s00003981.output.s00001054>=1)&&(i6.i1.u15.callToTask.s00003981.output.s00001077>=1)))||(i8.u13.callToTask.s00003978.inputCriterion.s00001053.used>=1))||(i5.i1.u37.decision.s00002760.activated>=1)))))))),!(EG(!((((((((((((((((((((((((((((((((i8.u6.callToTask.s00003913.input.s00001052>=1)&&(i8.u6.callToTask.s00003913.input.s00001066>=1))||(i1.i1.u16.decision.s00001126.activated>=1))||(i4.i0.u8.merge.s00001061.activated>=1))||(((i1.i1.u16.callToTask.s00003962.input.s00001052>=1)&&(i1.i1.u16.callToTask.s00003962.input.s00001066>=1))&&(i1.i1.u16.callToTask.s00003962.input.s00001068>=1)))||((i1.i0.u10.callToTask.s00003969.input.s00001052>=1)&&(i1.i0.u10.callToTask.s00003969.input.s00001066>=1)))||((i4.i0.u8.callToTask.s00003966.input.s00001052>=1)&&(i4.i0.u8.callToTask.s00003966.input.s00001068>=1)))||((i2.u0.callToTask.s00003965.input.s00001052>=1)&&(i2.u0.callToTask.s00003965.input.s00001066>=1)))||((i6.i1.u26.callToTask.s00001360.output.s00001054>=1)&&(i6.i1.u26.callToTask.s00001360.output.s00001077>=1)))||(i7.i0.u3.callToProcess.s00003880.inputCriterion.s00001053.used>=1))||(i4.i1.u20.fork.s00001298.activated.s00001073>=1))||(i4.i1.u20.callToTask.s00003971.inputCriterion.s00001053.used>=1))||(i2.u17.decision.s00002056.activated>=1))||(((i3.i1.u12.callToTask.s00003975.output.s00001054>=1)&&(i3.i1.u12.callToTask.s00003975.output.s00001077>=1))&&(i3.i1.u12.callToTask.s00003975.output.s00001080>=1)))||(i2.u0.callToProcess.s00001108.input.s00001066>=1))||(i7.i0.u36.merge.s00002238.input.s00001052>=1))||((i8.u2.callToProcess.s00003876.output.s00001054>=1)&&(i8.u2.callToProcess.s00003876.output.s00001077>=1)))||(i5.i1.u38.merge.s00002239.activated>=1))||(((i4.i0.u5.callToTask.s00003908.output.s00001054>=1)&&(i4.i0.u5.callToTask.s00003908.output.s00001077>=1))&&(i4.i0.u5.callToTask.s00003908.output.s00001083>=1)))||(i1.i1.u11.decision.s00001159.activated>=1))||(i5.i0.u23.fork.s00002755.activated.s00001073>=1))||(i6.i1.u14.fork.s00001403.activated.s00001078>=1))||(i8.u39.decision.s00003021.activated>=1))||(i4.i0.u5.callToTask.s00003908.inputCriterion.s00001053.used>=1))||((i6.i1.u26.callToTask.s00001360.output.s00001054>=1)&&(i6.i1.u26.callToTask.s00001360.output.s00001077>=1)))||((i6.i1.u15.callToTask.s00003981.output.s00001054>=1)&&(i6.i1.u15.callToTask.s00003981.output.s00001077>=1)))||(((i2.u17.callToProcess.s00003876.input.s00001052>=1)&&(i2.u1.callToProcess.s00003876.input.s00001066>=1))&&(i2.u17.callToProcess.s00003876.input.s00001068>=1)))||(i4.i0.u34.decision.s00001841.activated>=1))||(((i1.i0.u9.callToTask.s00003968.output.s00001054>=1)&&(i1.i0.u9.callToTask.s00003968.output.s00001077>=1))&&(i1.i0.u9.callToTask.s00003968.output.s00001080>=1)))||(i3.i0.u18.decision.s00002761.activated>=1))||(((i1.i0.u9.callToTask.s00003969.output.s00001054>=1)&&(i1.i0.u10.callToTask.s00003969.output.s00001077>=1))&&(i1.i0.u10.callToTask.s00003969.output.s00001080>=1))))))) * !(E(TRUE U !((!(EG(((((((((i1.i1.u16.callToTask.s00003970.output.s00001054>=1)&&(i1.i1.u16.callToTask.s00003970.output.s00001077>=1))||(((i3.i1.u12.callToTask.s00003975.output.s00001054>=1)&&(i3.i1.u12.callToTask.s00003975.output.s00001077>=1))&&(i3.i1.u12.callToTask.s00003975.output.s00001080>=1)))||((i8.u13.callToTask.s00003978.output.s00001077>=1)&&(i8.u13.callToTask.s00003978.output.s00001080>=1)))||(i5.i1.u38.merge.s00002239.activated>=1))||((i6.i0.u25.join.s00001163.input.s00001052>=1)&&(i6.i0.u29.join.s00001163.input.s00001259>=1)))||(i8.u13.callToTask.s00003978.inputCriterion.s00001053.used>=1))||((i1.i0.u10.callToTask.s00003969.input.s00001052>=1)&&(i1.i0.u10.callToTask.s00003969.input.s00001066>=1))))) + ((i1.i1.u11.callToTask.s00003976.input.s00001052>=1)&&(i1.i1.u11.callToTask.s00003976.input.s00001066>=1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t28, t81, t111, i2.u0.t82, i2.u0.t88, i2.u7.t89, i3.i0.t78, i3.i0.u40.t79, i4.t25, i4.i0.t30, i4.i0.u8.t11, i5.i1.t93, i5.i1.u37.t37, i5.i1.u38.t75, i7.i0.t73, i8.t108, i8.t95, i8.u6.t43, i8.u39.t94, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/95/19/114
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:176)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:342)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:284)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:326)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:178)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:185)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:161)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:326)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:392)
at fr.lip6.move.gal.application.ITSRunner$ITSInterpreter.run(ITSRunner.java:182)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
Ensure Unique test removed 80 places
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 180 transition count 98
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 90 rules applied. Total rules applied 170 place count 100 transition count 88
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 179 place count 91 transition count 88
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 179 place count 91 transition count 65
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 225 place count 68 transition count 65
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 231 place count 62 transition count 59
Iterating global reduction 3 with 6 rules applied. Total rules applied 237 place count 62 transition count 59
Performed 14 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 267 place count 46 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 269 place count 46 transition count 41
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 4 with 2 rules applied. Total rules applied 271 place count 45 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 273 place count 44 transition count 40
Applied a total of 273 rules in 17 ms. Remains 44 /260 variables (removed 216) and now considering 40/178 (removed 138) transitions.
[2021-05-12 16:45:06] [INFO ] Flatten gal took : 3 ms
[2021-05-12 16:45:06] [INFO ] Flatten gal took : 2 ms
[2021-05-12 16:45:06] [INFO ] Input system was already deterministic with 40 transitions.
[2021-05-12 16:45:06] [INFO ] Flatten gal took : 2 ms
[2021-05-12 16:45:06] [INFO ] Flatten gal took : 2 ms
[2021-05-12 16:45:06] [INFO ] Time to serialize gal into /tmp/CTLFireability8170862115063047591.gal : 0 ms
[2021-05-12 16:45:06] [INFO ] Time to serialize properties into /tmp/CTLFireability5877275470967847449.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/CTLFireability8170862115063047591.gal, -t, CGAL, -ctl, /tmp/CTLFireability5877275470967847449.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/CTLFireability8170862115063047591.gal -t CGAL -ctl /tmp/CTLFireability5877275470967847449.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,5.19321e+07,3.85402,93364,2,25411,5,315667,6,0,220,617434,0


Converting to forward existential form...Done !
original formula: E(!(AG(AF((((((((((callToTask.s00003975.input.s00001052>=1)&&(callToTask.s00003975.input.s00001066>=1))&&(callToTask.s00003975.input.s00001068>=1))&&(callToTask.s00003975.input.s00001127>=1))||(alpha>=1))||((callToTask.s00003976.output.s00001054>=1)&&(callToTask.s00003976.output.s00001077>=1)))||((callToTask.s00003973.output.s00001054>=1)&&(callToTask.s00003973.output.s00001077>=1)))||(decision.s00001123.activated>=1))||(fork.s00001403.activated.s00001078>=1))))) U ((((((join.s00001164.input.s00001052>=1)||(fork.s00002501.activated.s00001073>=1))||(callToProcess.s00003859.inputCriterion.s00001053.used>=1))||(decision.s00001126.activated>=1))||(((callToTask.s00003980.output.s00001077>=1)&&(callToTask.s00003980.output.s00001080>=1))&&(callToTask.s00003980.output.s00001083>=1)))||((callToProcess.s00003872.input.s00001052>=1)&&(callToProcess.s00003872.input.s00001066>=1))))
=> equivalent forward existential formula: [(FwdU(Init,!(!(E(TRUE U !(!(EG(!((((((((((callToTask.s00003975.input.s00001052>=1)&&(callToTask.s00003975.input.s00001066>=1))&&(callToTask.s00003975.input.s00001068>=1))&&(callToTask.s00003975.input.s00001127>=1))||(alpha>=1))||((callToTask.s00003976.output.s00001054>=1)&&(callToTask.s00003976.output.s00001077>=1)))||((callToTask.s00003973.output.s00001054>=1)&&(callToTask.s00003973.output.s00001077>=1)))||(decision.s00001123.activated>=1))||(fork.s00001403.activated.s00001078>=1)))))))))) * ((((((join.s00001164.input.s00001052>=1)||(fork.s00002501.activated.s00001073>=1))||(callToProcess.s00003859.inputCriterion.s00001053.used>=1))||(decision.s00001126.activated>=1))||(((callToTask.s00003980.output.s00001077>=1)&&(callToTask.s00003980.output.s00001080>=1))&&(callToTask.s00003980.output.s00001083>=1)))||((callToProcess.s00003872.input.s00001052>=1)&&(callToProcess.s00003872.input.s00001066>=1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t19, t20, t21, t22, t24, t28, t31, t32, t33, t35, t36, t37, t38, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/27/13/40
Detected timeout of ITS tools.
[2021-05-12 16:45:36] [INFO ] Flatten gal took : 2 ms
[2021-05-12 16:45:36] [INFO ] Applying decomposition
[2021-05-12 16:45:36] [INFO ] Flatten gal took : 2 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/graph78825279478122393.txt, -o, /tmp/graph78825279478122393.bin, -w, /tmp/graph78825279478122393.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/graph78825279478122393.bin, -l, -1, -v, -w, /tmp/graph78825279478122393.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 16:45:42] [INFO ] Decomposing Gal with order
[2021-05-12 16:45:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 16:45:42] [INFO ] Removed a total of 6 redundant transitions.
[2021-05-12 16:45:42] [INFO ] Flatten gal took : 4 ms
[2021-05-12 16:45:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 8 ms.
[2021-05-12 16:45:42] [INFO ] Time to serialize gal into /tmp/CTLFireability3015550920666621383.gal : 0 ms
[2021-05-12 16:45:42] [INFO ] Time to serialize properties into /tmp/CTLFireability5162818135205363168.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/CTLFireability3015550920666621383.gal, -t, CGAL, -ctl, /tmp/CTLFireability5162818135205363168.ctl], 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/CTLFireability3015550920666621383.gal -t CGAL -ctl /tmp/CTLFireability5162818135205363168.ctl
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,5.19321e+07,0.207423,10652,613,735,7314,8523,124,20733,73,31761,0


Converting to forward existential form...Done !
original formula: E(!(AG(AF((((((((((u11.callToTask.s00003975.input.s00001052>=1)&&(u11.callToTask.s00003975.input.s00001066>=1))&&(u11.callToTask.s00003975.input.s00001068>=1))&&(u11.callToTask.s00003975.input.s00001127>=1))||(i5.u9.alpha>=1))||((u10.callToTask.s00003976.output.s00001054>=1)&&(u10.callToTask.s00003976.output.s00001077>=1)))||((u4.callToTask.s00003973.output.s00001054>=1)&&(u4.callToTask.s00003973.output.s00001077>=1)))||(u3.decision.s00001123.activated>=1))||(u2.fork.s00001403.activated.s00001078>=1))))) U ((((((i5.u8.join.s00001164.input.s00001052>=1)||(i3.u7.fork.s00002501.activated.s00001073>=1))||(i5.u0.callToProcess.s00003859.inputCriterion.s00001053.used>=1))||(u3.decision.s00001126.activated>=1))||(((u10.callToTask.s00003980.output.s00001077>=1)&&(u10.callToTask.s00003980.output.s00001080>=1))&&(u10.callToTask.s00003980.output.s00001083>=1)))||((i0.u1.callToProcess.s00003872.input.s00001052>=1)&&(i0.u1.callToProcess.s00003872.input.s00001066>=1))))
=> equivalent forward existential formula: [(FwdU(Init,!(!(E(TRUE U !(!(EG(!((((((((((u11.callToTask.s00003975.input.s00001052>=1)&&(u11.callToTask.s00003975.input.s00001066>=1))&&(u11.callToTask.s00003975.input.s00001068>=1))&&(u11.callToTask.s00003975.input.s00001127>=1))||(i5.u9.alpha>=1))||((u10.callToTask.s00003976.output.s00001054>=1)&&(u10.callToTask.s00003976.output.s00001077>=1)))||((u4.callToTask.s00003973.output.s00001054>=1)&&(u4.callToTask.s00003973.output.s00001077>=1)))||(u3.decision.s00001123.activated>=1))||(u2.fork.s00001403.activated.s00001078>=1)))))))))) * ((((((i5.u8.join.s00001164.input.s00001052>=1)||(i3.u7.fork.s00002501.activated.s00001073>=1))||(i5.u0.callToProcess.s00003859.inputCriterion.s00001053.used>=1))||(u3.decision.s00001126.activated>=1))||(((u10.callToTask.s00003980.output.s00001077>=1)&&(u10.callToTask.s00003980.output.s00001080>=1))&&(u10.callToTask.s00003980.output.s00001083>=1)))||((i0.u1.callToProcess.s00003872.input.s00001052>=1)&&(i0.u1.callToProcess.s00003872.input.s00001066>=1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t19, t20, t21, u4.t24, u4.t35, u10.t31, u10.t32, u10.t33, u11.t28, i0.u1.t22, i5.t38, i5.t37, i5.t36, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/26/13/39
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,6.8573,175508,1,0,203036,61758,822,682798,556,553745,144209
FORMULA IBMB2S565S3960-PT-none-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2021-05-12 16:45:49] [INFO ] Flatten gal took : 17 ms
[2021-05-12 16:45:49] [INFO ] Flatten gal took : 12 ms
[2021-05-12 16:45:49] [INFO ] Applying decomposition
[2021-05-12 16:45:49] [INFO ] Flatten gal took : 13 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/graph661138767467823517.txt, -o, /tmp/graph661138767467823517.bin, -w, /tmp/graph661138767467823517.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/graph661138767467823517.bin, -l, -1, -v, -w, /tmp/graph661138767467823517.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 16:45:49] [INFO ] Decomposing Gal with order
[2021-05-12 16:45:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 16:45:49] [INFO ] Removed a total of 6 redundant transitions.
[2021-05-12 16:45:49] [INFO ] Flatten gal took : 33 ms
[2021-05-12 16:45:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2021-05-12 16:45:49] [INFO ] Time to serialize gal into /tmp/CTLFireability7301120664234683038.gal : 16 ms
[2021-05-12 16:45:49] [INFO ] Time to serialize properties into /tmp/CTLFireability12979825551419043224.ctl : 26 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/CTLFireability7301120664234683038.gal, -t, CGAL, -ctl, /tmp/CTLFireability12979825551419043224.ctl], 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/CTLFireability7301120664234683038.gal -t CGAL -ctl /tmp/CTLFireability12979825551419043224.ctl
No direction supplied, using forward translation only.
Parsed 14 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,1.31984e+16,13.1933,239980,7126,2252,288363,38951,684,1.43046e+06,186,442054,0


Converting to forward existential form...Done !
original formula: AF((AX(((((((i11.i0.u6.callToProcess.s00003904.output.s00001054>=1)&&(i11.i0.u6.callToProcess.s00003904.output.s00001077>=1))||(i9.u3.fork.s00002500.activated.s00001075>=1))||(i2.i1.u11.decision.s00003021.activated>=1))||((i11.i0.u49.join.s00001164.activated.s00001062>=1)&&(i11.i1.u50.join.s00001164.activated.s00001064>=1)))||(i0.u39.decision.s00002760.activated>=1))) * ((((i9.u0.callToProcess.s00001108.input.s00001066>=1)||(i4.i0.u27.callToTask.s00003975.inputCriterion.s00001053.used>=1))||(i12.u40.decision.s00002948.activated>=1))||(((i4.i0.u52.join.s00002243.input.s00001068>=1)&&(i4.i0.u52.join.s00002243.input.s00001167>=1))&&(i4.i0.u52.join.s00002243.input.s00001263>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(((((((i11.i0.u6.callToProcess.s00003904.output.s00001054>=1)&&(i11.i0.u6.callToProcess.s00003904.output.s00001077>=1))||(i9.u3.fork.s00002500.activated.s00001075>=1))||(i2.i1.u11.decision.s00003021.activated>=1))||((i11.i0.u49.join.s00001164.activated.s00001062>=1)&&(i11.i1.u50.join.s00001164.activated.s00001064>=1)))||(i0.u39.decision.s00002760.activated>=1))))) * ((((i9.u0.callToProcess.s00001108.input.s00001066>=1)||(i4.i0.u27.callToTask.s00003975.inputCriterion.s00001053.used>=1))||(i12.u40.decision.s00002948.activated>=1))||(((i4.i0.u52.join.s00002243.input.s00001068>=1)&&(i4.i0.u52.join.s00002243.input.s00001167>=1))&&(i4.i0.u52.join.s00002243.input.s00001263>=1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t142, t177, i0.t154, i0.u39.t93, i2.i1.t171, i2.i1.u12.t107, i2.i1.u41.t169, i2.i1.u41.t170, i3.u13.t23, i4.i1.t173, i4.i1.u64.t174, i6.t144, i6.t143, i6.i3.t141, i6.i3.u17.t33, i9.u0.t1, i9.u18.t35, i11.i0.u62.t166, i14.t164, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/158/19/177
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2021-05-12 16:52:44] [INFO ] Flatten gal took : 13 ms
[2021-05-12 16:52:44] [INFO ] Time to serialize gal into /tmp/CTLFireability168274122569608878.gal : 1 ms
[2021-05-12 16:52:44] [INFO ] Time to serialize properties into /tmp/CTLFireability18399238045290428908.ctl : 3 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/CTLFireability168274122569608878.gal, -t, CGAL, -ctl, /tmp/CTLFireability18399238045290428908.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/CTLFireability168274122569608878.gal -t CGAL -ctl /tmp/CTLFireability18399238045290428908.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
Detected timeout of ITS tools.
[2021-05-12 17:13:45] [INFO ] Flatten gal took : 9 ms
[2021-05-12 17:13:45] [INFO ] Input system was already deterministic with 178 transitions.
[2021-05-12 17:13:45] [INFO ] Transformed 260 places.
[2021-05-12 17:13:45] [INFO ] Transformed 178 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-12 17:13:45] [INFO ] Time to serialize gal into /tmp/CTLFireability15159601199686925533.gal : 1 ms
[2021-05-12 17:13:45] [INFO ] Time to serialize properties into /tmp/CTLFireability5105803685074778595.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/CTLFireability15159601199686925533.gal, -t, CGAL, -ctl, /tmp/CTLFireability5105803685074778595.ctl, --load-order, /home/mcc/execution/model.ord, --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/CTLFireability15159601199686925533.gal -t CGAL -ctl /tmp/CTLFireability5105803685074778595.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 14 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,1.31984e+16,21.6708,444664,2,137401,5,1.94853e+06,6,0,1214,2.94964e+06,0


Converting to forward existential form...Done !
original formula: AF((AX(((((((callToProcess.s00003904.output.s00001054>=1)&&(callToProcess.s00003904.output.s00001077>=1))||(fork.s00002500.activated.s00001075>=1))||(decision.s00003021.activated>=1))||((join.s00001164.activated.s00001062>=1)&&(join.s00001164.activated.s00001064>=1)))||(decision.s00002760.activated>=1))) * ((((callToProcess.s00001108.input.s00001066>=1)||(callToTask.s00003975.inputCriterion.s00001053.used>=1))||(decision.s00002948.activated>=1))||(((join.s00002243.input.s00001068>=1)&&(join.s00002243.input.s00001167>=1))&&(join.s00002243.input.s00001263>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(((((((callToProcess.s00003904.output.s00001054>=1)&&(callToProcess.s00003904.output.s00001077>=1))||(fork.s00002500.activated.s00001075>=1))||(decision.s00003021.activated>=1))||((join.s00001164.activated.s00001062>=1)&&(join.s00001164.activated.s00001064>=1)))||(decision.s00002760.activated>=1))))) * ((((callToProcess.s00001108.input.s00001066>=1)||(callToTask.s00003975.inputCriterion.s00001053.used>=1))||(decision.s00002948.activated>=1))||(((join.s00002243.input.s00001068>=1)&&(join.s00002243.input.s00001167>=1))&&(join.s00002243.input.s00001263>=1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t23, t33, t35, t93, t107, t141, t142, t143, t144, t154, t159, t164, t166, t169, t170, t171, t173, t174, t177, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/158/20/178
Detected timeout of ITS tools.

BK_STOP 1620840888209

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

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

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