fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r066-tajo-158922815101002
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for EnergyBus-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15740.780 1703098.00 1807896.00 2585.90 TTFFFFFFFTTTFFFF normal

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-158922815101002.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922815101002
=====================================================================

--------------------
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-00
FORMULA_NAME EnergyBus-PT-none-01
FORMULA_NAME EnergyBus-PT-none-02
FORMULA_NAME EnergyBus-PT-none-03
FORMULA_NAME EnergyBus-PT-none-04
FORMULA_NAME EnergyBus-PT-none-05
FORMULA_NAME EnergyBus-PT-none-06
FORMULA_NAME EnergyBus-PT-none-07
FORMULA_NAME EnergyBus-PT-none-08
FORMULA_NAME EnergyBus-PT-none-09
FORMULA_NAME EnergyBus-PT-none-10
FORMULA_NAME EnergyBus-PT-none-11
FORMULA_NAME EnergyBus-PT-none-12
FORMULA_NAME EnergyBus-PT-none-13
FORMULA_NAME EnergyBus-PT-none-14
FORMULA_NAME EnergyBus-PT-none-15

=== Now, execution of the tool begins

BK_START 1590157912555

[2020-05-22 14:31:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-22 14:31:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 14:31:55] [INFO ] Load time of PNML (sax parser for PT used): 312 ms
[2020-05-22 14:31:55] [INFO ] Transformed 157 places.
[2020-05-22 14:31:55] [INFO ] Transformed 4430 transitions.
[2020-05-22 14:31:55] [INFO ] Found NUPN structural information;
[2020-05-22 14:31:55] [INFO ] Parsed PT model containing 157 places and 4430 transitions in 412 ms.
Deduced a syphon composed of 4 places in 30 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/LTLFireability.xml in 75 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1384 ms. (steps per millisecond=72 ) properties seen :[0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0]
[2020-05-22 14:31:56] [INFO ] Flow matrix only has 647 transitions (discarded 1266 similar events)
// Phase 1: matrix 647 rows 153 cols
[2020-05-22 14:31:56] [INFO ] Computed 23 place invariants in 17 ms
[2020-05-22 14:31:57] [INFO ] [Real]Absence check using 21 positive place invariants in 30 ms returned sat
[2020-05-22 14:31:57] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:31:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:31:57] [INFO ] [Real]Absence check using state equation in 331 ms returned sat
[2020-05-22 14:31:57] [INFO ] State equation strengthened by 468 read => feed constraints.
[2020-05-22 14:31:57] [INFO ] [Real]Added 468 Read/Feed constraints in 423 ms returned sat
[2020-05-22 14:31:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:31:58] [INFO ] [Nat]Absence check using 21 positive place invariants in 32 ms returned sat
[2020-05-22 14:31:58] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:31:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:31:58] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2020-05-22 14:31:58] [INFO ] [Nat]Added 468 Read/Feed constraints in 105 ms returned sat
[2020-05-22 14:31:59] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 470 ms.
[2020-05-22 14:32:18] [INFO ] Added : 390 causal constraints over 78 iterations in 19408 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-22 14:32:18] [INFO ] [Real]Absence check using 21 positive place invariants in 36 ms returned sat
[2020-05-22 14:32:18] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:32:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:32:19] [INFO ] [Real]Absence check using state equation in 957 ms returned sat
[2020-05-22 14:32:19] [INFO ] [Real]Added 468 Read/Feed constraints in 114 ms returned sat
[2020-05-22 14:32:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:32:19] [INFO ] [Nat]Absence check using 21 positive place invariants in 25 ms returned sat
[2020-05-22 14:32:19] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-22 14:32:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:32:19] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2020-05-22 14:32:19] [INFO ] [Nat]Added 468 Read/Feed constraints in 77 ms returned sat
[2020-05-22 14:32:19] [INFO ] Deduced a trap composed of 4 places in 146 ms
[2020-05-22 14:32:19] [INFO ] Deduced a trap composed of 5 places in 42 ms
[2020-05-22 14:32:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 316 ms
[2020-05-22 14:32:20] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 200 ms.
[2020-05-22 14:32:35] [INFO ] Added : 340 causal constraints over 68 iterations in 15918 ms. Result :sat
[2020-05-22 14:32:36] [INFO ] [Real]Absence check using 21 positive place invariants in 132 ms returned unsat
[2020-05-22 14:32:36] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned sat
[2020-05-22 14:32:36] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:32:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:32:36] [INFO ] [Real]Absence check using state equation in 504 ms returned sat
[2020-05-22 14:32:36] [INFO ] [Real]Added 468 Read/Feed constraints in 91 ms returned sat
[2020-05-22 14:32:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:32:36] [INFO ] [Nat]Absence check using 21 positive place invariants in 14 ms returned sat
[2020-05-22 14:32:36] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:32:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:32:37] [INFO ] [Nat]Absence check using state equation in 539 ms returned sat
[2020-05-22 14:32:37] [INFO ] [Nat]Added 468 Read/Feed constraints in 83 ms returned sat
[2020-05-22 14:32:37] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 145 ms.
[2020-05-22 14:32:56] [INFO ] Added : 410 causal constraints over 82 iterations in 19304 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-22 14:32:56] [INFO ] [Real]Absence check using 21 positive place invariants in 17 ms returned sat
[2020-05-22 14:32:56] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 16 ms returned sat
[2020-05-22 14:32:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:32:57] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2020-05-22 14:32:57] [INFO ] [Real]Added 468 Read/Feed constraints in 104 ms returned sat
[2020-05-22 14:32:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:32:57] [INFO ] [Nat]Absence check using 21 positive place invariants in 19 ms returned sat
[2020-05-22 14:32:57] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:32:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:32:57] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2020-05-22 14:32:57] [INFO ] [Nat]Added 468 Read/Feed constraints in 120 ms returned sat
[2020-05-22 14:32:58] [INFO ] Deduced a trap composed of 32 places in 345 ms
[2020-05-22 14:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 368 ms
[2020-05-22 14:32:58] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned sat
[2020-05-22 14:32:58] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:32:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:32:58] [INFO ] [Real]Absence check using state equation in 531 ms returned sat
[2020-05-22 14:32:59] [INFO ] [Real]Added 468 Read/Feed constraints in 108 ms returned sat
[2020-05-22 14:32:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:32:59] [INFO ] [Nat]Absence check using 21 positive place invariants in 16 ms returned sat
[2020-05-22 14:32:59] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:32:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:32:59] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2020-05-22 14:32:59] [INFO ] [Nat]Added 468 Read/Feed constraints in 80 ms returned sat
[2020-05-22 14:33:00] [INFO ] Deduced a trap composed of 4 places in 760 ms
[2020-05-22 14:33:00] [INFO ] Deduced a trap composed of 32 places in 191 ms
[2020-05-22 14:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 1015 ms
[2020-05-22 14:33:00] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned sat
[2020-05-22 14:33:00] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:33:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:33:00] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2020-05-22 14:33:00] [INFO ] [Real]Added 468 Read/Feed constraints in 85 ms returned sat
[2020-05-22 14:33:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:33:01] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned sat
[2020-05-22 14:33:01] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 22 ms returned sat
[2020-05-22 14:33:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:33:01] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2020-05-22 14:33:01] [INFO ] [Nat]Added 468 Read/Feed constraints in 82 ms returned sat
[2020-05-22 14:33:01] [INFO ] Deduced a trap composed of 5 places in 128 ms
[2020-05-22 14:33:01] [INFO ] Deduced a trap composed of 4 places in 126 ms
[2020-05-22 14:33:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 358 ms
[2020-05-22 14:33:01] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 83 ms.
[2020-05-22 14:33:20] [INFO ] Added : 405 causal constraints over 81 iterations in 19244 ms. Result :unknown
[2020-05-22 14:33:21] [INFO ] [Real]Absence check using 21 positive place invariants in 23 ms returned sat
[2020-05-22 14:33:21] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-22 14:33:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:33:21] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2020-05-22 14:33:21] [INFO ] [Real]Added 468 Read/Feed constraints in 78 ms returned sat
[2020-05-22 14:33:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:33:21] [INFO ] [Nat]Absence check using 21 positive place invariants in 20 ms returned sat
[2020-05-22 14:33:21] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-22 14:33:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:33:21] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2020-05-22 14:33:21] [INFO ] [Nat]Added 468 Read/Feed constraints in 86 ms returned sat
[2020-05-22 14:33:22] [INFO ] Deduced a trap composed of 4 places in 142 ms
[2020-05-22 14:33:22] [INFO ] Deduced a trap composed of 5 places in 23 ms
[2020-05-22 14:33:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 337 ms
[2020-05-22 14:33:22] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 201 ms.
[2020-05-22 14:33:40] [INFO ] Added : 355 causal constraints over 71 iterations in 18391 ms. Result :sat
[2020-05-22 14:33:40] [INFO ] [Real]Absence check using 21 positive place invariants in 20 ms returned sat
[2020-05-22 14:33:40] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-22 14:33:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:33:41] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2020-05-22 14:33:41] [INFO ] [Real]Added 468 Read/Feed constraints in 78 ms returned sat
[2020-05-22 14:33:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:33:41] [INFO ] [Nat]Absence check using 21 positive place invariants in 14 ms returned sat
[2020-05-22 14:33:41] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:33:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:33:41] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2020-05-22 14:33:41] [INFO ] [Nat]Added 468 Read/Feed constraints in 123 ms returned sat
[2020-05-22 14:33:41] [INFO ] Deduced a trap composed of 5 places in 55 ms
[2020-05-22 14:33:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2020-05-22 14:33:41] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 175 ms.
[2020-05-22 14:34:01] [INFO ] Added : 365 causal constraints over 73 iterations in 19422 ms. Result :unknown
[2020-05-22 14:34:01] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2020-05-22 14:34:01] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 3 ms returned sat
[2020-05-22 14:34:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:34:01] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2020-05-22 14:34:01] [INFO ] [Real]Added 468 Read/Feed constraints in 86 ms returned sat
[2020-05-22 14:34:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:34:01] [INFO ] [Nat]Absence check using 21 positive place invariants in 20 ms returned sat
[2020-05-22 14:34:01] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:34:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:34:02] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2020-05-22 14:34:02] [INFO ] [Nat]Added 468 Read/Feed constraints in 91 ms returned sat
[2020-05-22 14:34:02] [INFO ] Deduced a trap composed of 5 places in 27 ms
[2020-05-22 14:34:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2020-05-22 14:34:02] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 127 ms.
[2020-05-22 14:34:21] [INFO ] Added : 415 causal constraints over 83 iterations in 19479 ms. Result :unknown
[2020-05-22 14:34:21] [INFO ] [Real]Absence check using 21 positive place invariants in 17 ms returned sat
[2020-05-22 14:34:21] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:34:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:34:22] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2020-05-22 14:34:22] [INFO ] [Real]Added 468 Read/Feed constraints in 73 ms returned sat
[2020-05-22 14:34:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:34:22] [INFO ] [Nat]Absence check using 21 positive place invariants in 20 ms returned sat
[2020-05-22 14:34:22] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-22 14:34:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:34:22] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2020-05-22 14:34:22] [INFO ] [Nat]Added 468 Read/Feed constraints in 71 ms returned sat
[2020-05-22 14:34:22] [INFO ] Deduced a trap composed of 4 places in 252 ms
[2020-05-22 14:34:23] [INFO ] Deduced a trap composed of 5 places in 264 ms
[2020-05-22 14:34:23] [INFO ] Deduced a trap composed of 9 places in 257 ms
[2020-05-22 14:34:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 888 ms
[2020-05-22 14:34:23] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 155 ms.
[2020-05-22 14:34:42] [INFO ] Added : 375 causal constraints over 75 iterations in 18703 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-22 14:34:42] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2020-05-22 14:34:42] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 0 ms returned sat
[2020-05-22 14:34:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:34:42] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2020-05-22 14:34:42] [INFO ] [Real]Added 468 Read/Feed constraints in 68 ms returned sat
[2020-05-22 14:34:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:34:42] [INFO ] [Nat]Absence check using 21 positive place invariants in 62 ms returned sat
[2020-05-22 14:34:42] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 29 ms returned sat
[2020-05-22 14:34:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:34:43] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2020-05-22 14:34:43] [INFO ] [Nat]Added 468 Read/Feed constraints in 100 ms returned sat
[2020-05-22 14:34:43] [INFO ] Deduced a trap composed of 5 places in 131 ms
[2020-05-22 14:34:43] [INFO ] Deduced a trap composed of 4 places in 131 ms
[2020-05-22 14:34:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 351 ms
[2020-05-22 14:34:43] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 197 ms.
[2020-05-22 14:35:02] [INFO ] Added : 350 causal constraints over 70 iterations in 19154 ms. Result :unknown
[2020-05-22 14:35:02] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned sat
[2020-05-22 14:35:02] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 0 ms returned sat
[2020-05-22 14:35:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:35:03] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2020-05-22 14:35:03] [INFO ] [Real]Added 468 Read/Feed constraints in 113 ms returned sat
[2020-05-22 14:35:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:35:03] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2020-05-22 14:35:03] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:35:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:35:04] [INFO ] [Nat]Absence check using state equation in 623 ms returned sat
[2020-05-22 14:35:04] [INFO ] [Nat]Added 468 Read/Feed constraints in 127 ms returned sat
[2020-05-22 14:35:04] [INFO ] Deduced a trap composed of 5 places in 39 ms
[2020-05-22 14:35:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2020-05-22 14:35:04] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 126 ms.
[2020-05-22 14:35:21] [INFO ] Added : 330 causal constraints over 66 iterations in 17631 ms. Result :sat
[2020-05-22 14:35:22] [INFO ] [Real]Absence check using 21 positive place invariants in 16 ms returned sat
[2020-05-22 14:35:22] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-22 14:35:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:35:23] [INFO ] [Real]Absence check using state equation in 964 ms returned sat
[2020-05-22 14:35:23] [INFO ] [Real]Added 468 Read/Feed constraints in 64 ms returned sat
[2020-05-22 14:35:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:35:23] [INFO ] [Nat]Absence check using 21 positive place invariants in 19 ms returned sat
[2020-05-22 14:35:23] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:35:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:35:23] [INFO ] [Nat]Absence check using state equation in 581 ms returned sat
[2020-05-22 14:35:23] [INFO ] [Nat]Added 468 Read/Feed constraints in 88 ms returned sat
[2020-05-22 14:35:24] [INFO ] Deduced a trap composed of 5 places in 103 ms
[2020-05-22 14:35:24] [INFO ] Deduced a trap composed of 4 places in 126 ms
[2020-05-22 14:35:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 353 ms
[2020-05-22 14:35:24] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 139 ms.
[2020-05-22 14:35:42] [INFO ] Added : 345 causal constraints over 69 iterations in 18233 ms. Result :sat
[2020-05-22 14:35:42] [INFO ] [Real]Absence check using 21 positive place invariants in 31 ms returned sat
[2020-05-22 14:35:42] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:35:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:35:42] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2020-05-22 14:35:43] [INFO ] [Real]Added 468 Read/Feed constraints in 98 ms returned sat
[2020-05-22 14:35:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:35:43] [INFO ] [Nat]Absence check using 21 positive place invariants in 127 ms returned sat
[2020-05-22 14:35:43] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 27 ms returned sat
[2020-05-22 14:35:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:35:43] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2020-05-22 14:35:43] [INFO ] [Nat]Added 468 Read/Feed constraints in 133 ms returned sat
[2020-05-22 14:35:44] [INFO ] Deduced a trap composed of 5 places in 197 ms
[2020-05-22 14:35:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2020-05-22 14:35:44] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 135 ms.
[2020-05-22 14:36:01] [INFO ] Added : 330 causal constraints over 66 iterations in 17668 ms. Result :sat
[2020-05-22 14:36:02] [INFO ] [Real]Absence check using 21 positive place invariants in 119 ms returned sat
[2020-05-22 14:36:02] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 3 ms returned sat
[2020-05-22 14:36:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:36:02] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2020-05-22 14:36:02] [INFO ] [Real]Added 468 Read/Feed constraints in 62 ms returned sat
[2020-05-22 14:36:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:36:02] [INFO ] [Nat]Absence check using 21 positive place invariants in 132 ms returned sat
[2020-05-22 14:36:02] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 27 ms returned sat
[2020-05-22 14:36:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:36:03] [INFO ] [Nat]Absence check using state equation in 1357 ms returned sat
[2020-05-22 14:36:04] [INFO ] [Nat]Added 468 Read/Feed constraints in 81 ms returned sat
[2020-05-22 14:36:04] [INFO ] Deduced a trap composed of 5 places in 17 ms
[2020-05-22 14:36:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2020-05-22 14:36:04] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 139 ms.
[2020-05-22 14:36:22] [INFO ] Added : 405 causal constraints over 81 iterations in 18291 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-22 14:36:22] [INFO ] [Real]Absence check using 21 positive place invariants in 20 ms returned sat
[2020-05-22 14:36:22] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 3 ms returned sat
[2020-05-22 14:36:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:36:23] [INFO ] [Real]Absence check using state equation in 1154 ms returned sat
[2020-05-22 14:36:23] [INFO ] [Real]Added 468 Read/Feed constraints in 124 ms returned sat
[2020-05-22 14:36:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:36:23] [INFO ] [Nat]Absence check using 21 positive place invariants in 40 ms returned sat
[2020-05-22 14:36:23] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 4 ms returned sat
[2020-05-22 14:36:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:36:24] [INFO ] [Nat]Absence check using state equation in 468 ms returned sat
[2020-05-22 14:36:24] [INFO ] [Nat]Added 468 Read/Feed constraints in 84 ms returned sat
[2020-05-22 14:36:24] [INFO ] Deduced a trap composed of 5 places in 76 ms
[2020-05-22 14:36:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2020-05-22 14:36:24] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 136 ms.
[2020-05-22 14:36:43] [INFO ] Added : 340 causal constraints over 68 iterations in 19255 ms. Result :unknown
[2020-05-22 14:36:43] [INFO ] [Real]Absence check using 21 positive place invariants in 25 ms returned sat
[2020-05-22 14:36:43] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-22 14:36:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:36:44] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2020-05-22 14:36:44] [INFO ] [Real]Added 468 Read/Feed constraints in 62 ms returned sat
[2020-05-22 14:36:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:36:44] [INFO ] [Nat]Absence check using 21 positive place invariants in 21 ms returned sat
[2020-05-22 14:36:44] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-22 14:36:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:36:44] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2020-05-22 14:36:44] [INFO ] [Nat]Added 468 Read/Feed constraints in 88 ms returned sat
[2020-05-22 14:36:44] [INFO ] Deduced a trap composed of 5 places in 39 ms
[2020-05-22 14:36:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2020-05-22 14:36:44] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 138 ms.
[2020-05-22 14:37:01] [INFO ] Added : 330 causal constraints over 66 iterations in 16587 ms. Result :sat
[2020-05-22 14:37:01] [INFO ] Deduced a trap composed of 5 places in 45 ms
[2020-05-22 14:37:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2020-05-22 14:37:01] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned sat
[2020-05-22 14:37:01] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 3 ms returned sat
[2020-05-22 14:37:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:37:02] [INFO ] [Real]Absence check using state equation in 402 ms returned sat
[2020-05-22 14:37:02] [INFO ] [Real]Added 468 Read/Feed constraints in 71 ms returned sat
[2020-05-22 14:37:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:37:02] [INFO ] [Nat]Absence check using 21 positive place invariants in 19 ms returned sat
[2020-05-22 14:37:02] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:37:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:37:02] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2020-05-22 14:37:02] [INFO ] [Nat]Added 468 Read/Feed constraints in 59 ms returned sat
[2020-05-22 14:37:03] [INFO ] Deduced a trap composed of 4 places in 300 ms
[2020-05-22 14:37:03] [INFO ] Deduced a trap composed of 5 places in 49 ms
[2020-05-22 14:37:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 444 ms
[2020-05-22 14:37:03] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 150 ms.
[2020-05-22 14:37:22] [INFO ] Added : 385 causal constraints over 77 iterations in 19059 ms. Result :unknown
[2020-05-22 14:37:22] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2020-05-22 14:37:22] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:37:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:37:22] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2020-05-22 14:37:22] [INFO ] [Real]Added 468 Read/Feed constraints in 106 ms returned sat
[2020-05-22 14:37:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:37:23] [INFO ] [Nat]Absence check using 21 positive place invariants in 16 ms returned sat
[2020-05-22 14:37:23] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:37:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:37:23] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2020-05-22 14:37:23] [INFO ] [Nat]Added 468 Read/Feed constraints in 93 ms returned sat
[2020-05-22 14:37:23] [INFO ] Deduced a trap composed of 4 places in 102 ms
[2020-05-22 14:37:23] [INFO ] Deduced a trap composed of 5 places in 29 ms
[2020-05-22 14:37:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 210 ms
[2020-05-22 14:37:23] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 185 ms.
[2020-05-22 14:37:43] [INFO ] Added : 370 causal constraints over 74 iterations in 19316 ms. Result :unknown
[2020-05-22 14:37:43] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned sat
[2020-05-22 14:37:43] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:37:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:37:43] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2020-05-22 14:37:43] [INFO ] [Real]Added 468 Read/Feed constraints in 73 ms returned sat
[2020-05-22 14:37:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:37:43] [INFO ] [Nat]Absence check using 21 positive place invariants in 53 ms returned sat
[2020-05-22 14:37:43] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-22 14:37:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:37:44] [INFO ] [Nat]Absence check using state equation in 471 ms returned sat
[2020-05-22 14:37:44] [INFO ] [Nat]Added 468 Read/Feed constraints in 97 ms returned sat
[2020-05-22 14:37:44] [INFO ] Deduced a trap composed of 5 places in 12 ms
[2020-05-22 14:37:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2020-05-22 14:37:44] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 181 ms.
[2020-05-22 14:38:03] [INFO ] Added : 375 causal constraints over 75 iterations in 19229 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-22 14:38:03] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned sat
[2020-05-22 14:38:03] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:38:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:38:03] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2020-05-22 14:38:03] [INFO ] [Real]Added 468 Read/Feed constraints in 70 ms returned sat
[2020-05-22 14:38:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:38:03] [INFO ] [Nat]Absence check using 21 positive place invariants in 32 ms returned sat
[2020-05-22 14:38:03] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:38:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:38:04] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2020-05-22 14:38:04] [INFO ] [Nat]Added 468 Read/Feed constraints in 115 ms returned sat
[2020-05-22 14:38:04] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 194 ms.
[2020-05-22 14:38:22] [INFO ] Added : 355 causal constraints over 71 iterations in 18107 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-05-22 14:38:23] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-05-22 14:38:23] [INFO ] Flatten gal took : 674 ms
FORMULA EnergyBus-PT-none-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 14:38:24] [INFO ] Flatten gal took : 243 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 14:38:24] [INFO ] Applying decomposition
[2020-05-22 14:38:25] [INFO ] Input system was already deterministic with 1913 transitions.
[2020-05-22 14:38:25] [INFO ] Too many transitions (1913) to apply POR reductions. Disabling POR matrices.
[2020-05-22 14:38:25] [INFO ] Flatten gal took : 605 ms
[2020-05-22 14:38:25] [INFO ] Built C files in 822ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
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/graph5204734372174374877.txt, -o, /tmp/graph5204734372174374877.bin, -w, /tmp/graph5204734372174374877.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/graph5204734372174374877.bin, -l, -1, -v, -w, /tmp/graph5204734372174374877.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 14:38:26] [INFO ] Decomposing Gal with order
[2020-05-22 14:38:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 14:38:27] [INFO ] Removed a total of 8893 redundant transitions.
[2020-05-22 14:38:27] [INFO ] Flatten gal took : 1098 ms
[2020-05-22 14:38:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 145 labels/synchronizations in 126 ms.
[2020-05-22 14:38:27] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 36 ms
[2020-05-22 14:38:27] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 8 LTL properties
Checking formula 0 : !(((!(G((F(X(F("((((((((i2.u6.p16==1)&&(i2.u5.p19==1))&&(i8.u14.p41==1))&&(i8.u14.p58==1))&&(i2.u6.p86==1))&&(i2.u5.p110==1))&&(i2.u24.p113==1))&&(i14.u33.p145==1))"))))||("((((((((i2.u6.p16==1)&&(i2.u5.p19==1))&&(i8.u14.p41==1))&&(i8.u14.p58==1))&&(i2.u6.p86==1))&&(i2.u5.p110==1))&&(i2.u24.p113==1))&&(i14.u33.p145==1))"))))||(F(G(F("((((((((i2.u6.p16==1)&&(i2.u5.p19==1))&&(i8.u14.p41==1))&&(i8.u14.p58==1))&&(i2.u24.p100==1))&&(i2.u5.p105==1))&&(i2.u5.p114==1))&&(i13.u31.p130==1))"))))))
Formula 0 simplified : !(!G("((((((((i2.u6.p16==1)&&(i2.u5.p19==1))&&(i8.u14.p41==1))&&(i8.u14.p58==1))&&(i2.u6.p86==1))&&(i2.u5.p110==1))&&(i2.u24.p113==1))&&(i14.u33.p145==1))" | FXF"((((((((i2.u6.p16==1)&&(i2.u5.p19==1))&&(i8.u14.p41==1))&&(i8.u14.p58==1))&&(i2.u6.p86==1))&&(i2.u5.p110==1))&&(i2.u24.p113==1))&&(i14.u33.p145==1))") | FGF"((((((((i2.u6.p16==1)&&(i2.u5.p19==1))&&(i8.u14.p41==1))&&(i8.u14.p58==1))&&(i2.u24.p100==1))&&(i2.u5.p105==1))&&(i2.u5.p114==1))&&(i13.u31.p130==1))")
built 63 ordering constraints for composite.
built 7 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 18 ordering constraints for composite.
built 63 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 10 ordering constraints for composite.
Compilation finished in 28542 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 105 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( !( [](( <>(X(<>((LTLAP0==true))))) || ( (LTLAP0==true)) )) ) || ( <>([](<>((LTLAP1==true))))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( !( [](( <>(X(<>((LTLAP0==true))))) || ( (LTLAP0==true)) )) ) || ( <>([](<>((LTLAP1==true))))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( !( [](( <>(X(<>((LTLAP0==true))))) || ( (LTLAP0==true)) )) ) || ( <>([](<>((LTLAP1==true))))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
Reverse transition relation is NOT exact ! Due to transitions t14, t40, t95, t157, t160, t169, t177, t303, t305, t435, t437, t583, t585, t715, t717, t919, t921, t927, t929, t1051, t1053, t1059, t1061, t1199, t1201, t1207, t1209, t1331, t1333, t1339, t1341, t1479, t1481, t1487, t1489, t1611, t1613, t1619, t1621, t1759, t1761, t1767, t1769, t1891, t1893, t1899, t1901, t2087, t2089, t2127, t2129, t2167, t2169, t2207, t2209, t2235, t2237, t2269, t2299, t2301, t2333, t3271, t3273, t3279, t3281, t3403, t3405, t3411, t3413, t3551, t3553, t3559, t3561, t3683, t3685, t3691, t3693, t3867, t3869, t3899, t3901, t3931, t3933, t3963, t3965, t4123, t4125, t4155, t4157, t4187, t4189, t4219, t4221, t4251, t4253, t4283, t4285, t4315, t4317, t4347, t4349, t4358, t4359, t4369, t4375, t4379, t4380, t4389, t4390, t4391, t4392, u15.t87, u15.t88, u15.t89, u15.t90, u15.t91, u18.t62, u18.t63, u18.t64, u18.t65, u18.t66, i0.t104, i0.t103, i0.t102, i0.u0.t111, i0.u1.t105, i1.u32.t17, i1.u32.t19, i2.t4366, i2.t4365, i2.t2307, i2.t2243, i2.t100, i2.u5.t152, i2.u5.t154, i3.i0.u27.t32, i3.i0.u27.t33, i3.i0.u27.t34, i3.i0.u27.t35, i3.i1.t4424, i3.i1.t4426, i3.i1.t4427, i3.i1.t4429, i3.i1.u11.t98, i3.i1.u12.t128, i8.u14.t93, i8.u14.t132, i11.u23.t4357, i11.u34.t5, i11.u34.t6, i11.u34.t7, i11.u34.t8, i12.u25.t41, i13.u4.t101, i13.u30.t150, i13.u31.t26, i13.u31.t27, i13.u31.t28, i13.u31.t29, i14.u33.t10, i14.u33.t11, i14.u33.t12, i14.u33.t13, i14.u35.t2, i14.u35.t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/476/165/641
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
39886 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,398.998,4172060,1,0,2.90032e+06,94421,8868,3.70662e+07,1015,596608,5955662
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA EnergyBus-PT-none-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F(G((((((((((X("((((((((i2.u6.p16==1)&&(i2.u5.p19==1))&&(i2.u13.p60==1))&&(i2.u13.p77==1))&&(i2.u6.p88==1))&&(i2.u5.p105==1))&&(i2.u5.p114==1))&&(i1.u32.p139==1))"))&&("(i2.u6.p16==1)"))&&("(i2.u5.p19==1)"))&&("(i8.u14.p41==1)"))&&("(i8.u14.p58==1)"))&&("(i11.u23.p97==1)"))&&("(i12.u25.p108==1)"))&&("(i2.u24.p113==1)"))&&("(i11.u34.p150==1)"))&&((G("((((((((i2.u6.p16==1)&&(i2.u5.p19==1))&&(i8.u14.p41==1))&&(i8.u14.p58==1))&&(i11.u23.p97==1))&&(i12.u25.p108==1))&&(i2.u24.p113==1))&&(i11.u34.p150==1))"))||("((((i2.u13.p60==1)&&(i2.u13.p77==1))&&(i2.u24.p85==1))&&(i1.u32.p139==1))")))))))
Formula 1 simplified : !GFG("(i2.u5.p19==1)" & "(i2.u6.p16==1)" & "(i2.u24.p113==1)" & "(i8.u14.p41==1)" & "(i8.u14.p58==1)" & "(i11.u23.p97==1)" & "(i11.u34.p150==1)" & "(i12.u25.p108==1)" & X"((((((((i2.u6.p16==1)&&(i2.u5.p19==1))&&(i2.u13.p60==1))&&(i2.u13.p77==1))&&(i2.u6.p88==1))&&(i2.u5.p105==1))&&(i2.u5.p114==1))&&(i1.u32.p139==1))" & ("((((i2.u13.p60==1)&&(i2.u13.p77==1))&&(i2.u24.p85==1))&&(i1.u32.p139==1))" | G"((((((((i2.u6.p16==1)&&(i2.u5.p19==1))&&(i8.u14.p41==1))&&(i8.u14.p58==1))&&(i11.u23.p97==1))&&(i12.u25.p108==1))&&(i2.u24.p113==1))&&(i11.u34.p150==1))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
4093 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,440.009,4193908,1,0,2.91653e+06,96726,3944,3.71599e+07,551,602606,418333
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA EnergyBus-PT-none-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(G(X(G((G(((((((((F("((((((((i2.u6.p16==1)&&(i2.u5.p19==1))&&(i8.u14.p41==1))&&(i8.u14.p58==1))&&(i2.u24.p100==1))&&(i12.u25.p108==1))&&(i2.u24.p113==1))&&(i14.u33.p145==1))"))&&("(i2.u6.p16==1)"))&&("(i2.u5.p19==1)"))&&("(i2.u13.p60==1)"))&&("(i2.u13.p77==1)"))&&("(i2.u24.p85==1)"))&&("(i2.u5.p103==1)"))&&("(i2.u5.p114==1)"))&&("(i13.u31.p131==1)")))U("((((((((i2.u6.p16==1)&&(i2.u5.p19==1))&&(i2.u13.p60==1))&&(i2.u13.p77==1))&&(i2.u24.p85==1))&&(i2.u5.p103==1))&&(i2.u5.p114==1))&&(i13.u31.p131==1))")))))))
Formula 2 simplified : !FGXG(G("(i2.u5.p19==1)" & "(i2.u5.p103==1)" & "(i2.u5.p114==1)" & "(i2.u6.p16==1)" & "(i2.u13.p60==1)" & "(i2.u13.p77==1)" & "(i2.u24.p85==1)" & "(i13.u31.p131==1)" & F"((((((((i2.u6.p16==1)&&(i2.u5.p19==1))&&(i8.u14.p41==1))&&(i8.u14.p58==1))&&(i2.u24.p100==1))&&(i12.u25.p108==1))&&(i2.u24.p113==1))&&(i14.u33.p145==1))") U "((((((((i2.u6.p16==1)&&(i2.u5.p19==1))&&(i2.u13.p60==1))&&(i2.u13.p77==1))&&(i2.u24.p85==1))&&(i2.u5.p103==1))&&(i2.u5.p114==1))&&(i13.u31.p131==1))")
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
269 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,442.768,4193908,1,0,2.91653e+06,96726,4921,3.71599e+07,607,602606,619739
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA EnergyBus-PT-none-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((X(X("((((((((i2.u6.p16==1)&&(i2.u5.p19==1))&&(i8.u14.p41==1))&&(i8.u14.p58==1))&&(i1.u21.p89==1))&&(i12.u25.p108==1))&&(i2.u24.p113==1))&&(i14.u33.p146==1))")))U("((((((((i2.u6.p16==1)&&(i2.u5.p19==1))&&(i2.u13.p60==1))&&(i2.u13.p77==1))&&(i2.u24.p87==1))&&(i12.u25.p108==1))&&(i2.u24.p113==1))&&(i1.u32.p139==1))")))
Formula 3 simplified : !(XX"((((((((i2.u6.p16==1)&&(i2.u5.p19==1))&&(i8.u14.p41==1))&&(i8.u14.p58==1))&&(i1.u21.p89==1))&&(i12.u25.p108==1))&&(i2.u24.p113==1))&&(i14.u33.p146==1))" U "((((((((i2.u6.p16==1)&&(i2.u5.p19==1))&&(i2.u13.p60==1))&&(i2.u13.p77==1))&&(i2.u24.p87==1))&&(i12.u25.p108==1))&&(i2.u24.p113==1))&&(i1.u32.p139==1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
16857 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,611.342,4194224,1,0,2.91653e+06,131647,4983,3.71599e+07,609,637010,2797215
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA EnergyBus-PT-none-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F((!(G(X("(((((((((i2.u6.p16==1)&&(i2.u5.p19==1))&&(i2.u13.p60==1))&&(i2.u13.p77==1))&&(i2.u24.p87==1))&&(i2.u5.p103==1))&&(i2.u24.p113==1))&&(i13.u31.p130==1))||((((((((i2.u6.p16==1)&&(i2.u5.p19==1))&&(i8.u14.p41==1))&&(i8.u14.p58==1))&&(i1.u21.p82==1))&&(i2.u5.p105==1))&&(i2.u24.p113==1))&&(i11.u34.p151==1)))"))))&&(((((((((G("((((((((i2.u6.p16!=1)||(i2.u5.p19!=1))||(i2.u13.p60!=1))||(i2.u13.p77!=1))||(i2.u24.p87!=1))||(i2.u5.p103!=1))||(i2.u24.p113!=1))||(i13.u31.p130!=1))"))||("(i2.u6.p16!=1)"))||("(i2.u5.p19!=1)"))||("(i2.u13.p60!=1)"))||("(i2.u13.p77!=1)"))||("(i2.u24.p87!=1)"))||("(i2.u5.p103!=1)"))||("(i2.u24.p113!=1)"))||("(i13.u31.p130!=1)")))))
Formula 4 simplified : !F(!GX"(((((((((i2.u6.p16==1)&&(i2.u5.p19==1))&&(i2.u13.p60==1))&&(i2.u13.p77==1))&&(i2.u24.p87==1))&&(i2.u5.p103==1))&&(i2.u24.p113==1))&&(i13.u31.p130==1))||((((((((i2.u6.p16==1)&&(i2.u5.p19==1))&&(i8.u14.p41==1))&&(i8.u14.p58==1))&&(i1.u21.p82==1))&&(i2.u5.p105==1))&&(i2.u24.p113==1))&&(i11.u34.p151==1)))" & ("(i2.u5.p19!=1)" | "(i2.u5.p103!=1)" | "(i2.u6.p16!=1)" | "(i2.u13.p60!=1)" | "(i2.u13.p77!=1)" | "(i2.u24.p87!=1)" | "(i2.u24.p113!=1)" | "(i13.u31.p130!=1)" | G"((((((((i2.u6.p16!=1)||(i2.u5.p19!=1))||(i2.u13.p60!=1))||(i2.u13.p77!=1))||(i2.u24.p87!=1))||(i2.u5.p103!=1))||(i2.u24.p113!=1))||(i13.u31.p130!=1))"))
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,611.384,4194224,1,0,2.91653e+06,131647,5143,3.71599e+07,622,637010,2797379
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA EnergyBus-PT-none-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(X(G(X(X("((((((((i2.u6.p16==1)&&(i2.u5.p19==1))&&(i8.u14.p41==1))&&(i8.u14.p58==1))&&(i11.u23.p97==1))&&(i2.u5.p105==1))&&(i2.u5.p114==1))&&(i11.u34.p151==1))")))))))
Formula 5 simplified : !FXGXX"((((((((i2.u6.p16==1)&&(i2.u5.p19==1))&&(i8.u14.p41==1))&&(i8.u14.p58==1))&&(i11.u23.p97==1))&&(i2.u5.p105==1))&&(i2.u5.p114==1))&&(i11.u34.p151==1))"
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
995 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,621.341,4194224,1,0,2.91653e+06,143153,5199,3.71599e+07,624,723718,3155925
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA EnergyBus-PT-none-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((F(X(F("((((((((i2.u6.p16==1)&&(i2.u5.p19==1))&&(i2.u13.p60==1))&&(i2.u13.p77==1))&&(i11.u23.p83==1))&&(i2.u5.p103==1))&&(i2.u24.p113==1))&&(i13.u31.p131==1))"))))||(G(X("((u16.p51==1)||((((((((i2.u6.p16==1)&&(i2.u5.p19==1))&&(i8.u14.p41==1))&&(i8.u14.p58==1))&&(i2.u24.p87==1))&&(i12.u25.p108==1))&&(i2.u5.p114==1))&&(i13.u31.p130==1)))")))))
Formula 6 simplified : !(FXF"((((((((i2.u6.p16==1)&&(i2.u5.p19==1))&&(i2.u13.p60==1))&&(i2.u13.p77==1))&&(i11.u23.p83==1))&&(i2.u5.p103==1))&&(i2.u24.p113==1))&&(i13.u31.p131==1))" | GX"((u16.p51==1)||((((((((i2.u6.p16==1)&&(i2.u5.p19==1))&&(i8.u14.p41==1))&&(i8.u14.p58==1))&&(i2.u24.p87==1))&&(i12.u25.p108==1))&&(i2.u5.p114==1))&&(i13.u31.p130==1)))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
58608 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1207.43,8099316,1,0,4.29707e+06,250294,3411,8.19807e+07,511,1.21951e+06,183442
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA EnergyBus-PT-none-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F((G("((((((((i2.u6.p16==1)&&(i2.u5.p19==1))&&(i2.u13.p60==1))&&(i2.u13.p77==1))&&(i2.u6.p81==1))&&(i2.u5.p103==1))&&(i2.u24.p113==1))&&(i14.u33.p146==1))"))U("((((((((i2.u6.p16==1)&&(i2.u5.p19==1))&&(i2.u13.p60==1))&&(i2.u13.p77==1))&&(i11.u23.p97==1))&&(i2.u5.p105==1))&&(i2.u5.p114==1))&&(i1.u32.p139==1))"))))
Formula 7 simplified : !F(G"((((((((i2.u6.p16==1)&&(i2.u5.p19==1))&&(i2.u13.p60==1))&&(i2.u13.p77==1))&&(i2.u6.p81==1))&&(i2.u5.p103==1))&&(i2.u24.p113==1))&&(i14.u33.p146==1))" U "((((((((i2.u6.p16==1)&&(i2.u5.p19==1))&&(i2.u13.p60==1))&&(i2.u13.p77==1))&&(i11.u23.p97==1))&&(i2.u5.p105==1))&&(i2.u5.p114==1))&&(i1.u32.p139==1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
7870 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1286.14,8099400,1,0,4.29707e+06,250294,4433,8.19807e+07,569,1.21951e+06,2147153
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA EnergyBus-PT-none-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1590159615653

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EnergyBus-PT-none"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is EnergyBus-PT-none, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r066-tajo-158922815101002"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;