Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r293-tall-167873945000157.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
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 r293-tall-167873945000157
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 8.3K Feb 25 21:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 21:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 17:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 17:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 08:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 08:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 03:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Feb 26 03:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 227K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Philosophers-COL-005000-UpperBounds-00
FORMULA_NAME Philosophers-COL-005000-UpperBounds-01
FORMULA_NAME Philosophers-COL-005000-UpperBounds-02
FORMULA_NAME Philosophers-COL-005000-UpperBounds-03
FORMULA_NAME Philosophers-COL-005000-UpperBounds-04
FORMULA_NAME Philosophers-COL-005000-UpperBounds-05
FORMULA_NAME Philosophers-COL-005000-UpperBounds-06
FORMULA_NAME Philosophers-COL-005000-UpperBounds-07
FORMULA_NAME Philosophers-COL-005000-UpperBounds-08
FORMULA_NAME Philosophers-COL-005000-UpperBounds-09
FORMULA_NAME Philosophers-COL-005000-UpperBounds-10
FORMULA_NAME Philosophers-COL-005000-UpperBounds-11
FORMULA_NAME Philosophers-COL-005000-UpperBounds-12
FORMULA_NAME Philosophers-COL-005000-UpperBounds-13
FORMULA_NAME Philosophers-COL-005000-UpperBounds-14
FORMULA_NAME Philosophers-COL-005000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678797291762

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-005000
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202303021504
[2023-03-14 12:34:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-14 12:34:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 12:34:53] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-14 12:34:53] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 12:34:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 501 ms
[2023-03-14 12:34:53] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 25000 PT places and 25000.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
[2023-03-14 12:34:53] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 4 ms.
[2023-03-14 12:34:53] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 5 rows 5 cols
[2023-03-14 12:34:53] [INFO ] Computed 2 place invariants in 3 ms
FORMULA Philosophers-COL-005000-UpperBounds-15 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-005000-UpperBounds-10 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-005000-UpperBounds-08 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-005000-UpperBounds-07 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-005000-UpperBounds-05 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-005000-UpperBounds-03 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-14 12:34:53] [INFO ] Invariant cache hit.
[2023-03-14 12:34:54] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-14 12:34:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:34:54] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-14 12:34:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 12:34:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-14 12:34:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 12:34:54] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-14 12:34:54] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-14 12:34:54] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 1203 ms.
[2023-03-14 12:34:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 12:34:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:34:55] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-14 12:34:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 12:34:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 12:34:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 12:34:55] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-14 12:34:55] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 12:34:55] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2023-03-14 12:34:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 12:34:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:34:55] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-14 12:34:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 12:34:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 12:34:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 12:34:55] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-14 12:34:55] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 12:34:55] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2023-03-14 12:34:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 12:34:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:34:55] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-14 12:34:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 12:34:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 12:34:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 12:34:55] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-14 12:34:55] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-14 12:34:55] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2023-03-14 12:34:55] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-14 12:34:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:34:55] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-14 12:34:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 12:34:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 12:34:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 12:34:55] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-14 12:34:55] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-14 12:34:55] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2023-03-14 12:34:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 12:34:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:34:55] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-14 12:34:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 12:34:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 12:34:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 12:34:55] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-14 12:34:55] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-14 12:34:55] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2023-03-14 12:34:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 12:34:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:34:55] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-14 12:34:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 12:34:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-14 12:34:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 12:34:55] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-14 12:34:55] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 12:34:55] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2023-03-14 12:34:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 12:34:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:34:55] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-14 12:34:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 12:34:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 12:34:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 12:34:55] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-14 12:34:55] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-14 12:34:55] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2023-03-14 12:34:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 12:34:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:34:55] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-14 12:34:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 12:34:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 12:34:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 12:34:55] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-14 12:34:55] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 12:34:55] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 5 ms.
[2023-03-14 12:34:55] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-14 12:34:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:34:55] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-14 12:34:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 12:34:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 12:34:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 12:34:55] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-14 12:34:55] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-14 12:34:55] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [5000, 2500, 5000, 2500, 2500, 5000, 5000, 2500, 5000, 2500]
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 5000) 5000) 5000)]] contains successor/predecessor on variables of sort Philo
[2023-03-14 12:34:56] [INFO ] Unfolded HLPN to a Petri net with 25000 places and 25000 transitions 80000 arcs in 239 ms.
[2023-03-14 12:34:56] [INFO ] Unfolded 10 HLPN properties in 4 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29698 ms. (steps per millisecond=0 ) properties (out of 10) seen :7640
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3299 ms. (steps per millisecond=3 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3618 ms. (steps per millisecond=2 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3682 ms. (steps per millisecond=2 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3639 ms. (steps per millisecond=2 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3685 ms. (steps per millisecond=2 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3576 ms. (steps per millisecond=2 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3467 ms. (steps per millisecond=2 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3609 ms. (steps per millisecond=2 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3555 ms. (steps per millisecond=2 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3488 ms. (steps per millisecond=2 ) properties (out of 10) seen :0
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-14 12:36:01] [INFO ] Computed 10000 place invariants in 175 ms
[2023-03-14 12:36:06] [INFO ] [Real]Absence check using 10000 positive place invariants in 2026 ms returned unknown
[2023-03-14 12:36:11] [INFO ] [Real]Absence check using 10000 positive place invariants in 2148 ms returned unknown
[2023-03-14 12:36:16] [INFO ] [Real]Absence check using 10000 positive place invariants in 2241 ms returned unknown
[2023-03-14 12:36:21] [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 3
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.assertInvariants(DeadlockTester.java:2340)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:886)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-14 12:36:26] [INFO ] [Real]Absence check using 10000 positive place invariants in 2313 ms returned unknown
[2023-03-14 12:36:31] [INFO ] [Real]Absence check using 10000 positive place invariants in 2205 ms returned unknown
[2023-03-14 12:36:36] [INFO ] [Real]Absence check using 10000 positive place invariants in 2307 ms returned unknown
[2023-03-14 12:36:41] [INFO ] [Real]Absence check using 10000 positive place invariants in 2245 ms returned unknown
[2023-03-14 12: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 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.assertInvariants(DeadlockTester.java:2340)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:886)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-14 12:36:52] [INFO ] [Real]Absence check using 10000 positive place invariants in 2277 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 2500, 5000, 2500, 2500, 5000, 5000, 2500, 5000, 2500] Max seen :[1107, 435, 1107, 435, 435, 1072, 1072, 435, 1107, 435]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 2479 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2484 ms. Remains : 25000/25000 places, 25000/25000 transitions.
[2023-03-14 12:36:54] [INFO ] Invariant cache hit.
Finished random walk after 11104 steps, including 0 resets, run visited all 10 properties in 30003 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5255 ms. (steps per millisecond=3 ) properties seen 3
Interrupted Best-First random walk after 17002 steps, including 0 resets, run timeout after 5028 ms. (steps per millisecond=3 ) properties seen 3
Interrupted Best-First random walk after 15002 steps, including 0 resets, run timeout after 5240 ms. (steps per millisecond=2 ) properties seen 3
Interrupted Best-First random walk after 15002 steps, including 0 resets, run timeout after 5293 ms. (steps per millisecond=2 ) properties seen 5
Interrupted Best-First random walk after 15002 steps, including 0 resets, run timeout after 5316 ms. (steps per millisecond=2 ) properties seen 2
Interrupted Best-First random walk after 15002 steps, including 0 resets, run timeout after 5063 ms. (steps per millisecond=2 ) properties seen 2
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5145 ms. (steps per millisecond=3 ) properties seen 2
Interrupted Best-First random walk after 17002 steps, including 0 resets, run timeout after 5114 ms. (steps per millisecond=3 ) properties seen 2
Interrupted Best-First random walk after 17002 steps, including 0 resets, run timeout after 5010 ms. (steps per millisecond=3 ) properties seen 3
Interrupted Best-First random walk after 17002 steps, including 0 resets, run timeout after 5079 ms. (steps per millisecond=3 ) properties seen 5
[2023-03-14 12:38:16] [INFO ] Invariant cache hit.
[2023-03-14 12:38:30] [INFO ] [Real]Absence check using 10000 positive place invariants in 11140 ms returned sat
[2023-03-14 12:38:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:39:01] [INFO ] [Real]Absence check using state equation in 31135 ms returned unknown
[2023-03-14 12:39:12] [INFO ] [Real]Absence check using 10000 positive place invariants in 8387 ms returned sat
[2023-03-14 12:39:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:39:46] [INFO ] [Real]Absence check using state equation in 33884 ms returned unknown
[2023-03-14 12:39:59] [INFO ] [Real]Absence check using 10000 positive place invariants in 10500 ms returned sat
[2023-03-14 12:39:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:40:31] [INFO ] [Real]Absence check using state equation in 31771 ms returned unknown
[2023-03-14 12:40:42] [INFO ] [Real]Absence check using 10000 positive place invariants in 8323 ms returned sat
[2023-03-14 12:40:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:41:16] [INFO ] [Real]Absence check using state equation in 33630 ms returned unknown
[2023-03-14 12:41:27] [INFO ] [Real]Absence check using 10000 positive place invariants in 8712 ms returned sat
[2023-03-14 12:41:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:42:01] [INFO ] [Real]Absence check using state equation in 33527 ms returned unknown
[2023-03-14 12:42:15] [INFO ] [Real]Absence check using 10000 positive place invariants in 11343 ms returned sat
[2023-03-14 12:42:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:42:46] [INFO ] [Real]Absence check using state equation in 30936 ms returned unknown
[2023-03-14 12:43:02] [INFO ] [Real]Absence check using 10000 positive place invariants in 12753 ms returned sat
[2023-03-14 12:43:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:43:31] [INFO ] [Real]Absence check using state equation in 29454 ms returned unknown
[2023-03-14 12:43:43] [INFO ] [Real]Absence check using 10000 positive place invariants in 9378 ms returned sat
[2023-03-14 12:43:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:44:16] [INFO ] [Real]Absence check using state equation in 32796 ms returned unknown
[2023-03-14 12:44:29] [INFO ] [Real]Absence check using 10000 positive place invariants in 10419 ms returned sat
[2023-03-14 12:44:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:45:01] [INFO ] [Real]Absence check using state equation in 31835 ms returned unknown
[2023-03-14 12:45:13] [INFO ] [Real]Absence check using 10000 positive place invariants in 8710 ms returned sat
[2023-03-14 12:45:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:45:46] [INFO ] [Real]Absence check using state equation in 33567 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 2500, 5000, 2500, 2500, 5000, 5000, 2500, 5000, 2500] Max seen :[1541, 680, 1541, 680, 680, 1768, 1768, 680, 1541, 680]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 2485 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2485 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1878 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-14 12:45:50] [INFO ] Invariant cache hit.
[2023-03-14 12:45:52] [INFO ] Implicit Places using invariants in 1885 ms returned []
Implicit Place search using SMT only with invariants took 1887 ms to find 0 implicit places.
[2023-03-14 12:45:52] [INFO ] Invariant cache hit.
[2023-03-14 12:45:54] [INFO ] Dead Transitions using invariants and state equation in 1902 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5671 ms. Remains : 25000/25000 places, 25000/25000 transitions.
[2023-03-14 12:45:54] [INFO ] Invariant cache hit.
Finished random walk after 11007 steps, including 0 resets, run visited all 10 properties in 30002 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5263 ms. (steps per millisecond=3 ) properties seen 3
Interrupted Best-First random walk after 17002 steps, including 0 resets, run timeout after 5110 ms. (steps per millisecond=3 ) properties seen 2
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5258 ms. (steps per millisecond=3 ) properties seen 3
Interrupted Best-First random walk after 17002 steps, including 0 resets, run timeout after 5108 ms. (steps per millisecond=3 ) properties seen 2
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5270 ms. (steps per millisecond=3 ) properties seen 3
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5120 ms. (steps per millisecond=3 ) properties seen 2
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5071 ms. (steps per millisecond=3 ) properties seen 2
Interrupted Best-First random walk after 17002 steps, including 0 resets, run timeout after 5016 ms. (steps per millisecond=3 ) properties seen 2
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5101 ms. (steps per millisecond=3 ) properties seen 3
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5186 ms. (steps per millisecond=3 ) properties seen 5
[2023-03-14 12:47:16] [INFO ] Invariant cache hit.
[2023-03-14 12:47:30] [INFO ] [Real]Absence check using 10000 positive place invariants in 11118 ms returned sat
[2023-03-14 12:47:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:48:01] [INFO ] [Real]Absence check using state equation in 31099 ms returned unknown
[2023-03-14 12:48:12] [INFO ] [Real]Absence check using 10000 positive place invariants in 8203 ms returned sat
[2023-03-14 12:48:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:48:46] [INFO ] [Real]Absence check using state equation in 33639 ms returned unknown
[2023-03-14 12:49:00] [INFO ] [Real]Absence check using 10000 positive place invariants in 10853 ms returned sat
[2023-03-14 12:49:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:49:31] [INFO ] [Real]Absence check using state equation in 31422 ms returned unknown
[2023-03-14 12:49:42] [INFO ] [Real]Absence check using 10000 positive place invariants in 8230 ms returned sat
[2023-03-14 12:49:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:50:16] [INFO ] [Real]Absence check using state equation in 34063 ms returned unknown
[2023-03-14 12:50:27] [INFO ] [Real]Absence check using 10000 positive place invariants in 8547 ms returned sat
[2023-03-14 12:50:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:51:01] [INFO ] [Real]Absence check using state equation in 33659 ms returned unknown
[2023-03-14 12:51:16] [INFO ] [Real]Absence check using 10000 positive place invariants in 12093 ms returned sat
[2023-03-14 12:51:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:51:46] [INFO ] [Real]Absence check using state equation in 30128 ms returned unknown
[2023-03-14 12:52:02] [INFO ] [Real]Absence check using 10000 positive place invariants in 12629 ms returned sat
[2023-03-14 12:52:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:52:31] [INFO ] [Real]Absence check using state equation in 29573 ms returned unknown
[2023-03-14 12:52:42] [INFO ] [Real]Absence check using 10000 positive place invariants in 8485 ms returned sat
[2023-03-14 12:52:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:53:16] [INFO ] [Real]Absence check using state equation in 33729 ms returned unknown
[2023-03-14 12:53:30] [INFO ] [Real]Absence check using 10000 positive place invariants in 10945 ms returned sat
[2023-03-14 12:53:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:54:01] [INFO ] [Real]Absence check using state equation in 31275 ms returned unknown
[2023-03-14 12:54:12] [INFO ] [Real]Absence check using 10000 positive place invariants in 8068 ms returned sat
[2023-03-14 12:54:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:54:46] [INFO ] [Real]Absence check using state equation in 34157 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 2500, 5000, 2500, 2500, 5000, 5000, 2500, 5000, 2500] Max seen :[1645, 702, 1645, 702, 702, 1768, 1768, 702, 1645, 702]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1539 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1539 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1530 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-14 12:54:49] [INFO ] Invariant cache hit.
[2023-03-14 12:54:51] [INFO ] Implicit Places using invariants in 1893 ms returned []
Implicit Place search using SMT only with invariants took 1895 ms to find 0 implicit places.
[2023-03-14 12:54:51] [INFO ] Invariant cache hit.
[2023-03-14 12:54:53] [INFO ] Dead Transitions using invariants and state equation in 1816 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5244 ms. Remains : 25000/25000 places, 25000/25000 transitions.
[2023-03-14 12:54:53] [INFO ] Invariant cache hit.
Finished random walk after 11267 steps, including 0 resets, run visited all 10 properties in 30001 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5129 ms. (steps per millisecond=3 ) properties seen 3
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5280 ms. (steps per millisecond=3 ) properties seen 5
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5282 ms. (steps per millisecond=3 ) properties seen 3
Interrupted Best-First random walk after 17002 steps, including 0 resets, run timeout after 5007 ms. (steps per millisecond=3 ) properties seen 2
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5277 ms. (steps per millisecond=3 ) properties seen 5
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5205 ms. (steps per millisecond=3 ) properties seen 2
Interrupted Best-First random walk after 19002 steps, including 0 resets, run timeout after 5267 ms. (steps per millisecond=3 ) properties seen 2
Interrupted Best-First random walk after 17002 steps, including 0 resets, run timeout after 5032 ms. (steps per millisecond=3 ) properties seen 5
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5269 ms. (steps per millisecond=3 ) properties seen 3
Interrupted Best-First random walk after 17002 steps, including 0 resets, run timeout after 5153 ms. (steps per millisecond=3 ) properties seen 2
[2023-03-14 12:56:15] [INFO ] Invariant cache hit.
[2023-03-14 12:56:30] [INFO ] [Real]Absence check using 10000 positive place invariants in 12042 ms returned sat
[2023-03-14 12:56:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:57:00] [INFO ] [Real]Absence check using state equation in 30070 ms returned unknown
[2023-03-14 12:57:13] [INFO ] [Real]Absence check using 10000 positive place invariants in 10162 ms returned sat
[2023-03-14 12:57:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:57:45] [INFO ] [Real]Absence check using state equation in 32021 ms returned unknown
[2023-03-14 12:58:01] [INFO ] [Real]Absence check using 10000 positive place invariants in 12967 ms returned sat
[2023-03-14 12:58:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:58:30] [INFO ] [Real]Absence check using state equation in 29158 ms returned unknown
[2023-03-14 12:58:42] [INFO ] [Real]Absence check using 10000 positive place invariants in 9119 ms returned sat
[2023-03-14 12:58:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:59:15] [INFO ] [Real]Absence check using state equation in 33067 ms returned unknown
[2023-03-14 12:59:28] [INFO ] [Real]Absence check using 10000 positive place invariants in 9775 ms returned sat
[2023-03-14 12:59:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:00:00] [INFO ] [Real]Absence check using state equation in 32458 ms returned unknown
[2023-03-14 13:00:16] [INFO ] [Real]Absence check using 10000 positive place invariants in 12718 ms returned sat
[2023-03-14 13:00:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:00:45] [INFO ] [Real]Absence check using state equation in 29463 ms returned unknown
[2023-03-14 13:01:01] [INFO ] [Real]Absence check using 10000 positive place invariants in 12919 ms returned sat
[2023-03-14 13:01:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:01:30] [INFO ] [Real]Absence check using state equation in 29259 ms returned unknown
[2023-03-14 13:01:42] [INFO ] [Real]Absence check using 10000 positive place invariants in 8905 ms returned sat
[2023-03-14 13:01:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:02:15] [INFO ] [Real]Absence check using state equation in 33278 ms returned unknown
[2023-03-14 13:02:31] [INFO ] [Real]Absence check using 10000 positive place invariants in 12609 ms returned sat
[2023-03-14 13:02:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:03:00] [INFO ] [Real]Absence check using state equation in 29345 ms returned unknown
[2023-03-14 13:03:12] [INFO ] [Real]Absence check using 10000 positive place invariants in 8213 ms returned sat
[2023-03-14 13:03:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:03:46] [INFO ] [Real]Absence check using state equation in 33935 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 2500, 5000, 2500, 2500, 5000, 5000, 2500, 5000, 2500] Max seen :[1751, 737, 1751, 737, 737, 1768, 1768, 737, 1751, 737]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1484 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1484 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1608 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-14 13:03:49] [INFO ] Invariant cache hit.
[2023-03-14 13:03:51] [INFO ] Implicit Places using invariants in 1947 ms returned []
Implicit Place search using SMT only with invariants took 1948 ms to find 0 implicit places.
[2023-03-14 13:03:51] [INFO ] Invariant cache hit.
[2023-03-14 13:03:53] [INFO ] Dead Transitions using invariants and state equation in 2108 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5665 ms. Remains : 25000/25000 places, 25000/25000 transitions.
[2023-03-14 13:03:53] [INFO ] Invariant cache hit.
Finished random walk after 11091 steps, including 0 resets, run visited all 10 properties in 30002 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5228 ms. (steps per millisecond=3 ) properties seen 3
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5277 ms. (steps per millisecond=3 ) properties seen 5
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5149 ms. (steps per millisecond=3 ) properties seen 3
Interrupted Best-First random walk after 17002 steps, including 0 resets, run timeout after 5085 ms. (steps per millisecond=3 ) properties seen 5
Interrupted Best-First random walk after 17002 steps, including 0 resets, run timeout after 5024 ms. (steps per millisecond=3 ) properties seen 5
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5255 ms. (steps per millisecond=3 ) properties seen 2
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5169 ms. (steps per millisecond=3 ) properties seen 2
Interrupted Best-First random walk after 18002 steps, including 0 resets, run timeout after 5280 ms. (steps per millisecond=3 ) properties seen 5
Interrupted Best-First random walk after 17002 steps, including 0 resets, run timeout after 5029 ms. (steps per millisecond=3 ) properties seen 3
Interrupted Best-First random walk after 17002 steps, including 0 resets, run timeout after 5042 ms. (steps per millisecond=3 ) properties seen 2
[2023-03-14 13:05:14] [INFO ] Invariant cache hit.
[2023-03-14 13:05:29] [INFO ] [Real]Absence check using 10000 positive place invariants in 11895 ms returned sat
[2023-03-14 13:05:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:05:59] [INFO ] [Real]Absence check using state equation in 30011 ms returned unknown
[2023-03-14 13:06:12] [INFO ] [Real]Absence check using 10000 positive place invariants in 9449 ms returned sat
[2023-03-14 13:06:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:06:44] [INFO ] [Real]Absence check using state equation in 32601 ms returned unknown
[2023-03-14 13:06:59] [INFO ] [Real]Absence check using 10000 positive place invariants in 11485 ms returned sat
[2023-03-14 13:06:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:07:29] [INFO ] [Real]Absence check using state equation in 30776 ms returned unknown
[2023-03-14 13:07:41] [INFO ] [Real]Absence check using 10000 positive place invariants in 8593 ms returned sat
[2023-03-14 13:07:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:08:14] [INFO ] [Real]Absence check using state equation in 33727 ms returned unknown
[2023-03-14 13:08:27] [INFO ] [Real]Absence check using 10000 positive place invariants in 9310 ms returned sat
[2023-03-14 13:08:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:08:59] [INFO ] [Real]Absence check using state equation in 32928 ms returned unknown
[2023-03-14 13:09:15] [INFO ] [Real]Absence check using 10000 positive place invariants in 12230 ms returned sat
[2023-03-14 13:09:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:09:45] [INFO ] [Real]Absence check using state equation in 30021 ms returned unknown
[2023-03-14 13:10:00] [INFO ] [Real]Absence check using 10000 positive place invariants in 12184 ms returned sat
[2023-03-14 13:10:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:10:30] [INFO ] [Real]Absence check using state equation in 30082 ms returned unknown
[2023-03-14 13:10:42] [INFO ] [Real]Absence check using 10000 positive place invariants in 9271 ms returned sat
[2023-03-14 13:10:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:11:15] [INFO ] [Real]Absence check using state equation in 33049 ms returned unknown
[2023-03-14 13:11:29] [INFO ] [Real]Absence check using 10000 positive place invariants in 11677 ms returned sat
[2023-03-14 13:11:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:12:00] [INFO ] [Real]Absence check using state equation in 30632 ms returned unknown
[2023-03-14 13:12:10] [INFO ] [Real]Absence check using 10000 positive place invariants in 8008 ms returned sat
[2023-03-14 13:12:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:12:45] [INFO ] [Real]Absence check using state equation in 34225 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 2500, 5000, 2500, 2500, 5000, 5000, 2500, 5000, 2500] Max seen :[1751, 737, 1751, 737, 737, 1768, 1768, 737, 1751, 737]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1615 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1615 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1630 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-14 13:12:48] [INFO ] Invariant cache hit.
[2023-03-14 13:12:50] [INFO ] Implicit Places using invariants in 1816 ms returned []
Implicit Place search using SMT only with invariants took 1817 ms to find 0 implicit places.
[2023-03-14 13:12:50] [INFO ] Invariant cache hit.
[2023-03-14 13:12:52] [INFO ] Dead Transitions using invariants and state equation in 1820 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5270 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Starting property specific reduction for Philosophers-COL-005000-UpperBounds-00
[2023-03-14 13:12:52] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16255 ms. (steps per millisecond=0 ) properties (out of 1) seen :1129
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2770 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
[2023-03-14 13:13:11] [INFO ] Invariant cache hit.
[2023-03-14 13:13:16] [INFO ] [Real]Absence check using 10000 positive place invariants in 2304 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1129]
Support contains 5000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Performed 5000 Post agglomeration using F-continuation condition.Transition count delta: 5000
Deduced a syphon composed of 5000 places in 3 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 10549 ms. Remains 15000 /25000 variables (removed 10000) and now considering 10000/25000 (removed 15000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10551 ms. Remains : 15000/25000 places, 10000/25000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-14 13:13:26] [INFO ] Computed 10000 place invariants in 23 ms
Finished random walk after 31689 steps, including 2 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
FORMULA Philosophers-COL-005000-UpperBounds-00 5000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Philosophers-COL-005000-UpperBounds-00 in 64687 ms.
Starting property specific reduction for Philosophers-COL-005000-UpperBounds-01
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-14 13:13:56] [INFO ] Computed 10000 place invariants in 79 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16057 ms. (steps per millisecond=0 ) properties (out of 1) seen :419
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2924 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
[2023-03-14 13:14:15] [INFO ] Invariant cache hit.
[2023-03-14 13:14:20] [INFO ] [Real]Absence check using 10000 positive place invariants in 1922 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000] Max seen :[419]
Support contains 5000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Free-agglomeration rule (complex) applied 10000 times.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 10000 place count 25000 transition count 15000
Reduce places removed 10000 places and 0 transitions.
Ensure Unique test removed 5000 transitions
Reduce isomorphic transitions removed 5000 transitions.
Iterating post reduction 0 with 15000 rules applied. Total rules applied 25000 place count 15000 transition count 10000
Applied a total of 25000 rules in 9144 ms. Remains 15000 /25000 variables (removed 10000) and now considering 10000/25000 (removed 15000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9144 ms. Remains : 15000/25000 places, 10000/25000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2023-03-14 13:14:30] [INFO ] Computed 10000 place invariants in 35 ms
Finished random walk after 34360 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 18998 steps, including 0 resets, run visited all 1 properties in 5026 ms. (steps per millisecond=3 )
[2023-03-14 13:15:05] [INFO ] Invariant cache hit.
[2023-03-14 13:15:14] [INFO ] [Real]Absence check using 10000 positive place invariants in 8344 ms returned sat
[2023-03-14 13:15:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:15:34] [INFO ] [Real]Absence check using state equation in 19608 ms returned sat
[2023-03-14 13:15:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 13:15:44] [INFO ] [Nat]Absence check using 10000 positive place invariants in 8592 ms returned sat
[2023-03-14 13:15:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 13:16:04] [INFO ] [Nat]Absence check using state equation in 20099 ms returned sat
[2023-03-14 13:16:06] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 402 ms.
[2023-03-14 13:16:07] [INFO ] Added : 0 causal constraints over 0 iterations in 1580 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1436]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1123 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1123 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1233 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 13:16:40] [INFO ] Invariant cache hit.
[2023-03-14 13:16:41] [INFO ] Implicit Places using invariants in 1165 ms returned []
Implicit Place search using SMT only with invariants took 1168 ms to find 0 implicit places.
[2023-03-14 13:16:41] [INFO ] Invariant cache hit.
[2023-03-14 13:16:42] [INFO ] Dead Transitions using invariants and state equation in 1143 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3548 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-14 13:16:42] [INFO ] Invariant cache hit.
Finished random walk after 34037 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 18998 steps, including 0 resets, run visited all 1 properties in 5264 ms. (steps per millisecond=3 )
[2023-03-14 13:17:17] [INFO ] Invariant cache hit.
[2023-03-14 13:17:27] [INFO ] [Real]Absence check using 10000 positive place invariants in 8713 ms returned sat
[2023-03-14 13:17:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:17:47] [INFO ] [Real]Absence check using state equation in 19452 ms returned sat
[2023-03-14 13:17:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 13:17:57] [INFO ] [Nat]Absence check using 10000 positive place invariants in 8576 ms returned sat
[2023-03-14 13:17:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 13:18:17] [INFO ] [Nat]Absence check using state equation in 19649 ms returned sat
[2023-03-14 13:18:18] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 328 ms.
[2023-03-14 13:18:19] [INFO ] Added : 0 causal constraints over 0 iterations in 1537 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1437]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1322 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1322 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1328 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 13:18:52] [INFO ] Invariant cache hit.
[2023-03-14 13:18:53] [INFO ] Implicit Places using invariants in 1192 ms returned []
Implicit Place search using SMT only with invariants took 1193 ms to find 0 implicit places.
[2023-03-14 13:18:53] [INFO ] Invariant cache hit.
[2023-03-14 13:18:54] [INFO ] Dead Transitions using invariants and state equation in 1179 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3701 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-14 13:18:54] [INFO ] Invariant cache hit.
Finished random walk after 33995 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 18998 steps, including 0 resets, run visited all 1 properties in 5185 ms. (steps per millisecond=3 )
[2023-03-14 13:19:30] [INFO ] Invariant cache hit.
[2023-03-14 13:19:39] [INFO ] [Real]Absence check using 10000 positive place invariants in 8416 ms returned sat
[2023-03-14 13:19:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:19:58] [INFO ] [Real]Absence check using state equation in 18718 ms returned sat
[2023-03-14 13:19:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 13:20:09] [INFO ] [Nat]Absence check using 10000 positive place invariants in 8879 ms returned sat
[2023-03-14 13:20:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 13:20:29] [INFO ] [Nat]Absence check using state equation in 20129 ms returned sat
[2023-03-14 13:20:30] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 349 ms.
[2023-03-14 13:20:31] [INFO ] Added : 0 causal constraints over 0 iterations in 1568 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1438]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 904 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 904 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 937 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 13:21:03] [INFO ] Invariant cache hit.
[2023-03-14 13:21:05] [INFO ] Implicit Places using invariants in 1143 ms returned []
Implicit Place search using SMT only with invariants took 1144 ms to find 0 implicit places.
[2023-03-14 13:21:05] [INFO ] Invariant cache hit.
[2023-03-14 13:21:06] [INFO ] Dead Transitions using invariants and state equation in 1133 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3215 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-14 13:21:06] [INFO ] Invariant cache hit.
Finished random walk after 34115 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 18998 steps, including 0 resets, run visited all 1 properties in 5236 ms. (steps per millisecond=3 )
[2023-03-14 13:21:41] [INFO ] Invariant cache hit.
[2023-03-14 13:21:51] [INFO ] [Real]Absence check using 10000 positive place invariants in 8533 ms returned sat
[2023-03-14 13:21:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:22:11] [INFO ] [Real]Absence check using state equation in 20130 ms returned sat
[2023-03-14 13:22:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 13:22:22] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9022 ms returned sat
[2023-03-14 13:22:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 13:22:42] [INFO ] [Nat]Absence check using state equation in 20640 ms returned sat
[2023-03-14 13:22:43] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 358 ms.
[2023-03-14 13:22:45] [INFO ] Added : 0 causal constraints over 0 iterations in 1531 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1443]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 939 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 939 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 934 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 13:23:17] [INFO ] Invariant cache hit.
[2023-03-14 13:23:18] [INFO ] Implicit Places using invariants in 1153 ms returned []
Implicit Place search using SMT only with invariants took 1154 ms to find 0 implicit places.
[2023-03-14 13:23:18] [INFO ] Invariant cache hit.
[2023-03-14 13:23:19] [INFO ] Dead Transitions using invariants and state equation in 1133 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3223 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-14 13:23:19] [INFO ] Invariant cache hit.
Finished random walk after 34457 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 18998 steps, including 0 resets, run visited all 1 properties in 5186 ms. (steps per millisecond=3 )
[2023-03-14 13:23:54] [INFO ] Invariant cache hit.
[2023-03-14 13:24:04] [INFO ] [Real]Absence check using 10000 positive place invariants in 8418 ms returned sat
[2023-03-14 13:24:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:24:25] [INFO ] [Real]Absence check using state equation in 20419 ms returned sat
[2023-03-14 13:24:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 13:24:35] [INFO ] [Nat]Absence check using 10000 positive place invariants in 8814 ms returned sat
[2023-03-14 13:24:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 13:24:57] [INFO ] [Nat]Absence check using state equation in 22165 ms returned sat
[2023-03-14 13:24:58] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 367 ms.
[2023-03-14 13:25:00] [INFO ] Added : 0 causal constraints over 0 iterations in 1577 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1444]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, 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 REACHABILITY mode , in 1 iterations and 950 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 947 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 13:25:32] [INFO ] Invariant cache hit.
[2023-03-14 13:25:33] [INFO ] Implicit Places using invariants in 1166 ms returned []
Implicit Place search using SMT only with invariants took 1167 ms to find 0 implicit places.
[2023-03-14 13:25:33] [INFO ] Invariant cache hit.
[2023-03-14 13:25:34] [INFO ] Dead Transitions using invariants and state equation in 1185 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3302 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-14 13:25:34] [INFO ] Invariant cache hit.
Finished random walk after 33866 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 17998 steps, including 0 resets, run visited all 1 properties in 5043 ms. (steps per millisecond=3 )
[2023-03-14 13:26:09] [INFO ] Invariant cache hit.
[2023-03-14 13:26:19] [INFO ] [Real]Absence check using 10000 positive place invariants in 8568 ms returned sat
[2023-03-14 13:26:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:26:39] [INFO ] [Real]Absence check using state equation in 19375 ms returned sat
[2023-03-14 13:26:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 13:26:49] [INFO ] [Nat]Absence check using 10000 positive place invariants in 8549 ms returned sat
[2023-03-14 13:26:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 13:27:12] [INFO ] [Nat]Absence check using state equation in 22714 ms returned sat
[2023-03-14 13:27:13] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 364 ms.
[2023-03-14 13:27:14] [INFO ] Added : 0 causal constraints over 0 iterations in 1574 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1445]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, 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.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 966 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 952 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 13:27:46] [INFO ] Invariant cache hit.
[2023-03-14 13:27:48] [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.
[2023-03-14 13:27:48] [INFO ] Invariant cache hit.
[2023-03-14 13:27:49] [INFO ] Dead Transitions using invariants and state equation in 1170 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3285 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-14 13:27:49] [INFO ] Invariant cache hit.
Finished random walk after 33566 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 17998 steps, including 0 resets, run visited all 1 properties in 5051 ms. (steps per millisecond=3 )
[2023-03-14 13:28:24] [INFO ] Invariant cache hit.
[2023-03-14 13:28:34] [INFO ] [Real]Absence check using 10000 positive place invariants in 9025 ms returned sat
[2023-03-14 13:28:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:28:55] [INFO ] [Real]Absence check using state equation in 20976 ms returned sat
[2023-03-14 13:28:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 13:29:06] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9144 ms returned sat
[2023-03-14 13:29:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 13:29:29] [INFO ] [Nat]Absence check using state equation in 22830 ms returned sat
[2023-03-14 13:29:30] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 368 ms.
[2023-03-14 13:29:31] [INFO ] Added : 0 causal constraints over 0 iterations in 1568 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1446]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 943 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 944 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 936 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 13:30:04] [INFO ] Invariant cache hit.
[2023-03-14 13:30:05] [INFO ] Implicit Places using invariants in 1131 ms returned []
Implicit Place search using SMT only with invariants took 1132 ms to find 0 implicit places.
[2023-03-14 13:30:05] [INFO ] Invariant cache hit.
[2023-03-14 13:30:06] [INFO ] Dead Transitions using invariants and state equation in 1126 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3197 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-14 13:30:06] [INFO ] Invariant cache hit.
Finished random walk after 33695 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 17998 steps, including 0 resets, run visited all 1 properties in 5020 ms. (steps per millisecond=3 )
[2023-03-14 13:30:41] [INFO ] Invariant cache hit.
[2023-03-14 13:30:51] [INFO ] [Real]Absence check using 10000 positive place invariants in 8644 ms returned sat
[2023-03-14 13:30:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:31:10] [INFO ] [Real]Absence check using state equation in 19370 ms returned sat
[2023-03-14 13:31:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 13:31:21] [INFO ] [Nat]Absence check using 10000 positive place invariants in 8850 ms returned sat
[2023-03-14 13:31:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 13:31:41] [INFO ] [Nat]Absence check using state equation in 20707 ms returned sat
[2023-03-14 13:31:43] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 350 ms.
[2023-03-14 13:31:44] [INFO ] Added : 0 causal constraints over 0 iterations in 1532 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1447]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 970 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 970 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 956 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 13:32:16] [INFO ] Invariant cache hit.
[2023-03-14 13:32:17] [INFO ] Implicit Places using invariants in 1189 ms returned []
Implicit Place search using SMT only with invariants took 1192 ms to find 0 implicit places.
[2023-03-14 13:32:17] [INFO ] Invariant cache hit.
[2023-03-14 13:32:19] [INFO ] Dead Transitions using invariants and state equation in 1155 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3306 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-14 13:32:19] [INFO ] Invariant cache hit.
Finished random walk after 33524 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 17998 steps, including 0 resets, run visited all 1 properties in 5081 ms. (steps per millisecond=3 )
[2023-03-14 13:32:54] [INFO ] Invariant cache hit.
[2023-03-14 13:33:04] [INFO ] [Real]Absence check using 10000 positive place invariants in 8622 ms returned sat
[2023-03-14 13:33:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 13:33:28] [INFO ] [Real]Absence check using state equation in 24725 ms returned sat
[2023-03-14 13:33:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 13:33:39] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9009 ms returned sat
[2023-03-14 13:33:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 13:34:01] [INFO ] [Nat]Absence check using state equation in 22049 ms returned sat
[2023-03-14 13:34:02] [INFO ] Computed and/alt/rep : 5000/5000/5000 causal constraints (skipped 0 transitions) in 361 ms.
[2023-03-14 13:34:03] [INFO ] Added : 0 causal constraints over 0 iterations in 1568 ms. Result :sat
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1448]
Support contains 5000 out of 15000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 953 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 953 ms. Remains : 15000/15000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15000/15000 places, 10000/10000 transitions.
Applied a total of 0 rules in 958 ms. Remains 15000 /15000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 13:34:36] [INFO ] Invariant cache hit.
[2023-03-14 13:34:37] [INFO ] Implicit Places using invariants in 1181 ms returned []
Implicit Place search using SMT only with invariants took 1182 ms to find 0 implicit places.
[2023-03-14 13:34:37] [INFO ] Invariant cache hit.
[2023-03-14 13:34:38] [INFO ] Dead Transitions using invariants and state equation in 1149 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3293 ms. Remains : 15000/15000 places, 10000/10000 transitions.
[2023-03-14 13:34:38] [INFO ] Invariant cache hit.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 12007012 kB
After kill :
MemTotal: 16393232 kB
MemFree: 12002908 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="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-5348"
echo " Executing tool itstools"
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 r293-tall-167873945000157"
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 ;