About the Execution of ITS-Tools for Philosophers-COL-005000
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r140-tall-162298995900067.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Philosophers-COL-005000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162298995900067
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 27 08:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 08:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 10:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 09:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 227K May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Philosophers-COL-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 1622990110445
Running Version 0
[2021-06-06 14:35:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-06-06 14:35:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-06 14:35:12] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-06-06 14:35:12] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-06-06 14:35:13] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 879 ms
[2021-06-06 14:35:13] [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 12 ms.
[2021-06-06 14:35:13] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions in 5 ms.
[2021-06-06 14:35:13] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_16661548546054392967.dot
// Phase 1: matrix 5 rows 5 cols
[2021-06-06 14:35:13] [INFO ] Computed 2 place invariants in 5 ms
FORMULA Philosophers-COL-005000-UpperBounds-10 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-005000-UpperBounds-03 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-005000-UpperBounds-01 5000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2021-06-06 14:35:13] [INFO ] Unfolded HLPN to a Petri net with 25000 places and 25000 transitions in 155 ms.
[2021-06-06 14:35:13] [INFO ] Unfolded HLPN properties in 7 ms.
// Phase 1: matrix 5 rows 5 cols
[2021-06-06 14:35:13] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-06 14:35:13] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-06-06 14:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:13] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-06-06 14:35:13] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:35:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-06-06 14:35:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:13] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-06-06 14:35:13] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2021-06-06 14:35:13] [INFO ] Added : 1 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 4 ms.
[2021-06-06 14:35:13] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-06-06 14:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:13] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-06-06 14:35:13] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:35:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:35:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:13] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-06-06 14:35:13] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2021-06-06 14:35:13] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2021-06-06 14:35:13] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-06-06 14:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:13] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-06-06 14:35:13] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:35:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:35:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:13] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-06-06 14:35:13] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2021-06-06 14:35:13] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2021-06-06 14:35:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:13] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-06-06 14:35:13] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:35:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2021-06-06 14:35:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:13] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-06-06 14:35:13] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2021-06-06 14:35:13] [INFO ] Added : 1 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 3 ms.
[2021-06-06 14:35:13] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2021-06-06 14:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:13] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-06-06 14:35:13] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:35:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:35:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:13] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-06-06 14:35:13] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2021-06-06 14:35:13] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2021-06-06 14:35:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:13] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-06-06 14:35:13] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:35:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:35:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:13] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-06-06 14:35:13] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2021-06-06 14:35:13] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 6 ms.
[2021-06-06 14:35:13] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2021-06-06 14:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:13] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-06-06 14:35:13] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:35:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2021-06-06 14:35:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:13] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-06-06 14:35:13] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2021-06-06 14:35:13] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 2 ms.
[2021-06-06 14:35:13] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-06-06 14:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:13] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-06-06 14:35:13] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:35:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:35:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:13] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-06-06 14:35:13] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2021-06-06 14:35:13] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2021-06-06 14:35:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:13] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-06-06 14:35:13] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:35:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:35:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:13] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-06-06 14:35:13] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2021-06-06 14:35:13] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2021-06-06 14:35:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:13] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-06-06 14:35:13] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:35:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2021-06-06 14:35:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:13] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-06-06 14:35:13] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2021-06-06 14:35:13] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 2 ms.
[2021-06-06 14:35:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:13] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-06-06 14:35:13] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:35:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:35:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:13] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-06-06 14:35:13] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2021-06-06 14:35:13] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2021-06-06 14:35:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:13] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-06-06 14:35:13] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:35:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:35:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:14] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-06-06 14:35:14] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2021-06-06 14:35:14] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2021-06-06 14:35:14] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2021-06-06 14:35:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:14] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-06-06 14:35:14] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:35:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:35:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:35:14] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-06-06 14:35:14] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2021-06-06 14:35:14] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [2500, 5000, 5000, 2500, 2500, 5000, 5000, 2500, 2500, 5000, 2500, 5000, 5000]
[2021-06-06 14:35:14] [INFO ] Unfolded HLPN to a Petri net with 25000 places and 25000 transitions in 85 ms.
[2021-06-06 14:35:14] [INFO ] Unfolded HLPN properties in 3 ms.
Successfully produced net in file /tmp/petri1001_1460110772537175366.dot
Interrupted random walk after 7582 steps, including 2 resets, run timeout after 30008 ms. (steps per millisecond=0 ) properties seen :{0=447, 1=1105, 2=1154, 3=447, 4=447, 5=1105, 6=1154, 7=447, 8=447, 9=1105, 10=447, 11=1154, 12=1154}
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3489 ms. (steps per millisecond=2 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3471 ms. (steps per millisecond=2 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3309 ms. (steps per millisecond=3 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3364 ms. (steps per millisecond=2 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3353 ms. (steps per millisecond=2 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3366 ms. (steps per millisecond=2 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3407 ms. (steps per millisecond=2 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3221 ms. (steps per millisecond=3 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3251 ms. (steps per millisecond=3 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3387 ms. (steps per millisecond=2 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2597 ms. (steps per millisecond=3 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2699 ms. (steps per millisecond=3 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2719 ms. (steps per millisecond=3 ) properties (out of 13) seen :0
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 14:36:26] [INFO ] Computed 10000 place invariants in 197 ms
[2021-06-06 14:36:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.assertInvariants(DeadlockTester.java:1970)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:558)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-06-06 14:36:36] [INFO ] [Real]Absence check using 10000 positive place invariants in 2045 ms returned unknown
[2021-06-06 14:36:41] [INFO ] [Real]Absence check using 10000 positive place invariants in 1845 ms returned unknown
[2021-06-06 14:36:46] [INFO ] [Real]Absence check using 10000 positive place invariants in 2031 ms returned unknown
[2021-06-06 14:36:51] [INFO ] [Real]Absence check using 10000 positive place invariants in 2049 ms returned unknown
[2021-06-06 14:36:56] [INFO ] [Real]Absence check using 10000 positive place invariants in 1749 ms returned unknown
[2021-06-06 14:37:01] [INFO ] [Real]Absence check using 10000 positive place invariants in 1746 ms returned unknown
[2021-06-06 14:37:06] [INFO ] [Real]Absence check using 10000 positive place invariants in 1792 ms returned unknown
[2021-06-06 14:37:11] [INFO ] [Real]Absence check using 10000 positive place invariants in 1849 ms returned unknown
[2021-06-06 14:37:16] [INFO ] [Real]Absence check using 10000 positive place invariants in 2004 ms returned unknown
[2021-06-06 14:37:21] [INFO ] [Real]Absence check using 10000 positive place invariants in 2029 ms returned unknown
[2021-06-06 14:37:26] [INFO ] [Real]Absence check using 10000 positive place invariants in 1847 ms returned unknown
[2021-06-06 14:37:31] [INFO ] [Real]Absence check using 10000 positive place invariants in 1823 ms returned unknown
Current structural bounds on expressions (after SMT) : [2500, 5000, 5000, 2500, 2500, 5000, 5000, 2500, 2500, 5000, 2500, 5000, 5000] Max seen :[447, 1105, 1154, 447, 447, 1105, 1154, 447, 447, 1105, 447, 1154, 1154]
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 2033 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 14:37:33] [INFO ] Computed 10000 place invariants in 72 ms
Interrupted random walk after 8362 steps, including 0 resets, run timeout after 30003 ms. (steps per millisecond=0 ) properties seen :{0=700, 1=1542, 2=1498, 3=700, 4=700, 5=1542, 6=1498, 7=700, 8=700, 9=1542, 10=700, 11=1498, 12=1498}
Interrupted Best-First random walk after 19002 steps, including 0 resets, run timeout after 5257 ms. (steps per millisecond=3 ) properties seen :{1=1, 5=1, 9=1}
Interrupted Best-First random walk after 22001 steps, including 0 resets, run timeout after 5064 ms. (steps per millisecond=4 ) properties seen :{1=2, 5=2, 9=2}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5170 ms. (steps per millisecond=3 ) properties seen :{2=1, 6=1, 11=1, 12=1}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5241 ms. (steps per millisecond=3 ) properties seen :{2=1, 6=1, 11=1, 12=1}
Interrupted Best-First random walk after 16002 steps, including 0 resets, run timeout after 5181 ms. (steps per millisecond=3 ) properties seen :{2=1, 6=1, 11=1, 12=1}
Interrupted Best-First random walk after 17002 steps, including 0 resets, run timeout after 5133 ms. (steps per millisecond=3 ) properties seen :{1=1, 5=1, 9=1}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5042 ms. (steps per millisecond=4 ) properties seen :{2=2, 6=2, 11=2, 12=2}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5057 ms. (steps per millisecond=4 ) properties seen :{0=1, 2=1, 3=1, 4=1, 6=1, 7=1, 8=1, 10=1, 11=1, 12=1}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5064 ms. (steps per millisecond=4 ) properties seen :{0=1, 2=1, 3=1, 4=1, 6=1, 7=1, 8=1, 10=1, 11=1, 12=1}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5034 ms. (steps per millisecond=4 ) properties seen :{1=2, 5=2, 9=2}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5163 ms. (steps per millisecond=4 ) properties seen :{0=1, 2=1, 3=1, 4=1, 6=1, 7=1, 8=1, 10=1, 11=1, 12=1}
Interrupted Best-First random walk after 23001 steps, including 0 resets, run timeout after 5008 ms. (steps per millisecond=4 ) properties seen :{2=2, 6=2, 11=2, 12=2}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5214 ms. (steps per millisecond=4 ) properties seen :{2=2, 6=2, 11=2, 12=2}
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 14:39:10] [INFO ] Computed 10000 place invariants in 76 ms
[2021-06-06 14:39:23] [INFO ] [Real]Absence check using 10000 positive place invariants in 9698 ms returned sat
[2021-06-06 14:39:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:39:55] [INFO ] [Real]Absence check using state equation in 32160 ms returned unknown
[2021-06-06 14:40:09] [INFO ] [Real]Absence check using 10000 positive place invariants in 10812 ms returned sat
[2021-06-06 14:40:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:40:40] [INFO ] [Real]Absence check using state equation in 31039 ms returned unknown
[2021-06-06 14:40:57] [INFO ] [Real]Absence check using 10000 positive place invariants in 13402 ms returned sat
[2021-06-06 14:40:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:41:25] [INFO ] [Real]Absence check using state equation in 28454 ms returned unknown
[2021-06-06 14:41:40] [INFO ] [Real]Absence check using 10000 positive place invariants in 11615 ms returned sat
[2021-06-06 14:41:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:42:10] [INFO ] [Real]Absence check using state equation in 30463 ms returned unknown
[2021-06-06 14:42:27] [INFO ] [Real]Absence check using 10000 positive place invariants in 13124 ms returned sat
[2021-06-06 14:42:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:42:55] [INFO ] [Real]Absence check using state equation in 28656 ms returned unknown
[2021-06-06 14:43:09] [INFO ] [Real]Absence check using 10000 positive place invariants in 11033 ms returned sat
[2021-06-06 14:43:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:43:40] [INFO ] [Real]Absence check using state equation in 31011 ms returned unknown
[2021-06-06 14:43:54] [INFO ] [Real]Absence check using 10000 positive place invariants in 10983 ms returned sat
[2021-06-06 14:43:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:44:25] [INFO ] [Real]Absence check using state equation in 31035 ms returned unknown
[2021-06-06 14:44:38] [INFO ] [Real]Absence check using 10000 positive place invariants in 9021 ms returned sat
[2021-06-06 14:44:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:45:10] [INFO ] [Real]Absence check using state equation in 32729 ms returned unknown
[2021-06-06 14:45:23] [INFO ] [Real]Absence check using 10000 positive place invariants in 9360 ms returned sat
[2021-06-06 14:45:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:45:56] [INFO ] [Real]Absence check using state equation in 32489 ms returned unknown
[2021-06-06 14:46:11] [INFO ] [Real]Absence check using 10000 positive place invariants in 11830 ms returned sat
[2021-06-06 14:46:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:46:41] [INFO ] [Real]Absence check using state equation in 30036 ms returned unknown
[2021-06-06 14:46:53] [INFO ] [Real]Absence check using 10000 positive place invariants in 9550 ms returned sat
[2021-06-06 14:46:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:47:26] [INFO ] [Real]Absence check using state equation in 32530 ms returned unknown
[2021-06-06 14:47:39] [INFO ] [Real]Absence check using 10000 positive place invariants in 10290 ms returned sat
[2021-06-06 14:47:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:48:11] [INFO ] [Real]Absence check using state equation in 31750 ms returned unknown
[2021-06-06 14:48:25] [INFO ] [Real]Absence check using 10000 positive place invariants in 11370 ms returned sat
[2021-06-06 14:48:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:48:56] [INFO ] [Real]Absence check using state equation in 30758 ms returned unknown
Current structural bounds on expressions (after SMT) : [2500, 5000, 5000, 2500, 2500, 5000, 5000, 2500, 2500, 5000, 2500, 5000, 5000] Max seen :[700, 1542, 1498, 700, 700, 1542, 1498, 700, 700, 1542, 700, 1498, 1498]
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 2126 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 2202 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 14:49:00] [INFO ] Computed 10000 place invariants in 90 ms
[2021-06-06 14:49:02] [INFO ] Implicit Places using invariants in 2098 ms returned []
Implicit Place search using SMT only with invariants took 2108 ms to find 0 implicit places.
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 14:49:02] [INFO ] Computed 10000 place invariants in 55 ms
[2021-06-06 14:49:04] [INFO ] Dead Transitions using invariants and state equation in 2314 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 14:49:05] [INFO ] Computed 10000 place invariants in 49 ms
Interrupted random walk after 8394 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen :{0=722, 1=1515, 2=1522, 3=722, 4=722, 5=1515, 6=1522, 7=722, 8=722, 9=1515, 10=722, 11=1522, 12=1522}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5083 ms. (steps per millisecond=4 ) properties seen :{0=1, 2=1, 3=1, 4=1, 6=1, 7=1, 8=1, 10=1, 11=1, 12=1}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5131 ms. (steps per millisecond=4 ) properties seen :{1=2, 5=2, 9=2}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5035 ms. (steps per millisecond=4 ) properties seen :{2=2, 6=2, 11=2, 12=2}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5045 ms. (steps per millisecond=4 ) properties seen :{0=1, 1=1, 3=1, 4=1, 5=1, 7=1, 8=1, 9=1, 10=1}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5203 ms. (steps per millisecond=4 ) properties seen :{0=1, 2=1, 3=1, 4=1, 6=1, 7=1, 8=1, 10=1, 11=1, 12=1}
Interrupted Best-First random walk after 25001 steps, including 0 resets, run timeout after 5161 ms. (steps per millisecond=4 ) properties seen :{1=2, 5=2, 9=2}
Interrupted Best-First random walk after 25001 steps, including 0 resets, run timeout after 5184 ms. (steps per millisecond=4 ) properties seen :{2=2, 6=2, 11=2, 12=2}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5059 ms. (steps per millisecond=4 ) properties seen :{0=1, 1=1, 3=1, 4=1, 5=1, 7=1, 8=1, 9=1, 10=1}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5026 ms. (steps per millisecond=4 ) properties seen :{0=1, 2=1, 3=1, 4=1, 6=1, 7=1, 8=1, 10=1, 11=1, 12=1}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5004 ms. (steps per millisecond=4 ) properties seen :{1=2, 5=2, 9=2}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5050 ms. (steps per millisecond=4 ) properties seen :{0=1, 1=1, 3=1, 4=1, 5=1, 7=1, 8=1, 9=1, 10=1}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5023 ms. (steps per millisecond=4 ) properties seen :{2=2, 6=2, 11=2, 12=2}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5037 ms. (steps per millisecond=4 ) properties seen :{2=2, 6=2, 11=2, 12=2}
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 14:50:41] [INFO ] Computed 10000 place invariants in 56 ms
[2021-06-06 14:50:54] [INFO ] [Real]Absence check using 10000 positive place invariants in 10442 ms returned sat
[2021-06-06 14:50:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:51:26] [INFO ] [Real]Absence check using state equation in 31749 ms returned unknown
[2021-06-06 14:51:41] [INFO ] [Real]Absence check using 10000 positive place invariants in 11974 ms returned sat
[2021-06-06 14:51:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:52:11] [INFO ] [Real]Absence check using state equation in 29934 ms returned unknown
[2021-06-06 14:52:26] [INFO ] [Real]Absence check using 10000 positive place invariants in 11856 ms returned sat
[2021-06-06 14:52:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:52:56] [INFO ] [Real]Absence check using state equation in 29997 ms returned unknown
[2021-06-06 14:53:07] [INFO ] [Real]Absence check using 10000 positive place invariants in 8673 ms returned sat
[2021-06-06 14:53:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:53:41] [INFO ] [Real]Absence check using state equation in 33409 ms returned unknown
[2021-06-06 14:53:53] [INFO ] [Real]Absence check using 10000 positive place invariants in 9073 ms returned sat
[2021-06-06 14:53:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:54:26] [INFO ] [Real]Absence check using state equation in 32829 ms returned unknown
[2021-06-06 14:54:40] [INFO ] [Real]Absence check using 10000 positive place invariants in 11184 ms returned sat
[2021-06-06 14:54:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:55:11] [INFO ] [Real]Absence check using state equation in 30843 ms returned unknown
[2021-06-06 14:55:27] [INFO ] [Real]Absence check using 10000 positive place invariants in 12725 ms returned sat
[2021-06-06 14:55:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:55:56] [INFO ] [Real]Absence check using state equation in 29355 ms returned unknown
[2021-06-06 14:56:08] [INFO ] [Real]Absence check using 10000 positive place invariants in 9301 ms returned sat
[2021-06-06 14:56:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:56:41] [INFO ] [Real]Absence check using state equation in 32507 ms returned unknown
[2021-06-06 14:56:53] [INFO ] [Real]Absence check using 10000 positive place invariants in 9115 ms returned sat
[2021-06-06 14:56:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:57:26] [INFO ] [Real]Absence check using state equation in 32691 ms returned unknown
[2021-06-06 14:57:40] [INFO ] [Real]Absence check using 10000 positive place invariants in 11303 ms returned sat
[2021-06-06 14:57:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:58:11] [INFO ] [Real]Absence check using state equation in 30856 ms returned unknown
[2021-06-06 14:58:22] [INFO ] [Real]Absence check using 10000 positive place invariants in 8368 ms returned sat
[2021-06-06 14:58:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:58:56] [INFO ] [Real]Absence check using state equation in 33706 ms returned unknown
[2021-06-06 14:59:10] [INFO ] [Real]Absence check using 10000 positive place invariants in 11323 ms returned sat
[2021-06-06 14:59:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:59:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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 14:59:55] [INFO ] [Real]Absence check using 10000 positive place invariants in 10934 ms returned sat
[2021-06-06 14:59:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:00:26] [INFO ] [Real]Absence check using state equation in 31083 ms returned unknown
Current structural bounds on expressions (after SMT) : [2500, 5000, 5000, 2500, 2500, 5000, 5000, 2500, 2500, 5000, 2500, 5000, 5000] Max seen :[722, 1542, 1522, 722, 722, 1542, 1522, 722, 722, 1542, 722, 1522, 1522]
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 2265 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 1723 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 15:00:30] [INFO ] Computed 10000 place invariants in 58 ms
[2021-06-06 15:00:32] [INFO ] Implicit Places using invariants in 2040 ms returned []
Implicit Place search using SMT only with invariants took 2046 ms to find 0 implicit places.
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 15:00:32] [INFO ] Computed 10000 place invariants in 49 ms
[2021-06-06 15:00:34] [INFO ] Dead Transitions using invariants and state equation in 2056 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 15:00:34] [INFO ] Computed 10000 place invariants in 47 ms
Interrupted random walk after 8547 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen :{0=689, 1=1564, 2=1558, 3=689, 4=689, 5=1564, 6=1558, 7=689, 8=689, 9=1564, 10=689, 11=1558, 12=1558}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5084 ms. (steps per millisecond=4 ) properties seen :{0=1, 2=1, 3=1, 4=1, 6=1, 7=1, 8=1, 10=1, 11=1, 12=1}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5038 ms. (steps per millisecond=4 ) properties seen :{1=2, 5=2, 9=2}
Interrupted Best-First random walk after 25001 steps, including 0 resets, run timeout after 5173 ms. (steps per millisecond=4 ) properties seen :{2=2, 6=2, 11=2, 12=2}
Interrupted Best-First random walk after 25001 steps, including 0 resets, run timeout after 5167 ms. (steps per millisecond=4 ) properties seen :{0=1, 1=1, 3=1, 4=1, 5=1, 7=1, 8=1, 9=1, 10=1}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5023 ms. (steps per millisecond=4 ) properties seen :{0=1, 2=1, 3=1, 4=1, 6=1, 7=1, 8=1, 10=1, 11=1, 12=1}
Interrupted Best-First random walk after 25001 steps, including 0 resets, run timeout after 5153 ms. (steps per millisecond=4 ) properties seen :{1=2, 5=2, 9=2}
Interrupted Best-First random walk after 25001 steps, including 0 resets, run timeout after 5147 ms. (steps per millisecond=4 ) properties seen :{2=2, 6=2, 11=2, 12=2}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5124 ms. (steps per millisecond=4 ) properties seen :{0=1, 1=1, 3=1, 4=1, 5=1, 7=1, 8=1, 9=1, 10=1}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5143 ms. (steps per millisecond=4 ) properties seen :{0=1, 2=1, 3=1, 4=1, 6=1, 7=1, 8=1, 10=1, 11=1, 12=1}
Interrupted Best-First random walk after 25001 steps, including 0 resets, run timeout after 5181 ms. (steps per millisecond=4 ) properties seen :{1=2, 5=2, 9=2}
Interrupted Best-First random walk after 25001 steps, including 0 resets, run timeout after 5183 ms. (steps per millisecond=4 ) properties seen :{0=1, 2=1, 3=1, 4=1, 6=1, 7=1, 8=1, 10=1, 11=1, 12=1}
Interrupted Best-First random walk after 25001 steps, including 0 resets, run timeout after 5156 ms. (steps per millisecond=4 ) properties seen :{2=2, 6=2, 11=2, 12=2}
Interrupted Best-First random walk after 25001 steps, including 0 resets, run timeout after 5165 ms. (steps per millisecond=4 ) properties seen :{2=2, 6=2, 11=2, 12=2}
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 15:02:11] [INFO ] Computed 10000 place invariants in 62 ms
[2021-06-06 15:02:24] [INFO ] [Real]Absence check using 10000 positive place invariants in 9345 ms returned sat
[2021-06-06 15:02:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:02:56] [INFO ] [Real]Absence check using state equation in 32706 ms returned unknown
[2021-06-06 15:03:11] [INFO ] [Real]Absence check using 10000 positive place invariants in 11971 ms returned sat
[2021-06-06 15:03:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:03:41] [INFO ] [Real]Absence check using state equation in 30036 ms returned unknown
[2021-06-06 15:03:55] [INFO ] [Real]Absence check using 10000 positive place invariants in 10905 ms returned sat
[2021-06-06 15:03:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:04:26] [INFO ] [Real]Absence check using state equation in 31137 ms returned unknown
[2021-06-06 15:04:38] [INFO ] [Real]Absence check using 10000 positive place invariants in 8719 ms returned sat
[2021-06-06 15:04:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:05:11] [INFO ] [Real]Absence check using state equation in 33366 ms returned unknown
[2021-06-06 15:05:24] [INFO ] [Real]Absence check using 10000 positive place invariants in 9390 ms returned sat
[2021-06-06 15:05:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:05:56] [INFO ] [Real]Absence check using state equation in 32509 ms returned unknown
[2021-06-06 15:06:11] [INFO ] [Real]Absence check using 10000 positive place invariants in 11573 ms returned sat
[2021-06-06 15:06:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:06:41] [INFO ] [Real]Absence check using state equation in 30346 ms returned unknown
[2021-06-06 15:06:55] [INFO ] [Real]Absence check using 10000 positive place invariants in 10836 ms returned sat
[2021-06-06 15:06:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:07:27] [INFO ] [Real]Absence check using state equation in 31238 ms returned unknown
[2021-06-06 15:07:39] [INFO ] [Real]Absence check using 10000 positive place invariants in 9887 ms returned sat
[2021-06-06 15:07:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:08:12] [INFO ] [Real]Absence check using state equation in 32147 ms returned unknown
[2021-06-06 15:08:24] [INFO ] [Real]Absence check using 10000 positive place invariants in 9442 ms returned sat
[2021-06-06 15:08:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:08:57] [INFO ] [Real]Absence check using state equation in 32596 ms returned unknown
[2021-06-06 15:09:11] [INFO ] [Real]Absence check using 10000 positive place invariants in 11122 ms returned sat
[2021-06-06 15:09:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:09:42] [INFO ] [Real]Absence check using state equation in 30986 ms returned unknown
[2021-06-06 15:09:54] [INFO ] [Real]Absence check using 10000 positive place invariants in 9105 ms returned sat
[2021-06-06 15:09:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:10:27] [INFO ] [Real]Absence check using state equation in 32971 ms returned unknown
[2021-06-06 15:10:41] [INFO ] [Real]Absence check using 10000 positive place invariants in 11053 ms returned sat
[2021-06-06 15:10:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:11:12] [INFO ] [Real]Absence check using state equation in 31082 ms returned unknown
[2021-06-06 15:11:26] [INFO ] [Real]Absence check using 10000 positive place invariants in 11435 ms returned sat
[2021-06-06 15:11:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:11:57] [INFO ] [Real]Absence check using state equation in 30643 ms returned unknown
Current structural bounds on expressions (after SMT) : [2500, 5000, 5000, 2500, 2500, 5000, 5000, 2500, 2500, 5000, 2500, 5000, 5000] Max seen :[722, 1564, 1558, 722, 722, 1564, 1558, 722, 722, 1564, 722, 1558, 1558]
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 1597 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 1605 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 15:12:00] [INFO ] Computed 10000 place invariants in 75 ms
[2021-06-06 15:12:02] [INFO ] Implicit Places using invariants in 2071 ms returned []
Implicit Place search using SMT only with invariants took 2076 ms to find 0 implicit places.
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 15:12:02] [INFO ] Computed 10000 place invariants in 78 ms
[2021-06-06 15:12:04] [INFO ] Dead Transitions using invariants and state equation in 2247 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 15:12:04] [INFO ] Computed 10000 place invariants in 49 ms
Interrupted random walk after 8384 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen :{0=757, 1=1495, 2=1479, 3=757, 4=757, 5=1495, 6=1479, 7=757, 8=757, 9=1495, 10=757, 11=1479, 12=1479}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5090 ms. (steps per millisecond=4 ) properties seen :{0=1, 2=1, 3=1, 4=1, 6=1, 7=1, 8=1, 10=1, 11=1, 12=1}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5005 ms. (steps per millisecond=4 ) properties seen :{1=2, 5=2, 9=2}
Interrupted Best-First random walk after 25001 steps, including 0 resets, run timeout after 5197 ms. (steps per millisecond=4 ) properties seen :{2=2, 6=2, 11=2, 12=2}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5017 ms. (steps per millisecond=4 ) properties seen :{0=1, 1=1, 3=1, 4=1, 5=1, 7=1, 8=1, 9=1, 10=1}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5039 ms. (steps per millisecond=4 ) properties seen :{0=1, 1=1, 3=1, 4=1, 5=1, 7=1, 8=1, 9=1, 10=1}
Interrupted Best-First random walk after 25001 steps, including 0 resets, run timeout after 5184 ms. (steps per millisecond=4 ) properties seen :{1=2, 5=2, 9=2}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5031 ms. (steps per millisecond=4 ) properties seen :{2=2, 6=2, 11=2, 12=2}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5020 ms. (steps per millisecond=4 ) properties seen :{0=1, 2=1, 3=1, 4=1, 6=1, 7=1, 8=1, 10=1, 11=1, 12=1}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5149 ms. (steps per millisecond=4 ) properties seen :{0=1, 2=1, 3=1, 4=1, 6=1, 7=1, 8=1, 10=1, 11=1, 12=1}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5022 ms. (steps per millisecond=4 ) properties seen :{1=2, 5=2, 9=2}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5035 ms. (steps per millisecond=4 ) properties seen :{0=1, 2=1, 3=1, 4=1, 6=1, 7=1, 8=1, 10=1, 11=1, 12=1}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5007 ms. (steps per millisecond=4 ) properties seen :{2=2, 6=2, 11=2, 12=2}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5014 ms. (steps per millisecond=4 ) properties seen :{2=2, 6=2, 11=2, 12=2}
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 15:13:40] [INFO ] Computed 10000 place invariants in 55 ms
[2021-06-06 15:13:52] [INFO ] [Real]Absence check using 10000 positive place invariants in 8558 ms returned sat
[2021-06-06 15:13:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:14:25] [INFO ] [Real]Absence check using state equation in 33484 ms returned unknown
[2021-06-06 15:14:39] [INFO ] [Real]Absence check using 10000 positive place invariants in 10673 ms returned sat
[2021-06-06 15:14:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:15:10] [INFO ] [Real]Absence check using state equation in 31500 ms returned unknown
[2021-06-06 15:15:24] [INFO ] [Real]Absence check using 10000 positive place invariants in 11100 ms returned sat
[2021-06-06 15:15:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:15:55] [INFO ] [Real]Absence check using state equation in 31102 ms returned unknown
[2021-06-06 15:16:07] [INFO ] [Real]Absence check using 10000 positive place invariants in 8869 ms returned sat
[2021-06-06 15:16:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:16:40] [INFO ] [Real]Absence check using state equation in 33308 ms returned unknown
[2021-06-06 15:16:54] [INFO ] [Real]Absence check using 10000 positive place invariants in 10711 ms returned sat
[2021-06-06 15:16:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:17:25] [INFO ] [Real]Absence check using state equation in 31111 ms returned unknown
[2021-06-06 15:17:39] [INFO ] [Real]Absence check using 10000 positive place invariants in 10947 ms returned sat
[2021-06-06 15:17:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:18:11] [INFO ] [Real]Absence check using state equation in 31190 ms returned unknown
[2021-06-06 15:18:24] [INFO ] [Real]Absence check using 10000 positive place invariants in 10935 ms returned sat
[2021-06-06 15:18:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:18:56] [INFO ] [Real]Absence check using state equation in 31199 ms returned unknown
[2021-06-06 15:19:07] [INFO ] [Real]Absence check using 10000 positive place invariants in 8696 ms returned sat
[2021-06-06 15:19:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:19:41] [INFO ] [Real]Absence check using state equation in 33380 ms returned unknown
[2021-06-06 15:19:53] [INFO ] [Real]Absence check using 10000 positive place invariants in 9804 ms returned sat
[2021-06-06 15:19:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:20:26] [INFO ] [Real]Absence check using state equation in 32329 ms returned unknown
[2021-06-06 15:20:39] [INFO ] [Real]Absence check using 10000 positive place invariants in 10624 ms returned sat
[2021-06-06 15:20:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:21:11] [INFO ] [Real]Absence check using state equation in 31266 ms returned unknown
[2021-06-06 15:21:24] [INFO ] [Real]Absence check using 10000 positive place invariants in 9674 ms returned sat
[2021-06-06 15:21:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:21:56] [INFO ] [Real]Absence check using state equation in 32053 ms returned unknown
[2021-06-06 15:22:09] [INFO ] [Real]Absence check using 10000 positive place invariants in 9984 ms returned sat
[2021-06-06 15:22:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:22:41] [INFO ] [Real]Absence check using state equation in 32252 ms returned unknown
[2021-06-06 15:22:55] [INFO ] [Real]Absence check using 10000 positive place invariants in 11278 ms returned sat
[2021-06-06 15:22:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:23:26] [INFO ] [Real]Absence check using state equation in 30964 ms returned unknown
Current structural bounds on expressions (after SMT) : [2500, 5000, 5000, 2500, 2500, 5000, 5000, 2500, 2500, 5000, 2500, 5000, 5000] Max seen :[757, 1564, 1558, 757, 757, 1564, 1558, 757, 757, 1564, 757, 1558, 1558]
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 1573 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 1547 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 15:23:29] [INFO ] Computed 10000 place invariants in 52 ms
[2021-06-06 15:23:31] [INFO ] Implicit Places using invariants in 1970 ms returned []
Implicit Place search using SMT only with invariants took 1987 ms to find 0 implicit places.
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 15:23:31] [INFO ] Computed 10000 place invariants in 43 ms
[2021-06-06 15:23:33] [INFO ] Dead Transitions using invariants and state equation in 2079 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 15:23:33] [INFO ] Computed 10000 place invariants in 45 ms
Interrupted random walk after 8420 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=0 ) properties seen :{0=685, 1=1486, 2=1565, 3=685, 4=685, 5=1486, 6=1565, 7=685, 8=685, 9=1486, 10=685, 11=1565, 12=1565}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5105 ms. (steps per millisecond=4 ) properties seen :{0=1, 1=1, 3=1, 4=1, 5=1, 7=1, 8=1, 9=1, 10=1}
Interrupted Best-First random walk after 25001 steps, including 0 resets, run timeout after 5164 ms. (steps per millisecond=4 ) properties seen :{1=2, 5=2, 9=2}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5041 ms. (steps per millisecond=4 ) properties seen :{2=2, 6=2, 11=2, 12=2}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5086 ms. (steps per millisecond=4 ) properties seen :{0=1, 2=1, 3=1, 4=1, 6=1, 7=1, 8=1, 10=1, 11=1, 12=1}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5031 ms. (steps per millisecond=4 ) properties seen :{0=1, 2=1, 3=1, 4=1, 6=1, 7=1, 8=1, 10=1, 11=1, 12=1}
Interrupted Best-First random walk after 25001 steps, including 0 resets, run timeout after 5176 ms. (steps per millisecond=4 ) properties seen :{1=2, 5=2, 9=2}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5023 ms. (steps per millisecond=4 ) properties seen :{2=2, 6=2, 11=2, 12=2}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5022 ms. (steps per millisecond=4 ) properties seen :{0=1, 1=1, 3=1, 4=1, 5=1, 7=1, 8=1, 9=1, 10=1}
Interrupted Best-First random walk after 23001 steps, including 0 resets, run timeout after 5114 ms. (steps per millisecond=4 ) properties seen :{0=1, 2=1, 3=1, 4=1, 6=1, 7=1, 8=1, 10=1, 11=1, 12=1}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5172 ms. (steps per millisecond=4 ) properties seen :{1=2, 5=2, 9=2}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5060 ms. (steps per millisecond=4 ) properties seen :{0=1, 2=1, 3=1, 4=1, 6=1, 7=1, 8=1, 10=1, 11=1, 12=1}
Interrupted Best-First random walk after 25001 steps, including 0 resets, run timeout after 5189 ms. (steps per millisecond=4 ) properties seen :{2=2, 6=2, 11=2, 12=2}
Interrupted Best-First random walk after 24001 steps, including 0 resets, run timeout after 5084 ms. (steps per millisecond=4 ) properties seen :{2=2, 6=2, 11=2, 12=2}
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 15:25:09] [INFO ] Computed 10000 place invariants in 50 ms
[2021-06-06 15:25:25] [INFO ] [Real]Absence check using 10000 positive place invariants in 12520 ms returned sat
[2021-06-06 15:25:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:25:54] [INFO ] [Real]Absence check using state equation in 29300 ms returned unknown
[2021-06-06 15:26:08] [INFO ] [Real]Absence check using 10000 positive place invariants in 11101 ms returned sat
[2021-06-06 15:26:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:26:40] [INFO ] [Real]Absence check using state equation in 31151 ms returned unknown
[2021-06-06 15:26:53] [INFO ] [Real]Absence check using 10000 positive place invariants in 10248 ms returned sat
[2021-06-06 15:26:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:27:25] [INFO ] [Real]Absence check using state equation in 31672 ms returned unknown
[2021-06-06 15:27:38] [INFO ] [Real]Absence check using 10000 positive place invariants in 9992 ms returned sat
[2021-06-06 15:27:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:28:10] [INFO ] [Real]Absence check using state equation in 32060 ms returned unknown
[2021-06-06 15:28:21] [INFO ] [Real]Absence check using 10000 positive place invariants in 8502 ms returned sat
[2021-06-06 15:28:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:28:55] [INFO ] [Real]Absence check using state equation in 33434 ms returned unknown
[2021-06-06 15:29:08] [INFO ] [Real]Absence check using 10000 positive place invariants in 10679 ms returned sat
[2021-06-06 15:29:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:29:40] [INFO ] [Real]Absence check using state equation in 31561 ms returned unknown
[2021-06-06 15:29:53] [INFO ] [Real]Absence check using 10000 positive place invariants in 10832 ms returned sat
[2021-06-06 15:29:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:30:25] [INFO ] [Real]Absence check using state equation in 31330 ms returned unknown
[2021-06-06 15:30:37] [INFO ] [Real]Absence check using 10000 positive place invariants in 9135 ms returned sat
[2021-06-06 15:30:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:31:10] [INFO ] [Real]Absence check using state equation in 32952 ms returned unknown
[2021-06-06 15:31:22] [INFO ] [Real]Absence check using 10000 positive place invariants in 9285 ms returned sat
[2021-06-06 15:31:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:31:55] [INFO ] [Real]Absence check using state equation in 32737 ms returned unknown
[2021-06-06 15:32:08] [INFO ] [Real]Absence check using 10000 positive place invariants in 10687 ms returned sat
[2021-06-06 15:32:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:32:40] [INFO ] [Real]Absence check using state equation in 31428 ms returned unknown
[2021-06-06 15:32:51] [INFO ] [Real]Absence check using 10000 positive place invariants in 8025 ms returned sat
[2021-06-06 15:32:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:33:25] [INFO ] [Real]Absence check using state equation in 33804 ms returned unknown
[2021-06-06 15:33:39] [INFO ] [Real]Absence check using 10000 positive place invariants in 10605 ms returned sat
[2021-06-06 15:33:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:34:10] [INFO ] [Real]Absence check using state equation in 31277 ms returned unknown
[2021-06-06 15:34:24] [INFO ] [Real]Absence check using 10000 positive place invariants in 10811 ms returned sat
[2021-06-06 15:34:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:34:55] [INFO ] [Real]Absence check using state equation in 31295 ms returned unknown
Current structural bounds on expressions (after SMT) : [2500, 5000, 5000, 2500, 2500, 5000, 5000, 2500, 2500, 5000, 2500, 5000, 5000] Max seen :[757, 1564, 1565, 757, 757, 1564, 1565, 757, 757, 1564, 757, 1565, 1565]
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 1684 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 1757 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 15:34:58] [INFO ] Computed 10000 place invariants in 50 ms
[2021-06-06 15:35:00] [INFO ] Implicit Places using invariants in 2005 ms returned []
Implicit Place search using SMT only with invariants took 2013 ms to find 0 implicit places.
// Phase 1: matrix 25000 rows 25000 cols
[2021-06-06 15:35:00] [INFO ] Computed 10000 place invariants in 58 ms
[2021-06-06 15:35:03] [INFO ] Dead Transitions using invariants and state equation in 2282 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 15:35:03] [INFO ] Computed 10000 place invariants in 52 ms
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-COL-005000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Philosophers-COL-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-162298995900067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-005000.tgz
mv Philosophers-COL-005000 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;