About the Execution of ITS-Tools for FamilyReunion-PT-L00020M0002C001P001G001
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
528.195 | 95882.00 | 125219.00 | 467.10 | 21 21 21 21 21 21 2 21 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 '/data/fkordon/mcc2024-input.r158-smll-171636267000493.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is FamilyReunion-PT-L00020M0002C001P001G001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-smll-171636267000493
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.2M
-rw-r--r-- 1 mcc users 33K Apr 11 20:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 233K Apr 11 20:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 50K Apr 11 20:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 195K Apr 11 20:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 22K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 28K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 64K Apr 11 20:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 436K Apr 11 20:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 149K Apr 11 20:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 568K Apr 11 20:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 24 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.3M May 18 16:42 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 FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-00
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-01
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-02
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-03
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-04
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-05
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-06
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-07
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-08
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-09
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-10
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-11
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-12
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-13
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-14
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716688747659
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00020M0002C001P001G001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-26 01:59:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 01:59:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 01:59:10] [INFO ] Load time of PNML (sax parser for PT used): 517 ms
[2024-05-26 01:59:10] [INFO ] Transformed 3271 places.
[2024-05-26 01:59:11] [INFO ] Transformed 2753 transitions.
[2024-05-26 01:59:11] [INFO ] Parsed PT model containing 3271 places and 2753 transitions and 8446 arcs in 859 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
Reduce places removed 11 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 2753 rows 3260 cols
[2024-05-26 01:59:11] [INFO ] Computed 748 invariants in 379 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[12876, 722, 4292, 361, 361, 722, 65605, 1023, 1, 1, 2, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (8 resets) in 218 ms. (45 steps per ms)
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100010 steps (20 resets) in 247 ms. (403 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 5, 7, 3, 5, 7, 2, 12, 1, 0] Max Struct:[12876, 722, 4292, 361, 361, 722, 65605, 1023, 2, 1]
[2024-05-26 01:59:12] [INFO ] Invariant cache hit.
[2024-05-26 01:59:13] [INFO ] [Real]Absence check using 61 positive place invariants in 97 ms returned sat
[2024-05-26 01:59:13] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 298 ms returned sat
[2024-05-26 01:59:16] [INFO ] [Real]Absence check using state equation in 2765 ms returned sat
[2024-05-26 01:59:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:954)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-26 01:59:18] [INFO ] [Real]Absence check using 61 positive place invariants in 100 ms returned sat
[2024-05-26 01:59:18] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 435 ms returned sat
[2024-05-26 01:59:21] [INFO ] [Real]Absence check using state equation in 2829 ms returned sat
[2024-05-26 01:59:22] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 422 ms.
[2024-05-26 01:59:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 01:59:23] [INFO ] [Nat]Absence check using 61 positive place invariants in 90 ms returned sat
[2024-05-26 01:59:23] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 250 ms returned sat
[2024-05-26 01:59:26] [INFO ] [Nat]Absence check using state equation in 2893 ms returned sat
[2024-05-26 01:59:27] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 379 ms.
[2024-05-26 01:59:27] [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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-26 01:59:28] [INFO ] [Real]Absence check using 61 positive place invariants in 98 ms returned sat
[2024-05-26 01:59:28] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 309 ms returned sat
[2024-05-26 01:59:30] [INFO ] [Real]Absence check using state equation in 2107 ms returned sat
[2024-05-26 01:59:31] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 321 ms.
[2024-05-26 01:59:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 01:59:33] [INFO ] [Nat]Absence check using 61 positive place invariants in 90 ms returned sat
[2024-05-26 01:59:33] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 306 ms returned sat
[2024-05-26 01:59:36] [INFO ] [Nat]Absence check using state equation in 2490 ms returned sat
[2024-05-26 01:59:36] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 333 ms.
[2024-05-26 01:59:37] [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 2
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-26 01:59:38] [INFO ] [Real]Absence check using 61 positive place invariants in 84 ms returned sat
[2024-05-26 01:59:38] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 284 ms returned sat
[2024-05-26 01:59:40] [INFO ] [Real]Absence check using state equation in 2039 ms returned sat
[2024-05-26 01:59:41] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 186 ms.
[2024-05-26 01:59:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 01:59:43] [INFO ] [Nat]Absence check using 61 positive place invariants in 83 ms returned sat
[2024-05-26 01:59:43] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 276 ms returned sat
[2024-05-26 01:59:46] [INFO ] [Nat]Absence check using state equation in 2570 ms returned sat
[2024-05-26 01:59:46] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 297 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2024-05-26 01:59:48] [INFO ] [Real]Absence check using 61 positive place invariants in 110 ms returned sat
[2024-05-26 01:59:48] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 266 ms returned sat
[2024-05-26 01:59:50] [INFO ] [Real]Absence check using state equation in 2435 ms returned sat
[2024-05-26 01:59:51] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 317 ms.
[2024-05-26 01:59:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 01:59:53] [INFO ] [Nat]Absence check using 61 positive place invariants in 129 ms returned sat
[2024-05-26 01:59:53] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 380 ms returned sat
[2024-05-26 01:59:55] [INFO ] [Nat]Absence check using state equation in 2155 ms returned sat
[2024-05-26 01:59:56] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 327 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-26 01:59:58] [INFO ] [Real]Absence check using 61 positive place invariants in 136 ms returned sat
[2024-05-26 01:59:58] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 408 ms returned sat
[2024-05-26 02:00:00] [INFO ] [Real]Absence check using state equation in 1922 ms returned sat
[2024-05-26 02:00:01] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 286 ms.
[2024-05-26 02:00:02] [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 5
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-26 02:00:03] [INFO ] [Real]Absence check using 61 positive place invariants in 123 ms returned sat
[2024-05-26 02:00:03] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 443 ms returned unsat
[2024-05-26 02:00:04] [INFO ] [Real]Absence check using 61 positive place invariants in 82 ms returned sat
[2024-05-26 02:00:05] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 292 ms returned sat
[2024-05-26 02:00:07] [INFO ] [Real]Absence check using state equation in 2091 ms returned sat
[2024-05-26 02:00:07] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 275 ms.
[2024-05-26 02:00:09] [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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-26 02:00:09] [INFO ] [Real]Absence check using 61 positive place invariants in 81 ms returned sat
[2024-05-26 02:00:10] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 267 ms returned unsat
[2024-05-26 02:00:10] [INFO ] [Real]Absence check using 61 positive place invariants in 87 ms returned sat
[2024-05-26 02:00:11] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 315 ms returned sat
[2024-05-26 02:00:13] [INFO ] [Real]Absence check using state equation in 2026 ms returned sat
[2024-05-26 02:00:13] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 270 ms.
[2024-05-26 02:00:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 02:00:16] [INFO ] [Nat]Absence check using 61 positive place invariants in 135 ms returned sat
[2024-05-26 02:00:16] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 335 ms returned sat
[2024-05-26 02:00:18] [INFO ] [Nat]Absence check using state equation in 2582 ms returned sat
[2024-05-26 02:00:19] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 299 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 5, 7, 3, 5, 7, 2, 12, 1, 0] Max Struct:[12876, 722, 4292, 361, 361, 722, 2, 1023, 1, 1]
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 5, 7, 3, 5, 7, 12, 0] Max Struct:[12876, 722, 4292, 361, 361, 722, 1023, 1]
Support contains 193 out of 3260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3260/3260 places, 2753/2753 transitions.
Graph (complete) has 4960 edges and 3260 vertex of which 2894 are kept as prefixes of interest. Removing 366 places using SCC suffix rule.17 ms
Discarding 366 places :
Also discarding 289 output transitions
Drop transitions (Output transitions of discarded places.) removed 289 transitions
Drop transitions (Empty/Sink Transition effects.) removed 41 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 42 transitions.
Discarding 378 places :
Implicit places reduction removed 378 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 988 transitions
Trivial Post-agglo rules discarded 988 transitions
Performed 988 trivial Post agglomeration. Transition count delta: 988
Iterating post reduction 0 with 1408 rules applied. Total rules applied 1409 place count 2516 transition count 1434
Reduce places removed 988 places and 0 transitions.
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Iterating post reduction 1 with 1114 rules applied. Total rules applied 2523 place count 1528 transition count 1308
Reduce places removed 126 places and 0 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 2649 place count 1402 transition count 1308
Performed 168 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 168 Pre rules applied. Total rules applied 2649 place count 1402 transition count 1140
Deduced a syphon composed of 168 places in 4 ms
Ensure Unique test removed 84 places
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 3 with 420 rules applied. Total rules applied 3069 place count 1150 transition count 1140
Discarding 21 places :
Implicit places reduction removed 21 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 3 with 63 rules applied. Total rules applied 3132 place count 1129 transition count 1098
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 3174 place count 1087 transition count 1098
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 3174 place count 1087 transition count 1077
Deduced a syphon composed of 21 places in 4 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 3216 place count 1066 transition count 1077
Discarding 146 places :
Symmetric choice reduction at 5 with 146 rule applications. Total rules 3362 place count 920 transition count 931
Iterating global reduction 5 with 146 rules applied. Total rules applied 3508 place count 920 transition count 931
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 5 with 126 rules applied. Total rules applied 3634 place count 878 transition count 847
Reduce places removed 63 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 6 with 84 rules applied. Total rules applied 3718 place count 815 transition count 826
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 3739 place count 794 transition count 826
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 64 Pre rules applied. Total rules applied 3739 place count 794 transition count 762
Deduced a syphon composed of 64 places in 3 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 8 with 128 rules applied. Total rules applied 3867 place count 730 transition count 762
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3868 place count 729 transition count 741
Iterating global reduction 8 with 1 rules applied. Total rules applied 3869 place count 729 transition count 741
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 8 with 84 rules applied. Total rules applied 3953 place count 687 transition count 699
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 3974 place count 666 transition count 699
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 4 ms
Ensure Unique test removed 21 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 10 with 107 rules applied. Total rules applied 4081 place count 602 transition count 656
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 10 with 42 rules applied. Total rules applied 4123 place count 581 transition count 635
Free-agglomeration rule (complex) applied 105 times.
Iterating global reduction 10 with 105 rules applied. Total rules applied 4228 place count 581 transition count 530
Ensure Unique test removed 21 places
Reduce places removed 126 places and 0 transitions.
Iterating post reduction 10 with 126 rules applied. Total rules applied 4354 place count 455 transition count 530
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 4356 place count 455 transition count 530
Applied a total of 4356 rules in 876 ms. Remains 455 /3260 variables (removed 2805) and now considering 530/2753 (removed 2223) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 901 ms. Remains : 455/3260 places, 530/2753 transitions.
// Phase 1: matrix 530 rows 455 cols
[2024-05-26 02:00:21] [INFO ] Computed 48 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6, 5, 7, 3, 5, 7, 12, 0] Max Struct:[12876, 722, 4292, 361, 361, 722, 1023, 1]
RANDOM walk for 1000000 steps (3355 resets) in 8494 ms. (117 steps per ms)
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 7000006 steps (1082 resets) in 11071 ms. (632 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[21, 21, 21, 21, 21, 21, 21] Max Struct:[12876, 722, 4292, 361, 361, 722, 1023]
[2024-05-26 02:00:40] [INFO ] Invariant cache hit.
[2024-05-26 02:00:40] [INFO ] [Real]Absence check using 0 positive and 48 generalized place invariants in 22 ms returned sat
[2024-05-26 02:00:40] [INFO ] [Real]Absence check using state equation in 138 ms returned unsat
[2024-05-26 02:00:41] [INFO ] [Real]Absence check using 0 positive and 48 generalized place invariants in 22 ms returned sat
[2024-05-26 02:00:41] [INFO ] [Real]Absence check using state equation in 142 ms returned unsat
[2024-05-26 02:00:41] [INFO ] [Real]Absence check using 0 positive and 48 generalized place invariants in 23 ms returned sat
[2024-05-26 02:00:41] [INFO ] [Real]Absence check using state equation in 135 ms returned unsat
[2024-05-26 02:00:41] [INFO ] [Real]Absence check using 0 positive and 48 generalized place invariants in 33 ms returned sat
[2024-05-26 02:00:41] [INFO ] [Real]Absence check using state equation in 201 ms returned unsat
[2024-05-26 02:00:41] [INFO ] [Real]Absence check using 0 positive and 48 generalized place invariants in 38 ms returned sat
[2024-05-26 02:00:42] [INFO ] [Real]Absence check using state equation in 218 ms returned unsat
[2024-05-26 02:00:42] [INFO ] [Real]Absence check using 0 positive and 48 generalized place invariants in 22 ms returned sat
[2024-05-26 02:00:42] [INFO ] [Real]Absence check using state equation in 135 ms returned unsat
[2024-05-26 02:00:42] [INFO ] [Real]Absence check using 0 positive and 48 generalized place invariants in 23 ms returned sat
[2024-05-26 02:00:42] [INFO ] [Real]Absence check using state equation in 157 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[21, 21, 21, 21, 21, 21, 21] Max Struct:[21, 21, 21, 21, 21, 21, 21]
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-07 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-05 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-04 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-03 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-02 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-01 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-00 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 7 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-26 02:00:43] [INFO ] Flatten gal took : 176 ms
[2024-05-26 02:00:43] [INFO ] Flatten gal took : 71 ms
[2024-05-26 02:00:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3999488166528120987.gal : 42 ms
[2024-05-26 02:00:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3202713274856815377.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3999488166528120987.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3202713274856815377.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 93282 ms.
BK_STOP 1716688843541
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="FamilyReunion-PT-L00020M0002C001P001G001"
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-5568"
echo " Executing tool itstools"
echo " Input is FamilyReunion-PT-L00020M0002C001P001G001, 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 r158-smll-171636267000493"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-PT-L00020M0002C001P001G001.tgz
mv FamilyReunion-PT-L00020M0002C001P001G001 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 '
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 ;