fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r178-tajo-162089415200107
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for QuasiCertifProtocol-PT-28

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
902.584 162095.00 185501.00 112.60 29 29 29 1 29 1 29 1 1 1 1 1 1 1 1 1 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/mcc2021-input.r178-tajo-162089415200107.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is QuasiCertifProtocol-PT-28, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089415200107
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 333K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.0M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 71K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 419K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 27K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 118K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 35K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Mar 27 10:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 27 10:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 25 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 25 13:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.9K Mar 22 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.4M May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621236049726

Running Version 0
[2021-05-17 07:20:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 07:20:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 07:20:51] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2021-05-17 07:20:51] [INFO ] Transformed 2998 places.
[2021-05-17 07:20:51] [INFO ] Transformed 446 transitions.
[2021-05-17 07:20:51] [INFO ] Parsed PT model containing 2998 places and 446 transitions in 177 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
// Phase 1: matrix 446 rows 2998 cols
[2021-05-17 07:20:51] [INFO ] Computed 2553 place invariants in 150 ms
Incomplete random walk after 10000 steps, including 302 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 16) seen :52
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 15) seen :58
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 15) seen :47
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 15) seen :50
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 15) seen :46
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 15) seen :42
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 15) seen :44
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 15) seen :50
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 15) seen :45
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 15) seen :48
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :49
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 15) seen :48
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 15) seen :49
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 15) seen :45
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :48
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 15) seen :48
// Phase 1: matrix 446 rows 2998 cols
[2021-05-17 07:20:52] [INFO ] Computed 2553 place invariants in 103 ms
[2021-05-17 07:20:52] [INFO ] [Real]Absence check using 32 positive place invariants in 55 ms returned sat
[2021-05-17 07:20:53] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 432 ms returned sat
[2021-05-17 07:20:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:20:53] [INFO ] [Real]Absence check using state equation in 719 ms returned unsat
[2021-05-17 07:20:54] [INFO ] [Real]Absence check using 32 positive place invariants in 54 ms returned sat
[2021-05-17 07:20:54] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 601 ms returned sat
[2021-05-17 07:20:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:20:55] [INFO ] [Real]Absence check using state equation in 988 ms returned sat
[2021-05-17 07:20:56] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 39 ms.
[2021-05-17 07:21:01] [INFO ] Deduced a trap composed of 10 places in 2525 ms of which 26 ms to minimize.
[2021-05-17 07:21:01] [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 close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-17 07:21:01] [INFO ] [Real]Absence check using 32 positive place invariants in 66 ms returned sat
[2021-05-17 07:21:02] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 528 ms returned sat
[2021-05-17 07:21:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:21:05] [INFO ] [Real]Absence check using state equation in 3315 ms returned sat
[2021-05-17 07:21:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:21:06] [INFO ] [Nat]Absence check using 32 positive place invariants in 94 ms returned sat
[2021-05-17 07:21:06] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 609 ms returned sat
[2021-05-17 07:21:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:21:08] [INFO ] [Nat]Absence check using state equation in 1551 ms returned sat
[2021-05-17 07:21:08] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 45 ms.
[2021-05-17 07:21:09] [INFO ] Added : 40 causal constraints over 8 iterations in 1054 ms. Result :sat
Minimization took 591 ms.
[2021-05-17 07:21:10] [INFO ] [Real]Absence check using 32 positive place invariants in 64 ms returned sat
[2021-05-17 07:21:11] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 516 ms returned sat
[2021-05-17 07:21:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:21:12] [INFO ] [Real]Absence check using state equation in 1232 ms returned sat
[2021-05-17 07:21:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:21:12] [INFO ] [Nat]Absence check using 32 positive place invariants in 61 ms returned sat
[2021-05-17 07:21:13] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 577 ms returned sat
[2021-05-17 07:21:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:21:14] [INFO ] [Nat]Absence check using state equation in 1230 ms returned sat
[2021-05-17 07:21:14] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 41 ms.
[2021-05-17 07:21:16] [INFO ] Added : 64 causal constraints over 13 iterations in 1663 ms. Result :sat
Minimization took 292 ms.
[2021-05-17 07:21:17] [INFO ] [Real]Absence check using 32 positive place invariants in 69 ms returned sat
[2021-05-17 07:21:17] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 567 ms returned sat
[2021-05-17 07:21:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:21:19] [INFO ] [Real]Absence check using state equation in 1133 ms returned unsat
[2021-05-17 07:21:19] [INFO ] [Real]Absence check using 32 positive place invariants in 59 ms returned sat
[2021-05-17 07:21:20] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 722 ms returned sat
[2021-05-17 07:21:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:21:21] [INFO ] [Real]Absence check using state equation in 1050 ms returned sat
[2021-05-17 07:21:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:21:21] [INFO ] [Nat]Absence check using 32 positive place invariants in 45 ms returned sat
[2021-05-17 07:21:22] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 459 ms returned sat
[2021-05-17 07:21:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:21:23] [INFO ] [Nat]Absence check using state equation in 1197 ms returned sat
[2021-05-17 07:21:23] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 36 ms.
[2021-05-17 07:21:24] [INFO ] Added : 34 causal constraints over 7 iterations in 883 ms. Result :sat
Minimization took 280 ms.
[2021-05-17 07:21:25] [INFO ] [Real]Absence check using 32 positive place invariants in 66 ms returned sat
[2021-05-17 07:21:25] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 561 ms returned sat
[2021-05-17 07:21:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:21:28] [INFO ] [Real]Absence check using state equation in 3171 ms returned sat
[2021-05-17 07:21:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:21:29] [INFO ] [Nat]Absence check using 32 positive place invariants in 42 ms returned sat
[2021-05-17 07:21:29] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 620 ms returned sat
[2021-05-17 07:21:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:21:31] [INFO ] [Nat]Absence check using state equation in 1768 ms returned sat
[2021-05-17 07:21:31] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 48 ms.
[2021-05-17 07:21:33] [INFO ] Added : 63 causal constraints over 13 iterations in 1747 ms. Result :sat
Minimization took 364 ms.
[2021-05-17 07:21:34] [INFO ] [Real]Absence check using 32 positive place invariants in 44 ms returned sat
[2021-05-17 07:21:34] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 475 ms returned sat
[2021-05-17 07:21:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:21:35] [INFO ] [Real]Absence check using state equation in 826 ms returned sat
[2021-05-17 07:21:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:21:36] [INFO ] [Nat]Absence check using 32 positive place invariants in 62 ms returned sat
[2021-05-17 07:21:36] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 578 ms returned sat
[2021-05-17 07:21:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:21:37] [INFO ] [Nat]Absence check using state equation in 911 ms returned sat
[2021-05-17 07:21:37] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 38 ms.
[2021-05-17 07:21:43] [INFO ] Deduced a trap composed of 10 places in 2575 ms of which 6 ms to minimize.
[2021-05-17 07:21:43] [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 close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-17 07:21:43] [INFO ] [Real]Absence check using 32 positive place invariants in 45 ms returned sat
[2021-05-17 07:21:44] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 652 ms returned sat
[2021-05-17 07:21:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:21:48] [INFO ] [Real]Absence check using state equation in 3678 ms returned sat
[2021-05-17 07:21:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:21:48] [INFO ] [Nat]Absence check using 32 positive place invariants in 65 ms returned sat
[2021-05-17 07:21:49] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 609 ms returned sat
[2021-05-17 07:21:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:21:53] [INFO ] [Nat]Absence check using state equation in 3930 ms returned unknown
[2021-05-17 07:21:53] [INFO ] [Real]Absence check using 32 positive place invariants in 62 ms returned sat
[2021-05-17 07:21:54] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 547 ms returned sat
[2021-05-17 07:21:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:21:55] [INFO ] [Real]Absence check using state equation in 1060 ms returned sat
[2021-05-17 07:21:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:21:55] [INFO ] [Nat]Absence check using 32 positive place invariants in 66 ms returned sat
[2021-05-17 07:21:56] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 576 ms returned sat
[2021-05-17 07:21:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:21:57] [INFO ] [Nat]Absence check using state equation in 1121 ms returned sat
[2021-05-17 07:21:57] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 34 ms.
[2021-05-17 07:22:00] [INFO ] Added : 120 causal constraints over 24 iterations in 2890 ms. Result :unknown
[2021-05-17 07:22:00] [INFO ] [Real]Absence check using 32 positive place invariants in 63 ms returned sat
[2021-05-17 07:22:01] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 695 ms returned sat
[2021-05-17 07:22:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:22:02] [INFO ] [Real]Absence check using state equation in 812 ms returned sat
[2021-05-17 07:22:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:22:02] [INFO ] [Nat]Absence check using 32 positive place invariants in 42 ms returned sat
[2021-05-17 07:22:02] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 410 ms returned sat
[2021-05-17 07:22:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:22:03] [INFO ] [Nat]Absence check using state equation in 745 ms returned sat
[2021-05-17 07:22:03] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 42 ms.
[2021-05-17 07:22:07] [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: Broken pipe ... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-17 07:22:07] [INFO ] [Real]Absence check using 32 positive place invariants in 103 ms returned sat
[2021-05-17 07:22:08] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 716 ms returned sat
[2021-05-17 07:22:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:22:09] [INFO ] [Real]Absence check using state equation in 1092 ms returned sat
[2021-05-17 07:22:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:22:09] [INFO ] [Nat]Absence check using 32 positive place invariants in 46 ms returned sat
[2021-05-17 07:22:10] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 419 ms returned sat
[2021-05-17 07:22:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:22:14] [INFO ] [Nat]Absence check using state equation in 4325 ms returned unknown
[2021-05-17 07:22:15] [INFO ] [Real]Absence check using 32 positive place invariants in 62 ms returned sat
[2021-05-17 07:22:15] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 555 ms returned sat
[2021-05-17 07:22:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:22:16] [INFO ] [Real]Absence check using state equation in 1001 ms returned sat
[2021-05-17 07:22:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:22:16] [INFO ] [Nat]Absence check using 32 positive place invariants in 41 ms returned sat
[2021-05-17 07:22:17] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 406 ms returned sat
[2021-05-17 07:22:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:22:18] [INFO ] [Nat]Absence check using state equation in 807 ms returned sat
[2021-05-17 07:22:18] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 35 ms.
[2021-05-17 07:22:20] [INFO ] Added : 121 causal constraints over 25 iterations in 1798 ms. Result :sat
Minimization took 178 ms.
[2021-05-17 07:22:20] [INFO ] [Real]Absence check using 32 positive place invariants in 67 ms returned sat
[2021-05-17 07:22:21] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 586 ms returned sat
[2021-05-17 07:22:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:22:22] [INFO ] [Real]Absence check using state equation in 1006 ms returned sat
[2021-05-17 07:22:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:22:22] [INFO ] [Nat]Absence check using 32 positive place invariants in 42 ms returned sat
[2021-05-17 07:22:23] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 470 ms returned sat
[2021-05-17 07:22:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:22:23] [INFO ] [Nat]Absence check using state equation in 762 ms returned sat
[2021-05-17 07:22:24] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 28 ms.
[2021-05-17 07:22:26] [INFO ] Added : 121 causal constraints over 25 iterations in 2549 ms. Result :sat
Minimization took 266 ms.
[2021-05-17 07:22:27] [INFO ] [Real]Absence check using 32 positive place invariants in 62 ms returned sat
[2021-05-17 07:22:27] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 589 ms returned sat
[2021-05-17 07:22:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:22:28] [INFO ] [Real]Absence check using state equation in 1005 ms returned sat
[2021-05-17 07:22:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:22:29] [INFO ] [Nat]Absence check using 32 positive place invariants in 43 ms returned sat
[2021-05-17 07:22:29] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 436 ms returned sat
[2021-05-17 07:22:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:22:32] [INFO ] [Nat]Absence check using state equation in 2516 ms returned sat
[2021-05-17 07:22:32] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 85 ms.
[2021-05-17 07:22:36] [INFO ] Deduced a trap composed of 10 places in 2456 ms of which 13 ms to minimize.
[2021-05-17 07:22:36] [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 close... while checking expression at index 14
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [29, 841, -1, 1, 29, 1, -1, -1, -1, -1, -1, -1, 29, 29, -1] Max seen :[29, 0, 0, 0, 29, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-04 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-00 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 17200 steps, including 143 resets, run finished after 267 ms. (steps per millisecond=64 ) properties (out of 13) seen :78 could not realise parikh vector
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 17200 steps, including 169 resets, run finished after 172 ms. (steps per millisecond=100 ) properties (out of 11) seen :76 could not realise parikh vector
Incomplete Parikh walk after 18700 steps, including 174 resets, run finished after 197 ms. (steps per millisecond=94 ) properties (out of 11) seen :77 could not realise parikh vector
Incomplete Parikh walk after 3600 steps, including 96 resets, run finished after 17 ms. (steps per millisecond=211 ) properties (out of 11) seen :0 could not realise parikh vector
Incomplete Parikh walk after 6600 steps, including 100 resets, run finished after 31 ms. (steps per millisecond=212 ) properties (out of 11) seen :58 could not realise parikh vector
Incomplete Parikh walk after 4100 steps, including 96 resets, run finished after 20 ms. (steps per millisecond=205 ) properties (out of 11) seen :30 could not realise parikh vector
Support contains 95 out of 2998 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2154 are kept as prefixes of interest. Removing 844 places using SCC suffix rule.22 ms
Discarding 844 places :
Also discarding 54 output transitions
Drop transitions removed 54 transitions
Drop transitions removed 181 transitions
Reduce isomorphic transitions removed 181 transitions.
Discarding 58 places :
Implicit places reduction removed 58 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 2096 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 242 place count 2095 transition count 210
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 242 place count 2095 transition count 153
Deduced a syphon composed of 57 places in 1 ms
Ensure Unique test removed 57 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 171 rules applied. Total rules applied 413 place count 1981 transition count 153
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 413 place count 1981 transition count 152
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 416 place count 1979 transition count 152
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Ensure Unique test removed 724 places
Reduce places removed 778 places and 0 transitions.
Iterating global reduction 2 with 832 rules applied. Total rules applied 1248 place count 1201 transition count 98
Applied a total of 1248 rules in 551 ms. Remains 1201 /2998 variables (removed 1797) and now considering 98/446 (removed 348) transitions.
Finished structural reductions, in 1 iterations. Remains : 1201/2998 places, 98/446 transitions.
// Phase 1: matrix 98 rows 1201 cols
[2021-05-17 07:22:37] [INFO ] Computed 1103 place invariants in 31 ms
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 1000000 steps, including 10101 resets, run finished after 16061 ms. (steps per millisecond=62 ) properties (out of 8) seen :92
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-01 29 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 642311 steps, including 439 resets, run timeout after 5001 ms. (steps per millisecond=128 ) properties seen :{0=29, 1=29, 2=1, 3=1, 4=1, 5=1, 6=1}
Interrupted Best-First random walk after 786635 steps, including 538 resets, run timeout after 5001 ms. (steps per millisecond=157 ) properties seen :{0=29, 1=29, 2=1, 3=1, 4=1, 5=1, 6=1}
Interrupted Best-First random walk after 806601 steps, including 557 resets, run timeout after 5001 ms. (steps per millisecond=161 ) properties seen :{0=29, 1=29, 2=1, 3=1, 4=1, 5=1, 6=1}
Interrupted Best-First random walk after 832144 steps, including 550 resets, run timeout after 5001 ms. (steps per millisecond=166 ) properties seen :{0=29, 1=29, 2=1, 3=1, 4=1, 5=1, 6=1}
Interrupted Best-First random walk after 875547 steps, including 605 resets, run timeout after 5001 ms. (steps per millisecond=175 ) properties seen :{0=29, 1=29, 2=1, 3=1, 4=1, 5=1, 6=1}
Interrupted Best-First random walk after 857221 steps, including 587 resets, run timeout after 5001 ms. (steps per millisecond=171 ) properties seen :{0=29, 1=29, 2=1, 3=1, 4=1, 5=1, 6=1}
Interrupted Best-First random walk after 905788 steps, including 620 resets, run timeout after 5001 ms. (steps per millisecond=181 ) properties seen :{0=29, 1=29, 2=1, 3=1, 4=1, 5=1, 6=1}
// Phase 1: matrix 98 rows 1201 cols
[2021-05-17 07:23:28] [INFO ] Computed 1103 place invariants in 12 ms
[2021-05-17 07:23:29] [INFO ] [Real]Absence check using 272 positive place invariants in 64 ms returned sat
[2021-05-17 07:23:29] [INFO ] [Real]Absence check using 272 positive and 831 generalized place invariants in 174 ms returned unsat
[2021-05-17 07:23:29] [INFO ] [Real]Absence check using 272 positive place invariants in 47 ms returned sat
[2021-05-17 07:23:29] [INFO ] [Real]Absence check using 272 positive and 831 generalized place invariants in 147 ms returned unsat
[2021-05-17 07:23:29] [INFO ] [Real]Absence check using 272 positive place invariants in 56 ms returned sat
[2021-05-17 07:23:29] [INFO ] [Real]Absence check using 272 positive and 831 generalized place invariants in 106 ms returned unsat
[2021-05-17 07:23:30] [INFO ] [Real]Absence check using 272 positive place invariants in 87 ms returned sat
[2021-05-17 07:23:30] [INFO ] [Real]Absence check using 272 positive and 831 generalized place invariants in 110 ms returned sat
[2021-05-17 07:23:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:23:30] [INFO ] [Real]Absence check using state equation in 178 ms returned unsat
[2021-05-17 07:23:30] [INFO ] [Real]Absence check using 272 positive place invariants in 56 ms returned sat
[2021-05-17 07:23:30] [INFO ] [Real]Absence check using 272 positive and 831 generalized place invariants in 152 ms returned unsat
[2021-05-17 07:23:30] [INFO ] [Real]Absence check using 272 positive place invariants in 40 ms returned sat
[2021-05-17 07:23:31] [INFO ] [Real]Absence check using 272 positive and 831 generalized place invariants in 108 ms returned sat
[2021-05-17 07:23:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:23:31] [INFO ] [Real]Absence check using state equation in 59 ms returned unsat
[2021-05-17 07:23:31] [INFO ] [Real]Absence check using 272 positive place invariants in 58 ms returned sat
[2021-05-17 07:23:31] [INFO ] [Real]Absence check using 272 positive and 831 generalized place invariants in 158 ms returned sat
[2021-05-17 07:23:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:23:31] [INFO ] [Real]Absence check using state equation in 88 ms returned unsat
Current structural bounds on expressions (after SMT) : [29, 29, 1, 1, 1, 1, 1] Max seen :[29, 29, 1, 1, 1, 1, 1]
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-06 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-02 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621236211821

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-28"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-PT-28, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-162089415200107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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