Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r064-tall-162038397700795.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Dekker-PT-200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-tall-162038397700795
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 25M
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 136K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 95K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K Apr 26 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 26 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 26 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 26 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 10:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 10:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 22 17:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 17:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 25M 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 Dekker-PT-200-UpperBounds-00
FORMULA_NAME Dekker-PT-200-UpperBounds-01
FORMULA_NAME Dekker-PT-200-UpperBounds-02
FORMULA_NAME Dekker-PT-200-UpperBounds-03
FORMULA_NAME Dekker-PT-200-UpperBounds-04
FORMULA_NAME Dekker-PT-200-UpperBounds-05
FORMULA_NAME Dekker-PT-200-UpperBounds-06
FORMULA_NAME Dekker-PT-200-UpperBounds-07
FORMULA_NAME Dekker-PT-200-UpperBounds-08
FORMULA_NAME Dekker-PT-200-UpperBounds-09
FORMULA_NAME Dekker-PT-200-UpperBounds-10
FORMULA_NAME Dekker-PT-200-UpperBounds-11
FORMULA_NAME Dekker-PT-200-UpperBounds-12
FORMULA_NAME Dekker-PT-200-UpperBounds-13
FORMULA_NAME Dekker-PT-200-UpperBounds-14
FORMULA_NAME Dekker-PT-200-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620571670675

Running Version 0
[2021-05-09 14:47:52] [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-09 14:47:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 14:47:53] [INFO ] Load time of PNML (sax parser for PT used): 1194 ms
[2021-05-09 14:47:53] [INFO ] Transformed 1000 places.
[2021-05-09 14:47:53] [INFO ] Transformed 40400 transitions.
[2021-05-09 14:47:53] [INFO ] Found NUPN structural information;
[2021-05-09 14:47:53] [INFO ] Parsed PT model containing 1000 places and 40400 transitions in 1408 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
FORMULA Dekker-PT-200-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 800 out of 40400 initially.
// Phase 1: matrix 800 rows 1000 cols
[2021-05-09 14:47:54] [INFO ] Computed 600 place invariants in 98 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 737 ms. (steps per millisecond=13 ) properties (out of 9) seen :7
FORMULA Dekker-PT-200-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-200-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-200-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-200-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-200-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-200-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-200-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
[2021-05-09 14:47:55] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 1000 cols
[2021-05-09 14:47:55] [INFO ] Computed 600 place invariants in 30 ms
[2021-05-09 14:47:55] [INFO ] [Real]Absence check using 400 positive place invariants in 75 ms returned sat
[2021-05-09 14:47:55] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 35 ms returned sat
[2021-05-09 14:47:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:47:55] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2021-05-09 14:47:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:47:56] [INFO ] [Nat]Absence check using 400 positive place invariants in 70 ms returned sat
[2021-05-09 14:47:56] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 30 ms returned sat
[2021-05-09 14:47:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:47:56] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2021-05-09 14:47:56] [INFO ] State equation strengthened by 200 read => feed constraints.
[2021-05-09 14:47:56] [INFO ] [Nat]Added 200 Read/Feed constraints in 126 ms returned sat
[2021-05-09 14:48:00] [INFO ] Deduced a trap composed of 4 places in 3289 ms of which 1890 ms to minimize.
[2021-05-09 14:48:01] [INFO ] Deduced a trap composed of 4 places in 1235 ms of which 1 ms to minimize.
[2021-05-09 14:48: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 0
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.verifyPossible(DeadlockTester.java:588)
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-09 14:48:01] [INFO ] [Real]Absence check using 400 positive place invariants in 74 ms returned sat
[2021-05-09 14:48:01] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 29 ms returned sat
[2021-05-09 14:48:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:48:01] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2021-05-09 14:48:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:48:02] [INFO ] [Nat]Absence check using 400 positive place invariants in 69 ms returned sat
[2021-05-09 14:48:02] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 30 ms returned sat
[2021-05-09 14:48:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:48:02] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2021-05-09 14:48:02] [INFO ] [Nat]Added 200 Read/Feed constraints in 110 ms returned sat
[2021-05-09 14:48:03] [INFO ] Deduced a trap composed of 4 places in 1279 ms of which 0 ms to minimize.
[2021-05-09 14:48:05] [INFO ] Deduced a trap composed of 6 places in 1117 ms of which 1 ms to minimize.
[2021-05-09 14:48:06] [INFO ] Deduced a trap composed of 4 places in 1080 ms of which 1 ms to minimize.
[2021-05-09 14:48:07] [INFO ] Deduced a trap composed of 4 places in 1267 ms of which 1 ms to minimize.
[2021-05-09 14:48: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: 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.verifyPossible(DeadlockTester.java:588)
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) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 1578 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 40400/40400 transitions.
Normalized transition count is 800 out of 40400 initially.
// Phase 1: matrix 800 rows 1000 cols
[2021-05-09 14:48:09] [INFO ] Computed 600 place invariants in 62 ms
Interrupted random walk after 471550 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen :{}
Interrupted Best-First random walk after 823499 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=164 ) properties seen :{}
Interrupted Best-First random walk after 824303 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=164 ) properties seen :{}
[2021-05-09 14:48:57] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 1000 cols
[2021-05-09 14:48:57] [INFO ] Computed 600 place invariants in 11 ms
[2021-05-09 14:48:57] [INFO ] [Real]Absence check using 400 positive place invariants in 67 ms returned sat
[2021-05-09 14:48:57] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 31 ms returned sat
[2021-05-09 14:48:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:48:58] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2021-05-09 14:48:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:48:58] [INFO ] [Nat]Absence check using 400 positive place invariants in 85 ms returned sat
[2021-05-09 14:48:58] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 28 ms returned sat
[2021-05-09 14:48:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:48:58] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2021-05-09 14:48:59] [INFO ] State equation strengthened by 200 read => feed constraints.
[2021-05-09 14:48:59] [INFO ] [Nat]Added 200 Read/Feed constraints in 119 ms returned sat
[2021-05-09 14:49:00] [INFO ] Deduced a trap composed of 4 places in 1235 ms of which 1 ms to minimize.
[2021-05-09 14:49:01] [INFO ] Deduced a trap composed of 4 places in 1047 ms of which 1 ms to minimize.
[2021-05-09 14:49:02] [INFO ] Deduced a trap composed of 4 places in 1041 ms of which 1 ms to minimize.
[2021-05-09 14:49:03] [INFO ] Deduced a trap composed of 4 places in 1147 ms of which 1 ms to minimize.
[2021-05-09 14:49:05] [INFO ] Deduced a trap composed of 4 places in 1225 ms of which 1 ms to minimize.
[2021-05-09 14:49:06] [INFO ] Deduced a trap composed of 4 places in 1052 ms of which 1 ms to minimize.
[2021-05-09 14:49:07] [INFO ] Deduced a trap composed of 4 places in 1089 ms of which 0 ms to minimize.
[2021-05-09 14:49:08] [INFO ] Deduced a trap composed of 4 places in 1033 ms of which 0 ms to minimize.
[2021-05-09 14:49:09] [INFO ] Deduced a trap composed of 4 places in 1132 ms of which 0 ms to minimize.
[2021-05-09 14:49:10] [INFO ] Deduced a trap composed of 4 places in 1173 ms of which 0 ms to minimize.
[2021-05-09 14:49:11] [INFO ] Deduced a trap composed of 4 places in 991 ms of which 0 ms to minimize.
[2021-05-09 14:49:12] [INFO ] Deduced a trap composed of 4 places in 996 ms of which 0 ms to minimize.
[2021-05-09 14:49:13] [INFO ] Deduced a trap composed of 4 places in 1134 ms of which 0 ms to minimize.
[2021-05-09 14:49:15] [INFO ] Deduced a trap composed of 4 places in 1126 ms of which 0 ms to minimize.
[2021-05-09 14:49:16] [INFO ] Deduced a trap composed of 4 places in 948 ms of which 1 ms to minimize.
[2021-05-09 14:49:17] [INFO ] Deduced a trap composed of 4 places in 943 ms of which 0 ms to minimize.
[2021-05-09 14:49:18] [INFO ] Deduced a trap composed of 4 places in 1050 ms of which 1 ms to minimize.
[2021-05-09 14:49:19] [INFO ] Deduced a trap composed of 4 places in 1038 ms of which 0 ms to minimize.
[2021-05-09 14:49:20] [INFO ] Deduced a trap composed of 4 places in 973 ms of which 0 ms to minimize.
[2021-05-09 14:49:21] [INFO ] Deduced a trap composed of 4 places in 1075 ms of which 0 ms to minimize.
[2021-05-09 14:49:22] [INFO ] Deduced a trap composed of 4 places in 1027 ms of which 0 ms to minimize.
[2021-05-09 14:49:23] [INFO ] Deduced a trap composed of 6 places in 994 ms of which 0 ms to minimize.
[2021-05-09 14:49:24] [INFO ] Deduced a trap composed of 4 places in 983 ms of which 0 ms to minimize.
[2021-05-09 14:49:25] [INFO ] Deduced a trap composed of 6 places in 969 ms of which 1 ms to minimize.
[2021-05-09 14:49:26] [INFO ] Deduced a trap composed of 6 places in 982 ms of which 0 ms to minimize.
[2021-05-09 14:49:27] [INFO ] Deduced a trap composed of 4 places in 843 ms of which 0 ms to minimize.
[2021-05-09 14:49:28] [INFO ] Deduced a trap composed of 4 places in 916 ms of which 1 ms to minimize.
[2021-05-09 14:49:29] [INFO ] Deduced a trap composed of 5 places in 946 ms of which 1 ms to minimize.
[2021-05-09 14:49:30] [INFO ] Deduced a trap composed of 5 places in 952 ms of which 4 ms to minimize.
[2021-05-09 14:49:31] [INFO ] Deduced a trap composed of 4 places in 930 ms of which 1 ms to minimize.
[2021-05-09 14:49:32] [INFO ] Deduced a trap composed of 4 places in 908 ms of which 0 ms to minimize.
[2021-05-09 14:49:33] [INFO ] Deduced a trap composed of 4 places in 892 ms of which 1 ms to minimize.
[2021-05-09 14:49:33] [INFO ] Deduced a trap composed of 4 places in 902 ms of which 1 ms to minimize.
[2021-05-09 14:49:34] [INFO ] Deduced a trap composed of 4 places in 924 ms of which 1 ms to minimize.
[2021-05-09 14:49:35] [INFO ] Deduced a trap composed of 4 places in 803 ms of which 1 ms to minimize.
[2021-05-09 14:49:36] [INFO ] Deduced a trap composed of 4 places in 825 ms of which 1 ms to minimize.
[2021-05-09 14:49:37] [INFO ] Deduced a trap composed of 4 places in 925 ms of which 0 ms to minimize.
[2021-05-09 14:49:38] [INFO ] Deduced a trap composed of 4 places in 908 ms of which 2 ms to minimize.
[2021-05-09 14:49:39] [INFO ] Deduced a trap composed of 4 places in 909 ms of which 2 ms to minimize.
[2021-05-09 14:49:40] [INFO ] Deduced a trap composed of 4 places in 904 ms of which 0 ms to minimize.
[2021-05-09 14:49:41] [INFO ] Deduced a trap composed of 4 places in 898 ms of which 0 ms to minimize.
[2021-05-09 14:49:42] [INFO ] Deduced a trap composed of 6 places in 902 ms of which 0 ms to minimize.
[2021-05-09 14:49:43] [INFO ] Deduced a trap composed of 4 places in 888 ms of which 1 ms to minimize.
[2021-05-09 14:49:44] [INFO ] Deduced a trap composed of 4 places in 798 ms of which 0 ms to minimize.
[2021-05-09 14:49:44] [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 0
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.verifyPossible(DeadlockTester.java:588)
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-09 14:49:44] [INFO ] [Real]Absence check using 400 positive place invariants in 66 ms returned sat
[2021-05-09 14:49:44] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 33 ms returned sat
[2021-05-09 14:49:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:49:44] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2021-05-09 14:49:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:49:44] [INFO ] [Nat]Absence check using 400 positive place invariants in 87 ms returned sat
[2021-05-09 14:49:44] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 29 ms returned sat
[2021-05-09 14:49:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:49:45] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2021-05-09 14:49:45] [INFO ] [Nat]Added 200 Read/Feed constraints in 101 ms returned sat
[2021-05-09 14:49:46] [INFO ] Deduced a trap composed of 4 places in 1127 ms of which 1 ms to minimize.
[2021-05-09 14:49:47] [INFO ] Deduced a trap composed of 6 places in 1122 ms of which 0 ms to minimize.
[2021-05-09 14:49:48] [INFO ] Deduced a trap composed of 4 places in 1232 ms of which 0 ms to minimize.
[2021-05-09 14:49:50] [INFO ] Deduced a trap composed of 4 places in 1216 ms of which 0 ms to minimize.
[2021-05-09 14:49:51] [INFO ] Deduced a trap composed of 4 places in 1081 ms of which 0 ms to minimize.
[2021-05-09 14:49:52] [INFO ] Deduced a trap composed of 4 places in 1073 ms of which 1 ms to minimize.
[2021-05-09 14:49:53] [INFO ] Deduced a trap composed of 4 places in 1078 ms of which 3 ms to minimize.
[2021-05-09 14:49:54] [INFO ] Deduced a trap composed of 4 places in 1208 ms of which 1 ms to minimize.
[2021-05-09 14:49:55] [INFO ] Deduced a trap composed of 4 places in 1127 ms of which 0 ms to minimize.
[2021-05-09 14:49:56] [INFO ] Deduced a trap composed of 4 places in 1085 ms of which 0 ms to minimize.
[2021-05-09 14:49:58] [INFO ] Deduced a trap composed of 4 places in 1168 ms of which 0 ms to minimize.
[2021-05-09 14:49:59] [INFO ] Deduced a trap composed of 4 places in 987 ms of which 0 ms to minimize.
[2021-05-09 14:50:00] [INFO ] Deduced a trap composed of 6 places in 994 ms of which 1 ms to minimize.
[2021-05-09 14:50:01] [INFO ] Deduced a trap composed of 4 places in 964 ms of which 0 ms to minimize.
[2021-05-09 14:50:02] [INFO ] Deduced a trap composed of 4 places in 960 ms of which 2 ms to minimize.
[2021-05-09 14:50:03] [INFO ] Deduced a trap composed of 4 places in 977 ms of which 1 ms to minimize.
[2021-05-09 14:50:04] [INFO ] Deduced a trap composed of 4 places in 1022 ms of which 1 ms to minimize.
[2021-05-09 14:50:05] [INFO ] Deduced a trap composed of 4 places in 1081 ms of which 2 ms to minimize.
[2021-05-09 14:50:06] [INFO ] Deduced a trap composed of 4 places in 1030 ms of which 1 ms to minimize.
[2021-05-09 14:50:07] [INFO ] Deduced a trap composed of 4 places in 1065 ms of which 0 ms to minimize.
[2021-05-09 14:50:08] [INFO ] Deduced a trap composed of 4 places in 931 ms of which 0 ms to minimize.
[2021-05-09 14:50:09] [INFO ] Deduced a trap composed of 4 places in 928 ms of which 0 ms to minimize.
[2021-05-09 14:50:10] [INFO ] Deduced a trap composed of 4 places in 932 ms of which 0 ms to minimize.
[2021-05-09 14:50:11] [INFO ] Deduced a trap composed of 4 places in 911 ms of which 1 ms to minimize.
[2021-05-09 14:50:12] [INFO ] Deduced a trap composed of 4 places in 910 ms of which 1 ms to minimize.
[2021-05-09 14:50:13] [INFO ] Deduced a trap composed of 4 places in 897 ms of which 1 ms to minimize.
[2021-05-09 14:50:14] [INFO ] Deduced a trap composed of 4 places in 1032 ms of which 0 ms to minimize.
[2021-05-09 14:50:15] [INFO ] Deduced a trap composed of 4 places in 1022 ms of which 1 ms to minimize.
[2021-05-09 14:50:16] [INFO ] Deduced a trap composed of 4 places in 1015 ms of which 9 ms to minimize.
[2021-05-09 14:50:17] [INFO ] Deduced a trap composed of 4 places in 953 ms of which 0 ms to minimize.
[2021-05-09 14:50:18] [INFO ] Deduced a trap composed of 4 places in 973 ms of which 0 ms to minimize.
[2021-05-09 14:50:19] [INFO ] Deduced a trap composed of 4 places in 828 ms of which 0 ms to minimize.
[2021-05-09 14:50:20] [INFO ] Deduced a trap composed of 4 places in 820 ms of which 0 ms to minimize.
[2021-05-09 14:50:20] [INFO ] Deduced a trap composed of 4 places in 815 ms of which 0 ms to minimize.
[2021-05-09 14:50:21] [INFO ] Deduced a trap composed of 4 places in 807 ms of which 0 ms to minimize.
[2021-05-09 14:50:22] [INFO ] Deduced a trap composed of 4 places in 878 ms of which 0 ms to minimize.
[2021-05-09 14:50:23] [INFO ] Deduced a trap composed of 4 places in 902 ms of which 1 ms to minimize.
[2021-05-09 14:50:24] [INFO ] Deduced a trap composed of 4 places in 921 ms of which 1 ms to minimize.
[2021-05-09 14:50:25] [INFO ] Deduced a trap composed of 4 places in 864 ms of which 0 ms to minimize.
[2021-05-09 14:50:26] [INFO ] Deduced a trap composed of 4 places in 858 ms of which 0 ms to minimize.
[2021-05-09 14:50:27] [INFO ] Deduced a trap composed of 4 places in 753 ms of which 1 ms to minimize.
[2021-05-09 14:50:27] [INFO ] Deduced a trap composed of 4 places in 749 ms of which 0 ms to minimize.
[2021-05-09 14:50:28] [INFO ] Deduced a trap composed of 4 places in 737 ms of which 1 ms to minimize.
[2021-05-09 14:50:29] [INFO ] Deduced a trap composed of 4 places in 764 ms of which 0 ms to minimize.
[2021-05-09 14:50:30] [INFO ] Deduced a trap composed of 4 places in 800 ms of which 1 ms to minimize.
[2021-05-09 14:50:30] [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.verifyPossible(DeadlockTester.java:588)
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) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 1139 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 40400/40400 transitions.
Starting structural reductions, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 1108 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2021-05-09 14:50:32] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 1000 cols
[2021-05-09 14:50:32] [INFO ] Computed 600 place invariants in 5 ms
[2021-05-09 14:51:00] [INFO ] Implicit Places using invariants in 28108 ms returned [400, 403, 406, 409, 412, 415, 418, 421, 424, 427, 430, 433, 436, 439, 442, 445, 448, 451, 454, 457, 460, 463, 466, 469, 472, 475, 478, 481, 484, 487, 490, 493, 496, 499, 502, 505, 508, 511, 514, 517, 520, 523, 526, 529, 532, 535, 538, 541, 544, 547, 550, 553, 556, 559, 562, 565, 568, 571, 574, 577, 580, 583, 586, 589, 592, 595, 598, 601, 604, 607, 610, 613, 616, 619, 622, 625, 628, 631, 634, 637, 640, 643, 646, 649, 652, 655, 658, 661, 664, 667, 670, 673, 676, 679, 682, 685, 688, 691, 694, 697, 700, 703, 706, 709, 712, 715, 718, 721, 724, 727, 730, 733, 736, 739, 742, 745, 748, 751, 754, 757, 760, 763, 766, 769, 772, 775, 778, 781, 784, 787, 790, 793, 796, 799, 802, 805, 808, 811, 814, 817, 820, 823, 826, 829, 832, 835, 838, 841, 844, 847, 850, 853, 856, 859, 862, 865, 868, 871, 874, 877, 880, 883, 886, 889, 892, 895, 898, 901, 904, 907, 910, 913, 916, 919, 922, 925, 928, 931, 934, 937, 940, 943, 946, 949, 952, 955, 958, 961, 964, 967, 970, 973, 976, 979, 982, 985, 988, 991, 994, 997]
Discarding 200 places :
Implicit Place search using SMT only with invariants took 28165 ms to find 200 implicit places.
[2021-05-09 14:51:00] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 800 cols
[2021-05-09 14:51:00] [INFO ] Computed 400 place invariants in 4 ms
[2021-05-09 14:51:16] [INFO ] Dead Transitions using invariants and state equation in 15976 ms returned []
Starting structural reductions, iteration 1 : 800/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 911 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2021-05-09 14:51:17] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 800 cols
[2021-05-09 14:51:17] [INFO ] Computed 400 place invariants in 3 ms
[2021-05-09 14:51:32] [INFO ] Dead Transitions using invariants and state equation in 15211 ms returned []
Finished structural reductions, in 2 iterations. Remains : 800/1000 places, 40400/40400 transitions.
Normalized transition count is 800 out of 40400 initially.
// Phase 1: matrix 800 rows 800 cols
[2021-05-09 14:51:32] [INFO ] Computed 400 place invariants in 13 ms
Interrupted random walk after 494251 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4928 ms. (steps per millisecond=202 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4883 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
[2021-05-09 14:52:12] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 800 cols
[2021-05-09 14:52:12] [INFO ] Computed 400 place invariants in 2 ms
[2021-05-09 14:52:12] [INFO ] [Real]Absence check using 400 positive place invariants in 64 ms returned sat
[2021-05-09 14:52:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:52:13] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2021-05-09 14:52:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:52:13] [INFO ] [Nat]Absence check using 400 positive place invariants in 59 ms returned sat
[2021-05-09 14:52:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:52:13] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2021-05-09 14:52:13] [INFO ] State equation strengthened by 200 read => feed constraints.
[2021-05-09 14:52:13] [INFO ] [Nat]Added 200 Read/Feed constraints in 113 ms returned sat
[2021-05-09 14:52:14] [INFO ] Deduced a trap composed of 4 places in 775 ms of which 1 ms to minimize.
[2021-05-09 14:52:15] [INFO ] Deduced a trap composed of 4 places in 774 ms of which 0 ms to minimize.
[2021-05-09 14:52:16] [INFO ] Deduced a trap composed of 4 places in 797 ms of which 1 ms to minimize.
[2021-05-09 14:52:17] [INFO ] Deduced a trap composed of 4 places in 734 ms of which 0 ms to minimize.
[2021-05-09 14:52:17] [INFO ] Deduced a trap composed of 4 places in 743 ms of which 1 ms to minimize.
[2021-05-09 14:52:18] [INFO ] Deduced a trap composed of 4 places in 740 ms of which 0 ms to minimize.
[2021-05-09 14:52:19] [INFO ] Deduced a trap composed of 4 places in 705 ms of which 0 ms to minimize.
[2021-05-09 14:52:20] [INFO ] Deduced a trap composed of 4 places in 687 ms of which 1 ms to minimize.
[2021-05-09 14:52:20] [INFO ] Deduced a trap composed of 4 places in 663 ms of which 0 ms to minimize.
[2021-05-09 14:52:21] [INFO ] Deduced a trap composed of 4 places in 677 ms of which 0 ms to minimize.
[2021-05-09 14:52:22] [INFO ] Deduced a trap composed of 4 places in 648 ms of which 1 ms to minimize.
[2021-05-09 14:52:22] [INFO ] Deduced a trap composed of 4 places in 632 ms of which 1 ms to minimize.
[2021-05-09 14:52:23] [INFO ] Deduced a trap composed of 4 places in 651 ms of which 1 ms to minimize.
[2021-05-09 14:52:24] [INFO ] Deduced a trap composed of 4 places in 662 ms of which 0 ms to minimize.
[2021-05-09 14:52:24] [INFO ] Deduced a trap composed of 4 places in 632 ms of which 0 ms to minimize.
[2021-05-09 14:52:25] [INFO ] Deduced a trap composed of 4 places in 668 ms of which 0 ms to minimize.
[2021-05-09 14:52:26] [INFO ] Deduced a trap composed of 4 places in 612 ms of which 1 ms to minimize.
[2021-05-09 14:52:26] [INFO ] Deduced a trap composed of 4 places in 601 ms of which 1 ms to minimize.
[2021-05-09 14:52:27] [INFO ] Deduced a trap composed of 4 places in 589 ms of which 0 ms to minimize.
[2021-05-09 14:52:27] [INFO ] Deduced a trap composed of 4 places in 564 ms of which 0 ms to minimize.
[2021-05-09 14:52:28] [INFO ] Deduced a trap composed of 4 places in 562 ms of which 1 ms to minimize.
[2021-05-09 14:52:29] [INFO ] Deduced a trap composed of 4 places in 557 ms of which 1 ms to minimize.
[2021-05-09 14:52:29] [INFO ] Deduced a trap composed of 4 places in 552 ms of which 0 ms to minimize.
[2021-05-09 14:52:30] [INFO ] Deduced a trap composed of 4 places in 549 ms of which 1 ms to minimize.
[2021-05-09 14:52:30] [INFO ] Deduced a trap composed of 4 places in 516 ms of which 0 ms to minimize.
[2021-05-09 14:52:31] [INFO ] Deduced a trap composed of 4 places in 505 ms of which 1 ms to minimize.
[2021-05-09 14:52:31] [INFO ] Deduced a trap composed of 4 places in 578 ms of which 1 ms to minimize.
[2021-05-09 14:52:32] [INFO ] Deduced a trap composed of 4 places in 522 ms of which 0 ms to minimize.
[2021-05-09 14:52:33] [INFO ] Deduced a trap composed of 4 places in 545 ms of which 1 ms to minimize.
[2021-05-09 14:52:33] [INFO ] Deduced a trap composed of 4 places in 477 ms of which 1 ms to minimize.
[2021-05-09 14:52:34] [INFO ] Deduced a trap composed of 4 places in 533 ms of which 0 ms to minimize.
[2021-05-09 14:52:34] [INFO ] Deduced a trap composed of 4 places in 536 ms of which 0 ms to minimize.
[2021-05-09 14:52:35] [INFO ] Deduced a trap composed of 4 places in 461 ms of which 0 ms to minimize.
[2021-05-09 14:52:35] [INFO ] Deduced a trap composed of 4 places in 452 ms of which 1 ms to minimize.
[2021-05-09 14:52:36] [INFO ] Deduced a trap composed of 4 places in 495 ms of which 0 ms to minimize.
[2021-05-09 14:52:36] [INFO ] Deduced a trap composed of 4 places in 444 ms of which 1 ms to minimize.
[2021-05-09 14:52:37] [INFO ] Deduced a trap composed of 4 places in 453 ms of which 0 ms to minimize.
[2021-05-09 14:52:37] [INFO ] Deduced a trap composed of 4 places in 408 ms of which 1 ms to minimize.
[2021-05-09 14:52:38] [INFO ] Deduced a trap composed of 4 places in 405 ms of which 1 ms to minimize.
[2021-05-09 14:52:38] [INFO ] Deduced a trap composed of 4 places in 390 ms of which 1 ms to minimize.
[2021-05-09 14:52:38] [INFO ] Deduced a trap composed of 4 places in 369 ms of which 1 ms to minimize.
[2021-05-09 14:52:39] [INFO ] Deduced a trap composed of 4 places in 372 ms of which 0 ms to minimize.
[2021-05-09 14:52:39] [INFO ] Deduced a trap composed of 4 places in 415 ms of which 1 ms to minimize.
[2021-05-09 14:52:40] [INFO ] Deduced a trap composed of 4 places in 427 ms of which 0 ms to minimize.
[2021-05-09 14:52:40] [INFO ] Deduced a trap composed of 4 places in 386 ms of which 0 ms to minimize.
[2021-05-09 14:52:40] [INFO ] Deduced a trap composed of 4 places in 372 ms of which 0 ms to minimize.
[2021-05-09 14:52:41] [INFO ] Deduced a trap composed of 4 places in 406 ms of which 0 ms to minimize.
[2021-05-09 14:52:41] [INFO ] Deduced a trap composed of 4 places in 378 ms of which 0 ms to minimize.
[2021-05-09 14:52:42] [INFO ] Deduced a trap composed of 4 places in 377 ms of which 0 ms to minimize.
[2021-05-09 14:52:42] [INFO ] Deduced a trap composed of 4 places in 359 ms of which 0 ms to minimize.
[2021-05-09 14:52:42] [INFO ] Deduced a trap composed of 4 places in 348 ms of which 0 ms to minimize.
[2021-05-09 14:52:43] [INFO ] Deduced a trap composed of 4 places in 383 ms of which 1 ms to minimize.
[2021-05-09 14:52:43] [INFO ] Deduced a trap composed of 4 places in 367 ms of which 0 ms to minimize.
[2021-05-09 14:52:44] [INFO ] Deduced a trap composed of 4 places in 378 ms of which 0 ms to minimize.
[2021-05-09 14:52:44] [INFO ] Deduced a trap composed of 4 places in 365 ms of which 0 ms to minimize.
[2021-05-09 14:52:44] [INFO ] Deduced a trap composed of 4 places in 366 ms of which 0 ms to minimize.
[2021-05-09 14:52:45] [INFO ] Deduced a trap composed of 4 places in 413 ms of which 1 ms to minimize.
[2021-05-09 14:52:45] [INFO ] Deduced a trap composed of 4 places in 402 ms of which 0 ms to minimize.
[2021-05-09 14:52:46] [INFO ] Deduced a trap composed of 4 places in 388 ms of which 0 ms to minimize.
[2021-05-09 14:52:46] [INFO ] Deduced a trap composed of 4 places in 396 ms of which 0 ms to minimize.
[2021-05-09 14:52:47] [INFO ] Deduced a trap composed of 4 places in 363 ms of which 0 ms to minimize.
[2021-05-09 14:52:47] [INFO ] Deduced a trap composed of 4 places in 371 ms of which 0 ms to minimize.
[2021-05-09 14:52:47] [INFO ] Deduced a trap composed of 4 places in 355 ms of which 0 ms to minimize.
[2021-05-09 14:52:48] [INFO ] Deduced a trap composed of 4 places in 374 ms of which 0 ms to minimize.
[2021-05-09 14:52:48] [INFO ] Deduced a trap composed of 4 places in 344 ms of which 0 ms to minimize.
[2021-05-09 14:52:49] [INFO ] Deduced a trap composed of 4 places in 395 ms of which 0 ms to minimize.
[2021-05-09 14:52:49] [INFO ] Deduced a trap composed of 4 places in 415 ms of which 0 ms to minimize.
[2021-05-09 14:52:49] [INFO ] Deduced a trap composed of 4 places in 413 ms of which 0 ms to minimize.
[2021-05-09 14:52:50] [INFO ] Deduced a trap composed of 4 places in 385 ms of which 0 ms to minimize.
[2021-05-09 14:52:50] [INFO ] Deduced a trap composed of 4 places in 388 ms of which 0 ms to minimize.
[2021-05-09 14:52:51] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 0 ms to minimize.
[2021-05-09 14:52:51] [INFO ] Deduced a trap composed of 4 places in 354 ms of which 0 ms to minimize.
[2021-05-09 14:52:51] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 1 ms to minimize.
[2021-05-09 14:52:52] [INFO ] Deduced a trap composed of 4 places in 346 ms of which 0 ms to minimize.
[2021-05-09 14:52:52] [INFO ] Deduced a trap composed of 4 places in 438 ms of which 1 ms to minimize.
[2021-05-09 14:52:53] [INFO ] Deduced a trap composed of 4 places in 426 ms of which 1 ms to minimize.
[2021-05-09 14:52:53] [INFO ] Deduced a trap composed of 4 places in 376 ms of which 1 ms to minimize.
[2021-05-09 14:52:54] [INFO ] Deduced a trap composed of 4 places in 411 ms of which 0 ms to minimize.
[2021-05-09 14:52:54] [INFO ] Deduced a trap composed of 4 places in 434 ms of which 0 ms to minimize.
[2021-05-09 14:52:54] [INFO ] Deduced a trap composed of 4 places in 381 ms of which 0 ms to minimize.
[2021-05-09 14:52:55] [INFO ] Deduced a trap composed of 4 places in 420 ms of which 0 ms to minimize.
[2021-05-09 14:52:55] [INFO ] Deduced a trap composed of 4 places in 399 ms of which 1 ms to minimize.
[2021-05-09 14:52:56] [INFO ] Deduced a trap composed of 4 places in 423 ms of which 0 ms to minimize.
[2021-05-09 14:52:56] [INFO ] Deduced a trap composed of 4 places in 416 ms of which 0 ms to minimize.
[2021-05-09 14:52:57] [INFO ] Deduced a trap composed of 4 places in 407 ms of which 1 ms to minimize.
[2021-05-09 14:52:57] [INFO ] Deduced a trap composed of 4 places in 375 ms of which 0 ms to minimize.
[2021-05-09 14:52:57] [INFO ] Deduced a trap composed of 4 places in 348 ms of which 0 ms to minimize.
[2021-05-09 14:52:58] [INFO ] Deduced a trap composed of 4 places in 350 ms of which 0 ms to minimize.
[2021-05-09 14:52:58] [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 0
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.verifyPossible(DeadlockTester.java:588)
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-09 14:52:58] [INFO ] [Real]Absence check using 400 positive place invariants in 61 ms returned sat
[2021-05-09 14:52:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:52:58] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2021-05-09 14:52:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:52:58] [INFO ] [Nat]Absence check using 400 positive place invariants in 62 ms returned sat
[2021-05-09 14:52:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:52:59] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2021-05-09 14:52:59] [INFO ] [Nat]Added 200 Read/Feed constraints in 103 ms returned sat
[2021-05-09 14:52:59] [INFO ] Deduced a trap composed of 4 places in 775 ms of which 0 ms to minimize.
[2021-05-09 14:53:00] [INFO ] Deduced a trap composed of 4 places in 775 ms of which 1 ms to minimize.
[2021-05-09 14:53:01] [INFO ] Deduced a trap composed of 4 places in 752 ms of which 1 ms to minimize.
[2021-05-09 14:53:02] [INFO ] Deduced a trap composed of 4 places in 752 ms of which 0 ms to minimize.
[2021-05-09 14:53:03] [INFO ] Deduced a trap composed of 4 places in 747 ms of which 0 ms to minimize.
[2021-05-09 14:53:03] [INFO ] Deduced a trap composed of 4 places in 739 ms of which 0 ms to minimize.
[2021-05-09 14:53:04] [INFO ] Deduced a trap composed of 4 places in 733 ms of which 0 ms to minimize.
[2021-05-09 14:53:05] [INFO ] Deduced a trap composed of 4 places in 723 ms of which 0 ms to minimize.
[2021-05-09 14:53:06] [INFO ] Deduced a trap composed of 4 places in 667 ms of which 0 ms to minimize.
[2021-05-09 14:53:06] [INFO ] Deduced a trap composed of 4 places in 747 ms of which 0 ms to minimize.
[2021-05-09 14:53:07] [INFO ] Deduced a trap composed of 4 places in 699 ms of which 1 ms to minimize.
[2021-05-09 14:53:08] [INFO ] Deduced a trap composed of 4 places in 682 ms of which 1 ms to minimize.
[2021-05-09 14:53:09] [INFO ] Deduced a trap composed of 4 places in 781 ms of which 0 ms to minimize.
[2021-05-09 14:53:09] [INFO ] Deduced a trap composed of 4 places in 781 ms of which 0 ms to minimize.
[2021-05-09 14:53:10] [INFO ] Deduced a trap composed of 4 places in 660 ms of which 0 ms to minimize.
[2021-05-09 14:53:11] [INFO ] Deduced a trap composed of 4 places in 746 ms of which 0 ms to minimize.
[2021-05-09 14:53:12] [INFO ] Deduced a trap composed of 4 places in 703 ms of which 0 ms to minimize.
[2021-05-09 14:53:12] [INFO ] Deduced a trap composed of 4 places in 658 ms of which 1 ms to minimize.
[2021-05-09 14:53:13] [INFO ] Deduced a trap composed of 4 places in 735 ms of which 0 ms to minimize.
[2021-05-09 14:53:14] [INFO ] Deduced a trap composed of 4 places in 646 ms of which 1 ms to minimize.
[2021-05-09 14:53:14] [INFO ] Deduced a trap composed of 4 places in 727 ms of which 0 ms to minimize.
[2021-05-09 14:53:15] [INFO ] Deduced a trap composed of 4 places in 665 ms of which 0 ms to minimize.
[2021-05-09 14:53:16] [INFO ] Deduced a trap composed of 4 places in 639 ms of which 0 ms to minimize.
[2021-05-09 14:53:16] [INFO ] Deduced a trap composed of 4 places in 617 ms of which 0 ms to minimize.
[2021-05-09 14:53:17] [INFO ] Deduced a trap composed of 4 places in 604 ms of which 0 ms to minimize.
[2021-05-09 14:53:18] [INFO ] Deduced a trap composed of 4 places in 600 ms of which 0 ms to minimize.
[2021-05-09 14:53:18] [INFO ] Deduced a trap composed of 4 places in 579 ms of which 1 ms to minimize.
[2021-05-09 14:53:19] [INFO ] Deduced a trap composed of 4 places in 590 ms of which 1 ms to minimize.
[2021-05-09 14:53:20] [INFO ] Deduced a trap composed of 4 places in 565 ms of which 0 ms to minimize.
[2021-05-09 14:53:20] [INFO ] Deduced a trap composed of 4 places in 579 ms of which 1 ms to minimize.
[2021-05-09 14:53:21] [INFO ] Deduced a trap composed of 4 places in 602 ms of which 0 ms to minimize.
[2021-05-09 14:53:21] [INFO ] Deduced a trap composed of 4 places in 605 ms of which 0 ms to minimize.
[2021-05-09 14:53:22] [INFO ] Deduced a trap composed of 4 places in 557 ms of which 1 ms to minimize.
[2021-05-09 14:53:23] [INFO ] Deduced a trap composed of 4 places in 508 ms of which 0 ms to minimize.
[2021-05-09 14:53:23] [INFO ] Deduced a trap composed of 4 places in 573 ms of which 0 ms to minimize.
[2021-05-09 14:53:24] [INFO ] Deduced a trap composed of 4 places in 556 ms of which 0 ms to minimize.
[2021-05-09 14:53:24] [INFO ] Deduced a trap composed of 4 places in 496 ms of which 0 ms to minimize.
[2021-05-09 14:53:25] [INFO ] Deduced a trap composed of 4 places in 537 ms of which 0 ms to minimize.
[2021-05-09 14:53:25] [INFO ] Deduced a trap composed of 4 places in 473 ms of which 0 ms to minimize.
[2021-05-09 14:53:26] [INFO ] Deduced a trap composed of 4 places in 467 ms of which 0 ms to minimize.
[2021-05-09 14:53:26] [INFO ] Deduced a trap composed of 4 places in 459 ms of which 0 ms to minimize.
[2021-05-09 14:53:27] [INFO ] Deduced a trap composed of 4 places in 506 ms of which 0 ms to minimize.
[2021-05-09 14:53:27] [INFO ] Deduced a trap composed of 4 places in 455 ms of which 0 ms to minimize.
[2021-05-09 14:53:28] [INFO ] Deduced a trap composed of 4 places in 499 ms of which 0 ms to minimize.
[2021-05-09 14:53:28] [INFO ] Deduced a trap composed of 4 places in 454 ms of which 0 ms to minimize.
[2021-05-09 14:53:29] [INFO ] Deduced a trap composed of 4 places in 521 ms of which 1 ms to minimize.
[2021-05-09 14:53:29] [INFO ] Deduced a trap composed of 4 places in 440 ms of which 0 ms to minimize.
[2021-05-09 14:53:30] [INFO ] Deduced a trap composed of 4 places in 479 ms of which 0 ms to minimize.
[2021-05-09 14:53:30] [INFO ] Deduced a trap composed of 4 places in 417 ms of which 1 ms to minimize.
[2021-05-09 14:53:31] [INFO ] Deduced a trap composed of 4 places in 443 ms of which 1 ms to minimize.
[2021-05-09 14:53:31] [INFO ] Deduced a trap composed of 4 places in 475 ms of which 0 ms to minimize.
[2021-05-09 14:53:32] [INFO ] Deduced a trap composed of 4 places in 472 ms of which 0 ms to minimize.
[2021-05-09 14:53:32] [INFO ] Deduced a trap composed of 4 places in 417 ms of which 0 ms to minimize.
[2021-05-09 14:53:33] [INFO ] Deduced a trap composed of 4 places in 402 ms of which 0 ms to minimize.
[2021-05-09 14:53:33] [INFO ] Deduced a trap composed of 4 places in 394 ms of which 0 ms to minimize.
[2021-05-09 14:53:33] [INFO ] Deduced a trap composed of 4 places in 428 ms of which 0 ms to minimize.
[2021-05-09 14:53:34] [INFO ] Deduced a trap composed of 4 places in 392 ms of which 1 ms to minimize.
[2021-05-09 14:53:34] [INFO ] Deduced a trap composed of 4 places in 406 ms of which 0 ms to minimize.
[2021-05-09 14:53:35] [INFO ] Deduced a trap composed of 4 places in 395 ms of which 0 ms to minimize.
[2021-05-09 14:53:35] [INFO ] Deduced a trap composed of 4 places in 399 ms of which 1 ms to minimize.
[2021-05-09 14:53:36] [INFO ] Deduced a trap composed of 4 places in 442 ms of which 0 ms to minimize.
[2021-05-09 14:53:36] [INFO ] Deduced a trap composed of 4 places in 435 ms of which 0 ms to minimize.
[2021-05-09 14:53:37] [INFO ] Deduced a trap composed of 4 places in 387 ms of which 0 ms to minimize.
[2021-05-09 14:53:37] [INFO ] Deduced a trap composed of 4 places in 413 ms of which 0 ms to minimize.
[2021-05-09 14:53:37] [INFO ] Deduced a trap composed of 4 places in 384 ms of which 1 ms to minimize.
[2021-05-09 14:53:38] [INFO ] Deduced a trap composed of 4 places in 374 ms of which 8 ms to minimize.
[2021-05-09 14:53:38] [INFO ] Deduced a trap composed of 4 places in 369 ms of which 1 ms to minimize.
[2021-05-09 14:53:39] [INFO ] Deduced a trap composed of 4 places in 368 ms of which 1 ms to minimize.
[2021-05-09 14:53:39] [INFO ] Deduced a trap composed of 4 places in 357 ms of which 0 ms to minimize.
[2021-05-09 14:53:39] [INFO ] Deduced a trap composed of 4 places in 372 ms of which 1 ms to minimize.
[2021-05-09 14:53:40] [INFO ] Deduced a trap composed of 4 places in 357 ms of which 0 ms to minimize.
[2021-05-09 14:53:40] [INFO ] Deduced a trap composed of 4 places in 320 ms of which 1 ms to minimize.
[2021-05-09 14:53:40] [INFO ] Deduced a trap composed of 4 places in 344 ms of which 3 ms to minimize.
[2021-05-09 14:53:41] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 0 ms to minimize.
[2021-05-09 14:53:41] [INFO ] Deduced a trap composed of 4 places in 352 ms of which 1 ms to minimize.
[2021-05-09 14:53:42] [INFO ] Deduced a trap composed of 4 places in 352 ms of which 0 ms to minimize.
[2021-05-09 14:53:42] [INFO ] Deduced a trap composed of 4 places in 342 ms of which 1 ms to minimize.
[2021-05-09 14:53:42] [INFO ] Deduced a trap composed of 4 places in 353 ms of which 0 ms to minimize.
[2021-05-09 14:53:43] [INFO ] Deduced a trap composed of 4 places in 372 ms of which 0 ms to minimize.
[2021-05-09 14:53:43] [INFO ] Deduced a trap composed of 4 places in 358 ms of which 0 ms to minimize.
[2021-05-09 14:53:43] [INFO ] Deduced a trap composed of 4 places in 322 ms of which 0 ms to minimize.
[2021-05-09 14:53: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 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.verifyPossible(DeadlockTester.java:588)
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) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 800 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 1090 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 800/800 places, 40400/40400 transitions.
Starting structural reductions, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 1123 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2021-05-09 14:53:46] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 800 cols
[2021-05-09 14:53:46] [INFO ] Computed 400 place invariants in 2 ms
[2021-05-09 14:53:51] [INFO ] Implicit Places using invariants in 5104 ms returned []
Implicit Place search using SMT only with invariants took 5124 ms to find 0 implicit places.
[2021-05-09 14:53:51] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 800 cols
[2021-05-09 14:53:51] [INFO ] Computed 400 place invariants in 3 ms
[2021-05-09 14:54:07] [INFO ] Dead Transitions using invariants and state equation in 16570 ms returned []
Finished structural reductions, in 1 iterations. Remains : 800/800 places, 40400/40400 transitions.
Starting property specific reduction for Dekker-PT-200-UpperBounds-04
Normalized transition count is 800 out of 40400 initially.
// Phase 1: matrix 800 rows 800 cols
[2021-05-09 14:54:07] [INFO ] Computed 400 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 673 ms. (steps per millisecond=14 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
[2021-05-09 14:54:08] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 800 cols
[2021-05-09 14:54:08] [INFO ] Computed 400 place invariants in 2 ms
[2021-05-09 14:54:08] [INFO ] [Real]Absence check using 400 positive place invariants in 61 ms returned sat
[2021-05-09 14:54:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:54:09] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2021-05-09 14:54:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:54:09] [INFO ] [Nat]Absence check using 400 positive place invariants in 63 ms returned sat
[2021-05-09 14:54:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:54:09] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2021-05-09 14:54:09] [INFO ] State equation strengthened by 200 read => feed constraints.
[2021-05-09 14:54:09] [INFO ] [Nat]Added 200 Read/Feed constraints in 111 ms returned sat
[2021-05-09 14:54:10] [INFO ] Deduced a trap composed of 4 places in 735 ms of which 0 ms to minimize.
[2021-05-09 14:54:11] [INFO ] Deduced a trap composed of 4 places in 823 ms of which 0 ms to minimize.
[2021-05-09 14:54:12] [INFO ] Deduced a trap composed of 4 places in 769 ms of which 0 ms to minimize.
[2021-05-09 14:54:13] [INFO ] Deduced a trap composed of 4 places in 706 ms of which 0 ms to minimize.
[2021-05-09 14:54:13] [INFO ] Deduced a trap composed of 4 places in 794 ms of which 0 ms to minimize.
[2021-05-09 14:54:14] [INFO ] Deduced a trap composed of 4 places in 782 ms of which 1 ms to minimize.
[2021-05-09 14:54:14] [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 0
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.verifyPossible(DeadlockTester.java:588)
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:446)
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) : [1] Max seen :[0]
Support contains 1 out of 800 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions, iteration 0 : 800/800 places, 40399/40399 transitions.
Applied a total of 0 rules in 934 ms. Remains 800 /800 variables (removed 0) and now considering 40399/40399 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 800/800 places, 40399/40399 transitions.
Normalized transition count is 799 out of 40399 initially.
// Phase 1: matrix 799 rows 800 cols
[2021-05-09 14:54:15] [INFO ] Computed 400 place invariants in 13 ms
Interrupted random walk after 503106 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties seen :{}
Interrupted Best-First random walk after 915959 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=183 ) properties seen :{}
[2021-05-09 14:54:50] [INFO ] Flow matrix only has 799 transitions (discarded 39600 similar events)
// Phase 1: matrix 799 rows 800 cols
[2021-05-09 14:54:50] [INFO ] Computed 400 place invariants in 1 ms
[2021-05-09 14:54:50] [INFO ] [Real]Absence check using 400 positive place invariants in 63 ms returned sat
[2021-05-09 14:54:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:54:51] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2021-05-09 14:54:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:54:51] [INFO ] [Nat]Absence check using 400 positive place invariants in 64 ms returned sat
[2021-05-09 14:54:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:54:51] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2021-05-09 14:54:51] [INFO ] State equation strengthened by 200 read => feed constraints.
[2021-05-09 14:54:51] [INFO ] [Nat]Added 200 Read/Feed constraints in 119 ms returned sat
[2021-05-09 14:54:52] [INFO ] Deduced a trap composed of 4 places in 758 ms of which 0 ms to minimize.
[2021-05-09 14:54:53] [INFO ] Deduced a trap composed of 4 places in 744 ms of which 0 ms to minimize.
[2021-05-09 14:54:54] [INFO ] Deduced a trap composed of 4 places in 734 ms of which 0 ms to minimize.
[2021-05-09 14:54:55] [INFO ] Deduced a trap composed of 4 places in 746 ms of which 0 ms to minimize.
[2021-05-09 14:54:55] [INFO ] Deduced a trap composed of 4 places in 704 ms of which 1 ms to minimize.
[2021-05-09 14:54:56] [INFO ] Deduced a trap composed of 4 places in 792 ms of which 0 ms to minimize.
[2021-05-09 14:54:57] [INFO ] Deduced a trap composed of 4 places in 770 ms of which 1 ms to minimize.
[2021-05-09 14:54:58] [INFO ] Deduced a trap composed of 4 places in 672 ms of which 0 ms to minimize.
[2021-05-09 14:54:58] [INFO ] Deduced a trap composed of 4 places in 745 ms of which 0 ms to minimize.
[2021-05-09 14:54:59] [INFO ] Deduced a trap composed of 4 places in 735 ms of which 0 ms to minimize.
[2021-05-09 14:55:00] [INFO ] Deduced a trap composed of 4 places in 703 ms of which 0 ms to minimize.
[2021-05-09 14:55:00] [INFO ] Deduced a trap composed of 4 places in 632 ms of which 1 ms to minimize.
[2021-05-09 14:55:01] [INFO ] Deduced a trap composed of 4 places in 654 ms of which 1 ms to minimize.
[2021-05-09 14:55:02] [INFO ] Deduced a trap composed of 4 places in 636 ms of which 1 ms to minimize.
[2021-05-09 14:55:03] [INFO ] Deduced a trap composed of 4 places in 691 ms of which 0 ms to minimize.
[2021-05-09 14:55:03] [INFO ] Deduced a trap composed of 4 places in 675 ms of which 0 ms to minimize.
[2021-05-09 14:55:04] [INFO ] Deduced a trap composed of 4 places in 668 ms of which 0 ms to minimize.
[2021-05-09 14:55:05] [INFO ] Deduced a trap composed of 4 places in 665 ms of which 0 ms to minimize.
[2021-05-09 14:55:05] [INFO ] Deduced a trap composed of 4 places in 583 ms of which 1 ms to minimize.
[2021-05-09 14:55:06] [INFO ] Deduced a trap composed of 4 places in 639 ms of which 0 ms to minimize.
[2021-05-09 14:55:06] [INFO ] Deduced a trap composed of 4 places in 575 ms of which 0 ms to minimize.
[2021-05-09 14:55:07] [INFO ] Deduced a trap composed of 4 places in 617 ms of which 1 ms to minimize.
[2021-05-09 14:55:08] [INFO ] Deduced a trap composed of 4 places in 613 ms of which 0 ms to minimize.
[2021-05-09 14:55:08] [INFO ] Deduced a trap composed of 4 places in 598 ms of which 0 ms to minimize.
[2021-05-09 14:55:09] [INFO ] Deduced a trap composed of 4 places in 542 ms of which 0 ms to minimize.
[2021-05-09 14:55:10] [INFO ] Deduced a trap composed of 4 places in 571 ms of which 0 ms to minimize.
[2021-05-09 14:55:10] [INFO ] Deduced a trap composed of 4 places in 546 ms of which 1 ms to minimize.
[2021-05-09 14:55:11] [INFO ] Deduced a trap composed of 4 places in 542 ms of which 1 ms to minimize.
[2021-05-09 14:55:11] [INFO ] Deduced a trap composed of 4 places in 474 ms of which 1 ms to minimize.
[2021-05-09 14:55:12] [INFO ] Deduced a trap composed of 4 places in 480 ms of which 1 ms to minimize.
[2021-05-09 14:55:12] [INFO ] Deduced a trap composed of 4 places in 483 ms of which 1 ms to minimize.
[2021-05-09 14:55:13] [INFO ] Deduced a trap composed of 4 places in 485 ms of which 0 ms to minimize.
[2021-05-09 14:55:13] [INFO ] Deduced a trap composed of 4 places in 517 ms of which 0 ms to minimize.
[2021-05-09 14:55:14] [INFO ] Deduced a trap composed of 4 places in 501 ms of which 0 ms to minimize.
[2021-05-09 14:55:14] [INFO ] Deduced a trap composed of 4 places in 474 ms of which 0 ms to minimize.
[2021-05-09 14:55:15] [INFO ] Deduced a trap composed of 4 places in 484 ms of which 1 ms to minimize.
[2021-05-09 14:55:15] [INFO ] Deduced a trap composed of 4 places in 459 ms of which 0 ms to minimize.
[2021-05-09 14:55:16] [INFO ] Deduced a trap composed of 4 places in 450 ms of which 0 ms to minimize.
[2021-05-09 14:55:16] [INFO ] Deduced a trap composed of 4 places in 398 ms of which 0 ms to minimize.
[2021-05-09 14:55:17] [INFO ] Deduced a trap composed of 4 places in 389 ms of which 1 ms to minimize.
[2021-05-09 14:55:17] [INFO ] Deduced a trap composed of 4 places in 409 ms of which 0 ms to minimize.
[2021-05-09 14:55:17] [INFO ] Deduced a trap composed of 4 places in 386 ms of which 0 ms to minimize.
[2021-05-09 14:55:18] [INFO ] Deduced a trap composed of 4 places in 415 ms of which 0 ms to minimize.
[2021-05-09 14:55:18] [INFO ] Deduced a trap composed of 4 places in 431 ms of which 0 ms to minimize.
[2021-05-09 14:55:19] [INFO ] Deduced a trap composed of 4 places in 392 ms of which 0 ms to minimize.
[2021-05-09 14:55:19] [INFO ] Deduced a trap composed of 4 places in 402 ms of which 0 ms to minimize.
[2021-05-09 14:55:20] [INFO ] Deduced a trap composed of 4 places in 403 ms of which 0 ms to minimize.
[2021-05-09 14:55:20] [INFO ] Deduced a trap composed of 4 places in 407 ms of which 0 ms to minimize.
[2021-05-09 14:55:20] [INFO ] Deduced a trap composed of 4 places in 392 ms of which 1 ms to minimize.
[2021-05-09 14:55:21] [INFO ] Deduced a trap composed of 4 places in 382 ms of which 0 ms to minimize.
[2021-05-09 14:55:21] [INFO ] Deduced a trap composed of 4 places in 366 ms of which 1 ms to minimize.
[2021-05-09 14:55:22] [INFO ] Deduced a trap composed of 4 places in 384 ms of which 1 ms to minimize.
[2021-05-09 14:55:22] [INFO ] Deduced a trap composed of 4 places in 377 ms of which 0 ms to minimize.
[2021-05-09 14:55:22] [INFO ] Deduced a trap composed of 4 places in 370 ms of which 0 ms to minimize.
[2021-05-09 14:55:23] [INFO ] Deduced a trap composed of 4 places in 371 ms of which 0 ms to minimize.
[2021-05-09 14:55:23] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 0 ms to minimize.
[2021-05-09 14:55:24] [INFO ] Deduced a trap composed of 4 places in 405 ms of which 0 ms to minimize.
[2021-05-09 14:55:24] [INFO ] Deduced a trap composed of 4 places in 369 ms of which 0 ms to minimize.
[2021-05-09 14:55:24] [INFO ] Deduced a trap composed of 4 places in 354 ms of which 1 ms to minimize.
[2021-05-09 14:55:25] [INFO ] Deduced a trap composed of 4 places in 396 ms of which 0 ms to minimize.
[2021-05-09 14:55:25] [INFO ] Deduced a trap composed of 4 places in 381 ms of which 0 ms to minimize.
[2021-05-09 14:55:26] [INFO ] Deduced a trap composed of 4 places in 371 ms of which 0 ms to minimize.
[2021-05-09 14:55:26] [INFO ] Deduced a trap composed of 4 places in 361 ms of which 0 ms to minimize.
[2021-05-09 14:55:26] [INFO ] Deduced a trap composed of 4 places in 346 ms of which 1 ms to minimize.
[2021-05-09 14:55:27] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 0 ms to minimize.
[2021-05-09 14:55:27] [INFO ] Deduced a trap composed of 4 places in 432 ms of which 0 ms to minimize.
[2021-05-09 14:55:28] [INFO ] Deduced a trap composed of 4 places in 417 ms of which 0 ms to minimize.
[2021-05-09 14:55:28] [INFO ] Deduced a trap composed of 4 places in 395 ms of which 1 ms to minimize.
[2021-05-09 14:55:29] [INFO ] Deduced a trap composed of 4 places in 370 ms of which 1 ms to minimize.
[2021-05-09 14:55:29] [INFO ] Deduced a trap composed of 4 places in 390 ms of which 1 ms to minimize.
[2021-05-09 14:55:29] [INFO ] Deduced a trap composed of 4 places in 375 ms of which 1 ms to minimize.
[2021-05-09 14:55:30] [INFO ] Deduced a trap composed of 4 places in 355 ms of which 0 ms to minimize.
[2021-05-09 14:55:30] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 0 ms to minimize.
[2021-05-09 14:55:30] [INFO ] Deduced a trap composed of 4 places in 342 ms of which 0 ms to minimize.
[2021-05-09 14:55:31] [INFO ] Deduced a trap composed of 4 places in 438 ms of which 1 ms to minimize.
[2021-05-09 14:55:31] [INFO ] Deduced a trap composed of 4 places in 395 ms of which 0 ms to minimize.
[2021-05-09 14:55:32] [INFO ] Deduced a trap composed of 4 places in 407 ms of which 1 ms to minimize.
[2021-05-09 14:55:32] [INFO ] Deduced a trap composed of 4 places in 435 ms of which 0 ms to minimize.
[2021-05-09 14:55:33] [INFO ] Deduced a trap composed of 4 places in 421 ms of which 0 ms to minimize.
[2021-05-09 14:55:33] [INFO ] Deduced a trap composed of 4 places in 397 ms of which 0 ms to minimize.
[2021-05-09 14:55:34] [INFO ] Deduced a trap composed of 4 places in 399 ms of which 0 ms to minimize.
[2021-05-09 14:55:34] [INFO ] Deduced a trap composed of 4 places in 422 ms of which 0 ms to minimize.
[2021-05-09 14:55:34] [INFO ] Deduced a trap composed of 4 places in 424 ms of which 0 ms to minimize.
[2021-05-09 14:55:35] [INFO ] Deduced a trap composed of 4 places in 413 ms of which 0 ms to minimize.
[2021-05-09 14:55:35] [INFO ] Deduced a trap composed of 4 places in 357 ms of which 0 ms to minimize.
[2021-05-09 14:55:36] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 0 ms to minimize.
[2021-05-09 14:55: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 0
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.verifyPossible(DeadlockTester.java:588)
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:446)
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) : [1] Max seen :[0]
Support contains 1 out of 800 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 800/800 places, 40399/40399 transitions.
Applied a total of 0 rules in 1070 ms. Remains 800 /800 variables (removed 0) and now considering 40399/40399 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 800/800 places, 40399/40399 transitions.
Starting structural reductions, iteration 0 : 800/800 places, 40399/40399 transitions.
Applied a total of 0 rules in 987 ms. Remains 800 /800 variables (removed 0) and now considering 40399/40399 (removed 0) transitions.
[2021-05-09 14:55:38] [INFO ] Flow matrix only has 799 transitions (discarded 39600 similar events)
// Phase 1: matrix 799 rows 800 cols
[2021-05-09 14:55:38] [INFO ] Computed 400 place invariants in 10 ms
[2021-05-09 14:55:43] [INFO ] Implicit Places using invariants in 4958 ms returned []
Implicit Place search using SMT only with invariants took 4967 ms to find 0 implicit places.
[2021-05-09 14:55:43] [INFO ] Flow matrix only has 799 transitions (discarded 39600 similar events)
// Phase 1: matrix 799 rows 800 cols
[2021-05-09 14:55:43] [INFO ] Computed 400 place invariants in 1 ms
[2021-05-09 14:55:57] [INFO ] Dead Transitions using invariants and state equation in 14806 ms returned []
Finished structural reductions, in 1 iterations. Remains : 800/800 places, 40399/40399 transitions.
Ending property specific reduction for Dekker-PT-200-UpperBounds-04 in 110107 ms.
Starting property specific reduction for Dekker-PT-200-UpperBounds-14
Normalized transition count is 800 out of 40400 initially.
// Phase 1: matrix 800 rows 800 cols
[2021-05-09 14:55:58] [INFO ] Computed 400 place invariants in 12 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 648 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
[2021-05-09 14:55:58] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 800 cols
[2021-05-09 14:55:58] [INFO ] Computed 400 place invariants in 1 ms
[2021-05-09 14:55:58] [INFO ] [Real]Absence check using 400 positive place invariants in 58 ms returned sat
[2021-05-09 14:55:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:55:59] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2021-05-09 14:55:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:55:59] [INFO ] [Nat]Absence check using 400 positive place invariants in 59 ms returned sat
[2021-05-09 14:55:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:55:59] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2021-05-09 14:55:59] [INFO ] State equation strengthened by 200 read => feed constraints.
[2021-05-09 14:55:59] [INFO ] [Nat]Added 200 Read/Feed constraints in 105 ms returned sat
[2021-05-09 14:56:00] [INFO ] Deduced a trap composed of 4 places in 753 ms of which 0 ms to minimize.
[2021-05-09 14:56:01] [INFO ] Deduced a trap composed of 4 places in 752 ms of which 0 ms to minimize.
[2021-05-09 14:56:02] [INFO ] Deduced a trap composed of 4 places in 740 ms of which 0 ms to minimize.
[2021-05-09 14:56:02] [INFO ] Deduced a trap composed of 4 places in 734 ms of which 1 ms to minimize.
[2021-05-09 14:56:03] [INFO ] Deduced a trap composed of 4 places in 820 ms of which 1 ms to minimize.
[2021-05-09 14:56:04] [INFO ] Deduced a trap composed of 4 places in 815 ms of which 0 ms to minimize.
[2021-05-09 14:56:04] [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 0
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.verifyPossible(DeadlockTester.java:588)
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:446)
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) : [1] Max seen :[0]
Support contains 1 out of 800 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions, iteration 0 : 800/800 places, 40399/40399 transitions.
Applied a total of 0 rules in 895 ms. Remains 800 /800 variables (removed 0) and now considering 40399/40399 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 800/800 places, 40399/40399 transitions.
Normalized transition count is 799 out of 40399 initially.
// Phase 1: matrix 799 rows 800 cols
[2021-05-09 14:56:05] [INFO ] Computed 400 place invariants in 13 ms
Interrupted random walk after 496411 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4863 ms. (steps per millisecond=205 ) properties (out of 1) seen :0
[2021-05-09 14:56:40] [INFO ] Flow matrix only has 799 transitions (discarded 39600 similar events)
// Phase 1: matrix 799 rows 800 cols
[2021-05-09 14:56:40] [INFO ] Computed 400 place invariants in 2 ms
[2021-05-09 14:56:40] [INFO ] [Real]Absence check using 400 positive place invariants in 58 ms returned sat
[2021-05-09 14:56:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:56:40] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2021-05-09 14:56:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:56:41] [INFO ] [Nat]Absence check using 400 positive place invariants in 58 ms returned sat
[2021-05-09 14:56:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:56:41] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2021-05-09 14:56:41] [INFO ] State equation strengthened by 200 read => feed constraints.
[2021-05-09 14:56:41] [INFO ] [Nat]Added 200 Read/Feed constraints in 106 ms returned sat
[2021-05-09 14:56:42] [INFO ] Deduced a trap composed of 4 places in 759 ms of which 1 ms to minimize.
[2021-05-09 14:56:43] [INFO ] Deduced a trap composed of 4 places in 765 ms of which 0 ms to minimize.
[2021-05-09 14:56:44] [INFO ] Deduced a trap composed of 4 places in 744 ms of which 0 ms to minimize.
[2021-05-09 14:56:44] [INFO ] Deduced a trap composed of 4 places in 727 ms of which 0 ms to minimize.
[2021-05-09 14:56:45] [INFO ] Deduced a trap composed of 4 places in 725 ms of which 0 ms to minimize.
[2021-05-09 14:56:46] [INFO ] Deduced a trap composed of 4 places in 714 ms of which 1 ms to minimize.
[2021-05-09 14:56:47] [INFO ] Deduced a trap composed of 4 places in 703 ms of which 0 ms to minimize.
[2021-05-09 14:56:47] [INFO ] Deduced a trap composed of 4 places in 699 ms of which 0 ms to minimize.
[2021-05-09 14:56:48] [INFO ] Deduced a trap composed of 4 places in 687 ms of which 0 ms to minimize.
[2021-05-09 14:56:49] [INFO ] Deduced a trap composed of 4 places in 685 ms of which 1 ms to minimize.
[2021-05-09 14:56:49] [INFO ] Deduced a trap composed of 4 places in 688 ms of which 0 ms to minimize.
[2021-05-09 14:56:50] [INFO ] Deduced a trap composed of 4 places in 686 ms of which 1 ms to minimize.
[2021-05-09 14:56:51] [INFO ] Deduced a trap composed of 4 places in 686 ms of which 0 ms to minimize.
[2021-05-09 14:56:52] [INFO ] Deduced a trap composed of 4 places in 681 ms of which 0 ms to minimize.
[2021-05-09 14:56:52] [INFO ] Deduced a trap composed of 4 places in 671 ms of which 1 ms to minimize.
[2021-05-09 14:56:53] [INFO ] Deduced a trap composed of 4 places in 659 ms of which 0 ms to minimize.
[2021-05-09 14:56:54] [INFO ] Deduced a trap composed of 4 places in 668 ms of which 1 ms to minimize.
[2021-05-09 14:56:54] [INFO ] Deduced a trap composed of 4 places in 651 ms of which 1 ms to minimize.
[2021-05-09 14:56:55] [INFO ] Deduced a trap composed of 4 places in 643 ms of which 0 ms to minimize.
[2021-05-09 14:56:56] [INFO ] Deduced a trap composed of 4 places in 638 ms of which 1 ms to minimize.
[2021-05-09 14:56:56] [INFO ] Deduced a trap composed of 4 places in 662 ms of which 0 ms to minimize.
[2021-05-09 14:56:57] [INFO ] Deduced a trap composed of 4 places in 626 ms of which 1 ms to minimize.
[2021-05-09 14:56:58] [INFO ] Deduced a trap composed of 4 places in 631 ms of which 1 ms to minimize.
[2021-05-09 14:56:58] [INFO ] Deduced a trap composed of 4 places in 632 ms of which 0 ms to minimize.
[2021-05-09 14:56:59] [INFO ] Deduced a trap composed of 4 places in 601 ms of which 0 ms to minimize.
[2021-05-09 14:57:00] [INFO ] Deduced a trap composed of 4 places in 639 ms of which 0 ms to minimize.
[2021-05-09 14:57:00] [INFO ] Deduced a trap composed of 4 places in 597 ms of which 0 ms to minimize.
[2021-05-09 14:57:01] [INFO ] Deduced a trap composed of 4 places in 591 ms of which 0 ms to minimize.
[2021-05-09 14:57:01] [INFO ] Deduced a trap composed of 4 places in 582 ms of which 1 ms to minimize.
[2021-05-09 14:57:02] [INFO ] Deduced a trap composed of 4 places in 561 ms of which 1 ms to minimize.
[2021-05-09 14:57:03] [INFO ] Deduced a trap composed of 4 places in 544 ms of which 0 ms to minimize.
[2021-05-09 14:57:03] [INFO ] Deduced a trap composed of 4 places in 546 ms of which 1 ms to minimize.
[2021-05-09 14:57:04] [INFO ] Deduced a trap composed of 4 places in 531 ms of which 0 ms to minimize.
[2021-05-09 14:57:04] [INFO ] Deduced a trap composed of 4 places in 514 ms of which 0 ms to minimize.
[2021-05-09 14:57:05] [INFO ] Deduced a trap composed of 4 places in 523 ms of which 0 ms to minimize.
[2021-05-09 14:57:05] [INFO ] Deduced a trap composed of 4 places in 533 ms of which 1 ms to minimize.
[2021-05-09 14:57:06] [INFO ] Deduced a trap composed of 4 places in 506 ms of which 0 ms to minimize.
[2021-05-09 14:57:06] [INFO ] Deduced a trap composed of 4 places in 485 ms of which 0 ms to minimize.
[2021-05-09 14:57:07] [INFO ] Deduced a trap composed of 4 places in 514 ms of which 0 ms to minimize.
[2021-05-09 14:57:07] [INFO ] Deduced a trap composed of 4 places in 474 ms of which 0 ms to minimize.
[2021-05-09 14:57:08] [INFO ] Deduced a trap composed of 4 places in 478 ms of which 0 ms to minimize.
[2021-05-09 14:57:09] [INFO ] Deduced a trap composed of 4 places in 462 ms of which 0 ms to minimize.
[2021-05-09 14:57:09] [INFO ] Deduced a trap composed of 4 places in 502 ms of which 0 ms to minimize.
[2021-05-09 14:57:09] [INFO ] Deduced a trap composed of 4 places in 444 ms of which 0 ms to minimize.
[2021-05-09 14:57:10] [INFO ] Deduced a trap composed of 4 places in 466 ms of which 1 ms to minimize.
[2021-05-09 14:57:10] [INFO ] Deduced a trap composed of 4 places in 448 ms of which 1 ms to minimize.
[2021-05-09 14:57:11] [INFO ] Deduced a trap composed of 4 places in 444 ms of which 0 ms to minimize.
[2021-05-09 14:57:11] [INFO ] Deduced a trap composed of 4 places in 441 ms of which 1 ms to minimize.
[2021-05-09 14:57:12] [INFO ] Deduced a trap composed of 4 places in 418 ms of which 0 ms to minimize.
[2021-05-09 14:57:12] [INFO ] Deduced a trap composed of 4 places in 446 ms of which 0 ms to minimize.
[2021-05-09 14:57:13] [INFO ] Deduced a trap composed of 4 places in 446 ms of which 0 ms to minimize.
[2021-05-09 14:57:13] [INFO ] Deduced a trap composed of 4 places in 428 ms of which 0 ms to minimize.
[2021-05-09 14:57:14] [INFO ] Deduced a trap composed of 4 places in 416 ms of which 0 ms to minimize.
[2021-05-09 14:57:14] [INFO ] Deduced a trap composed of 4 places in 397 ms of which 0 ms to minimize.
[2021-05-09 14:57:15] [INFO ] Deduced a trap composed of 4 places in 387 ms of which 0 ms to minimize.
[2021-05-09 14:57:15] [INFO ] Deduced a trap composed of 4 places in 395 ms of which 0 ms to minimize.
[2021-05-09 14:57:15] [INFO ] Deduced a trap composed of 4 places in 374 ms of which 1 ms to minimize.
[2021-05-09 14:57:16] [INFO ] Deduced a trap composed of 4 places in 394 ms of which 0 ms to minimize.
[2021-05-09 14:57:16] [INFO ] Deduced a trap composed of 4 places in 363 ms of which 0 ms to minimize.
[2021-05-09 14:57:17] [INFO ] Deduced a trap composed of 4 places in 369 ms of which 1 ms to minimize.
[2021-05-09 14:57:17] [INFO ] Deduced a trap composed of 4 places in 420 ms of which 1 ms to minimize.
[2021-05-09 14:57:18] [INFO ] Deduced a trap composed of 4 places in 405 ms of which 0 ms to minimize.
[2021-05-09 14:57:18] [INFO ] Deduced a trap composed of 4 places in 388 ms of which 0 ms to minimize.
[2021-05-09 14:57:18] [INFO ] Deduced a trap composed of 4 places in 375 ms of which 1 ms to minimize.
[2021-05-09 14:57:19] [INFO ] Deduced a trap composed of 4 places in 386 ms of which 0 ms to minimize.
[2021-05-09 14:57:19] [INFO ] Deduced a trap composed of 4 places in 391 ms of which 0 ms to minimize.
[2021-05-09 14:57:20] [INFO ] Deduced a trap composed of 4 places in 374 ms of which 1 ms to minimize.
[2021-05-09 14:57:20] [INFO ] Deduced a trap composed of 4 places in 373 ms of which 0 ms to minimize.
[2021-05-09 14:57:20] [INFO ] Deduced a trap composed of 4 places in 363 ms of which 0 ms to minimize.
[2021-05-09 14:57:21] [INFO ] Deduced a trap composed of 4 places in 352 ms of which 0 ms to minimize.
[2021-05-09 14:57:21] [INFO ] Deduced a trap composed of 4 places in 370 ms of which 0 ms to minimize.
[2021-05-09 14:57:22] [INFO ] Deduced a trap composed of 4 places in 340 ms of which 0 ms to minimize.
[2021-05-09 14:57:22] [INFO ] Deduced a trap composed of 4 places in 335 ms of which 1 ms to minimize.
[2021-05-09 14:57:22] [INFO ] Deduced a trap composed of 4 places in 317 ms of which 0 ms to minimize.
[2021-05-09 14:57:23] [INFO ] Deduced a trap composed of 4 places in 318 ms of which 0 ms to minimize.
[2021-05-09 14:57:23] [INFO ] Deduced a trap composed of 4 places in 342 ms of which 1 ms to minimize.
[2021-05-09 14:57:23] [INFO ] Deduced a trap composed of 4 places in 327 ms of which 1 ms to minimize.
[2021-05-09 14:57:24] [INFO ] Deduced a trap composed of 4 places in 387 ms of which 0 ms to minimize.
[2021-05-09 14:57:24] [INFO ] Deduced a trap composed of 4 places in 372 ms of which 0 ms to minimize.
[2021-05-09 14:57:25] [INFO ] Deduced a trap composed of 4 places in 360 ms of which 0 ms to minimize.
[2021-05-09 14:57:25] [INFO ] Deduced a trap composed of 4 places in 352 ms of which 0 ms to minimize.
[2021-05-09 14:57:25] [INFO ] Deduced a trap composed of 4 places in 357 ms of which 1 ms to minimize.
[2021-05-09 14:57:26] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 0 ms to minimize.
[2021-05-09 14:57:26] [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 0
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.verifyPossible(DeadlockTester.java:588)
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:446)
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) : [1] Max seen :[0]
Support contains 1 out of 800 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 800/800 places, 40399/40399 transitions.
Applied a total of 0 rules in 1024 ms. Remains 800 /800 variables (removed 0) and now considering 40399/40399 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 800/800 places, 40399/40399 transitions.
Starting structural reductions, iteration 0 : 800/800 places, 40399/40399 transitions.
Applied a total of 0 rules in 995 ms. Remains 800 /800 variables (removed 0) and now considering 40399/40399 (removed 0) transitions.
[2021-05-09 14:57:28] [INFO ] Flow matrix only has 799 transitions (discarded 39600 similar events)
// Phase 1: matrix 799 rows 800 cols
[2021-05-09 14:57:28] [INFO ] Computed 400 place invariants in 2 ms
[2021-05-09 14:57:33] [INFO ] Implicit Places using invariants in 4981 ms returned []
Implicit Place search using SMT only with invariants took 4982 ms to find 0 implicit places.
[2021-05-09 14:57:33] [INFO ] Flow matrix only has 799 transitions (discarded 39600 similar events)
// Phase 1: matrix 799 rows 800 cols
[2021-05-09 14:57:33] [INFO ] Computed 400 place invariants in 2 ms
[2021-05-09 14:57:47] [INFO ] Dead Transitions using invariants and state equation in 14491 ms returned []
Finished structural reductions, in 1 iterations. Remains : 800/800 places, 40399/40399 transitions.
Ending property specific reduction for Dekker-PT-200-UpperBounds-14 in 109688 ms.
[2021-05-09 14:57:50] [INFO ] Flatten gal took : 2024 ms
[2021-05-09 14:57:51] [INFO ] Applying decomposition
[2021-05-09 14:57:53] [INFO ] Flatten gal took : 1813 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15316523660295281786.txt, -o, /tmp/graph15316523660295281786.bin, -w, /tmp/graph15316523660295281786.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15316523660295281786.bin, -l, -1, -v, -w, /tmp/graph15316523660295281786.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 14:57:56] [INFO ] Decomposing Gal with order
[2021-05-09 14:57:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 14:58:00] [INFO ] Removed a total of 118800 redundant transitions.
[2021-05-09 14:58:00] [INFO ] Flatten gal took : 2790 ms
[2021-05-09 14:58:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1301 ms.
[2021-05-09 14:58:02] [INFO ] Time to serialize gal into /tmp/UpperBounds819943482958523200.gal : 133 ms
[2021-05-09 14:58:02] [INFO ] Time to serialize properties into /tmp/UpperBounds1058743881236775326.prop : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds819943482958523200.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds1058743881236775326.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds819943482958523200.gal -t CGAL -reachable-file /tmp/UpperBounds1058743881236775326.prop --nowitness
Loading property file /tmp/UpperBounds1058743881236775326.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.62301e+62,39.7575,236120,403,10,6370,20325,41215,5389,26,20146,0
Total reachable state count : 1.623007424701580178297381713264574228547e+62

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Dekker-PT-200-UpperBounds-04 :0 <= u143.p3_143 <= 1
FORMULA Dekker-PT-200-UpperBounds-04 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-200-UpperBounds-04,0,39.9456,236120,1,0,6370,20325,42415,5389,37,20146,21530
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Dekker-PT-200-UpperBounds-14 :0 <= u177.p3_177 <= 1
FORMULA Dekker-PT-200-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-200-UpperBounds-14,0,40.0927,236120,1,0,6370,20325,42829,5389,37,20146,21748
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1620572323966

--------------------
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="Dekker-PT-200"
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 Dekker-PT-200, 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 r064-tall-162038397700795"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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