fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r179-tall-165277026800094
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for Philosophers-COL-005000

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5129.531 3600000.00 3722689.00 6700.20 5000 5000 5000 5000 5000 5000 5000 5000 5000 5000 5000 ? ? ? ? ? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r179-tall-165277026800094.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 gold2021
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 r179-tall-165277026800094
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.5K Apr 29 20:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 29 20:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 29 14:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 29 14:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 227K May 10 09:34 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 1652827497963

Running Version 0
[2022-05-17 22:44:59] [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]
[2022-05-17 22:44:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 22:44:59] [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.
[2022-05-17 22:44:59] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 22:45:00] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 679 ms
[2022-05-17 22:45:00] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 25000 PT places and 25000.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2022-05-17 22:45:00] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions in 3 ms.
[2022-05-17 22:45:00] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_1460277747152614874.dot
// Phase 1: matrix 5 rows 5 cols
[2022-05-17 22:45:00] [INFO ] Computed 2 place invariants in 6 ms
FORMULA Philosophers-COL-005000-UpperBounds-10 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-005000-UpperBounds-09 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-06 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
FORMULA Philosophers-COL-005000-UpperBounds-01 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2022-05-17 22:45:00] [INFO ] Unfolded HLPN to a Petri net with 25000 places and 25000 transitions in 144 ms.
[2022-05-17 22:45:00] [INFO ] Unfolded HLPN properties in 21 ms.
// Phase 1: matrix 5 rows 5 cols
[2022-05-17 22:45:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 22:45:00] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-17 22:45:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:45:00] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-17 22:45:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:45:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 22:45:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:45:00] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-17 22:45:00] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 22:45:00] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Minimization took 3 ms.
[2022-05-17 22:45:00] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-17 22:45:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:45:00] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 22:45:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:45:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 22:45:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:45:00] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 22:45:00] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-17 22:45:00] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Minimization took 3 ms.
[2022-05-17 22:45:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 22:45:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:45:00] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 22:45:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:45:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 22:45:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:45:00] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-17 22:45:00] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 22:45:00] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 2 ms.
[2022-05-17 22:45:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 22:45:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:45:00] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-17 22:45:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:45:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 22:45:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:45:00] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-17 22:45:00] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 22:45:00] [INFO ] Added : 1 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 2 ms.
[2022-05-17 22:45:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 22:45:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:45:00] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 22:45:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:45:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-17 22:45:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:45:00] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-17 22:45:00] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 22:45:00] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2022-05-17 22:45:00] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-17 22:45:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:45:00] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 22:45:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:45:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 22:45:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:45:00] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 22:45:00] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 22:45:00] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 2 ms.
[2022-05-17 22:45:00] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-17 22:45:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:45:00] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 22:45:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:45:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 22:45:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:45:00] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-17 22:45:00] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 22:45:00] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 2 ms.
[2022-05-17 22:45:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 22:45:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:45:00] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 22:45:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:45:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-17 22:45:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:45:00] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-17 22:45:00] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 22:45:00] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [5000, 5000, 5000, 2500, 2500, 5000, 5000, 2500]
[2022-05-17 22:45:00] [INFO ] Unfolded HLPN to a Petri net with 25000 places and 25000 transitions in 75 ms.
[2022-05-17 22:45:00] [INFO ] Unfolded HLPN properties in 2 ms.
Successfully produced net in file /tmp/petri1001_5544252838042063520.dot
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29443 ms. (steps per millisecond=0 ) properties (out of 8) seen :6862
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3713 ms. (steps per millisecond=2 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3608 ms. (steps per millisecond=2 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3542 ms. (steps per millisecond=2 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3660 ms. (steps per millisecond=2 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3512 ms. (steps per millisecond=2 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3524 ms. (steps per millisecond=2 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3498 ms. (steps per millisecond=2 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3497 ms. (steps per millisecond=2 ) properties (out of 8) seen :0
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 22:45:59] [INFO ] Computed 10000 place invariants in 150 ms
[2022-05-17 22:46:04] [INFO ] [Real]Absence check using 10000 positive place invariants in 1937 ms returned unknown
[2022-05-17 22:46:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.assertInvariants(DeadlockTester.java:1970)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:558)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 22:46:14] [INFO ] [Real]Absence check using 10000 positive place invariants in 2258 ms returned unknown
[2022-05-17 22:46:19] [INFO ] [Real]Absence check using 10000 positive place invariants in 2154 ms returned unknown
[2022-05-17 22:46:24] [INFO ] [Real]Absence check using 10000 positive place invariants in 2209 ms returned unknown
[2022-05-17 22:46:29] [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 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.assertInvariants(DeadlockTester.java:1970)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:558)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 22:46:34] [INFO ] [Real]Absence check using 10000 positive place invariants in 2241 ms returned unknown
[2022-05-17 22:46:39] [INFO ] [Real]Absence check using 10000 positive place invariants in 2174 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 5000, 5000, 2500, 2500, 5000, 5000, 2500] Max seen :[1106, 1106, 1124, 438, 438, 1106, 1106, 438]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 2321 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
[2022-05-17 22:46:42] [INFO ] Computed 10000 place invariants in 68 ms
Interrupted random walk after 12273 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen :{0=1607, 1=1607, 2=1704, 3=714, 4=714, 5=1607, 6=1607, 7=714}
Interrupted Best-First random walk after 15002 steps, including 0 resets, run timeout after 5192 ms. (steps per millisecond=2 ) properties seen :{0=1, 1=1, 5=1, 6=1}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5197 ms. (steps per millisecond=3 ) properties seen :{0=1, 1=1, 5=1, 6=1}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5084 ms. (steps per millisecond=3 ) properties seen :{2=1}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5129 ms. (steps per millisecond=3 ) properties seen :{2=1}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5114 ms. (steps per millisecond=3 ) properties seen :{2=1}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5084 ms. (steps per millisecond=3 ) properties seen :{0=1, 1=1, 5=1, 6=1}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5101 ms. (steps per millisecond=3 ) properties seen :{0=1, 1=1, 5=1, 6=1}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5104 ms. (steps per millisecond=3 ) properties seen :{2=1}
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 22:47:53] [INFO ] Computed 10000 place invariants in 67 ms
[2022-05-17 22:48:07] [INFO ] [Real]Absence check using 10000 positive place invariants in 11297 ms returned sat
[2022-05-17 22:48:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:48:38] [INFO ] [Real]Absence check using state equation in 30977 ms returned unknown
[2022-05-17 22:48:52] [INFO ] [Real]Absence check using 10000 positive place invariants in 11191 ms returned sat
[2022-05-17 22:48:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:49:23] [INFO ] [Real]Absence check using state equation in 31147 ms returned unknown
[2022-05-17 22:49:36] [INFO ] [Real]Absence check using 10000 positive place invariants in 10759 ms returned sat
[2022-05-17 22:49:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:50:08] [INFO ] [Real]Absence check using state equation in 31532 ms returned unknown
[2022-05-17 22:50:19] [INFO ] [Real]Absence check using 10000 positive place invariants in 8081 ms returned sat
[2022-05-17 22:50:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:50:53] [INFO ] [Real]Absence check using state equation in 34228 ms returned unknown
[2022-05-17 22:51:04] [INFO ] [Real]Absence check using 10000 positive place invariants in 8631 ms returned sat
[2022-05-17 22:51:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:51:38] [INFO ] [Real]Absence check using state equation in 33675 ms returned unknown
[2022-05-17 22:51:54] [INFO ] [Real]Absence check using 10000 positive place invariants in 13607 ms returned sat
[2022-05-17 22:51:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:52:23] [INFO ] [Real]Absence check using state equation in 28642 ms returned unknown
[2022-05-17 22:52:37] [INFO ] [Real]Absence check using 10000 positive place invariants in 11414 ms returned sat
[2022-05-17 22:52:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:53:08] [INFO ] [Real]Absence check using state equation in 30889 ms returned unknown
[2022-05-17 22:53:19] [INFO ] [Real]Absence check using 10000 positive place invariants in 8227 ms returned sat
[2022-05-17 22:53:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:53:53] [INFO ] [Real]Absence check using state equation in 34118 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 5000, 5000, 2500, 2500, 5000, 5000, 2500] Max seen :[1607, 1607, 1704, 714, 714, 1607, 1607, 714]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 2218 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, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 2272 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 22:53:58] [INFO ] Computed 10000 place invariants in 48 ms
[2022-05-17 22:53:59] [INFO ] Implicit Places using invariants in 1816 ms returned []
Implicit Place search using SMT only with invariants took 1818 ms to find 0 implicit places.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 22:53:59] [INFO ] Computed 10000 place invariants in 48 ms
[2022-05-17 22:54:01] [INFO ] Dead Transitions using invariants and state equation in 1824 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 22:54:01] [INFO ] Computed 10000 place invariants in 60 ms
Interrupted random walk after 12736 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen :{0=1598, 1=1598, 2=1794, 3=694, 4=694, 5=1598, 6=1598, 7=694}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5128 ms. (steps per millisecond=3 ) properties seen :{0=1, 1=1, 5=1, 6=1}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5104 ms. (steps per millisecond=3 ) properties seen :{0=1, 1=1, 5=1, 6=1}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5019 ms. (steps per millisecond=3 ) properties seen :{2=1}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5214 ms. (steps per millisecond=3 ) properties seen :{0=1, 1=1, 5=1, 6=1}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5233 ms. (steps per millisecond=3 ) properties seen :{0=1, 1=1, 5=1, 6=1}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5118 ms. (steps per millisecond=3 ) properties seen :{0=1, 1=1, 5=1, 6=1}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5102 ms. (steps per millisecond=3 ) properties seen :{0=1, 1=1, 5=1, 6=1}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5141 ms. (steps per millisecond=3 ) properties seen :{0=1, 1=1, 5=1, 6=1}
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 22:55:12] [INFO ] Computed 10000 place invariants in 51 ms
[2022-05-17 22:55:26] [INFO ] [Real]Absence check using 10000 positive place invariants in 10831 ms returned sat
[2022-05-17 22:55:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:55:57] [INFO ] [Real]Absence check using state equation in 31496 ms returned unknown
[2022-05-17 22:56:13] [INFO ] [Real]Absence check using 10000 positive place invariants in 13397 ms returned sat
[2022-05-17 22:56:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:56:42] [INFO ] [Real]Absence check using state equation in 29011 ms returned unknown
[2022-05-17 22:56:57] [INFO ] [Real]Absence check using 10000 positive place invariants in 11762 ms returned sat
[2022-05-17 22:56:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:57:28] [INFO ] [Real]Absence check using state equation in 30604 ms returned unknown
[2022-05-17 22:57:39] [INFO ] [Real]Absence check using 10000 positive place invariants in 8430 ms returned sat
[2022-05-17 22:57:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:58:13] [INFO ] [Real]Absence check using state equation in 33881 ms returned unknown
[2022-05-17 22:58:24] [INFO ] [Real]Absence check using 10000 positive place invariants in 8529 ms returned sat
[2022-05-17 22:58:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:58:58] [INFO ] [Real]Absence check using state equation in 33807 ms returned unknown
[2022-05-17 22:59:11] [INFO ] [Real]Absence check using 10000 positive place invariants in 10710 ms returned sat
[2022-05-17 22:59:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:59:43] [INFO ] [Real]Absence check using state equation in 31548 ms returned unknown
[2022-05-17 22:59:57] [INFO ] [Real]Absence check using 10000 positive place invariants in 11623 ms returned sat
[2022-05-17 22:59:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:00:28] [INFO ] [Real]Absence check using state equation in 30655 ms returned unknown
[2022-05-17 23:00:40] [INFO ] [Real]Absence check using 10000 positive place invariants in 9513 ms returned sat
[2022-05-17 23:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:01:13] [INFO ] [Real]Absence check using state equation in 32798 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 5000, 5000, 2500, 2500, 5000, 5000, 2500] Max seen :[1607, 1607, 1794, 714, 714, 1607, 1607, 714]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1698 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, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1593 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 23:01:16] [INFO ] Computed 10000 place invariants in 64 ms
[2022-05-17 23:01:18] [INFO ] Implicit Places using invariants in 1923 ms returned []
Implicit Place search using SMT only with invariants took 1935 ms to find 0 implicit places.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 23:01:18] [INFO ] Computed 10000 place invariants in 61 ms
[2022-05-17 23:01:20] [INFO ] Dead Transitions using invariants and state equation in 1904 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 23:01:20] [INFO ] Computed 10000 place invariants in 58 ms
Interrupted random walk after 12543 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen :{0=1679, 1=1679, 2=1670, 3=705, 4=705, 5=1679, 6=1679, 7=705}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5096 ms. (steps per millisecond=3 ) properties seen :{0=1, 1=1, 5=1, 6=1}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5108 ms. (steps per millisecond=3 ) properties seen :{0=1, 1=1, 5=1, 6=1}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5069 ms. (steps per millisecond=3 ) properties seen :{2=1}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5180 ms. (steps per millisecond=3 ) properties seen :{0=1, 1=1, 5=1, 6=1}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5114 ms. (steps per millisecond=3 ) properties seen :{0=1, 1=1, 5=1, 6=1}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5099 ms. (steps per millisecond=3 ) properties seen :{0=1, 1=1, 5=1, 6=1}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5132 ms. (steps per millisecond=3 ) properties seen :{0=1, 1=1, 5=1, 6=1}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5111 ms. (steps per millisecond=3 ) properties seen :{0=1, 1=1, 5=1, 6=1}
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 23:02:31] [INFO ] Computed 10000 place invariants in 49 ms
[2022-05-17 23:02:45] [INFO ] [Real]Absence check using 10000 positive place invariants in 11465 ms returned sat
[2022-05-17 23:02:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:03:16] [INFO ] [Real]Absence check using state equation in 30879 ms returned unknown
[2022-05-17 23:03:31] [INFO ] [Real]Absence check using 10000 positive place invariants in 12630 ms returned sat
[2022-05-17 23:03:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:04:01] [INFO ] [Real]Absence check using state equation in 29522 ms returned unknown
[2022-05-17 23:04:15] [INFO ] [Real]Absence check using 10000 positive place invariants in 11528 ms returned sat
[2022-05-17 23:04:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:04:46] [INFO ] [Real]Absence check using state equation in 30738 ms returned unknown
[2022-05-17 23:04:58] [INFO ] [Real]Absence check using 10000 positive place invariants in 8682 ms returned sat
[2022-05-17 23:04:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:05:31] [INFO ] [Real]Absence check using state equation in 33573 ms returned unknown
[2022-05-17 23:05:43] [INFO ] [Real]Absence check using 10000 positive place invariants in 9436 ms returned sat
[2022-05-17 23:05:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:06:16] [INFO ] [Real]Absence check using state equation in 32844 ms returned unknown
[2022-05-17 23:06:32] [INFO ] [Real]Absence check using 10000 positive place invariants in 12909 ms returned sat
[2022-05-17 23:06:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:07:01] [INFO ] [Real]Absence check using state equation in 29264 ms returned unknown
[2022-05-17 23:07:16] [INFO ] [Real]Absence check using 10000 positive place invariants in 12279 ms returned sat
[2022-05-17 23:07:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:07:46] [INFO ] [Real]Absence check using state equation in 29986 ms returned unknown
[2022-05-17 23:07:58] [INFO ] [Real]Absence check using 10000 positive place invariants in 8611 ms returned sat
[2022-05-17 23:07:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:08:31] [INFO ] [Real]Absence check using state equation in 33651 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 5000, 5000, 2500, 2500, 5000, 5000, 2500] Max seen :[1679, 1679, 1794, 714, 714, 1679, 1679, 714]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1678 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, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1707 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 23:08:35] [INFO ] Computed 10000 place invariants in 69 ms
[2022-05-17 23:08:37] [INFO ] Implicit Places using invariants in 1928 ms returned []
Implicit Place search using SMT only with invariants took 1929 ms to find 0 implicit places.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 23:08:37] [INFO ] Computed 10000 place invariants in 62 ms
[2022-05-17 23:08:39] [INFO ] Dead Transitions using invariants and state equation in 1969 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 23:08:39] [INFO ] Computed 10000 place invariants in 67 ms
Interrupted random walk after 12493 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=0 ) properties seen :{0=1647, 1=1647, 2=1770, 3=700, 4=700, 5=1647, 6=1647, 7=700}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5086 ms. (steps per millisecond=3 ) properties seen :{0=1, 1=1, 5=1, 6=1}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5109 ms. (steps per millisecond=3 ) properties seen :{0=1, 1=1, 5=1, 6=1}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5125 ms. (steps per millisecond=3 ) properties seen :{2=1}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5159 ms. (steps per millisecond=3 ) properties seen :{2=1}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5126 ms. (steps per millisecond=3 ) properties seen :{2=1}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5117 ms. (steps per millisecond=3 ) properties seen :{0=1, 1=1, 5=1, 6=1}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5134 ms. (steps per millisecond=3 ) properties seen :{0=1, 1=1, 5=1, 6=1}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5152 ms. (steps per millisecond=3 ) properties seen :{0=1, 1=1, 5=1, 6=1}
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 23:09:50] [INFO ] Computed 10000 place invariants in 57 ms
[2022-05-17 23:10:04] [INFO ] [Real]Absence check using 10000 positive place invariants in 11192 ms returned sat
[2022-05-17 23:10:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:10:35] [INFO ] [Real]Absence check using state equation in 31079 ms returned unknown
[2022-05-17 23:10:50] [INFO ] [Real]Absence check using 10000 positive place invariants in 12112 ms returned sat
[2022-05-17 23:10:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:11:20] [INFO ] [Real]Absence check using state equation in 30155 ms returned unknown
[2022-05-17 23:11:37] [INFO ] [Real]Absence check using 10000 positive place invariants in 13936 ms returned sat
[2022-05-17 23:11:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:12:05] [INFO ] [Real]Absence check using state equation in 28316 ms returned unknown
[2022-05-17 23:12:17] [INFO ] [Real]Absence check using 10000 positive place invariants in 9767 ms returned sat
[2022-05-17 23:12:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:12:50] [INFO ] [Real]Absence check using state equation in 32442 ms returned unknown
[2022-05-17 23:13:02] [INFO ] [Real]Absence check using 10000 positive place invariants in 9617 ms returned sat
[2022-05-17 23:13:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:13:35] [INFO ] [Real]Absence check using state equation in 32600 ms returned unknown
[2022-05-17 23:13:49] [INFO ] [Real]Absence check using 10000 positive place invariants in 11672 ms returned sat
[2022-05-17 23:13:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:14:20] [INFO ] [Real]Absence check using state equation in 30601 ms returned unknown
[2022-05-17 23:14:35] [INFO ] [Real]Absence check using 10000 positive place invariants in 12137 ms returned sat
[2022-05-17 23:14:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:15:05] [INFO ] [Real]Absence check using state equation in 30096 ms returned unknown
[2022-05-17 23:15:17] [INFO ] [Real]Absence check using 10000 positive place invariants in 9293 ms returned sat
[2022-05-17 23:15:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:15:50] [INFO ] [Real]Absence check using state equation in 32894 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 5000, 5000, 2500, 2500, 5000, 5000, 2500] Max seen :[1679, 1679, 1794, 714, 714, 1679, 1679, 714]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1623 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, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1660 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 23:15:53] [INFO ] Computed 10000 place invariants in 63 ms
[2022-05-17 23:15:55] [INFO ] Implicit Places using invariants in 1919 ms returned []
Implicit Place search using SMT only with invariants took 1920 ms to find 0 implicit places.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 23:15:55] [INFO ] Computed 10000 place invariants in 57 ms
[2022-05-17 23:15:57] [INFO ] Dead Transitions using invariants and state equation in 1926 ms returned []
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
[2022-05-17 23:15:57] [INFO ] Computed 10000 place invariants in 65 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15950 ms. (steps per millisecond=0 ) properties (out of 1) seen :1114
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3512 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 23:16:17] [INFO ] Computed 10000 place invariants in 65 ms
[2022-05-17 23:16:22] [INFO ] [Real]Absence check using 10000 positive place invariants in 2158 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1114]
Support contains 5000 out of 25000 places. Attempting structural reductions.
Starting structural reductions, 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 11679 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
[2022-05-17 23:16:34] [INFO ] Computed 10000 place invariants in 14 ms
Interrupted random walk after 32428 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :{0=5000}
FORMULA Philosophers-COL-005000-UpperBounds-00 5000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Philosophers-COL-005000-UpperBounds-00 in 66383 ms.
Starting property specific reduction for Philosophers-COL-005000-UpperBounds-02
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 23:17:04] [INFO ] Computed 10000 place invariants in 68 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16057 ms. (steps per millisecond=0 ) properties (out of 1) seen :1087
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3167 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 23:17:23] [INFO ] Computed 10000 place invariants in 59 ms
[2022-05-17 23:17:28] [INFO ] [Real]Absence check using 10000 positive place invariants in 2191 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1087]
Support contains 5000 out of 25000 places. Attempting structural reductions.
Starting structural reductions, 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 6 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 10007 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
[2022-05-17 23:17:38] [INFO ] Computed 10000 place invariants in 15 ms
Interrupted random walk after 32671 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :{0=5000}
FORMULA Philosophers-COL-005000-UpperBounds-02 5000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Philosophers-COL-005000-UpperBounds-02 in 64458 ms.
Starting property specific reduction for Philosophers-COL-005000-UpperBounds-04
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 23:18:08] [INFO ] Computed 10000 place invariants in 60 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15922 ms. (steps per millisecond=0 ) properties (out of 1) seen :1127
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3193 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 23:18:27] [INFO ] Computed 10000 place invariants in 66 ms
[2022-05-17 23:18:32] [INFO ] [Real]Absence check using 10000 positive place invariants in 2178 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1127]
Support contains 5000 out of 25000 places. Attempting structural reductions.
Starting structural reductions, 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 9670 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
[2022-05-17 23:18:42] [INFO ] Computed 10000 place invariants in 18 ms
Interrupted random walk after 32565 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :{0=5000}
FORMULA Philosophers-COL-005000-UpperBounds-04 5000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Philosophers-COL-005000-UpperBounds-04 in 64009 ms.
Starting property specific reduction for Philosophers-COL-005000-UpperBounds-11
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 23:19:12] [INFO ] Computed 10000 place invariants in 59 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15658 ms. (steps per millisecond=0 ) properties (out of 1) seen :428
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3164 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 23:19:31] [INFO ] Computed 10000 place invariants in 65 ms
[2022-05-17 23:19:36] [INFO ] [Real]Absence check using 10000 positive place invariants in 2179 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000] Max seen :[428]
Support contains 5000 out of 25000 places. Attempting structural reductions.
Starting structural reductions, 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 9549 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
[2022-05-17 23:19:46] [INFO ] Computed 10000 place invariants in 23 ms
Interrupted random walk after 35346 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :{0=1430}
Interrupted Best-First random walk after 15998 steps, including 0 resets, run timeout after 5079 ms. (steps per millisecond=3 ) properties seen :{0=3}
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:20:21] [INFO ] Computed 10000 place invariants in 24 ms
[2022-05-17 23:20:31] [INFO ] [Real]Absence check using 10000 positive place invariants in 9091 ms returned sat
[2022-05-17 23:20:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:20:53] [INFO ] [Real]Absence check using state equation in 21832 ms returned sat
[2022-05-17 23:20:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:21:05] [INFO ] [Nat]Absence check using 10000 positive place invariants in 10140 ms returned sat
[2022-05-17 23:21:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:21:34] [INFO ] [Nat]Absence check using state equation in 29155 ms returned sat
[2022-05-17 23:21:35] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 392 ms.
[2022-05-17 23:21:37] [INFO ] Added : 0 causal constraints over 0 iterations in 1699 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1430]
Interrupted Parikh walk after 60171 steps, including 41 resets, run timeout after 30001 ms. (steps per millisecond=2 ) properties (out of 1) seen :1431
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1421 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, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1390 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:22:10] [INFO ] Computed 10000 place invariants in 23 ms
[2022-05-17 23:22:11] [INFO ] Implicit Places using invariants in 1170 ms returned []
Implicit Place search using SMT only with invariants took 1171 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:22:11] [INFO ] Computed 10000 place invariants in 20 ms
[2022-05-17 23:22:12] [INFO ] Dead Transitions using invariants and state equation in 1164 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:22:12] [INFO ] Computed 10000 place invariants in 23 ms
Interrupted random walk after 35086 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :{0=1450}
Interrupted Best-First random walk after 15998 steps, including 0 resets, run timeout after 5068 ms. (steps per millisecond=3 ) properties seen :{0=3}
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:22:48] [INFO ] Computed 10000 place invariants in 25 ms
[2022-05-17 23:22:58] [INFO ] [Real]Absence check using 10000 positive place invariants in 9414 ms returned sat
[2022-05-17 23:22:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:23:24] [INFO ] [Real]Absence check using state equation in 25473 ms returned sat
[2022-05-17 23:23:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:23:35] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9520 ms returned sat
[2022-05-17 23:23:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:24:02] [INFO ] [Nat]Absence check using state equation in 27462 ms returned sat
[2022-05-17 23:24:04] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 335 ms.
[2022-05-17 23:24:05] [INFO ] Added : 0 causal constraints over 0 iterations in 1604 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1450]
Interrupted Parikh walk after 60703 steps, including 41 resets, run timeout after 30001 ms. (steps per millisecond=2 ) properties (out of 1) seen :1451
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 921 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, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 906 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:24:37] [INFO ] Computed 10000 place invariants in 27 ms
[2022-05-17 23:24:39] [INFO ] Implicit Places using invariants in 1180 ms returned []
Implicit Place search using SMT only with invariants took 1181 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:24:39] [INFO ] Computed 10000 place invariants in 20 ms
[2022-05-17 23:24:40] [INFO ] Dead Transitions using invariants and state equation in 1167 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:24:40] [INFO ] Computed 10000 place invariants in 21 ms
Interrupted random walk after 35223 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :{0=1434}
Interrupted Best-First random walk after 16998 steps, including 0 resets, run timeout after 5288 ms. (steps per millisecond=3 ) properties seen :{0=3}
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:25:15] [INFO ] Computed 10000 place invariants in 24 ms
[2022-05-17 23:25:26] [INFO ] [Real]Absence check using 10000 positive place invariants in 9955 ms returned sat
[2022-05-17 23:25:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:25:49] [INFO ] [Real]Absence check using state equation in 23087 ms returned sat
[2022-05-17 23:25:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:26:00] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9006 ms returned sat
[2022-05-17 23:26:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:26:24] [INFO ] [Nat]Absence check using state equation in 24207 ms returned sat
[2022-05-17 23:26:25] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 363 ms.
[2022-05-17 23:26:27] [INFO ] Added : 0 causal constraints over 0 iterations in 1628 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1451]
Interrupted Parikh walk after 61366 steps, including 42 resets, run timeout after 30001 ms. (steps per millisecond=2 ) properties (out of 1) seen :1452
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 897 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, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 911 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:26:59] [INFO ] Computed 10000 place invariants in 17 ms
[2022-05-17 23:27:00] [INFO ] Implicit Places using invariants in 1126 ms returned []
Implicit Place search using SMT only with invariants took 1127 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:27:00] [INFO ] Computed 10000 place invariants in 20 ms
[2022-05-17 23:27:01] [INFO ] Dead Transitions using invariants and state equation in 1128 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:27:01] [INFO ] Computed 10000 place invariants in 17 ms
Interrupted random walk after 35252 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :{0=1435}
Interrupted Best-First random walk after 15998 steps, including 0 resets, run timeout after 5039 ms. (steps per millisecond=3 ) properties seen :{0=3}
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:27:36] [INFO ] Computed 10000 place invariants in 22 ms
[2022-05-17 23:27:47] [INFO ] [Real]Absence check using 10000 positive place invariants in 9094 ms returned sat
[2022-05-17 23:27:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:28:15] [INFO ] [Real]Absence check using state equation in 28643 ms returned sat
[2022-05-17 23:28:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:28:27] [INFO ] [Nat]Absence check using 10000 positive place invariants in 10199 ms returned sat
[2022-05-17 23:28:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:28:48] [INFO ] [Nat]Absence check using state equation in 20443 ms returned sat
[2022-05-17 23:28:49] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 377 ms.
[2022-05-17 23:28:50] [INFO ] Added : 0 causal constraints over 0 iterations in 1604 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1452]
Interrupted Parikh walk after 61397 steps, including 42 resets, run timeout after 30001 ms. (steps per millisecond=2 ) properties (out of 1) seen :1453
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 918 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, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 902 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:29:23] [INFO ] Computed 10000 place invariants in 23 ms
[2022-05-17 23:29:24] [INFO ] Implicit Places using invariants in 1160 ms returned []
Implicit Place search using SMT only with invariants took 1161 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:29:24] [INFO ] Computed 10000 place invariants in 19 ms
[2022-05-17 23:29:25] [INFO ] Dead Transitions using invariants and state equation in 1163 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:29:25] [INFO ] Computed 10000 place invariants in 24 ms
Interrupted random walk after 35114 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :{0=1451}
Interrupted Best-First random walk after 15998 steps, including 0 resets, run timeout after 5018 ms. (steps per millisecond=3 ) properties seen :{0=3}
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:30:00] [INFO ] Computed 10000 place invariants in 22 ms
[2022-05-17 23:30:10] [INFO ] [Real]Absence check using 10000 positive place invariants in 9071 ms returned sat
[2022-05-17 23:30:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:30:32] [INFO ] [Real]Absence check using state equation in 21409 ms returned sat
[2022-05-17 23:30:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:30:43] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9380 ms returned sat
[2022-05-17 23:30:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:31:10] [INFO ] [Nat]Absence check using state equation in 27142 ms returned sat
[2022-05-17 23:31:11] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 373 ms.
[2022-05-17 23:31:12] [INFO ] Added : 0 causal constraints over 0 iterations in 1623 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1453]
Interrupted Parikh walk after 61391 steps, including 42 resets, run timeout after 30001 ms. (steps per millisecond=2 ) properties (out of 1) seen :1454
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 896 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, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 913 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:31:45] [INFO ] Computed 10000 place invariants in 25 ms
[2022-05-17 23:31:46] [INFO ] Implicit Places using invariants in 1141 ms returned []
Implicit Place search using SMT only with invariants took 1142 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:31:46] [INFO ] Computed 10000 place invariants in 21 ms
[2022-05-17 23:31:47] [INFO ] Dead Transitions using invariants and state equation in 1147 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:31:47] [INFO ] Computed 10000 place invariants in 26 ms
Interrupted random walk after 35019 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :{0=1428}
Interrupted Best-First random walk after 15998 steps, including 0 resets, run timeout after 5054 ms. (steps per millisecond=3 ) properties seen :{0=3}
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:32:22] [INFO ] Computed 10000 place invariants in 24 ms
[2022-05-17 23:32:32] [INFO ] [Real]Absence check using 10000 positive place invariants in 8994 ms returned sat
[2022-05-17 23:32:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:32:54] [INFO ] [Real]Absence check using state equation in 21832 ms returned sat
[2022-05-17 23:32:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:33:05] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9073 ms returned sat
[2022-05-17 23:33:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:33:30] [INFO ] [Nat]Absence check using state equation in 24847 ms returned sat
[2022-05-17 23:33:31] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 375 ms.
[2022-05-17 23:33:32] [INFO ] Added : 0 causal constraints over 0 iterations in 1630 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1454]
Interrupted Parikh walk after 60864 steps, including 41 resets, run timeout after 30001 ms. (steps per millisecond=2 ) properties (out of 1) seen :1455
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 950 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, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 926 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:34:05] [INFO ] Computed 10000 place invariants in 27 ms
[2022-05-17 23:34:06] [INFO ] Implicit Places using invariants in 1182 ms returned []
Implicit Place search using SMT only with invariants took 1183 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:34:06] [INFO ] Computed 10000 place invariants in 22 ms
[2022-05-17 23:34:07] [INFO ] Dead Transitions using invariants and state equation in 1144 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:34:07] [INFO ] Computed 10000 place invariants in 22 ms
Interrupted random walk after 35404 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :{0=1446}
Interrupted Best-First random walk after 15998 steps, including 0 resets, run timeout after 5037 ms. (steps per millisecond=3 ) properties seen :{0=3}
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:34:42] [INFO ] Computed 10000 place invariants in 30 ms
[2022-05-17 23:34:53] [INFO ] [Real]Absence check using 10000 positive place invariants in 9318 ms returned sat
[2022-05-17 23:34:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:35:17] [INFO ] [Real]Absence check using state equation in 23609 ms returned sat
[2022-05-17 23:35:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:35:27] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9255 ms returned sat
[2022-05-17 23:35:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:35:50] [INFO ] [Nat]Absence check using state equation in 22335 ms returned sat
[2022-05-17 23:35:51] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 374 ms.
[2022-05-17 23:35:52] [INFO ] Added : 0 causal constraints over 0 iterations in 1611 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1455]
Interrupted Parikh walk after 61489 steps, including 41 resets, run timeout after 30001 ms. (steps per millisecond=2 ) properties (out of 1) seen :1456
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 903 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, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 892 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:36:25] [INFO ] Computed 10000 place invariants in 26 ms
[2022-05-17 23:36:26] [INFO ] Implicit Places using invariants in 1164 ms returned []
Implicit Place search using SMT only with invariants took 1165 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:36:26] [INFO ] Computed 10000 place invariants in 21 ms
[2022-05-17 23:36:27] [INFO ] Dead Transitions using invariants and state equation in 1186 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:36:27] [INFO ] Computed 10000 place invariants in 25 ms
Interrupted random walk after 35366 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :{0=1434}
Interrupted Best-First random walk after 15998 steps, including 0 resets, run timeout after 5007 ms. (steps per millisecond=3 ) properties seen :{0=3}
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:37:02] [INFO ] Computed 10000 place invariants in 25 ms
[2022-05-17 23:37:13] [INFO ] [Real]Absence check using 10000 positive place invariants in 9421 ms returned sat
[2022-05-17 23:37:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:37:39] [INFO ] [Real]Absence check using state equation in 25807 ms returned sat
[2022-05-17 23:37:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:37:50] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9284 ms returned sat
[2022-05-17 23:37:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:38:13] [INFO ] [Nat]Absence check using state equation in 23418 ms returned sat
[2022-05-17 23:38:14] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 351 ms.
[2022-05-17 23:38:15] [INFO ] Added : 0 causal constraints over 0 iterations in 1586 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1456]
Interrupted Parikh walk after 61677 steps, including 42 resets, run timeout after 30001 ms. (steps per millisecond=2 ) properties (out of 1) seen :1457
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 893 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, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 915 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:38:48] [INFO ] Computed 10000 place invariants in 23 ms
[2022-05-17 23:38:49] [INFO ] Implicit Places using invariants in 1184 ms returned []
Implicit Place search using SMT only with invariants took 1185 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:38:49] [INFO ] Computed 10000 place invariants in 20 ms
[2022-05-17 23:38:50] [INFO ] Dead Transitions using invariants and state equation in 1177 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:38:50] [INFO ] Computed 10000 place invariants in 23 ms
Interrupted random walk after 35036 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :{0=1416}
Interrupted Best-First random walk after 15998 steps, including 0 resets, run timeout after 5015 ms. (steps per millisecond=3 ) properties seen :{0=3}
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:39:25] [INFO ] Computed 10000 place invariants in 25 ms
[2022-05-17 23:39:36] [INFO ] [Real]Absence check using 10000 positive place invariants in 9246 ms returned sat
[2022-05-17 23:39:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:40:01] [INFO ] [Real]Absence check using state equation in 24907 ms returned sat
[2022-05-17 23:40:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:40:13] [INFO ] [Nat]Absence check using 10000 positive place invariants in 10993 ms returned sat
[2022-05-17 23:40:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:40:40] [INFO ] [Nat]Absence check using state equation in 26507 ms returned sat
[2022-05-17 23:40:41] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 363 ms.
[2022-05-17 23:40:42] [INFO ] Added : 0 causal constraints over 0 iterations in 1598 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1457]
Interrupted Parikh walk after 61135 steps, including 41 resets, run timeout after 30001 ms. (steps per millisecond=2 ) properties (out of 1) seen :1458
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 921 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, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 926 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:41:15] [INFO ] Computed 10000 place invariants in 26 ms
[2022-05-17 23:41:16] [INFO ] Implicit Places using invariants in 1159 ms returned []
Implicit Place search using SMT only with invariants took 1159 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:41:16] [INFO ] Computed 10000 place invariants in 20 ms
[2022-05-17 23:41:17] [INFO ] Dead Transitions using invariants and state equation in 1134 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:41:17] [INFO ] Computed 10000 place invariants in 26 ms
Interrupted random walk after 35055 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :{0=1423}
Interrupted Best-First random walk after 15998 steps, including 0 resets, run timeout after 5046 ms. (steps per millisecond=3 ) properties seen :{0=3}
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:41:52] [INFO ] Computed 10000 place invariants in 27 ms
[2022-05-17 23:42:03] [INFO ] [Real]Absence check using 10000 positive place invariants in 9265 ms returned sat
[2022-05-17 23:42:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:42:25] [INFO ] [Real]Absence check using state equation in 22574 ms returned sat
[2022-05-17 23:42:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:42:38] [INFO ] [Nat]Absence check using 10000 positive place invariants in 10674 ms returned sat
[2022-05-17 23:42:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:43:06] [INFO ] [Nat]Absence check using state equation in 28601 ms returned sat
[2022-05-17 23:43:07] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 359 ms.
[2022-05-17 23:43:09] [INFO ] Added : 0 causal constraints over 0 iterations in 1590 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1458]
Interrupted Parikh walk after 61604 steps, including 42 resets, run timeout after 30001 ms. (steps per millisecond=2 ) properties (out of 1) seen :1459
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 923 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, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 935 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:43:41] [INFO ] Computed 10000 place invariants in 21 ms
[2022-05-17 23:43:42] [INFO ] Implicit Places using invariants in 1147 ms returned []
Implicit Place search using SMT only with invariants took 1151 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:43:42] [INFO ] Computed 10000 place invariants in 22 ms
[2022-05-17 23:43:43] [INFO ] Dead Transitions using invariants and state equation in 1133 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:43:43] [INFO ] Computed 10000 place invariants in 22 ms
Interrupted random walk after 35209 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :{0=1438}
Interrupted Best-First random walk after 16998 steps, including 0 resets, run timeout after 5263 ms. (steps per millisecond=3 ) properties seen :{0=3}
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:44:19] [INFO ] Computed 10000 place invariants in 25 ms
[2022-05-17 23:44:29] [INFO ] [Real]Absence check using 10000 positive place invariants in 9343 ms returned sat
[2022-05-17 23:44:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:44:52] [INFO ] [Real]Absence check using state equation in 22690 ms returned sat
[2022-05-17 23:44:52] [INFO ] Solution in real domain found non-integer solution.

BK_TIME_CONFINEMENT_REACHED

--------------------
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-005000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
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 r179-tall-165277026800094"
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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;