About the Execution of ITS-Tools for Philosophers-PT-005000
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r140-tall-162298996000171.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Philosophers-PT-005000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162298996000171
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 246M
-rw-r--r-- 1 mcc users 13M May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15M May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 89M May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 2.9M Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 10M Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.6M Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.2M Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.7M Mar 27 08:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 8.6M Mar 27 08:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3M Mar 25 10:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.7M Mar 25 10:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 516K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 1.3M Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 21M May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Philosophers-PT-005000-UpperBounds-00
FORMULA_NAME Philosophers-PT-005000-UpperBounds-01
FORMULA_NAME Philosophers-PT-005000-UpperBounds-02
FORMULA_NAME Philosophers-PT-005000-UpperBounds-03
FORMULA_NAME Philosophers-PT-005000-UpperBounds-04
FORMULA_NAME Philosophers-PT-005000-UpperBounds-05
FORMULA_NAME Philosophers-PT-005000-UpperBounds-06
FORMULA_NAME Philosophers-PT-005000-UpperBounds-07
FORMULA_NAME Philosophers-PT-005000-UpperBounds-08
FORMULA_NAME Philosophers-PT-005000-UpperBounds-09
FORMULA_NAME Philosophers-PT-005000-UpperBounds-10
FORMULA_NAME Philosophers-PT-005000-UpperBounds-11
FORMULA_NAME Philosophers-PT-005000-UpperBounds-12
FORMULA_NAME Philosophers-PT-005000-UpperBounds-13
FORMULA_NAME Philosophers-PT-005000-UpperBounds-14
FORMULA_NAME Philosophers-PT-005000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1622998350106
Running Version 0
[2021-06-06 16:52:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-06-06 16:52:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-06 16:52:32] [INFO ] Load time of PNML (sax parser for PT used): 675 ms
[2021-06-06 16:52:32] [INFO ] Transformed 25000 places.
[2021-06-06 16:52:32] [INFO ] Transformed 25000 transitions.
[2021-06-06 16:52:32] [INFO ] Parsed PT model containing 25000 places and 25000 transitions in 910 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5368 ms.
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 16:52:38] [INFO ] Computed 10000 place invariants in 237 ms
FORMULA Philosophers-PT-005000-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-UpperBounds-03 5000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-UpperBounds-01 5000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24558 ms. (steps per millisecond=0 ) properties (out of 11) seen :4722
FORMULA Philosophers-PT-005000-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-005000-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-005000-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3024 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2992 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2906 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2910 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2854 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2986 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 1634 ms. (steps per millisecond=6 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 1468 ms. (steps per millisecond=6 ) properties (out of 8) seen :0
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 16:53:24] [INFO ] Computed 10000 place invariants in 67 ms
[2021-06-06 16:53:29] [INFO ] [Real]Absence check using 10000 positive place invariants in 1784 ms returned unknown
[2021-06-06 16:53:34] [INFO ] [Real]Absence check using 10000 positive place invariants in 1890 ms returned unknown
[2021-06-06 16:53:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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)
[2021-06-06 16:53:44] [INFO ] [Real]Absence check using 10000 positive place invariants in 2168 ms returned unknown
[2021-06-06 16:53:49] [INFO ] [Real]Absence check using 10000 positive place invariants in 2214 ms returned sat
[2021-06-06 16:53:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 16:53:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
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)
[2021-06-06 16:53:54] [INFO ] [Real]Absence check using 10000 positive place invariants in 1877 ms returned sat
[2021-06-06 16:53:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 16:53:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
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)
[2021-06-06 16:53:59] [INFO ] [Real]Absence check using 10000 positive place invariants in 1798 ms returned unknown
[2021-06-06 16:54:04] [INFO ] [Real]Absence check using 10000 positive place invariants in 2058 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 5000, 5000, 5000, 5000, 5000, 1, 1] Max seen :[445, 1115, 1154, 445, 445, 1115, 0, 0]
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 2458 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
[2021-06-06 16:54:07] [INFO ] Computed 10000 place invariants in 97 ms
Interrupted random walk after 14932 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen :{0=740, 1=1636, 2=1750, 3=740, 4=740, 5=1636}
Interrupted Best-First random walk after 17002 steps, including 0 resets, run timeout after 5006 ms. (steps per millisecond=3 ) properties seen :{2=1}
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5080 ms. (steps per millisecond=3 ) properties seen :{1=1, 5=1}
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5166 ms. (steps per millisecond=3 ) properties seen :{2=1}
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5184 ms. (steps per millisecond=3 ) properties seen :{2=1}
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5221 ms. (steps per millisecond=3 ) properties seen :{1=1, 5=1}
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5061 ms. (steps per millisecond=3 ) properties seen :{1=1, 5=1}
Interrupted Best-First random walk after 33998 steps, including 0 resets, run timeout after 5007 ms. (steps per millisecond=6 ) properties seen :{1=3, 5=3}
Interrupted Best-First random walk after 33998 steps, including 0 resets, run timeout after 5131 ms. (steps per millisecond=6 ) properties seen :{1=1, 2=2, 5=1}
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 16:55:18] [INFO ] Computed 10000 place invariants in 65 ms
[2021-06-06 16:55:29] [INFO ] [Real]Absence check using 10000 positive place invariants in 8332 ms returned sat
[2021-06-06 16:55:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 16:56:03] [INFO ] [Real]Absence check using state equation in 33500 ms returned unknown
[2021-06-06 16:56:17] [INFO ] [Real]Absence check using 10000 positive place invariants in 11293 ms returned sat
[2021-06-06 16:56:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 16:56:48] [INFO ] [Real]Absence check using state equation in 30662 ms returned unknown
[2021-06-06 16:57:03] [INFO ] [Real]Absence check using 10000 positive place invariants in 12238 ms returned sat
[2021-06-06 16:57:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 16:57:33] [INFO ] [Real]Absence check using state equation in 29716 ms returned unknown
[2021-06-06 16:57:44] [INFO ] [Real]Absence check using 10000 positive place invariants in 8788 ms returned sat
[2021-06-06 16:57:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 16:58:18] [INFO ] [Real]Absence check using state equation in 33423 ms returned unknown
[2021-06-06 16:58:31] [INFO ] [Real]Absence check using 10000 positive place invariants in 9489 ms returned sat
[2021-06-06 16:58:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 16:59:03] [INFO ] [Real]Absence check using state equation in 32421 ms returned unknown
[2021-06-06 16:59:17] [INFO ] [Real]Absence check using 10000 positive place invariants in 11021 ms returned sat
[2021-06-06 16:59:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 16:59:48] [INFO ] [Real]Absence check using state equation in 30980 ms returned unknown
[2021-06-06 16:59:58] [INFO ] [Real]Absence check using 10000 positive place invariants in 7035 ms returned sat
[2021-06-06 16:59:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:00:33] [INFO ] [Real]Absence check using state equation in 35151 ms returned unknown
[2021-06-06 17:00:44] [INFO ] [Real]Absence check using 10000 positive place invariants in 7781 ms returned sat
[2021-06-06 17:00:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:01:18] [INFO ] [Real]Absence check using state equation in 34182 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 5000, 5000, 5000, 5000, 5000, 1, 1] Max seen :[740, 1636, 1750, 740, 740, 1636, 0, 0]
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 1928 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 1738 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 17:01:22] [INFO ] Computed 10000 place invariants in 55 ms
[2021-06-06 17:01:25] [INFO ] Implicit Places using invariants in 2992 ms returned []
Implicit Place search using SMT only with invariants took 2992 ms to find 0 implicit places.
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 17:01:25] [INFO ] Computed 10000 place invariants in 52 ms
[2021-06-06 17:01:27] [INFO ] Dead Transitions using invariants and state equation in 2000 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 17:01:27] [INFO ] Computed 10000 place invariants in 59 ms
Interrupted random walk after 14608 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen :{0=714, 1=1841, 2=1686, 3=714, 4=714, 5=1841, 6=1}
FORMULA Philosophers-PT-005000-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5201 ms. (steps per millisecond=3 ) properties seen :{1=1, 5=1}
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5068 ms. (steps per millisecond=3 ) properties seen :{1=1, 5=1}
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5077 ms. (steps per millisecond=3 ) properties seen :{2=1}
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5094 ms. (steps per millisecond=3 ) properties seen :{1=1, 5=1}
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5081 ms. (steps per millisecond=3 ) properties seen :{2=1}
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5062 ms. (steps per millisecond=3 ) properties seen :{1=1, 5=1}
Interrupted Best-First random walk after 30998 steps, including 0 resets, run timeout after 5030 ms. (steps per millisecond=6 ) properties seen :{1=2, 2=1, 5=2}
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 17:02:33] [INFO ] Computed 10000 place invariants in 57 ms
[2021-06-06 17:02:46] [INFO ] [Real]Absence check using 10000 positive place invariants in 10488 ms returned sat
[2021-06-06 17:02:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:03:18] [INFO ] [Real]Absence check using state equation in 31436 ms returned unknown
[2021-06-06 17:03:32] [INFO ] [Real]Absence check using 10000 positive place invariants in 11810 ms returned sat
[2021-06-06 17:03:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:04:03] [INFO ] [Real]Absence check using state equation in 30306 ms returned unknown
[2021-06-06 17:04:18] [INFO ] [Real]Absence check using 10000 positive place invariants in 12752 ms returned sat
[2021-06-06 17:04:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:04:48] [INFO ] [Real]Absence check using state equation in 29433 ms returned unknown
[2021-06-06 17:05:00] [INFO ] [Real]Absence check using 10000 positive place invariants in 9083 ms returned sat
[2021-06-06 17:05:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:05:33] [INFO ] [Real]Absence check using state equation in 33151 ms returned unknown
[2021-06-06 17:05:45] [INFO ] [Real]Absence check using 10000 positive place invariants in 9108 ms returned sat
[2021-06-06 17:05:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:06:18] [INFO ] [Real]Absence check using state equation in 33029 ms returned unknown
[2021-06-06 17:06:32] [INFO ] [Real]Absence check using 10000 positive place invariants in 10909 ms returned sat
[2021-06-06 17:06:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:07:03] [INFO ] [Real]Absence check using state equation in 31292 ms returned unknown
[2021-06-06 17:07:13] [INFO ] [Real]Absence check using 10000 positive place invariants in 7595 ms returned sat
[2021-06-06 17:07:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:07:48] [INFO ] [Real]Absence check using state equation in 34323 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 5000, 5000, 5000, 5000, 5000, 1] Max seen :[740, 1841, 1750, 740, 740, 1841, 0]
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 1773 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
[2021-06-06 17:07:50] [INFO ] Computed 10000 place invariants in 71 ms
Interrupted random walk after 15071 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen :{0=693, 1=1645, 2=1824, 3=693, 4=693, 5=1645}
Interrupted Best-First random walk after 19002 steps, including 0 resets, run timeout after 5253 ms. (steps per millisecond=3 ) properties seen :{2=1}
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5006 ms. (steps per millisecond=3 ) properties seen :{1=1, 5=1}
Interrupted Best-First random walk after 19002 steps, including 0 resets, run timeout after 5186 ms. (steps per millisecond=3 ) properties seen :{2=1}
Interrupted Best-First random walk after 17002 steps, including 0 resets, run timeout after 5232 ms. (steps per millisecond=3 ) properties seen :{1=1, 5=1}
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5247 ms. (steps per millisecond=3 ) properties seen :{2=1}
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5173 ms. (steps per millisecond=3 ) properties seen :{1=1, 5=1}
Interrupted Best-First random walk after 32998 steps, including 0 resets, run timeout after 5039 ms. (steps per millisecond=6 ) properties seen :{2=3}
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 17:08:56] [INFO ] Computed 10000 place invariants in 53 ms
[2021-06-06 17:09:09] [INFO ] [Real]Absence check using 10000 positive place invariants in 10239 ms returned sat
[2021-06-06 17:09:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:09:41] [INFO ] [Real]Absence check using state equation in 31788 ms returned unknown
[2021-06-06 17:09:56] [INFO ] [Real]Absence check using 10000 positive place invariants in 12449 ms returned sat
[2021-06-06 17:09:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:10:26] [INFO ] [Real]Absence check using state equation in 29541 ms returned unknown
[2021-06-06 17:10:42] [INFO ] [Real]Absence check using 10000 positive place invariants in 12679 ms returned sat
[2021-06-06 17:10:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:11:11] [INFO ] [Real]Absence check using state equation in 29290 ms returned unknown
[2021-06-06 17:11:24] [INFO ] [Real]Absence check using 10000 positive place invariants in 9700 ms returned sat
[2021-06-06 17:11:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:11:56] [INFO ] [Real]Absence check using state equation in 32393 ms returned unknown
[2021-06-06 17:12:08] [INFO ] [Real]Absence check using 10000 positive place invariants in 8939 ms returned sat
[2021-06-06 17:12:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:12:41] [INFO ] [Real]Absence check using state equation in 32958 ms returned unknown
[2021-06-06 17:12:56] [INFO ] [Real]Absence check using 10000 positive place invariants in 12262 ms returned sat
[2021-06-06 17:12:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:13:26] [INFO ] [Real]Absence check using state equation in 29743 ms returned unknown
[2021-06-06 17:13:36] [INFO ] [Real]Absence check using 10000 positive place invariants in 7059 ms returned sat
[2021-06-06 17:13:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:14:11] [INFO ] [Real]Absence check using state equation in 35055 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 5000, 5000, 5000, 5000, 5000, 1] Max seen :[740, 1841, 1824, 740, 740, 1841, 0]
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 1640 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 1592 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 17:14:15] [INFO ] Computed 10000 place invariants in 48 ms
[2021-06-06 17:14:17] [INFO ] Implicit Places using invariants in 2249 ms returned []
Implicit Place search using SMT only with invariants took 2251 ms to find 0 implicit places.
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 17:14:17] [INFO ] Computed 10000 place invariants in 66 ms
[2021-06-06 17:14:19] [INFO ] Dead Transitions using invariants and state equation in 2301 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 17:14:19] [INFO ] Computed 10000 place invariants in 82 ms
Interrupted random walk after 14953 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=0 ) properties seen :{0=759, 1=1768, 2=1713, 3=759, 4=759, 5=1768, 6=1}
FORMULA Philosophers-PT-005000-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5068 ms. (steps per millisecond=3 ) properties seen :{2=1}
Interrupted Best-First random walk after 19002 steps, including 0 resets, run timeout after 5258 ms. (steps per millisecond=3 ) properties seen :{1=1, 5=1}
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5077 ms. (steps per millisecond=3 ) properties seen :{2=1}
Interrupted Best-First random walk after 19002 steps, including 0 resets, run timeout after 5293 ms. (steps per millisecond=3 ) properties seen :{1=1, 5=1}
Interrupted Best-First random walk after 19002 steps, including 0 resets, run timeout after 5245 ms. (steps per millisecond=3 ) properties seen :{1=1, 5=1}
Interrupted Best-First random walk after 19002 steps, including 0 resets, run timeout after 5269 ms. (steps per millisecond=3 ) properties seen :{1=1, 5=1}
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 17:15:20] [INFO ] Computed 10000 place invariants in 67 ms
[2021-06-06 17:15:34] [INFO ] [Real]Absence check using 10000 positive place invariants in 10651 ms returned sat
[2021-06-06 17:15:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:16:06] [INFO ] [Real]Absence check using state equation in 31478 ms returned unknown
[2021-06-06 17:16:20] [INFO ] [Real]Absence check using 10000 positive place invariants in 11737 ms returned sat
[2021-06-06 17:16:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:16:51] [INFO ] [Real]Absence check using state equation in 30470 ms returned unknown
[2021-06-06 17:17:06] [INFO ] [Real]Absence check using 10000 positive place invariants in 12199 ms returned sat
[2021-06-06 17:17:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:17:36] [INFO ] [Real]Absence check using state equation in 29698 ms returned unknown
[2021-06-06 17:17:49] [INFO ] [Real]Absence check using 10000 positive place invariants in 10316 ms returned sat
[2021-06-06 17:17:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:18:21] [INFO ] [Real]Absence check using state equation in 31827 ms returned unknown
[2021-06-06 17:18:34] [INFO ] [Real]Absence check using 10000 positive place invariants in 10372 ms returned sat
[2021-06-06 17:18:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:19:06] [INFO ] [Real]Absence check using state equation in 31495 ms returned unknown
[2021-06-06 17:19:21] [INFO ] [Real]Absence check using 10000 positive place invariants in 12186 ms returned sat
[2021-06-06 17:19:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:19:51] [INFO ] [Real]Absence check using state equation in 29760 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 5000, 5000, 5000, 5000, 5000] Max seen :[759, 1841, 1824, 759, 759, 1841]
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 1627 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
[2021-06-06 17:19:52] [INFO ] Computed 10000 place invariants in 48 ms
Interrupted random walk after 15271 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen :{0=696, 1=1788, 2=1807, 3=696, 4=696, 5=1788}
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5058 ms. (steps per millisecond=3 ) properties seen :{1=1, 5=1}
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5080 ms. (steps per millisecond=3 ) properties seen :{1=1, 5=1}
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5044 ms. (steps per millisecond=3 ) properties seen :{2=1}
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5064 ms. (steps per millisecond=3 ) properties seen :{2=1}
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5077 ms. (steps per millisecond=3 ) properties seen :{1=1, 5=1}
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5030 ms. (steps per millisecond=3 ) properties seen :{1=1, 5=1}
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 17:20:53] [INFO ] Computed 10000 place invariants in 73 ms
[2021-06-06 17:21:05] [INFO ] [Real]Absence check using 10000 positive place invariants in 9440 ms returned sat
[2021-06-06 17:21:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:21:38] [INFO ] [Real]Absence check using state equation in 32633 ms returned unknown
[2021-06-06 17:21:53] [INFO ] [Real]Absence check using 10000 positive place invariants in 12185 ms returned sat
[2021-06-06 17:21:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:22:23] [INFO ] [Real]Absence check using state equation in 29974 ms returned unknown
[2021-06-06 17:22:38] [INFO ] [Real]Absence check using 10000 positive place invariants in 12311 ms returned sat
[2021-06-06 17:22:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:23:08] [INFO ] [Real]Absence check using state equation in 29819 ms returned unknown
[2021-06-06 17:23:23] [INFO ] [Real]Absence check using 10000 positive place invariants in 11794 ms returned sat
[2021-06-06 17:23:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:23:53] [INFO ] [Real]Absence check using state equation in 30328 ms returned unknown
[2021-06-06 17:24:06] [INFO ] [Real]Absence check using 10000 positive place invariants in 10200 ms returned sat
[2021-06-06 17:24:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:24:38] [INFO ] [Real]Absence check using state equation in 31914 ms returned unknown
[2021-06-06 17:24:55] [INFO ] [Real]Absence check using 10000 positive place invariants in 13575 ms returned sat
[2021-06-06 17:24:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:25:23] [INFO ] [Real]Absence check using state equation in 28260 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 5000, 5000, 5000, 5000, 5000] Max seen :[759, 1841, 1824, 759, 759, 1841]
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 1640 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 1612 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 17:25:26] [INFO ] Computed 10000 place invariants in 53 ms
[2021-06-06 17:25:28] [INFO ] Implicit Places using invariants in 2063 ms returned []
Implicit Place search using SMT only with invariants took 2064 ms to find 0 implicit places.
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 17:25:29] [INFO ] Computed 10000 place invariants in 52 ms
[2021-06-06 17:25:30] [INFO ] Dead Transitions using invariants and state equation in 2000 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 25000/25000 transitions.
Starting property specific reduction for Philosophers-PT-005000-UpperBounds-00
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 17:25:31] [INFO ] Computed 10000 place invariants in 58 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16230 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 2863 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 17:25:50] [INFO ] Computed 10000 place invariants in 70 ms
[2021-06-06 17:25:55] [INFO ] [Real]Absence check using 10000 positive place invariants in 2185 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, 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 10505 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
[2021-06-06 17:26:05] [INFO ] Computed 10000 place invariants in 17 ms
Interrupted random walk after 32256 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :{0=1432}
Interrupted Best-First random walk after 18998 steps, including 0 resets, run timeout after 5242 ms. (steps per millisecond=3 ) properties seen :{0=3}
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:26:41] [INFO ] Computed 10000 place invariants in 23 ms
[2021-06-06 17:26:51] [INFO ] [Real]Absence check using 10000 positive place invariants in 8565 ms returned sat
[2021-06-06 17:26:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:27:10] [INFO ] [Real]Absence check using state equation in 19494 ms returned sat
[2021-06-06 17:27:11] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 17:27:21] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9112 ms returned sat
[2021-06-06 17:27:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 17:27:51] [INFO ] [Nat]Absence check using state equation in 29522 ms returned sat
[2021-06-06 17:27:52] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 470 ms.
[2021-06-06 17:27:54] [INFO ] Added : 0 causal constraints over 0 iterations in 1819 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1432]
Interrupted Parikh walk after 56717 steps, including 39 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties (out of 1) seen :1433
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 945 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 922 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:28:26] [INFO ] Computed 10000 place invariants in 18 ms
[2021-06-06 17:28:28] [INFO ] Implicit Places using invariants in 1395 ms returned []
Implicit Place search using SMT only with invariants took 1396 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:28:28] [INFO ] Computed 10000 place invariants in 23 ms
[2021-06-06 17:28:29] [INFO ] Dead Transitions using invariants and state equation in 1233 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:28:29] [INFO ] Computed 10000 place invariants in 28 ms
Interrupted random walk after 32439 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :{0=1444}
Interrupted Best-First random walk after 17998 steps, including 0 resets, run timeout after 5156 ms. (steps per millisecond=3 ) properties seen :{0=3}
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:29:04] [INFO ] Computed 10000 place invariants in 23 ms
[2021-06-06 17:29:14] [INFO ] [Real]Absence check using 10000 positive place invariants in 8964 ms returned sat
[2021-06-06 17:29:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:29:39] [INFO ] [Real]Absence check using state equation in 24829 ms returned sat
[2021-06-06 17:29:40] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 17:29:50] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9199 ms returned sat
[2021-06-06 17:29:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 17:30:17] [INFO ] [Nat]Absence check using state equation in 26929 ms returned sat
[2021-06-06 17:30:19] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 445 ms.
[2021-06-06 17:30:20] [INFO ] Added : 0 causal constraints over 0 iterations in 1776 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1444]
Interrupted Parikh walk after 55634 steps, including 38 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties (out of 1) seen :1445
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 1053 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 966 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:30:53] [INFO ] Computed 10000 place invariants in 30 ms
[2021-06-06 17:30:54] [INFO ] Implicit Places using invariants in 1394 ms returned []
Implicit Place search using SMT only with invariants took 1399 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:30:54] [INFO ] Computed 10000 place invariants in 24 ms
[2021-06-06 17:30:55] [INFO ] Dead Transitions using invariants and state equation in 1284 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:30:55] [INFO ] Computed 10000 place invariants in 18 ms
Interrupted random walk after 32062 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :{0=1431}
Interrupted Best-First random walk after 17998 steps, including 0 resets, run timeout after 5067 ms. (steps per millisecond=3 ) properties seen :{0=3}
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:31:30] [INFO ] Computed 10000 place invariants in 29 ms
[2021-06-06 17:31:41] [INFO ] [Real]Absence check using 10000 positive place invariants in 8908 ms returned sat
[2021-06-06 17:31:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:32:07] [INFO ] [Real]Absence check using state equation in 26237 ms returned sat
[2021-06-06 17:32:07] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 17:32:19] [INFO ] [Nat]Absence check using 10000 positive place invariants in 10098 ms returned sat
[2021-06-06 17:32:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 17:32:45] [INFO ] [Nat]Absence check using state equation in 26205 ms returned sat
[2021-06-06 17:32:46] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 431 ms.
[2021-06-06 17:32:48] [INFO ] Added : 0 causal constraints over 0 iterations in 1708 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1445]
Interrupted Parikh walk after 55576 steps, including 38 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties (out of 1) seen :1446
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 986 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 974 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:33:20] [INFO ] Computed 10000 place invariants in 26 ms
[2021-06-06 17:33:22] [INFO ] Implicit Places using invariants in 1361 ms returned []
Implicit Place search using SMT only with invariants took 1366 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:33:22] [INFO ] Computed 10000 place invariants in 28 ms
[2021-06-06 17:33:23] [INFO ] Dead Transitions using invariants and state equation in 1390 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:33:23] [INFO ] Computed 10000 place invariants in 32 ms
Interrupted random walk after 32200 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :{0=1434}
Interrupted Best-First random walk after 17998 steps, including 0 resets, run timeout after 5057 ms. (steps per millisecond=3 ) properties seen :{0=3}
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:33:58] [INFO ] Computed 10000 place invariants in 30 ms
[2021-06-06 17:34:10] [INFO ] [Real]Absence check using 10000 positive place invariants in 10252 ms returned sat
[2021-06-06 17:34:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:34:38] [INFO ] [Real]Absence check using state equation in 27983 ms returned sat
[2021-06-06 17:34:38] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 17:34:50] [INFO ] [Nat]Absence check using 10000 positive place invariants in 10129 ms returned sat
[2021-06-06 17:34:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 17:35:23] [INFO ] [Nat]Absence check using state equation in 33433 ms returned sat
[2021-06-06 17:36:46] [INFO ] Deduced a trap composed of 2 places in 82405 ms of which 24 ms to minimize.
[2021-06-06 17:36:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1446]
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 987 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 971 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:36:48] [INFO ] Computed 10000 place invariants in 30 ms
[2021-06-06 17:36:49] [INFO ] Implicit Places using invariants in 1261 ms returned []
Implicit Place search using SMT only with invariants took 1262 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:36:49] [INFO ] Computed 10000 place invariants in 25 ms
[2021-06-06 17:36:50] [INFO ] Dead Transitions using invariants and state equation in 1257 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
Ending property specific reduction for Philosophers-PT-005000-UpperBounds-00 in 679912 ms.
Starting property specific reduction for Philosophers-PT-005000-UpperBounds-02
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 17:36:51] [INFO ] Computed 10000 place invariants in 101 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17233 ms. (steps per millisecond=0 ) properties (out of 1) seen :1082
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2805 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 17:37:11] [INFO ] Computed 10000 place invariants in 76 ms
[2021-06-06 17:37:16] [INFO ] [Real]Absence check using 10000 positive place invariants in 1710 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1082]
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 10373 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
[2021-06-06 17:37:26] [INFO ] Computed 10000 place invariants in 27 ms
Interrupted random walk after 30328 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :{0=5000}
FORMULA Philosophers-PT-005000-UpperBounds-02 5000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Philosophers-PT-005000-UpperBounds-02 in 65726 ms.
Starting property specific reduction for Philosophers-PT-005000-UpperBounds-04
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 17:37:56] [INFO ] Computed 10000 place invariants in 67 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16518 ms. (steps per millisecond=0 ) properties (out of 1) seen :1088
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2787 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 17:38:16] [INFO ] Computed 10000 place invariants in 57 ms
[2021-06-06 17:38:21] [INFO ] [Real]Absence check using 10000 positive place invariants in 2104 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1088]
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 7 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 10725 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
[2021-06-06 17:38:31] [INFO ] Computed 10000 place invariants in 24 ms
Interrupted random walk after 30004 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :{0=5000}
FORMULA Philosophers-PT-005000-UpperBounds-04 5000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Philosophers-PT-005000-UpperBounds-04 in 65282 ms.
Starting property specific reduction for Philosophers-PT-005000-UpperBounds-05
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 17:39:02] [INFO ] Computed 10000 place invariants in 91 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16389 ms. (steps per millisecond=0 ) properties (out of 1) seen :446
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2561 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 17:39:21] [INFO ] Computed 10000 place invariants in 78 ms
[2021-06-06 17:39:26] [INFO ] [Real]Absence check using 10000 positive place invariants in 1896 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000] Max seen :[446]
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 9590 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
[2021-06-06 17:39:35] [INFO ] Computed 10000 place invariants in 29 ms
Interrupted random walk after 32064 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :{0=1451}
Interrupted Best-First random walk after 20993 steps, including 0 resets, run timeout after 5107 ms. (steps per millisecond=4 ) properties seen :{0=4}
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:40:10] [INFO ] Computed 10000 place invariants in 25 ms
[2021-06-06 17:40:21] [INFO ] [Real]Absence check using 10000 positive place invariants in 9418 ms returned sat
[2021-06-06 17:40:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:40:49] [INFO ] [Real]Absence check using state equation in 27575 ms returned sat
[2021-06-06 17:40:49] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 17:41:01] [INFO ] [Nat]Absence check using 10000 positive place invariants in 10209 ms returned sat
[2021-06-06 17:41:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 17:41:24] [INFO ] [Nat]Absence check using state equation in 22632 ms returned sat
[2021-06-06 17:41:25] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 470 ms.
[2021-06-06 17:41:26] [INFO ] Added : 0 causal constraints over 0 iterations in 1730 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1451]
Interrupted Parikh walk after 55189 steps, including 37 resets, run timeout after 30001 ms. (steps per millisecond=1 ) 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 1049 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 1033 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:41:59] [INFO ] Computed 10000 place invariants in 24 ms
[2021-06-06 17:42:00] [INFO ] Implicit Places using invariants in 1358 ms returned []
Implicit Place search using SMT only with invariants took 1359 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:42:00] [INFO ] Computed 10000 place invariants in 21 ms
[2021-06-06 17:42:02] [INFO ] Dead Transitions using invariants and state equation in 1249 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:42:02] [INFO ] Computed 10000 place invariants in 22 ms
Interrupted random walk after 31952 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :{0=1450}
Interrupted Best-First random walk after 19992 steps, including 0 resets, run timeout after 5139 ms. (steps per millisecond=3 ) properties seen :{0=3}
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:42:37] [INFO ] Computed 10000 place invariants in 23 ms
[2021-06-06 17:42:47] [INFO ] [Real]Absence check using 10000 positive place invariants in 9158 ms returned sat
[2021-06-06 17:42:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:43:13] [INFO ] [Real]Absence check using state equation in 25577 ms returned sat
[2021-06-06 17:43:14] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 17:43:26] [INFO ] [Nat]Absence check using 10000 positive place invariants in 10914 ms returned sat
[2021-06-06 17:43:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 17:43:53] [INFO ] [Nat]Absence check using state equation in 26945 ms returned sat
[2021-06-06 17:43:54] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 409 ms.
[2021-06-06 17:43:55] [INFO ] Added : 0 causal constraints over 0 iterations in 1808 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1452]
Interrupted Parikh walk after 55747 steps, including 38 resets, run timeout after 30001 ms. (steps per millisecond=1 ) 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 990 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 1031 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:44:28] [INFO ] Computed 10000 place invariants in 24 ms
[2021-06-06 17:44:29] [INFO ] Implicit Places using invariants in 1369 ms returned []
Implicit Place search using SMT only with invariants took 1375 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:44:29] [INFO ] Computed 10000 place invariants in 25 ms
[2021-06-06 17:44:31] [INFO ] Dead Transitions using invariants and state equation in 1302 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:44:31] [INFO ] Computed 10000 place invariants in 24 ms
Interrupted random walk after 31699 steps, including 0 resets, run timeout after 30006 ms. (steps per millisecond=1 ) properties seen :{0=1421}
Interrupted Best-First random walk after 19992 steps, including 0 resets, run timeout after 5028 ms. (steps per millisecond=3 ) properties seen :{0=3}
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:45:06] [INFO ] Computed 10000 place invariants in 27 ms
[2021-06-06 17:45:17] [INFO ] [Real]Absence check using 10000 positive place invariants in 9553 ms returned sat
[2021-06-06 17:45:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:45:38] [INFO ] [Real]Absence check using state equation in 21373 ms returned sat
[2021-06-06 17:45:39] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 17:45:50] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9419 ms returned sat
[2021-06-06 17:45:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 17:46:13] [INFO ] [Nat]Absence check using state equation in 22967 ms returned sat
[2021-06-06 17:46:14] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 359 ms.
[2021-06-06 17:46:15] [INFO ] Added : 0 causal constraints over 0 iterations in 1603 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1453]
Interrupted Parikh walk after 55962 steps, including 38 resets, run timeout after 30001 ms. (steps per millisecond=1 ) 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 1011 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 975 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:46:48] [INFO ] Computed 10000 place invariants in 25 ms
[2021-06-06 17:46:49] [INFO ] Implicit Places using invariants in 1366 ms returned []
Implicit Place search using SMT only with invariants took 1367 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:46:49] [INFO ] Computed 10000 place invariants in 27 ms
[2021-06-06 17:46:50] [INFO ] Dead Transitions using invariants and state equation in 1214 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:46:50] [INFO ] Computed 10000 place invariants in 24 ms
Interrupted random walk after 32027 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :{0=1442}
Interrupted Best-First random walk after 19992 steps, including 0 resets, run timeout after 5063 ms. (steps per millisecond=3 ) properties seen :{0=3}
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:47:25] [INFO ] Computed 10000 place invariants in 23 ms
[2021-06-06 17:47:36] [INFO ] [Real]Absence check using 10000 positive place invariants in 9521 ms returned sat
[2021-06-06 17:47:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:47:54] [INFO ] [Real]Absence check using state equation in 18211 ms returned sat
[2021-06-06 17:47:55] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 17:48:05] [INFO ] [Nat]Absence check using 10000 positive place invariants in 8998 ms returned sat
[2021-06-06 17:48:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 17:48:25] [INFO ] [Nat]Absence check using state equation in 20125 ms returned sat
[2021-06-06 17:48:26] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 378 ms.
[2021-06-06 17:48:28] [INFO ] Added : 0 causal constraints over 0 iterations in 1634 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1454]
Interrupted Parikh walk after 56589 steps, including 38 resets, run timeout after 30001 ms. (steps per millisecond=1 ) 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 973 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 996 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:49:00] [INFO ] Computed 10000 place invariants in 27 ms
[2021-06-06 17:49:02] [INFO ] Implicit Places using invariants in 1381 ms returned []
Implicit Place search using SMT only with invariants took 1387 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:49:02] [INFO ] Computed 10000 place invariants in 24 ms
[2021-06-06 17:49:03] [INFO ] Dead Transitions using invariants and state equation in 1359 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:49:03] [INFO ] Computed 10000 place invariants in 24 ms
Interrupted random walk after 32089 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :{0=1457}
Interrupted Best-First random walk after 19992 steps, including 0 resets, run timeout after 5156 ms. (steps per millisecond=3 ) properties seen :{0=3}
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:49:38] [INFO ] Computed 10000 place invariants in 41 ms
[2021-06-06 17:49:50] [INFO ] [Real]Absence check using 10000 positive place invariants in 10014 ms returned sat
[2021-06-06 17:49:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 17:50:10] [INFO ] [Real]Absence check using state equation in 19804 ms returned sat
[2021-06-06 17:50:10] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 17:50:20] [INFO ] [Nat]Absence check using 10000 positive place invariants in 8943 ms returned sat
[2021-06-06 17:50:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 17:50:42] [INFO ] [Nat]Absence check using state equation in 21505 ms returned sat
[2021-06-06 17:50:43] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 369 ms.
[2021-06-06 17:50:44] [INFO ] Added : 0 causal constraints over 0 iterations in 1587 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1457]
Interrupted Parikh walk after 56927 steps, including 38 resets, run timeout after 30001 ms. (steps per millisecond=1 ) 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 959 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 955 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:51:16] [INFO ] Computed 10000 place invariants in 28 ms
[2021-06-06 17:51:18] [INFO ] Implicit Places using invariants in 1374 ms returned []
Implicit Place search using SMT only with invariants took 1376 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:51:18] [INFO ] Computed 10000 place invariants in 22 ms
[2021-06-06 17:51:19] [INFO ] Dead Transitions using invariants and state equation in 1351 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15000/15000 places, 10000/10000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:51:19] [INFO ] Computed 10000 place invariants in 17 ms
Interrupted random walk after 32366 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :{0=1444}
Interrupted Best-First random walk after 19992 steps, including 0 resets, run timeout after 5055 ms. (steps per millisecond=3 ) properties seen :{0=3}
// Phase 1: matrix 10000 rows 15000 cols
[2021-06-06 17:51:54] [INFO ] Computed 10000 place invariants in 26 ms
[2021-06-06 17:52:08] [INFO ] [Real]Absence check using 10000 positive place invariants in 12197 ms returned sat
[2021-06-06 17:52:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
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-PT-005000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Philosophers-PT-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 r140-tall-162298996000171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-005000.tgz
mv Philosophers-PT-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 ;