Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r066-tajo-158922815101004.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is EnergyBus-PT-none, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922815101004
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 3.0K Apr 13 13:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 13 13:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 13 13:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 13 13:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 15:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 15:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 13 13:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 13 13:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 13 13:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 13 13:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 13 13:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 13 13:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 3.2M Mar 24 05:37 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 EnergyBus-PT-none-CTLFireability-00
FORMULA_NAME EnergyBus-PT-none-CTLFireability-01
FORMULA_NAME EnergyBus-PT-none-CTLFireability-02
FORMULA_NAME EnergyBus-PT-none-CTLFireability-03
FORMULA_NAME EnergyBus-PT-none-CTLFireability-04
FORMULA_NAME EnergyBus-PT-none-CTLFireability-05
FORMULA_NAME EnergyBus-PT-none-CTLFireability-06
FORMULA_NAME EnergyBus-PT-none-CTLFireability-07
FORMULA_NAME EnergyBus-PT-none-CTLFireability-08
FORMULA_NAME EnergyBus-PT-none-CTLFireability-09
FORMULA_NAME EnergyBus-PT-none-CTLFireability-10
FORMULA_NAME EnergyBus-PT-none-CTLFireability-11
FORMULA_NAME EnergyBus-PT-none-CTLFireability-12
FORMULA_NAME EnergyBus-PT-none-CTLFireability-13
FORMULA_NAME EnergyBus-PT-none-CTLFireability-14
FORMULA_NAME EnergyBus-PT-none-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1590158063853

[2020-05-22 14:34:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-22 14:34:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 14:34:26] [INFO ] Load time of PNML (sax parser for PT used): 358 ms
[2020-05-22 14:34:26] [INFO ] Transformed 157 places.
[2020-05-22 14:34:26] [INFO ] Transformed 4430 transitions.
[2020-05-22 14:34:26] [INFO ] Found NUPN structural information;
[2020-05-22 14:34:26] [INFO ] Parsed PT model containing 157 places and 4430 transitions in 468 ms.
Deduced a syphon composed of 4 places in 37 ms
Reduce places removed 4 places and 825 transitions.
Ensure Unique test removed 1692 transitions
Reduce redundant transitions removed 1692 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 90 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1805 ms. (steps per millisecond=55 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1]
[2020-05-22 14:34:28] [INFO ] Flow matrix only has 647 transitions (discarded 1266 similar events)
// Phase 1: matrix 647 rows 153 cols
[2020-05-22 14:34:28] [INFO ] Computed 23 place invariants in 37 ms
[2020-05-22 14:34:28] [INFO ] [Real]Absence check using 21 positive place invariants in 30 ms returned sat
[2020-05-22 14:34:28] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-22 14:34:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:34:28] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2020-05-22 14:34:29] [INFO ] State equation strengthened by 468 read => feed constraints.
[2020-05-22 14:34:29] [INFO ] [Real]Added 468 Read/Feed constraints in 82 ms returned sat
[2020-05-22 14:34:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:34:29] [INFO ] [Nat]Absence check using 21 positive place invariants in 21 ms returned sat
[2020-05-22 14:34:29] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:34:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:34:29] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2020-05-22 14:34:29] [INFO ] [Nat]Added 468 Read/Feed constraints in 82 ms returned sat
[2020-05-22 14:34:29] [INFO ] Deduced a trap composed of 5 places in 59 ms
[2020-05-22 14:34:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2020-05-22 14:34:30] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 257 ms.
[2020-05-22 14:34:49] [INFO ] Added : 365 causal constraints over 73 iterations in 19446 ms. Result :unknown
[2020-05-22 14:34:49] [INFO ] [Real]Absence check using 21 positive place invariants in 24 ms returned sat
[2020-05-22 14:34:49] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 3 ms returned sat
[2020-05-22 14:34:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:34:49] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2020-05-22 14:34:49] [INFO ] [Real]Added 468 Read/Feed constraints in 67 ms returned sat
[2020-05-22 14:34:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:34:49] [INFO ] [Nat]Absence check using 21 positive place invariants in 14 ms returned sat
[2020-05-22 14:34:49] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:34:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:34:50] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2020-05-22 14:34:50] [INFO ] [Nat]Added 468 Read/Feed constraints in 77 ms returned sat
[2020-05-22 14:34:50] [INFO ] Deduced a trap composed of 4 places in 125 ms
[2020-05-22 14:34:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2020-05-22 14:34:50] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 148 ms.
[2020-05-22 14:35:09] [INFO ] Added : 350 causal constraints over 70 iterations in 19496 ms. Result :unknown
[2020-05-22 14:35:09] [INFO ] [Real]Absence check using 21 positive place invariants in 41 ms returned sat
[2020-05-22 14:35:09] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:35:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:35:10] [INFO ] [Real]Absence check using state equation in 535 ms returned sat
[2020-05-22 14:35:10] [INFO ] [Real]Added 468 Read/Feed constraints in 96 ms returned sat
[2020-05-22 14:35:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:35:10] [INFO ] [Nat]Absence check using 21 positive place invariants in 20 ms returned sat
[2020-05-22 14:35:10] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:35:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:35:11] [INFO ] [Nat]Absence check using state equation in 414 ms returned sat
[2020-05-22 14:35:11] [INFO ] [Nat]Added 468 Read/Feed constraints in 102 ms returned sat
[2020-05-22 14:35:11] [INFO ] Deduced a trap composed of 4 places in 139 ms
[2020-05-22 14:35:11] [INFO ] Deduced a trap composed of 5 places in 27 ms
[2020-05-22 14:35:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 294 ms
[2020-05-22 14:35:11] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 137 ms.
[2020-05-22 14:35:30] [INFO ] Added : 380 causal constraints over 76 iterations in 18660 ms. Result :sat
[2020-05-22 14:35:30] [INFO ] [Real]Absence check using 21 positive place invariants in 16 ms returned sat
[2020-05-22 14:35:30] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:35:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:35:30] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2020-05-22 14:35:30] [INFO ] [Real]Added 468 Read/Feed constraints in 83 ms returned sat
[2020-05-22 14:35:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:35:30] [INFO ] [Nat]Absence check using 21 positive place invariants in 50 ms returned sat
[2020-05-22 14:35:30] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 4 ms returned sat
[2020-05-22 14:35:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:35:31] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2020-05-22 14:35:31] [INFO ] [Nat]Added 468 Read/Feed constraints in 109 ms returned sat
[2020-05-22 14:35:31] [INFO ] Deduced a trap composed of 5 places in 146 ms
[2020-05-22 14:35:31] [INFO ] Deduced a trap composed of 4 places in 136 ms
[2020-05-22 14:35:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 474 ms
[2020-05-22 14:35:31] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 188 ms.
[2020-05-22 14:35:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t354 0) (or (and (or (and (> t0 0) (< o0 o354)) (and (> t88 0) (< o88 o354))) (or (and (> t0 0) (< o0 o354)) (and (> t139 0) (< o139 o354)) (and (> t140 0) (< o140 o354))) (or (and (> t61 0) (< o61 o354)) (and (> t69 0) (< o69 o354))) (or (and (> t62 0) (< o62 o354)) (and (> t64 0) (< o64 o354)) (and (> t66 0) (< o66 o354))) (and (> t114 0) (< o114 o354)) (and (> t153 0) (< o153 o354)) (or (and (> t146 0) (< o146 o354)) (and (> t610 0) (< o610 o354))) (or (and (> t15 0) (< o15 o354)) (and (> t17 0) (< o17 o354)) (and (> t19 0) (< o19 o354)))) (and (or (and (> t0 0) (< o0 o354)) (and (> t88 0) (< o88 o354))) (or (and (> t0 0) (< o0 o354)) (and (> t139 0) (< o139 o354)) (and (> t140 0) (< o140 o354))) (or (and (> t61 0) (< o61 o354)) (and (> t69 0) (< o69 o354))) (or (and (> t62 0) (< o62 o354)) (and (> t64 0) (< o64 o354)) (and (> t66 0) (< o66 o354))) (and (> t114 0) (< o114 o354)) (or (and (> t141 0) (< o141 o354)) (and (> t144 0) (< o144 o354))) (or (and (> t146 0) (< o146 o354)) (and (> t610 0) (< o610 o354))) (or (and (> t15 0) (< o15 o354)) (and (> t17 0) (< o17 o354)) (and (> t19 0) (< o19 o354)))) (and (or (and (> t0 0) (< o0 o354)) (and (> t88 0) (< o88 o354))) (or (and (> t0 0) (< o0 o354)) (and (> t139 0) (< o139 o354)) (and (> t140 0) (< o140 o354))) (or (and (> t61 0) (< o61 o354)) (and (> t69 0) (< o69 o354))) (or (and (> t62 0) (< o62 o354)) (and (> t64 0) (< o64 o354)) (and (> t66 0) (< o66 o354))) (and (> t114 0) (< o114 o354)) (or (and (> t0 0) (< o0 o354)) (and (> t35 0) (< o35 o354)) (and (> t142 0) (< o142 o354)) (and (> t143 0) (< o143 o354))) (or (and (> t146 0) (< o146 o354)) (and (> t610 0) (< o610 o354))) (or (and (> t15 0) (< o15 o354)) (and (> t17 0) (< o17 o354)) (and (> t19 0) (< o19 o354)))) (and (or (and (> t0 0) (< o0 o354)) (and (> t88 0) (< o88 o354))) (or (and (> t0 0) (< o0 o354)) (and (> t139 0) (< o139 o354)) (and (> t140 0) (< o140 o354))) (or (and (> t61 0) (< o61 o354)) (and (> t69 0) (< o69 o354))) (or (and (> t62 0) (< o62 o354)) (and (> t64 0) (< o64 o354)) (and (> t66 0) (< o66 o354))) (and (> t114 0) (< o114 o354)) (and (> t153 0) (< o153 o354)) (or (and (> t0 0) (< o0 o354)) (and (> t145 0) (< o145 o354)) (and (> t611 0) (< o611 o354))) (or (and (> t15 0) (< o15 o354)) (and (> t17 0) (< o17 o354)) (and (> t19 0) (< o19 o354)))) (and (or (and (> t0 0) (< o0 o354)) (and (> t88 0) (< o88 o354))) (or (and (> t0 0) (< o0 o354)) (and (> t139 0) (< o139 o354)) (and (> t140 0) (< o140 o354))) (or (and (> t61 0) (< o61 o354)) (and (> t69 0) (< o69 o354))) (or (and (> t62 0) (< o62 o354)) (and (> t64 0) (< o64 o354)) (and (> t66 0) (< o66 o354))) (and (> t114 0) (< o114 o354)) (or (and (> t141 0) (< o141 o354)) (and (> t144 0) (< o144 o354))) (or (and (> t0 0) (< o0 o354)) (and (> t145 0) (< o145 o354)) (and (> t611 0) (< o611 o354))) (or (and (> t15 0) (< o15 o354)) (and (> t17 0) (< o17 o354)) (and (> t19 0) (< o19 o354)))) (and (or (and (> t0 0) (< o0 o354)) (and (> t88 0) (< o88 o354))) (or (and (> t0 0) (< o0 o354)) (and (> t139 0) (< o139 o354)) (and (> t140 0) (< o140 o354))) (or (and (> t61 0) (< o61 o354)) (and (> t69 0) (< o69 o354))) (or (and (> t62 0) (< o62 o354)) (and (> t64 0) (< o64 o354)) (and (> t66 0) (< o66 o354))) (and (> t114 0) (< o114 o354)) (or (and (> t0 0) (< o0 o354)) (and (> t35 0) (< o35 o354)) (and (> t142 0) (< o142 o354)) (and (> t143 0) (< o143 o354))) (or (and (> t0 0) (< o0 o354)) (and (> t145 0) (< o145 o354)) (and (> t611 0) (< o611 o354))) (or (and (> t15 0) (< o15 o354)) (and (> t17 0) (< o17 o354)) (and (> t19 0) (< o19 o354))))))") while checking expression at index 3
[2020-05-22 14:35:50] [INFO ] [Real]Absence check using 21 positive place invariants in 16 ms returned sat
[2020-05-22 14:35:50] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:35:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:35:50] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2020-05-22 14:35:51] [INFO ] [Real]Added 468 Read/Feed constraints in 84 ms returned sat
[2020-05-22 14:35:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:35:51] [INFO ] [Nat]Absence check using 21 positive place invariants in 20 ms returned sat
[2020-05-22 14:35:51] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:35:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:35:51] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2020-05-22 14:35:51] [INFO ] [Nat]Added 468 Read/Feed constraints in 85 ms returned sat
[2020-05-22 14:35:51] [INFO ] Deduced a trap composed of 5 places in 34 ms
[2020-05-22 14:35:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2020-05-22 14:35:51] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 142 ms.
[2020-05-22 14:36:09] [INFO ] Added : 345 causal constraints over 69 iterations in 18437 ms. Result :sat
[2020-05-22 14:36:10] [INFO ] [Real]Absence check using 21 positive place invariants in 23 ms returned sat
[2020-05-22 14:36:10] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:36:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:36:10] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2020-05-22 14:36:10] [INFO ] [Real]Added 468 Read/Feed constraints in 103 ms returned sat
[2020-05-22 14:36:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:36:10] [INFO ] [Nat]Absence check using 21 positive place invariants in 21 ms returned sat
[2020-05-22 14:36:10] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-22 14:36:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:36:11] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2020-05-22 14:36:11] [INFO ] [Nat]Added 468 Read/Feed constraints in 84 ms returned sat
[2020-05-22 14:36:11] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 125 ms.
[2020-05-22 14:36:28] [INFO ] Added : 305 causal constraints over 61 iterations in 17257 ms. Result :sat
[2020-05-22 14:36:28] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2020-05-22 14:36:28] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:36:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:36:28] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2020-05-22 14:36:28] [INFO ] [Real]Added 468 Read/Feed constraints in 73 ms returned sat
[2020-05-22 14:36:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:36:29] [INFO ] [Nat]Absence check using 21 positive place invariants in 21 ms returned sat
[2020-05-22 14:36:29] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:36:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:36:29] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2020-05-22 14:36:29] [INFO ] [Nat]Added 468 Read/Feed constraints in 90 ms returned sat
[2020-05-22 14:36:29] [INFO ] Deduced a trap composed of 5 places in 28 ms
[2020-05-22 14:36:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2020-05-22 14:36:29] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 179 ms.
[2020-05-22 14:36:45] [INFO ] Added : 315 causal constraints over 63 iterations in 15770 ms. Result :sat
[2020-05-22 14:36:45] [INFO ] [Real]Absence check using 21 positive place invariants in 19 ms returned sat
[2020-05-22 14:36:45] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-22 14:36:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:36:45] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2020-05-22 14:36:45] [INFO ] [Real]Added 468 Read/Feed constraints in 79 ms returned sat
[2020-05-22 14:36:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:36:45] [INFO ] [Nat]Absence check using 21 positive place invariants in 17 ms returned sat
[2020-05-22 14:36:45] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:36:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:36:46] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2020-05-22 14:36:46] [INFO ] [Nat]Added 468 Read/Feed constraints in 70 ms returned sat
[2020-05-22 14:36:46] [INFO ] Deduced a trap composed of 5 places in 20 ms
[2020-05-22 14:36:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2020-05-22 14:36:46] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 122 ms.
[2020-05-22 14:37:04] [INFO ] Added : 330 causal constraints over 66 iterations in 18073 ms. Result :sat
[2020-05-22 14:37:04] [INFO ] [Real]Absence check using 21 positive place invariants in 52 ms returned unsat
[2020-05-22 14:37:04] [INFO ] [Real]Absence check using 21 positive place invariants in 158 ms returned sat
[2020-05-22 14:37:04] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 26 ms returned sat
[2020-05-22 14:37:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:37:05] [INFO ] [Real]Absence check using state equation in 1089 ms returned sat
[2020-05-22 14:37:05] [INFO ] [Real]Added 468 Read/Feed constraints in 109 ms returned sat
[2020-05-22 14:37:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:37:05] [INFO ] [Nat]Absence check using 21 positive place invariants in 14 ms returned sat
[2020-05-22 14:37:05] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:37:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:37:07] [INFO ] [Nat]Absence check using state equation in 1229 ms returned sat
[2020-05-22 14:37:07] [INFO ] [Nat]Added 468 Read/Feed constraints in 87 ms returned sat
[2020-05-22 14:37:07] [INFO ] Deduced a trap composed of 5 places in 30 ms
[2020-05-22 14:37:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2020-05-22 14:37:07] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 245 ms.
[2020-05-22 14:37:25] [INFO ] Added : 355 causal constraints over 71 iterations in 17786 ms. Result :sat
[2020-05-22 14:37:25] [INFO ] [Real]Absence check using 21 positive place invariants in 18 ms returned sat
[2020-05-22 14:37:25] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-22 14:37:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:37:25] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2020-05-22 14:37:25] [INFO ] [Real]Added 468 Read/Feed constraints in 110 ms returned sat
[2020-05-22 14:37:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:37:25] [INFO ] [Nat]Absence check using 21 positive place invariants in 20 ms returned sat
[2020-05-22 14:37:25] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-22 14:37:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:37:26] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2020-05-22 14:37:26] [INFO ] [Nat]Added 468 Read/Feed constraints in 68 ms returned sat
[2020-05-22 14:37:26] [INFO ] Deduced a trap composed of 5 places in 36 ms
[2020-05-22 14:37:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2020-05-22 14:37:26] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 155 ms.
[2020-05-22 14:37:45] [INFO ] Added : 330 causal constraints over 66 iterations in 19525 ms. Result :unknown
[2020-05-22 14:37:45] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2020-05-22 14:37:45] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:37:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:37:45] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2020-05-22 14:37:46] [INFO ] [Real]Added 468 Read/Feed constraints in 71 ms returned sat
[2020-05-22 14:37:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:37:46] [INFO ] [Nat]Absence check using 21 positive place invariants in 17 ms returned sat
[2020-05-22 14:37:46] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:37:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:37:46] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2020-05-22 14:37:46] [INFO ] [Nat]Added 468 Read/Feed constraints in 79 ms returned sat
[2020-05-22 14:37:46] [INFO ] Deduced a trap composed of 4 places in 193 ms
[2020-05-22 14:37:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2020-05-22 14:37:46] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 179 ms.
[2020-05-22 14:38:06] [INFO ] Added : 375 causal constraints over 75 iterations in 19403 ms. Result :(error "Failed to check-sat")
[2020-05-22 14:38:06] [INFO ] [Real]Absence check using 21 positive place invariants in 153 ms returned sat
[2020-05-22 14:38:06] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 27 ms returned sat
[2020-05-22 14:38:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:38:06] [INFO ] [Real]Absence check using state equation in 609 ms returned sat
[2020-05-22 14:38:07] [INFO ] [Real]Added 468 Read/Feed constraints in 109 ms returned sat
[2020-05-22 14:38:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:38:07] [INFO ] [Nat]Absence check using 21 positive place invariants in 16 ms returned sat
[2020-05-22 14:38:07] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:38:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:38:07] [INFO ] [Nat]Absence check using state equation in 727 ms returned sat
[2020-05-22 14:38:08] [INFO ] [Nat]Added 468 Read/Feed constraints in 89 ms returned sat
[2020-05-22 14:38:08] [INFO ] Deduced a trap composed of 5 places in 22 ms
[2020-05-22 14:38:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2020-05-22 14:38:08] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 225 ms.
[2020-05-22 14:38:27] [INFO ] Added : 320 causal constraints over 64 iterations in 19073 ms. Result :unknown
[2020-05-22 14:38:27] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2020-05-22 14:38:27] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 3 ms returned sat
[2020-05-22 14:38:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:38:27] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2020-05-22 14:38:27] [INFO ] [Real]Added 468 Read/Feed constraints in 63 ms returned sat
[2020-05-22 14:38:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:38:27] [INFO ] [Nat]Absence check using 21 positive place invariants in 152 ms returned sat
[2020-05-22 14:38:27] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 27 ms returned sat
[2020-05-22 14:38:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:38:28] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2020-05-22 14:38:28] [INFO ] [Nat]Added 468 Read/Feed constraints in 95 ms returned sat
[2020-05-22 14:38:28] [INFO ] Deduced a trap composed of 5 places in 394 ms
[2020-05-22 14:38:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 450 ms
[2020-05-22 14:38:28] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 148 ms.
[2020-05-22 14:38:44] [INFO ] Added : 345 causal constraints over 69 iterations in 16056 ms. Result :sat
[2020-05-22 14:38:44] [INFO ] [Real]Absence check using 21 positive place invariants in 18 ms returned sat
[2020-05-22 14:38:44] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:38:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:38:45] [INFO ] [Real]Absence check using state equation in 654 ms returned sat
[2020-05-22 14:38:45] [INFO ] [Real]Added 468 Read/Feed constraints in 65 ms returned sat
[2020-05-22 14:38:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:38:45] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2020-05-22 14:38:45] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-22 14:38:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:38:45] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2020-05-22 14:38:45] [INFO ] [Nat]Added 468 Read/Feed constraints in 79 ms returned sat
[2020-05-22 14:38:46] [INFO ] Deduced a trap composed of 4 places in 139 ms
[2020-05-22 14:38:46] [INFO ] Deduced a trap composed of 5 places in 29 ms
[2020-05-22 14:38:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 291 ms
[2020-05-22 14:38:46] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 222 ms.
[2020-05-22 14:39:05] [INFO ] Added : 375 causal constraints over 75 iterations in 19350 ms. Result :unknown
[2020-05-22 14:39:05] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2020-05-22 14:39:05] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:39:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:39:05] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2020-05-22 14:39:05] [INFO ] [Real]Added 468 Read/Feed constraints in 64 ms returned sat
[2020-05-22 14:39:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:39:05] [INFO ] [Nat]Absence check using 21 positive place invariants in 25 ms returned sat
[2020-05-22 14:39:05] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:39:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:39:06] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2020-05-22 14:39:06] [INFO ] [Nat]Added 468 Read/Feed constraints in 87 ms returned sat
[2020-05-22 14:39:06] [INFO ] Deduced a trap composed of 5 places in 120 ms
[2020-05-22 14:39:06] [INFO ] Deduced a trap composed of 4 places in 110 ms
[2020-05-22 14:39:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 320 ms
[2020-05-22 14:39:06] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 128 ms.
[2020-05-22 14:39:17] [INFO ] Added : 235 causal constraints over 47 iterations in 11306 ms. Result :sat
[2020-05-22 14:39:18] [INFO ] [Real]Absence check using 21 positive place invariants in 33 ms returned unsat
[2020-05-22 14:39:18] [INFO ] [Real]Absence check using 21 positive place invariants in 158 ms returned sat
[2020-05-22 14:39:18] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 16 ms returned sat
[2020-05-22 14:39:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:39:18] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2020-05-22 14:39:18] [INFO ] [Real]Added 468 Read/Feed constraints in 66 ms returned sat
[2020-05-22 14:39:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:39:18] [INFO ] [Nat]Absence check using 21 positive place invariants in 21 ms returned sat
[2020-05-22 14:39:18] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:39:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:39:18] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2020-05-22 14:39:19] [INFO ] [Nat]Added 468 Read/Feed constraints in 105 ms returned sat
[2020-05-22 14:39:19] [INFO ] Deduced a trap composed of 5 places in 27 ms
[2020-05-22 14:39:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2020-05-22 14:39:19] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 158 ms.
[2020-05-22 14:39:35] [INFO ] Added : 310 causal constraints over 62 iterations in 16102 ms. Result :sat
[2020-05-22 14:39:35] [INFO ] [Real]Absence check using 21 positive place invariants in 18 ms returned sat
[2020-05-22 14:39:35] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-22 14:39:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:39:35] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2020-05-22 14:39:35] [INFO ] [Real]Added 468 Read/Feed constraints in 69 ms returned sat
[2020-05-22 14:39:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:39:35] [INFO ] [Nat]Absence check using 21 positive place invariants in 20 ms returned sat
[2020-05-22 14:39:35] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-22 14:39:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:39:36] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2020-05-22 14:39:36] [INFO ] [Nat]Added 468 Read/Feed constraints in 91 ms returned sat
[2020-05-22 14:39:36] [INFO ] Deduced a trap composed of 5 places in 41 ms
[2020-05-22 14:39:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2020-05-22 14:39:36] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 181 ms.
[2020-05-22 14:39:55] [INFO ] Added : 365 causal constraints over 73 iterations in 19455 ms. Result :(error "Failed to check-sat")
[2020-05-22 14:39:55] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned sat
[2020-05-22 14:39:55] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-22 14:39:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:39:56] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2020-05-22 14:39:56] [INFO ] [Real]Added 468 Read/Feed constraints in 70 ms returned sat
[2020-05-22 14:39:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:39:56] [INFO ] [Nat]Absence check using 21 positive place invariants in 20 ms returned sat
[2020-05-22 14:39:56] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-22 14:39:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:39:56] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2020-05-22 14:39:56] [INFO ] [Nat]Added 468 Read/Feed constraints in 73 ms returned sat
[2020-05-22 14:39:56] [INFO ] Deduced a trap composed of 4 places in 163 ms
[2020-05-22 14:39:56] [INFO ] Deduced a trap composed of 5 places in 34 ms
[2020-05-22 14:39:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 323 ms
[2020-05-22 14:39:57] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 154 ms.
[2020-05-22 14:40:12] [INFO ] Added : 330 causal constraints over 66 iterations in 15273 ms. Result :sat
[2020-05-22 14:40:12] [INFO ] [Real]Absence check using 21 positive place invariants in 59 ms returned sat
[2020-05-22 14:40:12] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-22 14:40:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:40:12] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2020-05-22 14:40:12] [INFO ] [Real]Added 468 Read/Feed constraints in 80 ms returned sat
[2020-05-22 14:40:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:40:13] [INFO ] [Nat]Absence check using 21 positive place invariants in 21 ms returned sat
[2020-05-22 14:40:13] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-22 14:40:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:40:13] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2020-05-22 14:40:13] [INFO ] [Nat]Added 468 Read/Feed constraints in 94 ms returned sat
[2020-05-22 14:40:13] [INFO ] Deduced a trap composed of 9 places in 111 ms
[2020-05-22 14:40:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2020-05-22 14:40:13] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 168 ms.
[2020-05-22 14:40:33] [INFO ] Added : 340 causal constraints over 68 iterations in 19390 ms. Result :unknown
[2020-05-22 14:40:33] [INFO ] [Real]Absence check using 21 positive place invariants in 95 ms returned sat
[2020-05-22 14:40:33] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 27 ms returned sat
[2020-05-22 14:40:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:40:33] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2020-05-22 14:40:33] [INFO ] [Real]Added 468 Read/Feed constraints in 82 ms returned sat
[2020-05-22 14:40:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:40:33] [INFO ] [Nat]Absence check using 21 positive place invariants in 135 ms returned sat
[2020-05-22 14:40:33] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 26 ms returned sat
[2020-05-22 14:40:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:40:34] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2020-05-22 14:40:34] [INFO ] [Nat]Added 468 Read/Feed constraints in 87 ms returned sat
[2020-05-22 14:40:34] [INFO ] Deduced a trap composed of 5 places in 20 ms
[2020-05-22 14:40:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2020-05-22 14:40:34] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 150 ms.
[2020-05-22 14:40:53] [INFO ] Added : 340 causal constraints over 68 iterations in 19160 ms. Result :(error "Failed to check-sat")
[2020-05-22 14:40:53] [INFO ] [Real]Absence check using 21 positive place invariants in 88 ms returned sat
[2020-05-22 14:40:53] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 3 ms returned sat
[2020-05-22 14:40:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:40:54] [INFO ] [Real]Absence check using state equation in 641 ms returned sat
[2020-05-22 14:40:54] [INFO ] [Real]Added 468 Read/Feed constraints in 85 ms returned sat
[2020-05-22 14:40:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:40:54] [INFO ] [Nat]Absence check using 21 positive place invariants in 19 ms returned sat
[2020-05-22 14:40:54] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-22 14:40:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:40:55] [INFO ] [Nat]Absence check using state equation in 476 ms returned sat
[2020-05-22 14:40:55] [INFO ] [Nat]Added 468 Read/Feed constraints in 86 ms returned sat
[2020-05-22 14:40:55] [INFO ] Deduced a trap composed of 5 places in 27 ms
[2020-05-22 14:40:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2020-05-22 14:40:55] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 89 ms.
[2020-05-22 14:41:10] [INFO ] Added : 255 causal constraints over 51 iterations in 14890 ms. Result :sat
[2020-05-22 14:41:10] [INFO ] [Real]Absence check using 21 positive place invariants in 19 ms returned sat
[2020-05-22 14:41:10] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:41:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:41:10] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2020-05-22 14:41:10] [INFO ] [Real]Added 468 Read/Feed constraints in 89 ms returned sat
[2020-05-22 14:41:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:41:10] [INFO ] [Nat]Absence check using 21 positive place invariants in 16 ms returned sat
[2020-05-22 14:41:10] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:41:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:41:11] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2020-05-22 14:41:11] [INFO ] [Nat]Added 468 Read/Feed constraints in 89 ms returned sat
[2020-05-22 14:41:11] [INFO ] Deduced a trap composed of 9 places in 551 ms
[2020-05-22 14:41:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 625 ms
[2020-05-22 14:41:12] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 167 ms.
[2020-05-22 14:41:27] [INFO ] Added : 310 causal constraints over 62 iterations in 15562 ms. Result :sat
[2020-05-22 14:41:27] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2020-05-22 14:41:27] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:41:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:41:27] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2020-05-22 14:41:27] [INFO ] [Real]Added 468 Read/Feed constraints in 65 ms returned sat
[2020-05-22 14:41:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:41:27] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2020-05-22 14:41:27] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:41:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:41:28] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2020-05-22 14:41:28] [INFO ] [Nat]Added 468 Read/Feed constraints in 74 ms returned sat
[2020-05-22 14:41:28] [INFO ] Deduced a trap composed of 5 places in 147 ms
[2020-05-22 14:41:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2020-05-22 14:41:28] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 141 ms.
[2020-05-22 14:41:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t391 0) (and (or (and (> t0 0) (< o0 o391)) (and (> t88 0) (< o88 o391))) (or (and (> t0 0) (< o0 o391)) (and (> t139 0) (< o139 o391)) (and (> t140 0) (< o140 o391))) (or (and (> t37 0) (< o37 o391)) (and (> t45 0) (< o45 o391))) (or (and (> t38 0) (< o38 o391)) (and (> t39 0) (< o39 o391)) (and (> t41 0) (< o41 o391)) (and (> t43 0) (< o43 o391))) (and (> t102 0) (< o102 o391)) (or (and (> t31 0) (< o31 o391)) (and (> t33 0) (< o33 o391))) (or (and (> t146 0) (< o146 o391)) (and (> t610 0) (< o610 o391))) (or (and (> t15 0) (< o15 o391)) (and (> t17 0) (< o17 o391)) (and (> t19 0) (< o19 o391)))))") while checking expression at index 24
[2020-05-22 14:41:47] [INFO ] [Real]Absence check using 21 positive place invariants in 16 ms returned sat
[2020-05-22 14:41:47] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:41:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:41:48] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2020-05-22 14:41:48] [INFO ] [Real]Added 468 Read/Feed constraints in 85 ms returned sat
[2020-05-22 14:41:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:41:48] [INFO ] [Nat]Absence check using 21 positive place invariants in 15 ms returned sat
[2020-05-22 14:41:48] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-22 14:41:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:41:48] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2020-05-22 14:41:48] [INFO ] [Nat]Added 468 Read/Feed constraints in 74 ms returned sat
[2020-05-22 14:41:48] [INFO ] Deduced a trap composed of 5 places in 113 ms
[2020-05-22 14:41:49] [INFO ] Deduced a trap composed of 4 places in 157 ms
[2020-05-22 14:41:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 365 ms
[2020-05-22 14:41:49] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 160 ms.
[2020-05-22 14:42:06] [INFO ] Added : 340 causal constraints over 68 iterations in 16995 ms. Result :sat
[2020-05-22 14:42:06] [INFO ] [Real]Absence check using 21 positive place invariants in 18 ms returned sat
[2020-05-22 14:42:06] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:42:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:42:06] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2020-05-22 14:42:06] [INFO ] [Real]Added 468 Read/Feed constraints in 79 ms returned sat
[2020-05-22 14:42:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:42:06] [INFO ] [Nat]Absence check using 21 positive place invariants in 14 ms returned sat
[2020-05-22 14:42:06] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-22 14:42:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:42:07] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2020-05-22 14:42:07] [INFO ] [Nat]Added 468 Read/Feed constraints in 77 ms returned sat
[2020-05-22 14:42:07] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 174 ms.
[2020-05-22 14:42:26] [INFO ] Added : 310 causal constraints over 62 iterations in 19559 ms. Result :unknown
[2020-05-22 14:42:26] [INFO ] [Real]Absence check using 21 positive place invariants in 158 ms returned sat
[2020-05-22 14:42:26] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 29 ms returned sat
[2020-05-22 14:42:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:42:27] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2020-05-22 14:42:27] [INFO ] [Real]Added 468 Read/Feed constraints in 75 ms returned sat
[2020-05-22 14:42:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:42:27] [INFO ] [Nat]Absence check using 21 positive place invariants in 21 ms returned sat
[2020-05-22 14:42:27] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-22 14:42:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:42:27] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2020-05-22 14:42:27] [INFO ] [Nat]Added 468 Read/Feed constraints in 87 ms returned sat
[2020-05-22 14:42:28] [INFO ] Deduced a trap composed of 4 places in 248 ms
[2020-05-22 14:42:28] [INFO ] Deduced a trap composed of 5 places in 345 ms
[2020-05-22 14:42:28] [INFO ] Deduced a trap composed of 32 places in 290 ms
[2020-05-22 14:42:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 1013 ms
[2020-05-22 14:42:28] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned sat
[2020-05-22 14:42:28] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:42:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:42:29] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2020-05-22 14:42:29] [INFO ] [Real]Added 468 Read/Feed constraints in 96 ms returned sat
[2020-05-22 14:42:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:42:29] [INFO ] [Nat]Absence check using 21 positive place invariants in 134 ms returned sat
[2020-05-22 14:42:29] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 3 ms returned sat
[2020-05-22 14:42:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:42:30] [INFO ] [Nat]Absence check using state equation in 530 ms returned sat
[2020-05-22 14:42:30] [INFO ] [Nat]Added 468 Read/Feed constraints in 104 ms returned sat
[2020-05-22 14:42:30] [INFO ] Deduced a trap composed of 9 places in 145 ms
[2020-05-22 14:42:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2020-05-22 14:42:30] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 236 ms.
[2020-05-22 14:42:34] [INFO ] Added : 167 causal constraints over 34 iterations in 3894 ms. Result :sat
[2020-05-22 14:42:34] [INFO ] Deduced a trap composed of 4 places in 349 ms
[2020-05-22 14:42:34] [INFO ] Deduced a trap composed of 5 places in 200 ms
[2020-05-22 14:42:35] [INFO ] Deduced a trap composed of 22 places in 373 ms
[2020-05-22 14:42:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1280 ms
[2020-05-22 14:42:35] [INFO ] [Real]Absence check using 21 positive place invariants in 157 ms returned sat
[2020-05-22 14:42:35] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 27 ms returned sat
[2020-05-22 14:42:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:42:37] [INFO ] [Real]Absence check using state equation in 1334 ms returned sat
[2020-05-22 14:42:37] [INFO ] [Real]Added 468 Read/Feed constraints in 112 ms returned sat
[2020-05-22 14:42:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:42:37] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2020-05-22 14:42:37] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:42:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:42:38] [INFO ] [Nat]Absence check using state equation in 1065 ms returned sat
[2020-05-22 14:42:38] [INFO ] [Nat]Added 468 Read/Feed constraints in 139 ms returned sat
[2020-05-22 14:42:38] [INFO ] Deduced a trap composed of 5 places in 21 ms
[2020-05-22 14:42:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2020-05-22 14:42:38] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 192 ms.
[2020-05-22 14:42:57] [INFO ] Added : 350 causal constraints over 70 iterations in 18625 ms. Result :unknown
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-05-22 14:42:58] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-22 14:42:58] [INFO ] Flatten gal took : 704 ms
[2020-05-22 14:42:58] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-22 14:42:58] [INFO ] Flatten gal took : 302 ms
FORMULA EnergyBus-PT-none-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 14:42:59] [INFO ] Applying decomposition
[2020-05-22 14:42:59] [INFO ] Flatten gal took : 172 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph639649741075880032.txt, -o, /tmp/graph639649741075880032.bin, -w, /tmp/graph639649741075880032.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph639649741075880032.bin, -l, -1, -v, -w, /tmp/graph639649741075880032.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 14:43:00] [INFO ] Decomposing Gal with order
[2020-05-22 14:43:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 14:43:01] [INFO ] Removed a total of 8887 redundant transitions.
[2020-05-22 14:43:01] [INFO ] Flatten gal took : 681 ms
[2020-05-22 14:43:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 128 labels/synchronizations in 91 ms.
[2020-05-22 14:43:01] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 10 ms
[2020-05-22 14:43:01] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
built 41 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 59 ordering constraints for composite.
built 10 ordering constraints for composite.
built 16 ordering constraints for composite.
built 23 ordering constraints for composite.
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,2.13184e+12,2.30207,63636,2754,360,111756,4644,1310,270104,223,33160,0


Converting to forward existential form...Done !
original formula: !(EF(((((((((i3.u6.p16==1)&&(i5.u21.p19==1))&&(i5.u11.p60==1))&&(i5.u11.p77==1))&&(i11.u20.p97==1))&&(i3.u6.p105==1))&&(i3.u6.p113==1))&&(i13.u30.p146==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((((((((i3.u6.p16==1)&&(i5.u21.p19==1))&&(i5.u11.p60==1))&&(i5.u11.p77==1))&&(i11.u20.p97==1))&&(i3.u6.p105==1))&&(i3.u6.p113==1))&&(i13.u30.p146==1)))] = FALSE
(forward)formula 0,0,2.30833,63636,1,0,111756,4644,1366,270104,240,33160,273
FORMULA EnergyBus-PT-none-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(((((((((i3.u6.p16==1)&&(i5.u21.p19==1))&&(i3.u12.p41==1))&&(i3.u12.p58==1))&&(i3.u19.p95==1))&&(i3.u6.p110==1))&&(i3.u6.p113==1))&&(i13.u30.p146==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((((((((i3.u6.p16==1)&&(i5.u21.p19==1))&&(i3.u12.p41==1))&&(i3.u12.p58==1))&&(i3.u19.p95==1))&&(i3.u6.p110==1))&&(i3.u6.p113==1))&&(i13.u30.p146==1)))] != FALSE
(forward)formula 1,1,2.31049,63636,1,0,111756,4644,1414,270104,250,33160,981
FORMULA EnergyBus-PT-none-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (!(E(((((((((i3.u6.p16==1)&&(i5.u21.p19==1))&&(i3.u12.p41==1))&&(i3.u12.p58==1))&&(i11.u20.p83==1))&&(i3.u6.p110==1))&&(i3.u6.p113==1))&&(i3.u29.p139==1)) U ((((((((i3.u6.p16!=1)||(i5.u21.p19!=1))||(i3.u12.p41!=1))||(i3.u12.p58!=1))||(i3.u5.p100!=1))||(i3.u6.p103!=1))||(i3.u5.p114!=1))||(i13.u30.p146!=1)))) + AG(EF(((((((((i3.u6.p16==1)&&(i5.u21.p19==1))&&(i5.u11.p60==1))&&(i5.u11.p77==1))&&(i5.u21.p86==1))&&(i3.u6.p110==1))&&(i3.u6.p113==1))&&(i2.u28.p130==1)))))
=> equivalent forward existential formula: [(FwdU((Init * !(!(E(((((((((i3.u6.p16==1)&&(i5.u21.p19==1))&&(i3.u12.p41==1))&&(i3.u12.p58==1))&&(i11.u20.p83==1))&&(i3.u6.p110==1))&&(i3.u6.p113==1))&&(i3.u29.p139==1)) U ((((((((i3.u6.p16!=1)||(i5.u21.p19!=1))||(i3.u12.p41!=1))||(i3.u12.p58!=1))||(i3.u5.p100!=1))||(i3.u6.p103!=1))||(i3.u5.p114!=1))||(i13.u30.p146!=1)))))),TRUE) * !(E(TRUE U ((((((((i3.u6.p16==1)&&(i5.u21.p19==1))&&(i5.u11.p60==1))&&(i5.u11.p77==1))&&(i5.u21.p86==1))&&(i3.u6.p110==1))&&(i3.u6.p113==1))&&(i2.u28.p130==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t40, t152, t157, t160, t165, t176, t177, t179, t181, t245, t247, t525, t527, t591, t593, t803, t805, t853, t855, t869, t871, t919, t921, t1149, t1151, t1199, t1201, t1215, t1217, t1265, t1267, t1363, t1365, t1413, t1415, t1429, t1431, t1479, t1481, t1709, t1711, t1759, t1761, t1775, t1777, t1825, t1827, t2067, t2069, t2087, t2089, t2167, t2169, t2187, t2189, t2219, t2221, t2235, t2237, t2299, t2301, t2315, t2317, t3155, t3157, t3205, t3207, t3221, t3223, t3271, t3273, t3501, t3503, t3551, t3553, t3567, t3569, t3617, t3619, t3851, t3853, t3867, t3869, t3931, t3933, t3947, t3949, t4107, t4109, t4123, t4125, t4187, t4189, t4203, t4205, t4235, t4237, t4251, t4253, t4315, t4317, t4331, t4333, t4358, t4369, t4375, t4379, t4380, t4389, t4390, t4391, t4392, u13.t87, u13.t88, u13.t89, u13.t90, u13.t91, u16.t62, u16.t63, u16.t64, u16.t65, u16.t66, i0.t104, i0.t103, i0.t102, i0.u0.t111, i0.u2.t105, i2.u4.t101, i2.u27.t150, i2.u28.t26, i2.u28.t27, i2.u28.t28, i2.u28.t29, i3.t4366, i3.t4360, i3.t14, i3.u6.t100, i3.u6.t4365, i3.u12.t93, i3.u12.t132, i3.u29.t17, i3.u29.t19, i4.t4429, i4.t4426, i4.u9.t98, i4.u10.t128, i4.u24.t32, i4.u24.t33, i4.u24.t34, i4.u24.t35, i5.t95, i5.u21.t154, i11.u20.t4357, i11.u31.t5, i11.u31.t6, i11.u31.t7, i11.u31.t8, i12.u22.t41, i13.u30.t10, i13.u30.t11, i13.u30.t12, i13.u30.t13, i13.u32.t2, i13.u32.t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/477/164/641
(forward)formula 2,0,18.0739,551876,1,0,792125,12249,9668,3.6719e+06,1211,69946,1742530
FORMULA EnergyBus-PT-none-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E(!(EG(((((((((i3.u6.p16==1)&&(i5.u21.p19==1))&&(i3.u12.p41==1))&&(i3.u12.p58==1))&&(i3.u5.p85==1))&&(i3.u6.p105==1))&&(i3.u6.p113==1))&&(i11.u31.p151==1)))) U (AG(((((((((i3.u6.p16==1)&&(i5.u21.p19==1))&&(i5.u11.p60==1))&&(i5.u11.p77==1))&&(i5.u21.p81==1))&&(i12.u22.p108==1))&&(i3.u6.p113==1))&&(i2.u28.p130==1))) * EG(((((((((i3.u6.p16==1)&&(i5.u21.p19==1))&&(i5.u11.p60==1))&&(i5.u11.p77==1))&&(i3.u5.p85==1))&&(i3.u6.p105==1))&&(i3.u5.p114==1))&&(i3.u5.p140==1)))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,!(EG(((((((((i3.u6.p16==1)&&(i5.u21.p19==1))&&(i3.u12.p41==1))&&(i3.u12.p58==1))&&(i3.u5.p85==1))&&(i3.u6.p105==1))&&(i3.u6.p113==1))&&(i11.u31.p151==1))))) * !(E(TRUE U !(((((((((i3.u6.p16==1)&&(i5.u21.p19==1))&&(i5.u11.p60==1))&&(i5.u11.p77==1))&&(i5.u21.p81==1))&&(i12.u22.p108==1))&&(i3.u6.p113==1))&&(i2.u28.p130==1)))))),((((((((i3.u6.p16==1)&&(i5.u21.p19==1))&&(i5.u11.p60==1))&&(i5.u11.p77==1))&&(i3.u5.p85==1))&&(i3.u6.p105==1))&&(i3.u5.p114==1))&&(i3.u5.p140==1)))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
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
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 3,0,18.2401,553988,1,0,795072,12330,9817,3.68051e+06,1241,70435,1761537
FORMULA EnergyBus-PT-none-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(((((i2.u27.p126!=1)||(i3.u5.p140!=1))&&((((((((i3.u6.p16!=1)||(i5.u21.p19!=1))||(i5.u11.p60!=1))||(i5.u11.p77!=1))||(i5.u21.p88!=1))||(i3.u6.p110!=1))||(i3.u6.p113!=1))||(i11.u31.p151!=1)))&&(((((((((i3.u6.p16!=1)||(i5.u21.p19!=1))||(i3.u12.p41!=1))||(i3.u12.p58!=1))||(i5.u21.p88!=1))||(i3.u6.p110!=1))||(i3.u6.p113!=1))||(i2.u28.p131!=1))||(((((((((i3.u6.p16!=1)||(i5.u21.p19!=1))||(i5.u11.p60!=1))||(i5.u11.p77!=1))||(i3.u5.p100!=1))||(i12.u22.p108!=1))||(i3.u6.p113!=1))||(i2.u28.p131!=1))&&((((((((i3.u6.p16!=1)||(i5.u21.p19!=1))||(i5.u11.p60!=1))||(i5.u11.p77!=1))||(i11.u20.p90!=1))||(i3.u6.p110!=1))||(i3.u6.p113!=1))||(i11.u31.p151!=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(((((i2.u27.p126!=1)||(i3.u5.p140!=1))&&((((((((i3.u6.p16!=1)||(i5.u21.p19!=1))||(i5.u11.p60!=1))||(i5.u11.p77!=1))||(i5.u21.p88!=1))||(i3.u6.p110!=1))||(i3.u6.p113!=1))||(i11.u31.p151!=1)))&&(((((((((i3.u6.p16!=1)||(i5.u21.p19!=1))||(i3.u12.p41!=1))||(i3.u12.p58!=1))||(i5.u21.p88!=1))||(i3.u6.p110!=1))||(i3.u6.p113!=1))||(i2.u28.p131!=1))||(((((((((i3.u6.p16!=1)||(i5.u21.p19!=1))||(i5.u11.p60!=1))||(i5.u11.p77!=1))||(i3.u5.p100!=1))||(i12.u22.p108!=1))||(i3.u6.p113!=1))||(i2.u28.p131!=1))&&((((((((i3.u6.p16!=1)||(i5.u21.p19!=1))||(i5.u11.p60!=1))||(i5.u11.p77!=1))||(i11.u20.p90!=1))||(i3.u6.p110!=1))||(i3.u6.p113!=1))||(i11.u31.p151!=1)))))))] = FALSE
(forward)formula 4,0,18.334,557420,1,0,800425,12367,9900,3.69738e+06,1247,70735,1774954
FORMULA EnergyBus-PT-none-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(EF((((((((((i3.u6.p16==1)&&(i5.u21.p19==1))&&(i3.u12.p41==1))&&(i3.u12.p58==1))&&(i11.u20.p83==1))&&(i3.u6.p105==1))&&(i3.u5.p114==1))&&(i13.u30.p146==1))||((((((((i3.u6.p16==1)&&(i5.u21.p19==1))&&(i5.u11.p60==1))&&(i5.u11.p77==1))&&(i3.u5.p100==1))&&(i12.u22.p108==1))&&(i3.u6.p113==1))&&(i2.u28.p130==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (((((((((i3.u6.p16==1)&&(i5.u21.p19==1))&&(i3.u12.p41==1))&&(i3.u12.p58==1))&&(i11.u20.p83==1))&&(i3.u6.p105==1))&&(i3.u5.p114==1))&&(i13.u30.p146==1))||((((((((i3.u6.p16==1)&&(i5.u21.p19==1))&&(i5.u11.p60==1))&&(i5.u11.p77==1))&&(i3.u5.p100==1))&&(i12.u22.p108==1))&&(i3.u6.p113==1))&&(i2.u28.p130==1)))))] != FALSE
(forward)formula 5,1,756.64,2963928,1,0,3.98862e+06,250442,3592,2.1206e+07,515,2.60312e+06,2841885
FORMULA EnergyBus-PT-none-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(((((((((((i3.u6.p16!=1)||(i5.u21.p19!=1))||(i5.u11.p60!=1))||(i5.u11.p77!=1))||(i5.u21.p86!=1))||(i3.u6.p110!=1))||(i3.u5.p114!=1))||(i2.u28.p131!=1)) + !(EX(((((((((i3.u6.p16==1)&&(i5.u21.p19==1))&&(i3.u12.p41==1))&&(i3.u12.p58==1))&&(i3.u5.p85==1))&&(i3.u6.p105==1))&&(i3.u6.p113==1))&&(i11.u31.p151==1))))) + ((((((((i3.u6.p16==1)&&(i5.u21.p19==1))&&(i3.u12.p41==1))&&(i3.u12.p58==1))&&(i5.u21.p88==1))&&(i3.u6.p105==1))&&(i3.u5.p114==1))&&(i13.u30.p145==1))))
=> equivalent forward existential formula: [(EY(((FwdU(Init,TRUE) * !(((((((((i3.u6.p16==1)&&(i5.u21.p19==1))&&(i3.u12.p41==1))&&(i3.u12.p58==1))&&(i5.u21.p88==1))&&(i3.u6.p105==1))&&(i3.u5.p114==1))&&(i13.u30.p145==1)))) * !(((((((((i3.u6.p16!=1)||(i5.u21.p19!=1))||(i5.u11.p60!=1))||(i5.u11.p77!=1))||(i5.u21.p86!=1))||(i3.u6.p110!=1))||(i3.u5.p114!=1))||(i2.u28.p131!=1))))) * ((((((((i3.u6.p16==1)&&(i5.u21.p19==1))&&(i3.u12.p41==1))&&(i3.u12.p58==1))&&(i3.u5.p85==1))&&(i3.u6.p105==1))&&(i3.u6.p113==1))&&(i11.u31.p151==1)))] = FALSE
(forward)formula 6,1,756.733,2965776,1,0,3.99167e+06,250442,3724,2.12133e+07,535,2.60312e+06,2847178
FORMULA EnergyBus-PT-none-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((((((((((i3.u6.p16==1)&&(i5.u21.p19==1))&&(i3.u12.p41==1))&&(i3.u12.p58==1))&&(i3.u7.p92==1))&&(i12.u22.p108==1))&&(i3.u5.p114==1))&&(i3.u29.p139==1))||(((((((((i3.u6.p16==1)&&(i5.u21.p19==1))&&(i5.u11.p60==1))&&(i5.u11.p77==1))&&(i5.u21.p81==1))&&(i12.u22.p108==1))&&(i3.u5.p114==1))&&(i2.u28.p130==1))&&(((((((((i3.u6.p16!=1)||(i5.u21.p19!=1))||(i5.u11.p60!=1))||(i5.u11.p77!=1))||(i3.u5.p80!=1))||(i3.u6.p103!=1))||(i3.u5.p114!=1))||(i13.u30.p145!=1))||((((((((i3.u6.p16==1)&&(i5.u21.p19==1))&&(i3.u12.p41==1))&&(i3.u12.p58==1))&&(i5.u21.p81==1))&&(i3.u6.p103==1))&&(i3.u6.p113==1))&&(i2.u28.p130==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (((((((((i3.u6.p16==1)&&(i5.u21.p19==1))&&(i3.u12.p41==1))&&(i3.u12.p58==1))&&(i3.u7.p92==1))&&(i12.u22.p108==1))&&(i3.u5.p114==1))&&(i3.u29.p139==1))||(((((((((i3.u6.p16==1)&&(i5.u21.p19==1))&&(i5.u11.p60==1))&&(i5.u11.p77==1))&&(i5.u21.p81==1))&&(i12.u22.p108==1))&&(i3.u5.p114==1))&&(i2.u28.p130==1))&&(((((((((i3.u6.p16!=1)||(i5.u21.p19!=1))||(i5.u11.p60!=1))||(i5.u11.p77!=1))||(i3.u5.p80!=1))||(i3.u6.p103!=1))||(i3.u5.p114!=1))||(i13.u30.p145!=1))||((((((((i3.u6.p16==1)&&(i5.u21.p19==1))&&(i3.u12.p41==1))&&(i3.u12.p58==1))&&(i5.u21.p81==1))&&(i3.u6.p103==1))&&(i3.u6.p113==1))&&(i2.u28.p130==1))))))] != FALSE
(forward)formula 7,1,756.753,2966040,1,0,3.99175e+06,250442,3840,2.12134e+07,546,2.60312e+06,2849067
FORMULA EnergyBus-PT-none-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(AG((((((((((i3.u6.p16!=1)||(i5.u21.p19!=1))||(i5.u11.p60!=1))||(i5.u11.p77!=1))||(i3.u19.p95!=1))||(i12.u22.p108!=1))||(i3.u5.p114!=1))||(i3.u29.p139!=1))&&((i4.u9.p30!=1)||(i3.u5.p99!=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((((((((((i3.u6.p16!=1)||(i5.u21.p19!=1))||(i5.u11.p60!=1))||(i5.u11.p77!=1))||(i3.u19.p95!=1))||(i12.u22.p108!=1))||(i3.u5.p114!=1))||(i3.u29.p139!=1))&&((i4.u9.p30!=1)||(i3.u5.p99!=1))))))))] = FALSE
(forward)formula 8,0,1361.67,3971096,1,0,5.45331e+06,324138,3592,2.6912e+07,515,3.3691e+06,1902135
FORMULA EnergyBus-PT-none-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
Detected timeout of ITS tools.
[2020-05-22 15:05:51] [INFO ] Applying decomposition
[2020-05-22 15:05:52] [INFO ] Flatten gal took : 425 ms
[2020-05-22 15:05:52] [INFO ] Decomposing Gal with order
[2020-05-22 15:05:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 15:05:53] [INFO ] Removed a total of 15311 redundant transitions.
[2020-05-22 15:05:53] [INFO ] Flatten gal took : 716 ms
[2020-05-22 15:05:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 183 ms.
[2020-05-22 15:05:53] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 16 ms
[2020-05-22 15:05:53] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 5 CTL formulae.
built 21 ordering constraints for composite.
built 18 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
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,2.13184e+12,0.375859,17852,808,352,26386,2033,635,35635,251,12800,0


Converting to forward existential form...Done !
original formula: E(((((((((u5.p16==1)&&(u6.p19==1))&&(i11.i0.u29.p41==1))&&(i11.u16.p58==1))&&(u21.p97==1))&&(u22.p103==1))&&(u23.p114==1))&&(u28.p150==1)) U !(EF(((((((((u5.p16==1)&&(u6.p19==1))&&(i11.i2.u31.p60==1))&&(i11.u20.p77==1))&&(u21.p93==1))&&(u22.p103==1))&&(u23.p114==1))&&(u28.p139==1)))))
=> equivalent forward existential formula: [(FwdU(Init,((((((((u5.p16==1)&&(u6.p19==1))&&(i11.i0.u29.p41==1))&&(i11.u16.p58==1))&&(u21.p97==1))&&(u22.p103==1))&&(u23.p114==1))&&(u28.p150==1))) * !(E(TRUE U ((((((((u5.p16==1)&&(u6.p19==1))&&(i11.i2.u31.p60==1))&&(i11.u20.p77==1))&&(u21.p93==1))&&(u22.p103==1))&&(u23.p114==1))&&(u28.p139==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t167, t176, t177, t853, t855, t861, t863, t919, t921, t927, t929, t985, t987, t993, t995, t1133, t1135, t1141, t1143, t1199, t1201, t1207, t1209, t1265, t1267, t1273, t1275, t1413, t1415, t1421, t1423, t1479, t1481, t1487, t1489, t1545, t1547, t1553, t1555, t1693, t1695, t1701, t1703, t1759, t1761, t1767, t1769, t1825, t1827, t1833, t1835, t2067, t2069, t2087, t2089, t2107, t2109, t2147, t2149, t2167, t2169, t2187, t2189, t4107, t4109, t4111, t4113, t4123, t4125, t4127, t4129, t4139, t4141, t4143, t4145, t4171, t4173, t4175, t4177, t4187, t4189, t4191, t4193, t4203, t4205, t4207, t4209, t4235, t4237, t4239, t4241, t4251, t4253, t4255, t4257, t4267, t4269, t4271, t4273, t4299, t4301, t4303, t4305, t4315, t4317, t4319, t4321, t4331, t4333, t4335, t4337, t4356, t4358, t4359, t4366, t4369, t4370, t4379, t4389, t4392, t4420, t4422, t4423, t4425, u1.t102, u1.t103, u1.t104, u1.t105, u1.t111, u3.t101, u5.t100, u6.t152, u6.t154, u10.t98, u11.t128, u22.t40, u22.t41, u22.t157, u22.t160, u24.t32, u24.t33, u24.t34, u24.t35, u27.t150, u28.t2, u28.t3, u28.t5, u28.t6, u28.t7, u28.t8, u28.t10, u28.t11, u28.t12, u28.t13, u28.t16, u28.t17, u28.t18, u28.t19, u28.t26, u28.t27, u28.t28, u28.t29, i11.t133, i11.t95, i11.t93, i11.i0.u14.t87, i11.i0.u14.t88, i11.i0.u14.t89, i11.i0.u14.t90, i11.i0.u14.t91, i11.i2.u18.t62, i11.i2.u18.t63, i11.i2.u18.t64, i11.i2.u18.t65, i11.i2.u18.t66, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/325/175/500
(forward)formula 0,0,2.04956,85292,1,0,165297,18138,6508,271205,1352,81583,286495
FORMULA EnergyBus-PT-none-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(AX(((((((((u5.p16==1)&&(u6.p19==1))&&(i11.i0.u29.p41==1))&&(i11.u16.p58==1))&&(u21.p90==1))&&(u22.p110==1))&&(u23.p114==1))&&(u28.p139==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(((((((((u5.p16==1)&&(u6.p19==1))&&(i11.i0.u29.p41==1))&&(i11.u16.p58==1))&&(u21.p90==1))&&(u22.p110==1))&&(u23.p114==1))&&(u28.p139==1))))))] != FALSE
(forward)formula 1,0,2.11775,87932,1,0,170516,18664,6541,283641,1362,83878,290836
FORMULA EnergyBus-PT-none-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(((((((((u5.p16==1)&&(u6.p19==1))&&(i11.i0.u29.p41==1))&&(i11.u16.p58==1))&&(u21.p81==1))&&(u22.p108==1))&&(u23.p114==1))&&(u28.p151==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((((((((u5.p16==1)&&(u6.p19==1))&&(i11.i0.u29.p41==1))&&(i11.u16.p58==1))&&(u21.p81==1))&&(u22.p108==1))&&(u23.p114==1))&&(u28.p151==1)))] != FALSE
(forward)formula 2,1,2.12113,88196,1,0,170543,18664,6559,283689,1365,83878,290984
FORMULA EnergyBus-PT-none-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(AG(((((((((u5.p16!=1)||(u6.p19!=1))||(i11.i2.u31.p60!=1))||(i11.u20.p77!=1))||(u21.p100!=1))||(u22.p103!=1))||(u23.p114!=1))||(u28.p145!=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(((((((((u5.p16!=1)||(u6.p19!=1))||(i11.i2.u31.p60!=1))||(i11.u20.p77!=1))||(u21.p100!=1))||(u22.p103!=1))||(u23.p114!=1))||(u28.p145!=1))))] != FALSE
(forward)formula 3,1,2.13145,88724,1,0,171306,18797,6589,284559,1370,84331,292264
FORMULA EnergyBus-PT-none-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AF(AG((u28.p141==1))) + !(EF(((((((((u5.p16==1)&&(u6.p19==1))&&(i11.i2.u31.p60==1))&&(i11.u20.p77==1))&&(u21.p86==1))&&(u22.p105==1))&&(u23.p113==1))&&(u28.p150==1)))))
=> equivalent forward existential formula: [(FwdU((Init * !(!(EG(!(!(E(TRUE U !((u28.p141==1))))))))),TRUE) * ((((((((u5.p16==1)&&(u6.p19==1))&&(i11.i2.u31.p60==1))&&(i11.u20.p77==1))&&(u21.p86==1))&&(u22.p105==1))&&(u23.p113==1))&&(u28.p150==1)))] = FALSE
Using saturation style SCC detection
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 4,0,2.3771,99020,1,0,192558,19505,6983,319688,1515,91905,342910
FORMULA EnergyBus-PT-none-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1590159956711

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EnergyBus-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"

# 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 EnergyBus-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 r066-tajo-158922815101004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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