About the Execution of 2022-gold for Philosophers-COL-005000
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r319-tall-167873969800020.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is Philosophers-COL-005000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r319-tall-167873969800020
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 8.3K Feb 25 21:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 21:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 17:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 17:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 08:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 08:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 03:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Feb 26 03:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 227K Mar 5 18:23 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-005000-UpperBounds-00
FORMULA_NAME Philosophers-COL-005000-UpperBounds-01
FORMULA_NAME Philosophers-COL-005000-UpperBounds-02
FORMULA_NAME Philosophers-COL-005000-UpperBounds-03
FORMULA_NAME Philosophers-COL-005000-UpperBounds-04
FORMULA_NAME Philosophers-COL-005000-UpperBounds-05
FORMULA_NAME Philosophers-COL-005000-UpperBounds-06
FORMULA_NAME Philosophers-COL-005000-UpperBounds-07
FORMULA_NAME Philosophers-COL-005000-UpperBounds-08
FORMULA_NAME Philosophers-COL-005000-UpperBounds-09
FORMULA_NAME Philosophers-COL-005000-UpperBounds-10
FORMULA_NAME Philosophers-COL-005000-UpperBounds-11
FORMULA_NAME Philosophers-COL-005000-UpperBounds-12
FORMULA_NAME Philosophers-COL-005000-UpperBounds-13
FORMULA_NAME Philosophers-COL-005000-UpperBounds-14
FORMULA_NAME Philosophers-COL-005000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678866330831
Running Version 202205111006
[2023-03-15 07:45:32] [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]
[2023-03-15 07:45:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 07:45:32] [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.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 07:45:32] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 07:45:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 840 ms
[2023-03-15 07:45:33] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 25000 PT places and 25000.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-15 07:45:33] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 6 ms.
[2023-03-15 07:45:33] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 5 rows 5 cols
[2023-03-15 07:45:33] [INFO ] Computed 2 place invariants in 4 ms
FORMULA Philosophers-COL-005000-UpperBounds-15 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-005000-UpperBounds-10 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-005000-UpperBounds-08 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-005000-UpperBounds-07 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-005000-UpperBounds-05 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-005000-UpperBounds-03 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 5 rows 5 cols
[2023-03-15 07:45:33] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-15 07:45:33] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 07:45:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:33] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-15 07:45:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:33] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-15 07:45:33] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 07:45:33] [INFO ] Added : 0 causal constraints over 0 iterations in 36 ms. Result :sat
Minimization took 8 ms.
[2023-03-15 07:45:33] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 07:45:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:33] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-15 07:45:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:33] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-15 07:45:33] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-15 07:45:33] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 3 ms.
[2023-03-15 07:45:33] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-15 07:45:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:33] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 07:45:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:33] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-15 07:45:33] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-15 07:45:33] [INFO ] Added : 0 causal constraints over 0 iterations in 18 ms. Result :sat
Minimization took 2 ms.
[2023-03-15 07:45:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:33] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 07:45:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:33] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-15 07:45:33] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-15 07:45:33] [INFO ] Added : 1 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 3 ms.
[2023-03-15 07:45:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:33] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-15 07:45:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:33] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-15 07:45:33] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-15 07:45:33] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2023-03-15 07:45:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:33] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-15 07:45:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:33] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-15 07:45:33] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-15 07:45:34] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 2 ms.
[2023-03-15 07:45:34] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-15 07:45:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:34] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-15 07:45:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-15 07:45:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:34] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-15 07:45:34] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-15 07:45:34] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 1 ms.
[2023-03-15 07:45:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:34] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-15 07:45:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-15 07:45:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:34] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2023-03-15 07:45:34] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-15 07:45:34] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2023-03-15 07:45:34] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-15 07:45:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:34] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-15 07:45:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2023-03-15 07:45:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:34] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-15 07:45:34] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-15 07:45:34] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 2 ms.
[2023-03-15 07:45:34] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-15 07:45:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:34] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-15 07:45:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:34] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-15 07:45:34] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 07:45:34] [INFO ] Added : 1 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [5000, 2500, 5000, 2500, 2500, 5000, 5000, 2500, 5000, 2500]
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 5000) 5000) 5000)]] contains successor/predecessor on variables of sort Philo
[2023-03-15 07:45:34] [INFO ] Unfolded HLPN to a Petri net with 25000 places and 25000 transitions 80000 arcs in 498 ms.
[2023-03-15 07:45:34] [INFO ] Unfolded 10 HLPN properties in 4 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28703 ms. (steps per millisecond=0 ) properties (out of 10) seen :7854
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3481 ms. (steps per millisecond=2 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3571 ms. (steps per millisecond=2 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3530 ms. (steps per millisecond=2 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3615 ms. (steps per millisecond=2 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3487 ms. (steps per millisecond=2 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3397 ms. (steps per millisecond=2 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3361 ms. (steps per millisecond=2 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3379 ms. (steps per millisecond=2 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3366 ms. (steps per millisecond=2 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3343 ms. (steps per millisecond=2 ) properties (out of 10) seen :0
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-15 07:46:38] [INFO ] Computed 10000 place invariants in 145 ms
[2023-03-15 07:46:43] [INFO ] [Real]Absence check using 10000 positive place invariants in 1816 ms returned unknown
[2023-03-15 07:46:48] [INFO ] [Real]Absence check using 10000 positive place invariants in 1981 ms returned unknown
[2023-03-15 07:46:53] [INFO ] [Real]Absence check using 10000 positive place invariants in 1447 ms returned unknown
[2023-03-15 07:46:58] [INFO ] [Real]Absence check using 10000 positive place invariants in 2179 ms returned unknown
[2023-03-15 07:47:03] [INFO ] [Real]Absence check using 10000 positive place invariants in 1931 ms returned unknown
[2023-03-15 07:47:08] [INFO ] [Real]Absence check using 10000 positive place invariants in 2117 ms returned unknown
[2023-03-15 07:47:13] [INFO ] [Real]Absence check using 10000 positive place invariants in 2059 ms returned unknown
[2023-03-15 07:47:18] [INFO ] [Real]Absence check using 10000 positive place invariants in 2037 ms returned unknown
[2023-03-15 07:47:23] [INFO ] [Real]Absence check using 10000 positive place invariants in 2087 ms returned unknown
[2023-03-15 07:47: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: Broken pipe ... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.assertInvariants(DeadlockTester.java:2342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:888)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [5000, 2500, 5000, 2500, 2500, 5000, 5000, 2500, 5000, 2500] Max seen :[1127, 423, 1127, 423, 423, 1179, 1179, 423, 1127, 423]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 2585 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-15 07:47:31] [INFO ] Computed 10000 place invariants in 98 ms
Finished random walk after 12135 steps, including 0 resets, run visited all 10 properties in 30001 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 17002 steps, including 0 resets, run timeout after 5193 ms. (steps per millisecond=3 ) properties seen 3
Interrupted Best-First random walk after 17002 steps, including 0 resets, run timeout after 5212 ms. (steps per millisecond=3 ) properties seen 5
Interrupted Best-First random walk after 15002 steps, including 0 resets, run timeout after 5036 ms. (steps per millisecond=2 ) properties seen 3
Interrupted Best-First random walk after 15002 steps, including 0 resets, run timeout after 5104 ms. (steps per millisecond=2 ) properties seen 2
Interrupted Best-First random walk after 15002 steps, including 0 resets, run timeout after 5101 ms. (steps per millisecond=2 ) properties seen 5
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5068 ms. (steps per millisecond=3 ) properties seen 2
Interrupted Best-First random walk after 22001 steps, including 0 resets, run timeout after 5216 ms. (steps per millisecond=4 ) properties seen 4
Finished Best-First random walk after 21001 steps, including 0 resets, run visited all 10 properties in 5066 ms. (steps per millisecond=4 )
Interrupted Best-First random walk after 22001 steps, including 0 resets, run timeout after 5063 ms. (steps per millisecond=4 ) properties seen 6
Finished Best-First random walk after 22001 steps, including 0 resets, run visited all 10 properties in 5100 ms. (steps per millisecond=4 )
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-15 07:48:53] [INFO ] Computed 10000 place invariants in 67 ms
[2023-03-15 07:49:09] [INFO ] [Real]Absence check using 10000 positive place invariants in 12776 ms returned sat
[2023-03-15 07:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:49:38] [INFO ] [Real]Absence check using state equation in 29139 ms returned unknown
[2023-03-15 07:49:50] [INFO ] [Real]Absence check using 10000 positive place invariants in 8794 ms returned sat
[2023-03-15 07:49:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:50:23] [INFO ] [Real]Absence check using state equation in 33089 ms returned unknown
[2023-03-15 07:50:39] [INFO ] [Real]Absence check using 10000 positive place invariants in 13699 ms returned sat
[2023-03-15 07:50:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:51:08] [INFO ] [Real]Absence check using state equation in 28316 ms returned unknown
[2023-03-15 07:51:20] [INFO ] [Real]Absence check using 10000 positive place invariants in 8947 ms returned sat
[2023-03-15 07:51:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:51:53] [INFO ] [Real]Absence check using state equation in 32948 ms returned unknown
[2023-03-15 07:52:05] [INFO ] [Real]Absence check using 10000 positive place invariants in 9339 ms returned sat
[2023-03-15 07:52:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:52:38] [INFO ] [Real]Absence check using state equation in 32683 ms returned unknown
[2023-03-15 07:52:55] [INFO ] [Real]Absence check using 10000 positive place invariants in 14467 ms returned sat
[2023-03-15 07:52:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:53:23] [INFO ] [Real]Absence check using state equation in 27558 ms returned unknown
[2023-03-15 07:53:39] [INFO ] [Real]Absence check using 10000 positive place invariants in 12798 ms returned sat
[2023-03-15 07:53:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:54:08] [INFO ] [Real]Absence check using state equation in 29269 ms returned unknown
[2023-03-15 07:54:21] [INFO ] [Real]Absence check using 10000 positive place invariants in 9651 ms returned sat
[2023-03-15 07:54:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:54:53] [INFO ] [Real]Absence check using state equation in 32327 ms returned unknown
[2023-03-15 07:55:09] [INFO ] [Real]Absence check using 10000 positive place invariants in 13190 ms returned sat
[2023-03-15 07:55:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:55:38] [INFO ] [Real]Absence check using state equation in 28843 ms returned unknown
[2023-03-15 07:55:51] [INFO ] [Real]Absence check using 10000 positive place invariants in 9927 ms returned sat
[2023-03-15 07:55:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:56:23] [INFO ] [Real]Absence check using state equation in 31861 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 2500, 5000, 2500, 2500, 5000, 5000, 2500, 5000, 2500] Max seen :[1546, 701, 1546, 701, 701, 1810, 1810, 701, 1546, 701]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 2473 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1709 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-15 07:56:27] [INFO ] Computed 10000 place invariants in 92 ms
[2023-03-15 07:56:29] [INFO ] Implicit Places using invariants in 2106 ms returned []
Implicit Place search using SMT only with invariants took 2108 ms to find 0 implicit places.
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-15 07:56:29] [INFO ] Computed 10000 place invariants in 60 ms
[2023-03-15 07:56:31] [INFO ] Dead Transitions using invariants and state equation in 2072 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-15 07:56:32] [INFO ] Computed 10000 place invariants in 90 ms
Finished random walk after 11711 steps, including 0 resets, run visited all 10 properties in 30002 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 22001 steps, including 0 resets, run timeout after 5062 ms. (steps per millisecond=4 ) properties seen 8
Interrupted Best-First random walk after 22001 steps, including 0 resets, run timeout after 5123 ms. (steps per millisecond=4 ) properties seen 7
Interrupted Best-First random walk after 21001 steps, including 0 resets, run timeout after 5009 ms. (steps per millisecond=4 ) properties seen 6
Finished Best-First random walk after 22001 steps, including 0 resets, run visited all 10 properties in 5201 ms. (steps per millisecond=4 )
Finished Best-First random walk after 22001 steps, including 0 resets, run visited all 10 properties in 5187 ms. (steps per millisecond=4 )
Interrupted Best-First random walk after 22001 steps, including 0 resets, run timeout after 5145 ms. (steps per millisecond=4 ) properties seen 4
Interrupted Best-First random walk after 22001 steps, including 0 resets, run timeout after 5168 ms. (steps per millisecond=4 ) properties seen 4
Finished Best-First random walk after 22001 steps, including 0 resets, run visited all 10 properties in 5187 ms. (steps per millisecond=4 )
Interrupted Best-First random walk after 22001 steps, including 0 resets, run timeout after 5164 ms. (steps per millisecond=4 ) properties seen 8
Interrupted Best-First random walk after 22001 steps, including 0 resets, run timeout after 5155 ms. (steps per millisecond=4 ) properties seen 7
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-15 07:57:53] [INFO ] Computed 10000 place invariants in 55 ms
[2023-03-15 07:58:08] [INFO ] [Real]Absence check using 10000 positive place invariants in 11739 ms returned sat
[2023-03-15 07:58:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:58:38] [INFO ] [Real]Absence check using state equation in 30221 ms returned unknown
[2023-03-15 07:58:51] [INFO ] [Real]Absence check using 10000 positive place invariants in 9878 ms returned sat
[2023-03-15 07:58:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:59:23] [INFO ] [Real]Absence check using state equation in 31997 ms returned unknown
[2023-03-15 07:59:38] [INFO ] [Real]Absence check using 10000 positive place invariants in 11926 ms returned sat
[2023-03-15 07:59:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:00:08] [INFO ] [Real]Absence check using state equation in 30144 ms returned unknown
[2023-03-15 08:00:19] [INFO ] [Real]Absence check using 10000 positive place invariants in 7986 ms returned sat
[2023-03-15 08:00:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:00:53] [INFO ] [Real]Absence check using state equation in 34135 ms returned unknown
[2023-03-15 08:01:07] [INFO ] [Real]Absence check using 10000 positive place invariants in 10086 ms returned sat
[2023-03-15 08:01:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:01:38] [INFO ] [Real]Absence check using state equation in 31807 ms returned unknown
[2023-03-15 08:01:54] [INFO ] [Real]Absence check using 10000 positive place invariants in 12705 ms returned sat
[2023-03-15 08:01:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:02:23] [INFO ] [Real]Absence check using state equation in 29456 ms returned unknown
[2023-03-15 08:02:40] [INFO ] [Real]Absence check using 10000 positive place invariants in 13224 ms returned sat
[2023-03-15 08:02:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:03:08] [INFO ] [Real]Absence check using state equation in 28901 ms returned unknown
[2023-03-15 08:03:21] [INFO ] [Real]Absence check using 10000 positive place invariants in 9471 ms returned sat
[2023-03-15 08:03:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:03:53] [INFO ] [Real]Absence check using state equation in 32641 ms returned unknown
[2023-03-15 08:04:10] [INFO ] [Real]Absence check using 10000 positive place invariants in 13029 ms returned sat
[2023-03-15 08:04:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:04:39] [INFO ] [Real]Absence check using state equation in 28803 ms returned unknown
[2023-03-15 08:04:51] [INFO ] [Real]Absence check using 10000 positive place invariants in 9065 ms returned sat
[2023-03-15 08:04:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:05:24] [INFO ] [Real]Absence check using state equation in 33074 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 2500, 5000, 2500, 2500, 5000, 5000, 2500, 5000, 2500] Max seen :[1631, 712, 1631, 712, 712, 1810, 1810, 712, 1631, 712]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1616 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1606 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-15 08:05:27] [INFO ] Computed 10000 place invariants in 48 ms
[2023-03-15 08:05:29] [INFO ] Implicit Places using invariants in 1912 ms returned []
Implicit Place search using SMT only with invariants took 1913 ms to find 0 implicit places.
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-15 08:05:29] [INFO ] Computed 10000 place invariants in 51 ms
[2023-03-15 08:05:31] [INFO ] Dead Transitions using invariants and state equation in 2040 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-15 08:05:31] [INFO ] Computed 10000 place invariants in 44 ms
Finished random walk after 11831 steps, including 0 resets, run visited all 10 properties in 30001 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 23001 steps, including 0 resets, run timeout after 5200 ms. (steps per millisecond=4 ) properties seen 6
Finished Best-First random walk after 23001 steps, including 0 resets, run visited all 10 properties in 5205 ms. (steps per millisecond=4 )
Interrupted Best-First random walk after 23001 steps, including 0 resets, run timeout after 5222 ms. (steps per millisecond=4 ) properties seen 6
Interrupted Best-First random walk after 22001 steps, including 0 resets, run timeout after 5010 ms. (steps per millisecond=4 ) properties seen 7
Finished Best-First random walk after 22001 steps, including 0 resets, run visited all 10 properties in 5028 ms. (steps per millisecond=4 )
Interrupted Best-First random walk after 22001 steps, including 0 resets, run timeout after 5004 ms. (steps per millisecond=4 ) properties seen 4
Interrupted Best-First random walk after 23001 steps, including 0 resets, run timeout after 5216 ms. (steps per millisecond=4 ) properties seen 4
Finished Best-First random walk after 22001 steps, including 0 resets, run visited all 10 properties in 5026 ms. (steps per millisecond=4 )
Interrupted Best-First random walk after 22001 steps, including 0 resets, run timeout after 5002 ms. (steps per millisecond=4 ) properties seen 6
Interrupted Best-First random walk after 23001 steps, including 0 resets, run timeout after 5224 ms. (steps per millisecond=4 ) properties seen 7
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-15 08:06:52] [INFO ] Computed 10000 place invariants in 62 ms
[2023-03-15 08:07:07] [INFO ] [Real]Absence check using 10000 positive place invariants in 11761 ms returned sat
[2023-03-15 08:07:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:07:37] [INFO ] [Real]Absence check using state equation in 30143 ms returned unknown
[2023-03-15 08:07:50] [INFO ] [Real]Absence check using 10000 positive place invariants in 9781 ms returned sat
[2023-03-15 08:07:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:08:22] [INFO ] [Real]Absence check using state equation in 32135 ms returned unknown
[2023-03-15 08:08:37] [INFO ] [Real]Absence check using 10000 positive place invariants in 11830 ms returned sat
[2023-03-15 08:08:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:09:07] [INFO ] [Real]Absence check using state equation in 30204 ms returned unknown
[2023-03-15 08:09:19] [INFO ] [Real]Absence check using 10000 positive place invariants in 8970 ms returned sat
[2023-03-15 08:09:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:09:52] [INFO ] [Real]Absence check using state equation in 32813 ms returned unknown
[2023-03-15 08:10:06] [INFO ] [Real]Absence check using 10000 positive place invariants in 10755 ms returned sat
[2023-03-15 08:10:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:10:37] [INFO ] [Real]Absence check using state equation in 31045 ms returned unknown
[2023-03-15 08:10:58] [INFO ] [Real]Absence check using 10000 positive place invariants in 16930 ms returned sat
[2023-03-15 08:10:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:11:22] [INFO ] [Real]Absence check using state equation in 24888 ms returned unknown
[2023-03-15 08:11:38] [INFO ] [Real]Absence check using 10000 positive place invariants in 12713 ms returned sat
[2023-03-15 08:11:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:12:07] [INFO ] [Real]Absence check using state equation in 29223 ms returned unknown
[2023-03-15 08:12:20] [INFO ] [Real]Absence check using 10000 positive place invariants in 9885 ms returned sat
[2023-03-15 08:12:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:12:52] [INFO ] [Real]Absence check using state equation in 32225 ms returned unknown
[2023-03-15 08:13:11] [INFO ] [Real]Absence check using 10000 positive place invariants in 15179 ms returned sat
[2023-03-15 08:13:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:13:38] [INFO ] [Real]Absence check using state equation in 26843 ms returned unknown
[2023-03-15 08:13:51] [INFO ] [Real]Absence check using 10000 positive place invariants in 10055 ms returned sat
[2023-03-15 08:13:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:14:23] [INFO ] [Real]Absence check using state equation in 31755 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 2500, 5000, 2500, 2500, 5000, 5000, 2500, 5000, 2500] Max seen :[1631, 730, 1631, 730, 730, 1810, 1810, 730, 1631, 730]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1711 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1733 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-15 08:14:26] [INFO ] Computed 10000 place invariants in 67 ms
[2023-03-15 08:14:28] [INFO ] Implicit Places using invariants in 2057 ms returned []
Implicit Place search using SMT only with invariants took 2083 ms to find 0 implicit places.
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-15 08:14:28] [INFO ] Computed 10000 place invariants in 55 ms
[2023-03-15 08:14:30] [INFO ] Dead Transitions using invariants and state equation in 2050 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-15 08:14:30] [INFO ] Computed 10000 place invariants in 66 ms
Finished random walk after 12012 steps, including 0 resets, run visited all 10 properties in 30002 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 22001 steps, including 0 resets, run timeout after 5115 ms. (steps per millisecond=4 ) properties seen 6
Finished Best-First random walk after 22001 steps, including 0 resets, run visited all 10 properties in 5035 ms. (steps per millisecond=4 )
Interrupted Best-First random walk after 22001 steps, including 0 resets, run timeout after 5009 ms. (steps per millisecond=4 ) properties seen 8
Finished Best-First random walk after 22001 steps, including 0 resets, run visited all 10 properties in 5182 ms. (steps per millisecond=4 )
Interrupted Best-First random walk after 22001 steps, including 0 resets, run timeout after 5169 ms. (steps per millisecond=4 ) properties seen 7
Interrupted Best-First random walk after 22001 steps, including 0 resets, run timeout after 5049 ms. (steps per millisecond=4 ) properties seen 4
Interrupted Best-First random walk after 22001 steps, including 0 resets, run timeout after 5025 ms. (steps per millisecond=4 ) properties seen 4
Interrupted Best-First random walk after 22001 steps, including 0 resets, run timeout after 5011 ms. (steps per millisecond=4 ) properties seen 7
Interrupted Best-First random walk after 22001 steps, including 0 resets, run timeout after 5002 ms. (steps per millisecond=4 ) properties seen 6
Interrupted Best-First random walk after 22001 steps, including 0 resets, run timeout after 5063 ms. (steps per millisecond=4 ) properties seen 7
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-15 08:15:51] [INFO ] Computed 10000 place invariants in 65 ms
[2023-03-15 08:16:06] [INFO ] [Real]Absence check using 10000 positive place invariants in 11613 ms returned sat
[2023-03-15 08:16:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:16:36] [INFO ] [Real]Absence check using state equation in 30432 ms returned unknown
[2023-03-15 08:16:50] [INFO ] [Real]Absence check using 10000 positive place invariants in 10431 ms returned sat
[2023-03-15 08:16:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:17:21] [INFO ] [Real]Absence check using state equation in 31492 ms returned unknown
[2023-03-15 08:17:38] [INFO ] [Real]Absence check using 10000 positive place invariants in 13799 ms returned sat
[2023-03-15 08:17:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:18:06] [INFO ] [Real]Absence check using state equation in 28279 ms returned unknown
[2023-03-15 08:18:21] [INFO ] [Real]Absence check using 10000 positive place invariants in 11773 ms returned sat
[2023-03-15 08:18:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:18:51] [INFO ] [Real]Absence check using state equation in 30293 ms returned unknown
[2023-03-15 08:19:06] [INFO ] [Real]Absence check using 10000 positive place invariants in 11583 ms returned sat
[2023-03-15 08:19:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:19:36] [INFO ] [Real]Absence check using state equation in 30452 ms returned unknown
[2023-03-15 08:19:54] [INFO ] [Real]Absence check using 10000 positive place invariants in 14716 ms returned sat
[2023-03-15 08:19:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:20:21] [INFO ] [Real]Absence check using state equation in 27438 ms returned unknown
[2023-03-15 08:20:41] [INFO ] [Real]Absence check using 10000 positive place invariants in 16517 ms returned sat
[2023-03-15 08:20:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:21:06] [INFO ] [Real]Absence check using state equation in 25350 ms returned unknown
[2023-03-15 08:21:24] [INFO ] [Real]Absence check using 10000 positive place invariants in 14345 ms returned sat
[2023-03-15 08:21:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:21:51] [INFO ] [Real]Absence check using state equation in 27453 ms returned unknown
[2023-03-15 08:22:09] [INFO ] [Real]Absence check using 10000 positive place invariants in 14901 ms returned sat
[2023-03-15 08:22:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:22:37] [INFO ] [Real]Absence check using state equation in 27242 ms returned unknown
[2023-03-15 08:22:52] [INFO ] [Real]Absence check using 10000 positive place invariants in 12670 ms returned sat
[2023-03-15 08:22:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:23:22] [INFO ] [Real]Absence check using state equation in 29388 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 2500, 5000, 2500, 2500, 5000, 5000, 2500, 5000, 2500] Max seen :[1672, 730, 1672, 730, 730, 1810, 1810, 730, 1672, 730]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1591 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1546 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-15 08:23:25] [INFO ] Computed 10000 place invariants in 65 ms
[2023-03-15 08:23:27] [INFO ] Implicit Places using invariants in 2176 ms returned []
Implicit Place search using SMT only with invariants took 2178 ms to find 0 implicit places.
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-15 08:23:27] [INFO ] Computed 10000 place invariants in 69 ms
[2023-03-15 08:23:29] [INFO ] Dead Transitions using invariants and state equation in 2050 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-15 08:23:29] [INFO ] Computed 10000 place invariants in 61 ms
Finished random walk after 11303 steps, including 0 resets, run visited all 10 properties in 30002 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 22001 steps, including 0 resets, run timeout after 5115 ms. (steps per millisecond=4 ) properties seen 6
Finished Best-First random walk after 22001 steps, including 0 resets, run visited all 10 properties in 5084 ms. (steps per millisecond=4 )
Interrupted Best-First random walk after 22001 steps, including 0 resets, run timeout after 5086 ms. (steps per millisecond=4 ) properties seen 8
Finished Best-First random walk after 22001 steps, including 0 resets, run visited all 10 properties in 5039 ms. (steps per millisecond=4 )
Finished Best-First random walk after 22001 steps, including 0 resets, run visited all 10 properties in 5186 ms. (steps per millisecond=4 )
Interrupted Best-First random walk after 22001 steps, including 0 resets, run timeout after 5064 ms. (steps per millisecond=4 ) properties seen 4
Interrupted Best-First random walk after 22001 steps, including 0 resets, run timeout after 5077 ms. (steps per millisecond=4 ) properties seen 4
Interrupted Best-First random walk after 22001 steps, including 0 resets, run timeout after 5045 ms. (steps per millisecond=4 ) properties seen 7
Interrupted Best-First random walk after 22001 steps, including 0 resets, run timeout after 5037 ms. (steps per millisecond=4 ) properties seen 8
Finished Best-First random walk after 23001 steps, including 0 resets, run visited all 10 properties in 5252 ms. (steps per millisecond=4 )
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-15 08:24:50] [INFO ] Computed 10000 place invariants in 53 ms
[2023-03-15 08:25:05] [INFO ] [Real]Absence check using 10000 positive place invariants in 11759 ms returned sat
[2023-03-15 08:25:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:25:35] [INFO ] [Real]Absence check using state equation in 30358 ms returned unknown
[2023-03-15 08:25:47] [INFO ] [Real]Absence check using 10000 positive place invariants in 8775 ms returned sat
[2023-03-15 08:25:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:26:20] [INFO ] [Real]Absence check using state equation in 33384 ms returned unknown
[2023-03-15 08:26:37] [INFO ] [Real]Absence check using 10000 positive place invariants in 14131 ms returned sat
[2023-03-15 08:26:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:27:05] [INFO ] [Real]Absence check using state equation in 27981 ms returned unknown
[2023-03-15 08:27:17] [INFO ] [Real]Absence check using 10000 positive place invariants in 8448 ms returned sat
[2023-03-15 08:27:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:27:50] [INFO ] [Real]Absence check using state equation in 33645 ms returned unknown
[2023-03-15 08:28:03] [INFO ] [Real]Absence check using 10000 positive place invariants in 9126 ms returned sat
[2023-03-15 08:28:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:28:35] [INFO ] [Real]Absence check using state equation in 32740 ms returned unknown
[2023-03-15 08:28:53] [INFO ] [Real]Absence check using 10000 positive place invariants in 14618 ms returned sat
[2023-03-15 08:28:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:29:20] [INFO ] [Real]Absence check using state equation in 27218 ms returned unknown
[2023-03-15 08:29:38] [INFO ] [Real]Absence check using 10000 positive place invariants in 14364 ms returned sat
[2023-03-15 08:29:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:30:05] [INFO ] [Real]Absence check using state equation in 27650 ms returned unknown
[2023-03-15 08:30:18] [INFO ] [Real]Absence check using 10000 positive place invariants in 9406 ms returned sat
[2023-03-15 08:30:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:30:50] [INFO ] [Real]Absence check using state equation in 32738 ms returned unknown
[2023-03-15 08:31:07] [INFO ] [Real]Absence check using 10000 positive place invariants in 13312 ms returned sat
[2023-03-15 08:31:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:31:36] [INFO ] [Real]Absence check using state equation in 28804 ms returned unknown
[2023-03-15 08:31:48] [INFO ] [Real]Absence check using 10000 positive place invariants in 9286 ms returned sat
[2023-03-15 08:31:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:32:21] [INFO ] [Real]Absence check using state equation in 32566 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 2500, 5000, 2500, 2500, 5000, 5000, 2500, 5000, 2500] Max seen :[1672, 739, 1672, 739, 739, 1810, 1810, 739, 1672, 739]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1670 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1690 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-15 08:32:24] [INFO ] Computed 10000 place invariants in 69 ms
[2023-03-15 08:32:26] [INFO ] Implicit Places using invariants in 2117 ms returned []
Implicit Place search using SMT only with invariants took 2119 ms to find 0 implicit places.
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-15 08:32:26] [INFO ] Computed 10000 place invariants in 49 ms
[2023-03-15 08:32:28] [INFO ] Dead Transitions using invariants and state equation in 2257 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-15 08:32:28] [INFO ] Computed 10000 place invariants in 53 ms
Finished random walk after 11780 steps, including 0 resets, run visited all 10 properties in 30002 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 22001 steps, including 0 resets, run timeout after 5205 ms. (steps per millisecond=4 ) properties seen 6
Finished Best-First random walk after 21001 steps, including 0 resets, run visited all 10 properties in 5011 ms. (steps per millisecond=4 )
Interrupted Best-First random walk after 21001 steps, including 0 resets, run timeout after 5007 ms. (steps per millisecond=4 ) properties seen 8
Interrupted Best-First random walk after 22001 steps, including 0 resets, run timeout after 5197 ms. (steps per millisecond=4 ) properties seen 7
Interrupted Best-First random walk after 21001 steps, including 0 resets, run timeout after 5032 ms. (steps per millisecond=4 ) properties seen 7
Interrupted Best-First random walk after 22001 steps, including 0 resets, run timeout after 5061 ms. (steps per millisecond=4 ) properties seen 4
Interrupted Best-First random walk after 21001 steps, including 0 resets, run timeout after 5021 ms. (steps per millisecond=4 ) properties seen 4
Finished Best-First random walk after 21001 steps, including 0 resets, run visited all 10 properties in 5095 ms. (steps per millisecond=4 )
Interrupted Best-First random walk after 21001 steps, including 0 resets, run timeout after 5053 ms. (steps per millisecond=4 ) properties seen 8
Finished Best-First random walk after 21001 steps, including 0 resets, run visited all 10 properties in 5086 ms. (steps per millisecond=4 )
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-15 08:33:49] [INFO ] Computed 10000 place invariants in 79 ms
[2023-03-15 08:34:03] [INFO ] [Real]Absence check using 10000 positive place invariants in 11144 ms returned sat
[2023-03-15 08:34:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:34:34] [INFO ] [Real]Absence check using state equation in 30926 ms returned unknown
[2023-03-15 08:34:49] [INFO ] [Real]Absence check using 10000 positive place invariants in 11516 ms returned sat
[2023-03-15 08:34:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:35:19] [INFO ] [Real]Absence check using state equation in 30547 ms returned unknown
[2023-03-15 08:35:35] [INFO ] [Real]Absence check using 10000 positive place invariants in 12555 ms returned sat
[2023-03-15 08:35:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:36:04] [INFO ] [Real]Absence check using state equation in 29357 ms returned unknown
[2023-03-15 08:36:20] [INFO ] [Real]Absence check using 10000 positive place invariants in 12562 ms returned sat
[2023-03-15 08:36:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:36:50] [INFO ] [Real]Absence check using state equation in 29262 ms returned unknown
[2023-03-15 08:37:04] [INFO ] [Real]Absence check using 10000 positive place invariants in 11157 ms returned sat
[2023-03-15 08:37:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:37:35] [INFO ] [Real]Absence check using state equation in 30742 ms returned unknown
[2023-03-15 08:37:53] [INFO ] [Real]Absence check using 10000 positive place invariants in 15242 ms returned sat
[2023-03-15 08:37:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:38:20] [INFO ] [Real]Absence check using state equation in 26736 ms returned unknown
[2023-03-15 08:38:37] [INFO ] [Real]Absence check using 10000 positive place invariants in 14162 ms returned sat
[2023-03-15 08:38:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:39:05] [INFO ] [Real]Absence check using state equation in 27797 ms returned unknown
[2023-03-15 08:39:17] [INFO ] [Real]Absence check using 10000 positive place invariants in 9707 ms returned sat
[2023-03-15 08:39:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:39:50] [INFO ] [Real]Absence check using state equation in 32233 ms returned unknown
[2023-03-15 08:40:06] [INFO ] [Real]Absence check using 10000 positive place invariants in 12873 ms returned sat
[2023-03-15 08:40:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:40:35] [INFO ] [Real]Absence check using state equation in 28987 ms returned unknown
[2023-03-15 08:40:48] [INFO ] [Real]Absence check using 10000 positive place invariants in 9944 ms returned sat
[2023-03-15 08:40:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:41:20] [INFO ] [Real]Absence check using state equation in 31801 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 2500, 5000, 2500, 2500, 5000, 5000, 2500, 5000, 2500] Max seen :[1672, 739, 1672, 739, 739, 1810, 1810, 739, 1672, 739]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1770 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1736 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-15 08:41:23] [INFO ] Computed 10000 place invariants in 80 ms
[2023-03-15 08:41:26] [INFO ] Implicit Places using invariants in 2221 ms returned []
Implicit Place search using SMT only with invariants took 2226 ms to find 0 implicit places.
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-15 08:41:26] [INFO ] Computed 10000 place invariants in 66 ms
[2023-03-15 08:41:28] [INFO ] Dead Transitions using invariants and state equation in 2018 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
Starting property specific reduction for Philosophers-COL-005000-UpperBounds-00
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-15 08:41:28] [INFO ] Computed 10000 place invariants in 58 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14709 ms. (steps per millisecond=0 ) properties (out of 1) seen :1134
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2310 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-15 08:41:45] [INFO ] Computed 10000 place invariants in 60 ms
[2023-03-15 08:41:50] [INFO ] [Real]Absence check using 10000 positive place invariants in 2030 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1134]
Support contains 5000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Performed 5000 Post agglomeration using F-continuation condition.Transition count delta: 5000
Deduced a syphon composed of 5000 places in 4 ms
Reduce places removed 5000 places and 0 transitions.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 10000 place count 20000 transition count 20000
Free-agglomeration rule (complex) applied 5000 times.
Iterating global reduction 0 with 5000 rules applied. Total rules applied 15000 place count 20000 transition count 15000
Reduce places removed 5000 places and 0 transitions.
Drop transitions removed 5000 transitions
Reduce isomorphic transitions removed 5000 transitions.
Iterating post reduction 0 with 10000 rules applied. Total rules applied 25000 place count 15000 transition count 10000
Applied a total of 25000 rules in 11488 ms. Remains 15000 /25000 variables (removed 10000) and now considering 10000/25000 (removed 15000) transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/25000 places, 10000/25000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:42:01] [INFO ] Computed 10000 place invariants in 14 ms
Finished random walk after 35695 steps, including 2 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
FORMULA Philosophers-COL-005000-UpperBounds-00 5000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Philosophers-COL-005000-UpperBounds-00 in 63735 ms.
Starting property specific reduction for Philosophers-COL-005000-UpperBounds-01
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-15 08:42:31] [INFO ] Computed 10000 place invariants in 46 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14470 ms. (steps per millisecond=0 ) properties (out of 1) seen :439
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2497 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-15 08:42:48] [INFO ] Computed 10000 place invariants in 70 ms
[2023-03-15 08:42:53] [INFO ] [Real]Absence check using 10000 positive place invariants in 1938 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000] Max seen :[439]
Support contains 5000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Free-agglomeration rule (complex) applied 10000 times.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 10000 place count 25000 transition count 15000
Reduce places removed 10000 places and 0 transitions.
Ensure Unique test removed 5000 transitions
Reduce isomorphic transitions removed 5000 transitions.
Iterating post reduction 0 with 15000 rules applied. Total rules applied 25000 place count 15000 transition count 10000
Applied a total of 25000 rules in 9575 ms. Remains 15000 /25000 variables (removed 10000) and now considering 10000/25000 (removed 15000) transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/25000 places, 10000/25000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:43:03] [INFO ] Computed 10000 place invariants in 33 ms
Finished random walk after 36905 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 19992 steps, including 0 resets, run visited all 1 properties in 5195 ms. (steps per millisecond=3 )
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:43:38] [INFO ] Computed 10000 place invariants in 23 ms
[2023-03-15 08:43:50] [INFO ] [Real]Absence check using 10000 positive place invariants in 9928 ms returned sat
[2023-03-15 08:43:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:44:14] [INFO ] [Real]Absence check using state equation in 24025 ms returned sat
[2023-03-15 08:44:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 08:44:25] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9635 ms returned sat
[2023-03-15 08:44:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 08:44:49] [INFO ] [Nat]Absence check using state equation in 23799 ms returned sat
[2023-03-15 08:44:50] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 399 ms.
[2023-03-15 08:44:52] [INFO ] Added : 0 causal constraints over 0 iterations in 1745 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1422]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1262 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1415 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:45:25] [INFO ] Computed 10000 place invariants in 39 ms
[2023-03-15 08:45:26] [INFO ] Implicit Places using invariants in 1254 ms returned []
Implicit Place search using SMT only with invariants took 1257 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:45:26] [INFO ] Computed 10000 place invariants in 20 ms
[2023-03-15 08:45:28] [INFO ] Dead Transitions using invariants and state equation in 1234 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-15 08:45:28] [INFO ] Computed 10000 place invariants in 18 ms
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m
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-005000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is Philosophers-COL-005000, 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 r319-tall-167873969800020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-005000.tgz
mv Philosophers-COL-005000 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 ;