About the Execution of ITS-Tools for Philosophers-COL-000500
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.r140-tall-162298995800043.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Philosophers-COL-000500, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162298995800043
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 332K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 27 07:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 07:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 08:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 08:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 31K 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 Philosophers-COL-000500-UpperBounds-00
FORMULA_NAME Philosophers-COL-000500-UpperBounds-01
FORMULA_NAME Philosophers-COL-000500-UpperBounds-02
FORMULA_NAME Philosophers-COL-000500-UpperBounds-03
FORMULA_NAME Philosophers-COL-000500-UpperBounds-04
FORMULA_NAME Philosophers-COL-000500-UpperBounds-05
FORMULA_NAME Philosophers-COL-000500-UpperBounds-06
FORMULA_NAME Philosophers-COL-000500-UpperBounds-07
FORMULA_NAME Philosophers-COL-000500-UpperBounds-08
FORMULA_NAME Philosophers-COL-000500-UpperBounds-09
FORMULA_NAME Philosophers-COL-000500-UpperBounds-10
FORMULA_NAME Philosophers-COL-000500-UpperBounds-11
FORMULA_NAME Philosophers-COL-000500-UpperBounds-12
FORMULA_NAME Philosophers-COL-000500-UpperBounds-13
FORMULA_NAME Philosophers-COL-000500-UpperBounds-14
FORMULA_NAME Philosophers-COL-000500-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1622990143013
Running Version 0
[2021-06-06 14:35:46] [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-06-06 14:35:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-06 14:35:46] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-06-06 14:35:46] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-06-06 14:35:47] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 834 ms
[2021-06-06 14:35:47] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 2500 PT places and 2500.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2021-06-06 14:35:47] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions in 5 ms.
[2021-06-06 14:35:47] [INFO ] Skeletonized HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1000_2354263875336854128.dot
// Phase 1: matrix 5 rows 5 cols
[2021-06-06 14:35:47] [INFO ] Computed 2 place invariants in 5 ms
FORMULA Philosophers-COL-000500-UpperBounds-11 500 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000500-UpperBounds-08 500 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000500-UpperBounds-07 500 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000500-UpperBounds-04 500 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000500-UpperBounds-00 500 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2021-06-06 14:35:47] [INFO ] Unfolded HLPN to a Petri net with 2500 places and 2500 transitions in 65 ms.
[2021-06-06 14:35:47] [INFO ] Unfolded HLPN properties in 9 ms.
// Phase 1: matrix 5 rows 5 cols
[2021-06-06 14:35:47] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-06 14:35:47] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2021-06-06 14:35:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:47] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-06-06 14:35:47] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:35:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2021-06-06 14:35:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:48] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2021-06-06 14:35:48] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 6 ms.
[2021-06-06 14:35:48] [INFO ] Added : 0 causal constraints over 0 iterations in 63 ms. Result :sat
Minimization took 46 ms.
[2021-06-06 14:35:48] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2021-06-06 14:35:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:48] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2021-06-06 14:35:48] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:35:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2021-06-06 14:35:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:48] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2021-06-06 14:35:48] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 15 ms.
[2021-06-06 14:35:48] [INFO ] Added : 0 causal constraints over 0 iterations in 57 ms. Result :sat
Minimization took 12 ms.
[2021-06-06 14:35:48] [INFO ] [Real]Absence check using 2 positive place invariants in 18 ms returned sat
[2021-06-06 14:35:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:48] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-06-06 14:35:48] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:35:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-06-06 14:35:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:48] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-06-06 14:35:48] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 8 ms.
[2021-06-06 14:35:48] [INFO ] Added : 1 causal constraints over 1 iterations in 78 ms. Result :sat
Minimization took 12 ms.
[2021-06-06 14:35:48] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-06-06 14:35:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:48] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-06-06 14:35:48] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:35:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-06-06 14:35:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:49] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2021-06-06 14:35:49] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2021-06-06 14:35:49] [INFO ] Added : 0 causal constraints over 0 iterations in 51 ms. Result :sat
Minimization took 2 ms.
[2021-06-06 14:35:49] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-06-06 14:35:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:49] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-06-06 14:35:49] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:35:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-06-06 14:35:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:49] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-06-06 14:35:49] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2021-06-06 14:35:49] [INFO ] Added : 1 causal constraints over 1 iterations in 27 ms. Result :sat
Minimization took 5 ms.
[2021-06-06 14:35:49] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-06-06 14:35:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:49] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-06-06 14:35:49] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:35:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-06-06 14:35:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:49] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2021-06-06 14:35:49] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 4 ms.
[2021-06-06 14:35:49] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2021-06-06 14:35:49] [INFO ] [Real]Absence check using 2 positive place invariants in 26 ms returned sat
[2021-06-06 14:35:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:49] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-06-06 14:35:49] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:35:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-06-06 14:35:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:49] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-06-06 14:35:49] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 3 ms.
[2021-06-06 14:35:49] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 2 ms.
[2021-06-06 14:35:49] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-06-06 14:35:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:49] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-06-06 14:35:49] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:35:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-06-06 14:35:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:49] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-06-06 14:35:49] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2021-06-06 14:35:49] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2021-06-06 14:35:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:35:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:49] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2021-06-06 14:35:49] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:35:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:35:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:49] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2021-06-06 14:35:49] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 14 ms.
[2021-06-06 14:35:49] [INFO ] Added : 1 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 16 ms.
[2021-06-06 14:35:49] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-06-06 14:35:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:49] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-06-06 14:35:49] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:35:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:35:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:50] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-06-06 14:35:50] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2021-06-06 14:35:50] [INFO ] Added : 0 causal constraints over 0 iterations in 19 ms. Result :sat
Minimization took 7 ms.
[2021-06-06 14:35:50] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-06-06 14:35:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:50] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-06-06 14:35:50] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:35:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:35:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:50] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-06-06 14:35:50] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2021-06-06 14:35:50] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [500, 500, 250, 500, 250, 500, 500, 500, 250, 500, 250]
[2021-06-06 14:35:50] [INFO ] Unfolded HLPN to a Petri net with 2500 places and 2500 transitions in 30 ms.
[2021-06-06 14:35:50] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_8786362868454907407.dot
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3290 ms. (steps per millisecond=3 ) properties (out of 11) seen :1919
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 555 ms. (steps per millisecond=18 ) properties (out of 11) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 572 ms. (steps per millisecond=17 ) properties (out of 11) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 11) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 470 ms. (steps per millisecond=21 ) properties (out of 11) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 480 ms. (steps per millisecond=20 ) properties (out of 11) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 387 ms. (steps per millisecond=25 ) properties (out of 11) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 458 ms. (steps per millisecond=21 ) properties (out of 11) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 450 ms. (steps per millisecond=22 ) properties (out of 11) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 513 ms. (steps per millisecond=19 ) properties (out of 11) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 439 ms. (steps per millisecond=22 ) properties (out of 11) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 428 ms. (steps per millisecond=23 ) properties (out of 11) seen :15
// Phase 1: matrix 2500 rows 2500 cols
[2021-06-06 14:35:58] [INFO ] Computed 1000 place invariants in 49 ms
[2021-06-06 14:36:00] [INFO ] [Real]Absence check using 1000 positive place invariants in 514 ms returned sat
[2021-06-06 14:36:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:01] [INFO ] [Real]Absence check using state equation in 1564 ms returned sat
[2021-06-06 14:36:01] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:02] [INFO ] [Nat]Absence check using 1000 positive place invariants in 407 ms returned sat
[2021-06-06 14:36:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:04] [INFO ] [Nat]Absence check using state equation in 1561 ms returned sat
[2021-06-06 14:36:04] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 162 ms.
[2021-06-06 14:36:10] [INFO ] Deduced a trap composed of 4 places in 3653 ms of which 7 ms to minimize.
[2021-06-06 14:36:10] [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.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-06-06 14:36:11] [INFO ] [Real]Absence check using 1000 positive place invariants in 384 ms returned sat
[2021-06-06 14:36:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:12] [INFO ] [Real]Absence check using state equation in 1414 ms returned sat
[2021-06-06 14:36:12] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:13] [INFO ] [Nat]Absence check using 1000 positive place invariants in 374 ms returned sat
[2021-06-06 14:36:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:14] [INFO ] [Nat]Absence check using state equation in 1464 ms returned sat
[2021-06-06 14:36:15] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 170 ms.
[2021-06-06 14:36:17] [INFO ] Added : 55 causal constraints over 11 iterations in 2531 ms. Result :sat
Minimization took 103 ms.
[2021-06-06 14:36:18] [INFO ] [Real]Absence check using 1000 positive place invariants in 346 ms returned sat
[2021-06-06 14:36:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:19] [INFO ] [Real]Absence check using state equation in 1474 ms returned sat
[2021-06-06 14:36:20] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:20] [INFO ] [Nat]Absence check using 1000 positive place invariants in 289 ms returned sat
[2021-06-06 14:36:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:21] [INFO ] [Nat]Absence check using state equation in 1356 ms returned sat
[2021-06-06 14:36:22] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 143 ms.
[2021-06-06 14:36:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-06-06 14:36:25] [INFO ] [Real]Absence check using 1000 positive place invariants in 374 ms returned sat
[2021-06-06 14:36:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:27] [INFO ] [Real]Absence check using state equation in 1422 ms returned sat
[2021-06-06 14:36:27] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:27] [INFO ] [Nat]Absence check using 1000 positive place invariants in 344 ms returned sat
[2021-06-06 14:36:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:29] [INFO ] [Nat]Absence check using state equation in 1361 ms returned sat
[2021-06-06 14:36:29] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 124 ms.
[2021-06-06 14:36:31] [INFO ] Added : 55 causal constraints over 11 iterations in 2343 ms. Result :sat
Minimization took 530 ms.
[2021-06-06 14:36:32] [INFO ] [Real]Absence check using 1000 positive place invariants in 308 ms returned sat
[2021-06-06 14:36:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:34] [INFO ] [Real]Absence check using state equation in 1420 ms returned sat
[2021-06-06 14:36:34] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:35] [INFO ] [Nat]Absence check using 1000 positive place invariants in 283 ms returned sat
[2021-06-06 14:36:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:36] [INFO ] [Nat]Absence check using state equation in 1395 ms returned sat
[2021-06-06 14:36:36] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 144 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2021-06-06 14:36:42] [INFO ] Deduced a trap composed of 4 places in 3292 ms of which 5 ms to minimize.
[2021-06-06 14:36:42] [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 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-06-06 14:36:43] [INFO ] [Real]Absence check using 1000 positive place invariants in 356 ms returned sat
[2021-06-06 14:36:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:44] [INFO ] [Real]Absence check using state equation in 1365 ms returned sat
[2021-06-06 14:36:44] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:45] [INFO ] [Nat]Absence check using 1000 positive place invariants in 347 ms returned sat
[2021-06-06 14:36:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:46] [INFO ] [Nat]Absence check using state equation in 1384 ms returned sat
[2021-06-06 14:36:47] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 106 ms.
[2021-06-06 14:36:49] [INFO ] Added : 56 causal constraints over 12 iterations in 2641 ms. Result :sat
Minimization took 193 ms.
[2021-06-06 14:36:50] [INFO ] [Real]Absence check using 1000 positive place invariants in 390 ms returned sat
[2021-06-06 14:36:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:52] [INFO ] [Real]Absence check using state equation in 1384 ms returned sat
[2021-06-06 14:36:52] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:52] [INFO ] [Nat]Absence check using 1000 positive place invariants in 373 ms returned sat
[2021-06-06 14:36:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:54] [INFO ] [Nat]Absence check using state equation in 1348 ms returned sat
[2021-06-06 14:36:54] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 137 ms.
[2021-06-06 14:36:57] [INFO ] Added : 56 causal constraints over 12 iterations in 2737 ms. Result :sat
Minimization took 117 ms.
[2021-06-06 14:36:57] [INFO ] [Real]Absence check using 1000 positive place invariants in 363 ms returned sat
[2021-06-06 14:36:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:59] [INFO ] [Real]Absence check using state equation in 1353 ms returned sat
[2021-06-06 14:36:59] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:59] [INFO ] [Nat]Absence check using 1000 positive place invariants in 352 ms returned sat
[2021-06-06 14:36:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:37:01] [INFO ] [Nat]Absence check using state equation in 1336 ms returned sat
[2021-06-06 14:37:01] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 137 ms.
[2021-06-06 14:37:04] [INFO ] Added : 56 causal constraints over 12 iterations in 2696 ms. Result :sat
Minimization took 179 ms.
[2021-06-06 14:37:04] [INFO ] [Real]Absence check using 1000 positive place invariants in 313 ms returned sat
[2021-06-06 14:37:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:37:06] [INFO ] [Real]Absence check using state equation in 1268 ms returned sat
[2021-06-06 14:37:06] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:37:06] [INFO ] [Nat]Absence check using 1000 positive place invariants in 291 ms returned sat
[2021-06-06 14:37:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:37:08] [INFO ] [Nat]Absence check using state equation in 1360 ms returned sat
[2021-06-06 14:37:08] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 135 ms.
[2021-06-06 14:37:11] [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 8
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.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-06-06 14:37:12] [INFO ] [Real]Absence check using 1000 positive place invariants in 406 ms returned sat
[2021-06-06 14:37:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:37:13] [INFO ] [Real]Absence check using state equation in 1348 ms returned sat
[2021-06-06 14:37:13] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:37:14] [INFO ] [Nat]Absence check using 1000 positive place invariants in 368 ms returned sat
[2021-06-06 14:37:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:37:15] [INFO ] [Nat]Absence check using state equation in 1410 ms returned sat
[2021-06-06 14:37:15] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 117 ms.
[2021-06-06 14:37:18] [INFO ] Added : 56 causal constraints over 12 iterations in 2667 ms. Result :sat
Minimization took 141 ms.
[2021-06-06 14:37:19] [INFO ] [Real]Absence check using 1000 positive place invariants in 306 ms returned sat
[2021-06-06 14:37:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:37:20] [INFO ] [Real]Absence check using state equation in 1281 ms returned sat
[2021-06-06 14:37:20] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:37:21] [INFO ] [Nat]Absence check using 1000 positive place invariants in 334 ms returned sat
[2021-06-06 14:37:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:37:22] [INFO ] [Nat]Absence check using state equation in 1436 ms returned sat
[2021-06-06 14:37:22] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 139 ms.
[2021-06-06 14:37:28] [INFO ] Deduced a trap composed of 4 places in 3192 ms of which 4 ms to minimize.
[2021-06-06 14:37:28] [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 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [500, 500, 250, 500, 250, 500, 500, 500, 250, 500, 250] Max seen :[237, 203, 82, 203, 82, 237, 237, 237, 82, 237, 82]
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 190 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2021-06-06 14:37:29] [INFO ] Computed 1000 place invariants in 11 ms
Interrupted random walk after 118285 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=3 ) properties seen :{0=316, 1=356, 2=75, 3=356, 4=75, 5=316, 6=316, 7=316, 8=75, 9=316, 10=75}
Interrupted Best-First random walk after 124976 steps, including 0 resets, run timeout after 5010 ms. (steps per millisecond=24 ) properties seen :{0=145, 5=145, 6=145, 7=145, 9=145}
Interrupted Best-First random walk after 140777 steps, including 0 resets, run timeout after 5011 ms. (steps per millisecond=28 ) properties seen :{1=168, 3=168}
Interrupted Best-First random walk after 143888 steps, including 0 resets, run timeout after 5020 ms. (steps per millisecond=28 ) properties seen :{0=4, 1=5, 2=77, 3=5, 4=77, 5=4, 6=4, 7=4, 8=77, 9=4, 10=77}
Interrupted Best-First random walk after 144725 steps, including 0 resets, run timeout after 5013 ms. (steps per millisecond=28 ) properties seen :{1=174, 3=174}
Interrupted Best-First random walk after 148427 steps, including 0 resets, run timeout after 5015 ms. (steps per millisecond=29 ) properties seen :{0=4, 1=4, 2=81, 3=4, 4=81, 5=4, 6=4, 7=4, 8=81, 9=4, 10=81}
Interrupted Best-First random walk after 144072 steps, including 0 resets, run timeout after 5017 ms. (steps per millisecond=28 ) properties seen :{0=173, 5=173, 6=173, 7=173, 9=173}
Interrupted Best-First random walk after 144072 steps, including 0 resets, run timeout after 5019 ms. (steps per millisecond=28 ) properties seen :{0=173, 5=173, 6=173, 7=173, 9=173}
Interrupted Best-First random walk after 144072 steps, including 0 resets, run timeout after 5026 ms. (steps per millisecond=28 ) properties seen :{0=173, 5=173, 6=173, 7=173, 9=173}
Interrupted Best-First random walk after 155617 steps, including 0 resets, run timeout after 5008 ms. (steps per millisecond=31 ) properties seen :{0=5, 1=6, 2=84, 3=6, 4=84, 5=5, 6=5, 7=5, 8=84, 9=5, 10=84}
Interrupted Best-First random walk after 138776 steps, including 0 resets, run timeout after 5028 ms. (steps per millisecond=27 ) properties seen :{0=165, 5=165, 6=165, 7=165, 9=165}
Interrupted Best-First random walk after 151268 steps, including 0 resets, run timeout after 5014 ms. (steps per millisecond=30 ) properties seen :{0=4, 1=5, 2=83, 3=5, 4=83, 5=4, 6=4, 7=4, 8=83, 9=4, 10=83}
// Phase 1: matrix 2500 rows 2500 cols
[2021-06-06 14:38:54] [INFO ] Computed 1000 place invariants in 13 ms
[2021-06-06 14:38:54] [INFO ] [Real]Absence check using 1000 positive place invariants in 385 ms returned sat
[2021-06-06 14:38:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:38:56] [INFO ] [Real]Absence check using state equation in 1328 ms returned sat
[2021-06-06 14:38:56] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:38:57] [INFO ] [Nat]Absence check using 1000 positive place invariants in 435 ms returned sat
[2021-06-06 14:38:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:38:58] [INFO ] [Nat]Absence check using state equation in 1406 ms returned sat
[2021-06-06 14:38:58] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 138 ms.
[2021-06-06 14:39:00] [INFO ] Added : 33 causal constraints over 7 iterations in 1751 ms. Result :sat
Minimization took 674 ms.
[2021-06-06 14:39:01] [INFO ] [Real]Absence check using 1000 positive place invariants in 463 ms returned sat
[2021-06-06 14:39:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:39:03] [INFO ] [Real]Absence check using state equation in 1308 ms returned sat
[2021-06-06 14:39:03] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:39:04] [INFO ] [Nat]Absence check using 1000 positive place invariants in 372 ms returned sat
[2021-06-06 14:39:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:39:05] [INFO ] [Nat]Absence check using state equation in 1345 ms returned sat
[2021-06-06 14:39:05] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 135 ms.
[2021-06-06 14:39:07] [INFO ] Added : 26 causal constraints over 6 iterations in 1567 ms. Result :sat
Minimization took 661 ms.
[2021-06-06 14:39:08] [INFO ] [Real]Absence check using 1000 positive place invariants in 304 ms returned sat
[2021-06-06 14:39:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:39:09] [INFO ] [Real]Absence check using state equation in 1371 ms returned sat
[2021-06-06 14:39:10] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:39:10] [INFO ] [Nat]Absence check using 1000 positive place invariants in 320 ms returned sat
[2021-06-06 14:39:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:39:12] [INFO ] [Nat]Absence check using state equation in 1375 ms returned sat
[2021-06-06 14:39:12] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 125 ms.
[2021-06-06 14:39:15] [INFO ] Added : 85 causal constraints over 17 iterations in 3606 ms. Result :sat
Minimization took 1126 ms.
[2021-06-06 14:39:17] [INFO ] [Real]Absence check using 1000 positive place invariants in 474 ms returned sat
[2021-06-06 14:39:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:39:19] [INFO ] [Real]Absence check using state equation in 1439 ms returned sat
[2021-06-06 14:39:19] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:39:20] [INFO ] [Nat]Absence check using 1000 positive place invariants in 488 ms returned sat
[2021-06-06 14:39:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:39:21] [INFO ] [Nat]Absence check using state equation in 1464 ms returned sat
[2021-06-06 14:39:21] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 164 ms.
[2021-06-06 14:39:23] [INFO ] Added : 26 causal constraints over 6 iterations in 1601 ms. Result :sat
Minimization took 642 ms.
[2021-06-06 14:39:24] [INFO ] [Real]Absence check using 1000 positive place invariants in 317 ms returned sat
[2021-06-06 14:39:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:39:26] [INFO ] [Real]Absence check using state equation in 1339 ms returned sat
[2021-06-06 14:39:26] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:39:26] [INFO ] [Nat]Absence check using 1000 positive place invariants in 306 ms returned sat
[2021-06-06 14:39:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:39:28] [INFO ] [Nat]Absence check using state equation in 1453 ms returned sat
[2021-06-06 14:39:28] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 135 ms.
[2021-06-06 14:39:32] [INFO ] Added : 85 causal constraints over 17 iterations in 3771 ms. Result :sat
Minimization took 1163 ms.
[2021-06-06 14:39:34] [INFO ] [Real]Absence check using 1000 positive place invariants in 411 ms returned sat
[2021-06-06 14:39:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:39:35] [INFO ] [Real]Absence check using state equation in 1512 ms returned sat
[2021-06-06 14:39:35] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:39:36] [INFO ] [Nat]Absence check using 1000 positive place invariants in 453 ms returned sat
[2021-06-06 14:39:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:39:38] [INFO ] [Nat]Absence check using state equation in 1491 ms returned sat
[2021-06-06 14:39:38] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 133 ms.
[2021-06-06 14:39:39] [INFO ] Added : 33 causal constraints over 7 iterations in 1723 ms. Result :sat
Minimization took 751 ms.
[2021-06-06 14:39:41] [INFO ] [Real]Absence check using 1000 positive place invariants in 441 ms returned sat
[2021-06-06 14:39:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:39:42] [INFO ] [Real]Absence check using state equation in 1391 ms returned sat
[2021-06-06 14:39:43] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:39:43] [INFO ] [Nat]Absence check using 1000 positive place invariants in 433 ms returned sat
[2021-06-06 14:39:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:39:45] [INFO ] [Nat]Absence check using state equation in 1423 ms returned sat
[2021-06-06 14:39:45] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 124 ms.
[2021-06-06 14:39:47] [INFO ] Added : 33 causal constraints over 7 iterations in 1744 ms. Result :sat
Minimization took 739 ms.
[2021-06-06 14:39:48] [INFO ] [Real]Absence check using 1000 positive place invariants in 418 ms returned sat
[2021-06-06 14:39:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:39:50] [INFO ] [Real]Absence check using state equation in 1346 ms returned sat
[2021-06-06 14:39:50] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:39:50] [INFO ] [Nat]Absence check using 1000 positive place invariants in 417 ms returned sat
[2021-06-06 14:39:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:39:52] [INFO ] [Nat]Absence check using state equation in 1416 ms returned sat
[2021-06-06 14:39:52] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 139 ms.
[2021-06-06 14:39:54] [INFO ] Added : 33 causal constraints over 7 iterations in 1722 ms. Result :sat
Minimization took 603 ms.
[2021-06-06 14:39:55] [INFO ] [Real]Absence check using 1000 positive place invariants in 304 ms returned sat
[2021-06-06 14:39:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:39:56] [INFO ] [Real]Absence check using state equation in 1365 ms returned sat
[2021-06-06 14:39:56] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:39:57] [INFO ] [Nat]Absence check using 1000 positive place invariants in 323 ms returned sat
[2021-06-06 14:39:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:39:58] [INFO ] [Nat]Absence check using state equation in 1403 ms returned sat
[2021-06-06 14:39:59] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 139 ms.
[2021-06-06 14:40:02] [INFO ] Added : 85 causal constraints over 17 iterations in 3729 ms. Result :sat
Minimization took 1000 ms.
[2021-06-06 14:40:04] [INFO ] [Real]Absence check using 1000 positive place invariants in 372 ms returned sat
[2021-06-06 14:40:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:40:05] [INFO ] [Real]Absence check using state equation in 1268 ms returned sat
[2021-06-06 14:40:06] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:40:06] [INFO ] [Nat]Absence check using 1000 positive place invariants in 415 ms returned sat
[2021-06-06 14:40:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:40:07] [INFO ] [Nat]Absence check using state equation in 1216 ms returned sat
[2021-06-06 14:40:08] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 134 ms.
[2021-06-06 14:40:09] [INFO ] Added : 33 causal constraints over 7 iterations in 1677 ms. Result :sat
Minimization took 581 ms.
[2021-06-06 14:40:11] [INFO ] [Real]Absence check using 1000 positive place invariants in 315 ms returned sat
[2021-06-06 14:40:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:40:12] [INFO ] [Real]Absence check using state equation in 1284 ms returned sat
[2021-06-06 14:40:12] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:40:13] [INFO ] [Nat]Absence check using 1000 positive place invariants in 268 ms returned sat
[2021-06-06 14:40:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:40:14] [INFO ] [Nat]Absence check using state equation in 1305 ms returned sat
[2021-06-06 14:40:14] [INFO ] Computed and/alt/rep : 1500/2000/1500 causal constraints (skipped 0 transitions) in 135 ms.
[2021-06-06 14:40:17] [INFO ] Added : 85 causal constraints over 17 iterations in 3376 ms. Result :sat
Minimization took 1103 ms.
Current structural bounds on expressions (after SMT) : [500, 500, 250, 500, 250, 500, 500, 500, 250, 500, 250] Max seen :[316, 356, 84, 356, 84, 316, 316, 316, 84, 316, 84]
Incomplete Parikh walk after 59000 steps, including 110 resets, run finished after 14639 ms. (steps per millisecond=4 ) properties (out of 11) seen :1638 could not realise parikh vector
Incomplete Parikh walk after 59900 steps, including 112 resets, run finished after 16770 ms. (steps per millisecond=3 ) properties (out of 11) seen :2564 could not realise parikh vector
FORMULA Philosophers-COL-000500-UpperBounds-14 500 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000500-UpperBounds-12 500 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000500-UpperBounds-10 500 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000500-UpperBounds-09 500 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000500-UpperBounds-01 500 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 59000 steps, including 110 resets, run finished after 11369 ms. (steps per millisecond=5 ) properties (out of 6) seen :1032 could not realise parikh vector
Incomplete Parikh walk after 59900 steps, including 112 resets, run finished after 11635 ms. (steps per millisecond=5 ) properties (out of 6) seen :66 could not realise parikh vector
Incomplete Parikh walk after 59900 steps, including 112 resets, run finished after 11219 ms. (steps per millisecond=5 ) properties (out of 6) seen :70 could not realise parikh vector
Incomplete Parikh walk after 59900 steps, including 112 resets, run finished after 11921 ms. (steps per millisecond=5 ) properties (out of 6) seen :62 could not realise parikh vector
Incomplete Parikh walk after 59000 steps, including 110 resets, run finished after 11436 ms. (steps per millisecond=5 ) properties (out of 6) seen :1034 could not realise parikh vector
Incomplete Parikh walk after 57800 steps, including 107 resets, run finished after 11964 ms. (steps per millisecond=4 ) properties (out of 6) seen :1200 could not realise parikh vector
FORMULA Philosophers-COL-000500-UpperBounds-05 500 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000500-UpperBounds-02 500 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 59000 steps, including 110 resets, run finished after 8701 ms. (steps per millisecond=6 ) properties (out of 4) seen :972 could not realise parikh vector
Incomplete Parikh walk after 57800 steps, including 107 resets, run finished after 8889 ms. (steps per millisecond=6 ) properties (out of 4) seen :176 could not realise parikh vector
Incomplete Parikh walk after 59900 steps, including 112 resets, run finished after 9679 ms. (steps per millisecond=6 ) properties (out of 4) seen :44 could not realise parikh vector
Support contains 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Free-agglomeration rule (complex) applied 1000 times.
Iterating global reduction 0 with 1000 rules applied. Total rules applied 1000 place count 2500 transition count 1500
Reduce places removed 1000 places and 0 transitions.
Ensure Unique test removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Iterating post reduction 0 with 1500 rules applied. Total rules applied 2500 place count 1500 transition count 1000
Applied a total of 2500 rules in 665 ms. Remains 1500 /2500 variables (removed 1000) and now considering 1000/2500 (removed 1500) transitions.
Finished structural reductions, in 1 iterations. Remains : 1500/2500 places, 1000/2500 transitions.
// Phase 1: matrix 1000 rows 1500 cols
[2021-06-06 14:42:28] [INFO ] Computed 1000 place invariants in 5 ms
Interrupted random walk after 185754 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=6 ) properties seen :{0=161, 1=161, 2=161, 3=161}
Interrupted Best-First random walk after 122324 steps, including 0 resets, run timeout after 5009 ms. (steps per millisecond=24 ) properties seen :{0=224, 1=224, 2=224, 3=224}
Interrupted Best-First random walk after 129974 steps, including 0 resets, run timeout after 5007 ms. (steps per millisecond=25 ) properties seen :{0=221, 1=221, 2=221, 3=221}
Interrupted Best-First random walk after 126377 steps, including 0 resets, run timeout after 5006 ms. (steps per millisecond=25 ) properties seen :{0=221, 1=221, 2=221, 3=221}
Interrupted Best-First random walk after 129258 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=25 ) properties seen :{0=222, 1=222, 2=222, 3=222}
// Phase 1: matrix 1000 rows 1500 cols
[2021-06-06 14:43:18] [INFO ] Computed 1000 place invariants in 15 ms
[2021-06-06 14:43:18] [INFO ] [Real]Absence check using 1000 positive place invariants in 346 ms returned sat
[2021-06-06 14:43:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:43:19] [INFO ] [Real]Absence check using state equation in 560 ms returned sat
[2021-06-06 14:43:19] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:43:19] [INFO ] [Nat]Absence check using 1000 positive place invariants in 357 ms returned sat
[2021-06-06 14:43:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:43:20] [INFO ] [Nat]Absence check using state equation in 556 ms returned sat
[2021-06-06 14:43:20] [INFO ] Computed and/alt/rep : 500/500/500 causal constraints (skipped 0 transitions) in 42 ms.
[2021-06-06 14:43:20] [INFO ] Added : 0 causal constraints over 0 iterations in 163 ms. Result :sat
Minimization took 528 ms.
[2021-06-06 14:43:21] [INFO ] [Real]Absence check using 1000 positive place invariants in 340 ms returned sat
[2021-06-06 14:43:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:43:22] [INFO ] [Real]Absence check using state equation in 616 ms returned sat
[2021-06-06 14:43:22] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:43:22] [INFO ] [Nat]Absence check using 1000 positive place invariants in 370 ms returned sat
[2021-06-06 14:43:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:43:23] [INFO ] [Nat]Absence check using state equation in 608 ms returned sat
[2021-06-06 14:43:23] [INFO ] Computed and/alt/rep : 500/500/500 causal constraints (skipped 0 transitions) in 54 ms.
[2021-06-06 14:43:23] [INFO ] Added : 0 causal constraints over 0 iterations in 187 ms. Result :sat
Minimization took 428 ms.
[2021-06-06 14:43:24] [INFO ] [Real]Absence check using 1000 positive place invariants in 345 ms returned sat
[2021-06-06 14:43:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:43:25] [INFO ] [Real]Absence check using state equation in 539 ms returned sat
[2021-06-06 14:43:25] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:43:25] [INFO ] [Nat]Absence check using 1000 positive place invariants in 343 ms returned sat
[2021-06-06 14:43:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:43:26] [INFO ] [Nat]Absence check using state equation in 630 ms returned sat
[2021-06-06 14:43:26] [INFO ] Computed and/alt/rep : 500/500/500 causal constraints (skipped 0 transitions) in 54 ms.
[2021-06-06 14:43:26] [INFO ] Added : 0 causal constraints over 0 iterations in 190 ms. Result :sat
Minimization took 488 ms.
[2021-06-06 14:43:27] [INFO ] [Real]Absence check using 1000 positive place invariants in 310 ms returned sat
[2021-06-06 14:43:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:43:28] [INFO ] [Real]Absence check using state equation in 608 ms returned sat
[2021-06-06 14:43:28] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:43:28] [INFO ] [Nat]Absence check using 1000 positive place invariants in 324 ms returned sat
[2021-06-06 14:43:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:43:29] [INFO ] [Nat]Absence check using state equation in 616 ms returned sat
[2021-06-06 14:43:29] [INFO ] Computed and/alt/rep : 500/500/500 causal constraints (skipped 0 transitions) in 48 ms.
[2021-06-06 14:43:29] [INFO ] Added : 0 causal constraints over 0 iterations in 188 ms. Result :sat
Minimization took 532 ms.
Current structural bounds on expressions (after SMT) : [250, 250, 250, 250] Max seen :[243, 243, 243, 243]
Incomplete Parikh walk after 25000 steps, including 98 resets, run finished after 3586 ms. (steps per millisecond=6 ) properties (out of 4) seen :1000 could not realise parikh vector
FORMULA Philosophers-COL-000500-UpperBounds-15 250 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000500-UpperBounds-13 250 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000500-UpperBounds-06 250 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000500-UpperBounds-03 250 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
BK_STOP 1622990615131
--------------------
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="Philosophers-COL-000500"
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 Philosophers-COL-000500, 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 r140-tall-162298995800043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000500.tgz
mv Philosophers-COL-000500 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;