Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r179-tall-165277026900157.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is PhilosophersDyn-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277026900157
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 37K Apr 30 07:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 182K Apr 30 07:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 318K Apr 30 07:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.6M Apr 30 07:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 28K May 9 08:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 9 08:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 126K May 9 08:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 469K May 9 08:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K May 9 08:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K May 9 08:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.8M May 10 09:34 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652831355961

Running Version 0
[2022-05-17 23:49:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 23:49:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 23:49:17] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2022-05-17 23:49:17] [INFO ] Transformed 170 places.
[2022-05-17 23:49:17] [INFO ] Transformed 2310 transitions.
[2022-05-17 23:49:17] [INFO ] Parsed PT model containing 170 places and 2310 transitions in 229 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
Normalized transition count is 1905 out of 2265 initially.
// Phase 1: matrix 1905 rows 170 cols
[2022-05-17 23:49:17] [INFO ] Computed 39 place invariants in 89 ms
FORMULA PhilosophersDyn-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 1191 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 15) seen :33
FORMULA PhilosophersDyn-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :28
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :28
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :28
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :28
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :28
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :28
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :28
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :28
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :22
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :22
[2022-05-17 23:49:18] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2022-05-17 23:49:18] [INFO ] Computed 39 place invariants in 46 ms
[2022-05-17 23:49:18] [INFO ] [Real]Absence check using 27 positive place invariants in 11 ms returned sat
[2022-05-17 23:49:18] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 14 ms returned sat
[2022-05-17 23:49:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:49:19] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2022-05-17 23:49:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:49:19] [INFO ] [Nat]Absence check using 27 positive place invariants in 5 ms returned sat
[2022-05-17 23:49:19] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 3 ms returned sat
[2022-05-17 23:49:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:49:19] [INFO ] [Nat]Absence check using state equation in 338 ms returned sat
[2022-05-17 23:49:19] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2022-05-17 23:49:20] [INFO ] [Nat]Added 1030 Read/Feed constraints in 964 ms returned sat
[2022-05-17 23:49:20] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 294 ms.
[2022-05-17 23:49:21] [INFO ] Added : 0 causal constraints over 0 iterations in 451 ms. Result :sat
Minimization took 1888 ms.
[2022-05-17 23:49:23] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned sat
[2022-05-17 23:49:23] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 3 ms returned sat
[2022-05-17 23:49:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:49:23] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2022-05-17 23:49:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:49:23] [INFO ] [Nat]Absence check using 27 positive place invariants in 5 ms returned sat
[2022-05-17 23:49:23] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2022-05-17 23:49:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:49:23] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2022-05-17 23:49:24] [INFO ] [Nat]Added 1030 Read/Feed constraints in 962 ms returned sat
[2022-05-17 23:49:25] [INFO ] Deduced a trap composed of 64 places in 332 ms of which 3 ms to minimize.
[2022-05-17 23:49:25] [INFO ] Deduced a trap composed of 56 places in 276 ms of which 1 ms to minimize.
[2022-05-17 23:49:25] [INFO ] Deduced a trap composed of 59 places in 252 ms of which 1 ms to minimize.
[2022-05-17 23:49:26] [INFO ] Deduced a trap composed of 64 places in 282 ms of which 1 ms to minimize.
[2022-05-17 23:49:26] [INFO ] Deduced a trap composed of 56 places in 255 ms of which 1 ms to minimize.
[2022-05-17 23:49:26] [INFO ] Deduced a trap composed of 56 places in 241 ms of which 0 ms to minimize.
[2022-05-17 23:49:26] [INFO ] Deduced a trap composed of 63 places in 252 ms of which 0 ms to minimize.
[2022-05-17 23:49:27] [INFO ] Deduced a trap composed of 77 places in 276 ms of which 1 ms to minimize.
[2022-05-17 23:49:27] [INFO ] Deduced a trap composed of 65 places in 256 ms of which 5 ms to minimize.
[2022-05-17 23:49:27] [INFO ] Deduced a trap composed of 48 places in 281 ms of which 0 ms to minimize.
[2022-05-17 23:49:28] [INFO ] Deduced a trap composed of 63 places in 244 ms of which 0 ms to minimize.
[2022-05-17 23:49:28] [INFO ] Deduced a trap composed of 48 places in 243 ms of which 0 ms to minimize.
[2022-05-17 23:49:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 23:49:28] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned sat
[2022-05-17 23:49:28] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 3 ms returned sat
[2022-05-17 23:49:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:49:28] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2022-05-17 23:49:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:49:28] [INFO ] [Nat]Absence check using 27 positive place invariants in 5 ms returned sat
[2022-05-17 23:49:28] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 5 ms returned sat
[2022-05-17 23:49:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:49:29] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2022-05-17 23:49:30] [INFO ] [Nat]Added 1030 Read/Feed constraints in 969 ms returned sat
[2022-05-17 23:49:30] [INFO ] Deduced a trap composed of 64 places in 243 ms of which 0 ms to minimize.
[2022-05-17 23:49:30] [INFO ] Deduced a trap composed of 56 places in 237 ms of which 1 ms to minimize.
[2022-05-17 23:49:31] [INFO ] Deduced a trap composed of 59 places in 245 ms of which 0 ms to minimize.
[2022-05-17 23:49:31] [INFO ] Deduced a trap composed of 64 places in 251 ms of which 0 ms to minimize.
[2022-05-17 23:49:31] [INFO ] Deduced a trap composed of 56 places in 269 ms of which 1 ms to minimize.
[2022-05-17 23:49:32] [INFO ] Deduced a trap composed of 56 places in 290 ms of which 0 ms to minimize.
[2022-05-17 23:49:32] [INFO ] Deduced a trap composed of 63 places in 252 ms of which 0 ms to minimize.
[2022-05-17 23:49:32] [INFO ] Deduced a trap composed of 77 places in 283 ms of which 1 ms to minimize.
[2022-05-17 23:49:32] [INFO ] Deduced a trap composed of 65 places in 276 ms of which 1 ms to minimize.
[2022-05-17 23:49:33] [INFO ] Deduced a trap composed of 48 places in 251 ms of which 1 ms to minimize.
[2022-05-17 23:49:33] [INFO ] Deduced a trap composed of 63 places in 245 ms of which 1 ms to minimize.
[2022-05-17 23:49:33] [INFO ] Deduced a trap composed of 48 places in 276 ms of which 1 ms to minimize.
[2022-05-17 23:49:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 23:49:33] [INFO ] [Real]Absence check using 27 positive place invariants in 17 ms returned sat
[2022-05-17 23:49:33] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2022-05-17 23:49:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:49:34] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2022-05-17 23:49:34] [INFO ] [Real]Added 1030 Read/Feed constraints in 227 ms returned sat
[2022-05-17 23:49:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:49:34] [INFO ] [Nat]Absence check using 27 positive place invariants in 5 ms returned sat
[2022-05-17 23:49:34] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 3 ms returned sat
[2022-05-17 23:49:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:49:34] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2022-05-17 23:49:35] [INFO ] [Nat]Added 1030 Read/Feed constraints in 976 ms returned sat
[2022-05-17 23:49:36] [INFO ] Deduced a trap composed of 40 places in 249 ms of which 0 ms to minimize.
[2022-05-17 23:49:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 993 ms
[2022-05-17 23:49:37] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 502 ms.
[2022-05-17 23:49:37] [INFO ] Added : 0 causal constraints over 0 iterations in 636 ms. Result :sat
Minimization took 1304 ms.
[2022-05-17 23:49:38] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned sat
[2022-05-17 23:49:38] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 11 ms returned sat
[2022-05-17 23:49:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:49:39] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2022-05-17 23:49:39] [INFO ] [Real]Added 1030 Read/Feed constraints in 225 ms returned sat
[2022-05-17 23:49:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:49:39] [INFO ] [Nat]Absence check using 27 positive place invariants in 4 ms returned sat
[2022-05-17 23:49:39] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 3 ms returned sat
[2022-05-17 23:49:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:49:39] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2022-05-17 23:49:40] [INFO ] [Nat]Added 1030 Read/Feed constraints in 928 ms returned sat
[2022-05-17 23:49:41] [INFO ] Deduced a trap composed of 40 places in 280 ms of which 1 ms to minimize.
[2022-05-17 23:49:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1014 ms
[2022-05-17 23:49:42] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 221 ms.
[2022-05-17 23:49:42] [INFO ] Added : 0 causal constraints over 0 iterations in 349 ms. Result :sat
Minimization took 1309 ms.
[2022-05-17 23:49:43] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned sat
[2022-05-17 23:49:43] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 3 ms returned sat
[2022-05-17 23:49:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:49:43] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2022-05-17 23:49:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:49:44] [INFO ] [Nat]Absence check using 27 positive place invariants in 5 ms returned sat
[2022-05-17 23:49:44] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2022-05-17 23:49:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:49:44] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2022-05-17 23:49:45] [INFO ] [Nat]Added 1030 Read/Feed constraints in 1067 ms returned sat
[2022-05-17 23:49:45] [INFO ] Deduced a trap composed of 56 places in 238 ms of which 0 ms to minimize.
[2022-05-17 23:49:45] [INFO ] Deduced a trap composed of 58 places in 228 ms of which 1 ms to minimize.
[2022-05-17 23:49:46] [INFO ] Deduced a trap composed of 64 places in 231 ms of which 0 ms to minimize.
[2022-05-17 23:49:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 888 ms
[2022-05-17 23:49:46] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 197 ms.
[2022-05-17 23:49:46] [INFO ] Added : 0 causal constraints over 0 iterations in 332 ms. Result :sat
Minimization took 1950 ms.
[2022-05-17 23:49:48] [INFO ] [Real]Absence check using 27 positive place invariants in 5 ms returned sat
[2022-05-17 23:49:48] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2022-05-17 23:49:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:49:48] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2022-05-17 23:49:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:49:49] [INFO ] [Nat]Absence check using 27 positive place invariants in 7 ms returned sat
[2022-05-17 23:49:49] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2022-05-17 23:49:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:49:49] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2022-05-17 23:49:50] [INFO ] [Nat]Added 1030 Read/Feed constraints in 965 ms returned sat
[2022-05-17 23:49:50] [INFO ] Deduced a trap composed of 64 places in 277 ms of which 0 ms to minimize.
[2022-05-17 23:49:50] [INFO ] Deduced a trap composed of 56 places in 302 ms of which 1 ms to minimize.
[2022-05-17 23:49:51] [INFO ] Deduced a trap composed of 59 places in 236 ms of which 0 ms to minimize.
[2022-05-17 23:49:51] [INFO ] Deduced a trap composed of 64 places in 275 ms of which 0 ms to minimize.
[2022-05-17 23:49:51] [INFO ] Deduced a trap composed of 56 places in 246 ms of which 0 ms to minimize.
[2022-05-17 23:49:52] [INFO ] Deduced a trap composed of 56 places in 281 ms of which 1 ms to minimize.
[2022-05-17 23:49:52] [INFO ] Deduced a trap composed of 63 places in 274 ms of which 0 ms to minimize.
[2022-05-17 23:49:52] [INFO ] Deduced a trap composed of 77 places in 298 ms of which 0 ms to minimize.
[2022-05-17 23:49:53] [INFO ] Deduced a trap composed of 65 places in 270 ms of which 0 ms to minimize.
[2022-05-17 23:49:53] [INFO ] Deduced a trap composed of 48 places in 281 ms of which 1 ms to minimize.
[2022-05-17 23:49:53] [INFO ] Deduced a trap composed of 63 places in 272 ms of which 1 ms to minimize.
[2022-05-17 23:49:54] [INFO ] Deduced a trap composed of 48 places in 278 ms of which 1 ms to minimize.
[2022-05-17 23:49:54] [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 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 23:49:54] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned sat
[2022-05-17 23:49:54] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2022-05-17 23:49:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:49:54] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2022-05-17 23:49:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:49:54] [INFO ] [Nat]Absence check using 27 positive place invariants in 5 ms returned sat
[2022-05-17 23:49:54] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2022-05-17 23:49:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:49:54] [INFO ] [Nat]Absence check using state equation in 298 ms returned sat
[2022-05-17 23:49:55] [INFO ] [Nat]Added 1030 Read/Feed constraints in 948 ms returned sat
[2022-05-17 23:49:56] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 198 ms.
[2022-05-17 23:49:56] [INFO ] Added : 0 causal constraints over 0 iterations in 321 ms. Result :sat
Minimization took 1870 ms.
[2022-05-17 23:49:58] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned sat
[2022-05-17 23:49:58] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 10 ms returned unsat
[2022-05-17 23:49:58] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned sat
[2022-05-17 23:49:58] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : [10, 10, 10, -1, -1, -1, 10, 10, 1, 1] Max seen :[2, 4, 4, 4, 4, 2, 4, 2, 1, 1]
FORMULA PhilosophersDyn-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PhilosophersDyn-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 417300 steps, including 49550 resets, run finished after 7519 ms. (steps per millisecond=55 ) properties (out of 8) seen :26 could not realise parikh vector
Incomplete Parikh walk after 475900 steps, including 51989 resets, run finished after 8723 ms. (steps per millisecond=54 ) properties (out of 8) seen :26 could not realise parikh vector
Incomplete Parikh walk after 334900 steps, including 36582 resets, run finished after 6205 ms. (steps per millisecond=53 ) properties (out of 8) seen :26 could not realise parikh vector
Incomplete Parikh walk after 334900 steps, including 36651 resets, run finished after 6235 ms. (steps per millisecond=53 ) properties (out of 8) seen :26 could not realise parikh vector
Incomplete Parikh walk after 417300 steps, including 49592 resets, run finished after 7453 ms. (steps per millisecond=55 ) properties (out of 8) seen :26 could not realise parikh vector
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 2265/2265 transitions.
Applied a total of 0 rules in 254 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
[2022-05-17 23:50:34] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2022-05-17 23:50:34] [INFO ] Computed 39 place invariants in 35 ms
[2022-05-17 23:50:35] [INFO ] Dead Transitions using invariants and state equation in 751 ms returned [7, 9, 16, 24, 27, 29, 40, 41, 54, 59, 68, 69, 72, 85, 101, 115, 116, 123, 124, 137, 140, 155, 157, 167, 169, 171, 190, 199, 210, 211, 217, 226, 228, 248, 259, 261, 269, 270, 271, 272, 284, 285, 293, 297, 303, 326, 336, 338, 348, 351, 360, 363, 370, 375, 378, 381, 391, 397, 408, 412, 419, 422, 437, 454, 460, 465, 472, 477, 478, 482, 488, 503, 504, 505, 506, 513, 516, 519, 521, 530, 542, 545, 546, 551, 555, 556, 558, 560, 564, 573, 575, 576, 577, 579, 590, 593, 599, 605, 621, 625, 632, 636, 641, 643, 649, 656, 659, 661, 664, 665, 669, 678, 683, 686, 696, 706, 715, 724, 737, 745, 750, 751, 753, 754, 755, 763, 775, 782, 790, 793, 800, 803, 806, 810, 838, 850, 852, 857, 859, 863, 871, 873, 878, 881, 887, 888, 889, 894, 897, 913, 922, 929, 938, 940, 941, 951, 952, 955, 957, 965, 970, 972, 978, 979, 985, 1015, 1016, 1027, 1030, 1035, 1038, 1059, 1061, 1065, 1068, 1075, 1079, 1080, 1088, 1089, 1091, 1100, 1105, 1110, 1118, 1134, 1136, 1139, 1140, 1144, 1145, 1154, 1158, 1161, 1167, 1190, 1195, 1201, 1202, 1203, 1205, 1212, 1213, 1228, 1236, 1244, 1252, 1272, 1299, 1307, 1308, 1309, 1318, 1319, 1322, 1332, 1335, 1337, 1338, 1345, 1349, 1354, 1355, 1360, 1364, 1365, 1373, 1384, 1386, 1406, 1408, 1414, 1428, 1433, 1436, 1443, 1444, 1452, 1453, 1464, 1481, 1487, 1499, 1505, 1522, 1527, 1529, 1535, 1540, 1545, 1547, 1555, 1558, 1560, 1561, 1563, 1564, 1567, 1570, 1572, 1573, 1575, 1579, 1580, 1585, 1589, 1592, 1593, 1599, 1603, 1612, 1613, 1622, 1628, 1629, 1635, 1641, 1659, 1662, 1664, 1671, 1680, 1684, 1704, 1708, 1718, 1732, 1733, 1737, 1738, 1739, 1748, 1753, 1754, 1761, 1763, 1764, 1772, 1775, 1782, 1784, 1787, 1791, 1806, 1816, 1818, 1822, 1827, 1830, 1841, 1851, 1859, 1872, 1877, 1899, 1901, 1908, 1909, 1916, 1920, 1925, 1926, 1934, 1942, 1947, 1971, 1978, 1984, 1988, 1999, 2001, 2004, 2008, 2010, 2011, 2025, 2032, 2034, 2038, 2039, 2046, 2059, 2061, 2065, 2069, 2071, 2079, 2080, 2096, 2101, 2105, 2108, 2111, 2117, 2118, 2126, 2134, 2139, 2140, 2155, 2157, 2163, 2171, 2175, 2179, 2180, 2186, 2194, 2197, 2200, 2202, 2209, 2220, 2222, 2225, 2228, 2229, 2233, 2242, 2259]
Found 380 dead transitions using SMT.
Drop transitions removed 380 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 380 transitions :[2259, 2242, 2233, 2229, 2228, 2225, 2222, 2220, 2209, 2202, 2200, 2197, 2194, 2186, 2180, 2179, 2175, 2171, 2163, 2157, 2155, 2140, 2139, 2134, 2126, 2118, 2117, 2111, 2108, 2105, 2101, 2096, 2080, 2079, 2071, 2069, 2065, 2061, 2059, 2046, 2039, 2038, 2034, 2032, 2025, 2011, 2010, 2008, 2004, 2001, 1999, 1988, 1984, 1978, 1971, 1947, 1942, 1934, 1926, 1925, 1920, 1916, 1909, 1908, 1901, 1899, 1877, 1872, 1859, 1851, 1841, 1830, 1827, 1822, 1818, 1816, 1806, 1791, 1787, 1784, 1782, 1775, 1772, 1764, 1763, 1761, 1754, 1753, 1748, 1739, 1738, 1737, 1733, 1732, 1718, 1708, 1704, 1684, 1680, 1671, 1664, 1662, 1659, 1641, 1635, 1629, 1628, 1622, 1613, 1612, 1603, 1599, 1593, 1592, 1589, 1585, 1580, 1579, 1575, 1573, 1572, 1570, 1567, 1564, 1563, 1561, 1560, 1558, 1555, 1547, 1545, 1540, 1535, 1529, 1527, 1522, 1505, 1499, 1487, 1481, 1464, 1453, 1452, 1444, 1443, 1436, 1433, 1428, 1414, 1408, 1406, 1386, 1384, 1373, 1365, 1364, 1360, 1355, 1354, 1349, 1345, 1338, 1337, 1335, 1332, 1322, 1319, 1318, 1309, 1308, 1307, 1299, 1272, 1252, 1244, 1236, 1228, 1213, 1212, 1205, 1203, 1202, 1201, 1195, 1190, 1167, 1161, 1158, 1154, 1145, 1144, 1140, 1139, 1136, 1134, 1118, 1110, 1105, 1100, 1091, 1089, 1088, 1080, 1079, 1075, 1068, 1065, 1061, 1059, 1038, 1035, 1030, 1027, 1016, 1015, 985, 979, 978, 972, 970, 965, 957, 955, 952, 951, 941, 940, 938, 929, 922, 913, 897, 894, 889, 888, 887, 881, 878, 873, 871, 863, 859, 857, 852, 850, 838, 810, 806, 803, 800, 793, 790, 782, 775, 763, 755, 754, 753, 751, 750, 745, 737, 724, 715, 706, 696, 686, 683, 678, 669, 665, 664, 661, 659, 656, 649, 643, 641, 636, 632, 625, 621, 605, 599, 593, 590, 579, 577, 576, 575, 573, 564, 560, 558, 556, 555, 551, 546, 545, 542, 530, 521, 519, 516, 513, 506, 505, 504, 503, 488, 482, 478, 477, 472, 465, 460, 454, 437, 422, 419, 412, 408, 397, 391, 381, 378, 375, 370, 363, 360, 351, 348, 338, 336, 326, 303, 297, 293, 285, 284, 272, 271, 270, 269, 261, 259, 248, 228, 226, 217, 211, 210, 199, 190, 171, 169, 167, 157, 155, 140, 137, 124, 123, 116, 115, 101, 85, 72, 69, 68, 59, 54, 41, 40, 29, 27, 24, 16, 9, 7]
Starting structural reductions, iteration 1 : 170/170 places, 1885/2265 transitions.
Applied a total of 0 rules in 111 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 170/170 places, 1885/2265 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:50:35] [INFO ] Computed 39 place invariants in 49 ms
Incomplete random walk after 1000000 steps, including 119396 resets, run finished after 15336 ms. (steps per millisecond=65 ) properties (out of 8) seen :26
Incomplete Best-First random walk after 1000001 steps, including 10003 resets, run finished after 1871 ms. (steps per millisecond=534 ) properties (out of 8) seen :26
Incomplete Best-First random walk after 1000001 steps, including 9576 resets, run finished after 1893 ms. (steps per millisecond=528 ) properties (out of 8) seen :26
Incomplete Best-First random walk after 1000001 steps, including 9575 resets, run finished after 1911 ms. (steps per millisecond=523 ) properties (out of 8) seen :26
Incomplete Best-First random walk after 1000001 steps, including 9042 resets, run finished after 2877 ms. (steps per millisecond=347 ) properties (out of 8) seen :26
Incomplete Best-First random walk after 1000001 steps, including 9043 resets, run finished after 2826 ms. (steps per millisecond=353 ) properties (out of 8) seen :26
Incomplete Best-First random walk after 1000001 steps, including 8514 resets, run finished after 1821 ms. (steps per millisecond=549 ) properties (out of 8) seen :26
Incomplete Best-First random walk after 1000001 steps, including 9578 resets, run finished after 1920 ms. (steps per millisecond=520 ) properties (out of 8) seen :26
Incomplete Best-First random walk after 1000001 steps, including 10001 resets, run finished after 1867 ms. (steps per millisecond=535 ) properties (out of 8) seen :26
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:51:07] [INFO ] Computed 39 place invariants in 41 ms
[2022-05-17 23:51:07] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 23:51:07] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-17 23:51:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:51:08] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2022-05-17 23:51:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:51:08] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 23:51:08] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2022-05-17 23:51:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:51:08] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2022-05-17 23:51:08] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:51:09] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1196 ms returned sat
[2022-05-17 23:51:10] [INFO ] Deduced a trap composed of 72 places in 211 ms of which 0 ms to minimize.
[2022-05-17 23:51:10] [INFO ] Deduced a trap composed of 80 places in 233 ms of which 0 ms to minimize.
[2022-05-17 23:51:10] [INFO ] Deduced a trap composed of 77 places in 213 ms of which 0 ms to minimize.
[2022-05-17 23:51:10] [INFO ] Deduced a trap composed of 74 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:51:11] [INFO ] Deduced a trap composed of 73 places in 224 ms of which 0 ms to minimize.
[2022-05-17 23:51:11] [INFO ] Deduced a trap composed of 73 places in 237 ms of which 0 ms to minimize.
[2022-05-17 23:51:12] [INFO ] Deduced a trap composed of 76 places in 206 ms of which 0 ms to minimize.
[2022-05-17 23:51:12] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2682 ms
[2022-05-17 23:51:12] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 152 ms.
[2022-05-17 23:51:12] [INFO ] Added : 0 causal constraints over 0 iterations in 279 ms. Result :sat
Minimization took 3001 ms.
[2022-05-17 23:51:15] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 23:51:15] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-17 23:51:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:51:16] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2022-05-17 23:51:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:51:16] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 23:51:16] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2022-05-17 23:51:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:51:16] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2022-05-17 23:51:17] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1087 ms returned sat
[2022-05-17 23:51:17] [INFO ] Deduced a trap composed of 76 places in 257 ms of which 1 ms to minimize.
[2022-05-17 23:51:18] [INFO ] Deduced a trap composed of 51 places in 216 ms of which 0 ms to minimize.
[2022-05-17 23:51:18] [INFO ] Deduced a trap composed of 48 places in 212 ms of which 0 ms to minimize.
[2022-05-17 23:51:18] [INFO ] Deduced a trap composed of 75 places in 219 ms of which 1 ms to minimize.
[2022-05-17 23:51:19] [INFO ] Deduced a trap composed of 51 places in 219 ms of which 0 ms to minimize.
[2022-05-17 23:51:19] [INFO ] Deduced a trap composed of 65 places in 244 ms of which 0 ms to minimize.
[2022-05-17 23:51:20] [INFO ] Deduced a trap composed of 57 places in 254 ms of which 1 ms to minimize.
[2022-05-17 23:51:20] [INFO ] Deduced a trap composed of 56 places in 214 ms of which 1 ms to minimize.
[2022-05-17 23:51:20] [INFO ] Deduced a trap composed of 73 places in 244 ms of which 1 ms to minimize.
[2022-05-17 23:51:21] [INFO ] Deduced a trap composed of 72 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:51:21] [INFO ] Deduced a trap composed of 64 places in 248 ms of which 0 ms to minimize.
[2022-05-17 23:51:22] [INFO ] Deduced a trap composed of 40 places in 234 ms of which 1 ms to minimize.
[2022-05-17 23:51:23] [INFO ] Deduced a trap composed of 48 places in 223 ms of which 0 ms to minimize.
[2022-05-17 23:51:23] [INFO ] Deduced a trap composed of 78 places in 246 ms of which 0 ms to minimize.
[2022-05-17 23:51:23] [INFO ] Deduced a trap composed of 66 places in 239 ms of which 0 ms to minimize.
[2022-05-17 23:51:24] [INFO ] Deduced a trap composed of 62 places in 246 ms of which 0 ms to minimize.
[2022-05-17 23:51:24] [INFO ] Deduced a trap composed of 80 places in 240 ms of which 1 ms to minimize.
[2022-05-17 23:51:24] [INFO ] Deduced a trap composed of 65 places in 239 ms of which 0 ms to minimize.
[2022-05-17 23:51:24] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 7371 ms
[2022-05-17 23:51:25] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 158 ms.
[2022-05-17 23:51:25] [INFO ] Added : 0 causal constraints over 0 iterations in 293 ms. Result :sat
Minimization took 1704 ms.
[2022-05-17 23:51:27] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 23:51:27] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 10 ms returned sat
[2022-05-17 23:51:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:51:27] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2022-05-17 23:51:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:51:27] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 23:51:27] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-17 23:51:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:51:27] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2022-05-17 23:51:28] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1086 ms returned sat
[2022-05-17 23:51:29] [INFO ] Deduced a trap composed of 76 places in 226 ms of which 2 ms to minimize.
[2022-05-17 23:51:29] [INFO ] Deduced a trap composed of 51 places in 235 ms of which 5 ms to minimize.
[2022-05-17 23:51:29] [INFO ] Deduced a trap composed of 48 places in 248 ms of which 1 ms to minimize.
[2022-05-17 23:51:30] [INFO ] Deduced a trap composed of 75 places in 250 ms of which 0 ms to minimize.
[2022-05-17 23:51:30] [INFO ] Deduced a trap composed of 51 places in 256 ms of which 0 ms to minimize.
[2022-05-17 23:51:31] [INFO ] Deduced a trap composed of 65 places in 250 ms of which 0 ms to minimize.
[2022-05-17 23:51:31] [INFO ] Deduced a trap composed of 57 places in 263 ms of which 1 ms to minimize.
[2022-05-17 23:51:31] [INFO ] Deduced a trap composed of 56 places in 256 ms of which 0 ms to minimize.
[2022-05-17 23:51:32] [INFO ] Deduced a trap composed of 73 places in 253 ms of which 1 ms to minimize.
[2022-05-17 23:51:32] [INFO ] Deduced a trap composed of 72 places in 250 ms of which 1 ms to minimize.
[2022-05-17 23:51:33] [INFO ] Deduced a trap composed of 64 places in 269 ms of which 1 ms to minimize.
[2022-05-17 23:51:33] [INFO ] Deduced a trap composed of 40 places in 250 ms of which 1 ms to minimize.
[2022-05-17 23:51:34] [INFO ] Deduced a trap composed of 48 places in 214 ms of which 1 ms to minimize.
[2022-05-17 23:51:35] [INFO ] Deduced a trap composed of 78 places in 210 ms of which 0 ms to minimize.
[2022-05-17 23:51:35] [INFO ] Deduced a trap composed of 66 places in 220 ms of which 1 ms to minimize.
[2022-05-17 23:51:35] [INFO ] Deduced a trap composed of 62 places in 242 ms of which 0 ms to minimize.
[2022-05-17 23:51:35] [INFO ] Deduced a trap composed of 80 places in 221 ms of which 0 ms to minimize.
[2022-05-17 23:51:36] [INFO ] Deduced a trap composed of 65 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:51:36] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 7502 ms
[2022-05-17 23:51:36] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 152 ms.
[2022-05-17 23:51:36] [INFO ] Added : 0 causal constraints over 0 iterations in 293 ms. Result :sat
Minimization took 1698 ms.
[2022-05-17 23:51:38] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 23:51:38] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-17 23:51:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:51:38] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2022-05-17 23:51:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:51:38] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 23:51:38] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2022-05-17 23:51:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:51:39] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2022-05-17 23:51:40] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1122 ms returned sat
[2022-05-17 23:51:40] [INFO ] Deduced a trap composed of 68 places in 231 ms of which 1 ms to minimize.
[2022-05-17 23:51:41] [INFO ] Deduced a trap composed of 74 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:51:41] [INFO ] Deduced a trap composed of 72 places in 227 ms of which 1 ms to minimize.
[2022-05-17 23:51:41] [INFO ] Deduced a trap composed of 72 places in 221 ms of which 1 ms to minimize.
[2022-05-17 23:51:42] [INFO ] Deduced a trap composed of 46 places in 227 ms of which 0 ms to minimize.
[2022-05-17 23:51:42] [INFO ] Deduced a trap composed of 81 places in 231 ms of which 0 ms to minimize.
[2022-05-17 23:51:43] [INFO ] Deduced a trap composed of 83 places in 227 ms of which 1 ms to minimize.
[2022-05-17 23:51:44] [INFO ] Deduced a trap composed of 61 places in 256 ms of which 0 ms to minimize.
[2022-05-17 23:51:44] [INFO ] Deduced a trap composed of 64 places in 228 ms of which 0 ms to minimize.
[2022-05-17 23:51:44] [INFO ] Deduced a trap composed of 46 places in 226 ms of which 0 ms to minimize.
[2022-05-17 23:51:45] [INFO ] Deduced a trap composed of 55 places in 227 ms of which 0 ms to minimize.
[2022-05-17 23:51:45] [INFO ] Deduced a trap composed of 51 places in 225 ms of which 0 ms to minimize.
[2022-05-17 23:51:45] [INFO ] Deduced a trap composed of 48 places in 225 ms of which 0 ms to minimize.
[2022-05-17 23:51:46] [INFO ] Deduced a trap composed of 46 places in 223 ms of which 0 ms to minimize.
[2022-05-17 23:51:46] [INFO ] Deduced a trap composed of 74 places in 228 ms of which 0 ms to minimize.
[2022-05-17 23:51:46] [INFO ] Deduced a trap composed of 74 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:51:46] [INFO ] Deduced a trap composed of 40 places in 224 ms of which 1 ms to minimize.
[2022-05-17 23:51:47] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 6843 ms
[2022-05-17 23:51:47] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 160 ms.
[2022-05-17 23:51:47] [INFO ] Added : 0 causal constraints over 0 iterations in 290 ms. Result :sat
Minimization took 1995 ms.
[2022-05-17 23:51:49] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 23:51:49] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-17 23:51:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:51:49] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2022-05-17 23:51:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:51:49] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 23:51:49] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-17 23:51:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:51:50] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2022-05-17 23:51:51] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1120 ms returned sat
[2022-05-17 23:51:51] [INFO ] Deduced a trap composed of 68 places in 240 ms of which 1 ms to minimize.
[2022-05-17 23:51:52] [INFO ] Deduced a trap composed of 74 places in 219 ms of which 0 ms to minimize.
[2022-05-17 23:51:52] [INFO ] Deduced a trap composed of 72 places in 224 ms of which 0 ms to minimize.
[2022-05-17 23:51:52] [INFO ] Deduced a trap composed of 72 places in 229 ms of which 0 ms to minimize.
[2022-05-17 23:51:53] [INFO ] Deduced a trap composed of 46 places in 227 ms of which 0 ms to minimize.
[2022-05-17 23:51:53] [INFO ] Deduced a trap composed of 81 places in 249 ms of which 0 ms to minimize.
[2022-05-17 23:51:54] [INFO ] Deduced a trap composed of 83 places in 223 ms of which 0 ms to minimize.
[2022-05-17 23:51:55] [INFO ] Deduced a trap composed of 61 places in 219 ms of which 1 ms to minimize.
[2022-05-17 23:51:55] [INFO ] Deduced a trap composed of 64 places in 231 ms of which 1 ms to minimize.
[2022-05-17 23:51:55] [INFO ] Deduced a trap composed of 46 places in 259 ms of which 0 ms to minimize.
[2022-05-17 23:51:56] [INFO ] Deduced a trap composed of 55 places in 221 ms of which 0 ms to minimize.
[2022-05-17 23:51:56] [INFO ] Deduced a trap composed of 51 places in 221 ms of which 0 ms to minimize.
[2022-05-17 23:51:56] [INFO ] Deduced a trap composed of 48 places in 219 ms of which 1 ms to minimize.
[2022-05-17 23:51:57] [INFO ] Deduced a trap composed of 46 places in 223 ms of which 1 ms to minimize.
[2022-05-17 23:51:57] [INFO ] Deduced a trap composed of 74 places in 256 ms of which 0 ms to minimize.
[2022-05-17 23:51:57] [INFO ] Deduced a trap composed of 74 places in 221 ms of which 0 ms to minimize.
[2022-05-17 23:51:57] [INFO ] Deduced a trap composed of 40 places in 227 ms of which 0 ms to minimize.
[2022-05-17 23:51:58] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 6863 ms
[2022-05-17 23:51:58] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 156 ms.
[2022-05-17 23:51:58] [INFO ] Added : 0 causal constraints over 0 iterations in 291 ms. Result :sat
Minimization took 2011 ms.
[2022-05-17 23:52:00] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 23:52:00] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-17 23:52:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:52:00] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2022-05-17 23:52:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:52:00] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 23:52:00] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2022-05-17 23:52:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:52:01] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2022-05-17 23:52:02] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1098 ms returned sat
[2022-05-17 23:52:02] [INFO ] Deduced a trap composed of 80 places in 208 ms of which 1 ms to minimize.
[2022-05-17 23:52:02] [INFO ] Deduced a trap composed of 82 places in 205 ms of which 0 ms to minimize.
[2022-05-17 23:52:03] [INFO ] Deduced a trap composed of 60 places in 215 ms of which 0 ms to minimize.
[2022-05-17 23:52:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 966 ms
[2022-05-17 23:52:03] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 192 ms.
[2022-05-17 23:52:03] [INFO ] Added : 0 causal constraints over 0 iterations in 322 ms. Result :sat
Minimization took 2293 ms.
[2022-05-17 23:52:05] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 23:52:05] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-17 23:52:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:52:06] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2022-05-17 23:52:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:52:06] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 23:52:06] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-17 23:52:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:52:06] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2022-05-17 23:52:07] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1069 ms returned sat
[2022-05-17 23:52:07] [INFO ] Deduced a trap composed of 76 places in 225 ms of which 0 ms to minimize.
[2022-05-17 23:52:08] [INFO ] Deduced a trap composed of 51 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:52:08] [INFO ] Deduced a trap composed of 48 places in 229 ms of which 0 ms to minimize.
[2022-05-17 23:52:09] [INFO ] Deduced a trap composed of 75 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:52:09] [INFO ] Deduced a trap composed of 51 places in 213 ms of which 1 ms to minimize.
[2022-05-17 23:52:09] [INFO ] Deduced a trap composed of 65 places in 221 ms of which 1 ms to minimize.
[2022-05-17 23:52:10] [INFO ] Deduced a trap composed of 57 places in 218 ms of which 1 ms to minimize.
[2022-05-17 23:52:10] [INFO ] Deduced a trap composed of 56 places in 241 ms of which 1 ms to minimize.
[2022-05-17 23:52:10] [INFO ] Deduced a trap composed of 73 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:52:11] [INFO ] Deduced a trap composed of 72 places in 209 ms of which 1 ms to minimize.
[2022-05-17 23:52:11] [INFO ] Deduced a trap composed of 64 places in 221 ms of which 1 ms to minimize.
[2022-05-17 23:52:12] [INFO ] Deduced a trap composed of 40 places in 225 ms of which 0 ms to minimize.
[2022-05-17 23:52:13] [INFO ] Deduced a trap composed of 48 places in 214 ms of which 0 ms to minimize.
[2022-05-17 23:52:13] [INFO ] Deduced a trap composed of 78 places in 209 ms of which 0 ms to minimize.
[2022-05-17 23:52:13] [INFO ] Deduced a trap composed of 66 places in 213 ms of which 0 ms to minimize.
[2022-05-17 23:52:14] [INFO ] Deduced a trap composed of 62 places in 228 ms of which 1 ms to minimize.
[2022-05-17 23:52:14] [INFO ] Deduced a trap composed of 80 places in 225 ms of which 0 ms to minimize.
[2022-05-17 23:52:14] [INFO ] Deduced a trap composed of 65 places in 224 ms of which 0 ms to minimize.
[2022-05-17 23:52:14] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 7142 ms
[2022-05-17 23:52:14] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 154 ms.
[2022-05-17 23:52:15] [INFO ] Added : 0 causal constraints over 0 iterations in 297 ms. Result :sat
Minimization took 1711 ms.
[2022-05-17 23:52:16] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 23:52:16] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-17 23:52:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:52:17] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2022-05-17 23:52:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:52:17] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 23:52:17] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 8 ms returned sat
[2022-05-17 23:52:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:52:17] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2022-05-17 23:52:18] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1192 ms returned sat
[2022-05-17 23:52:18] [INFO ] Deduced a trap composed of 72 places in 204 ms of which 0 ms to minimize.
[2022-05-17 23:52:19] [INFO ] Deduced a trap composed of 80 places in 201 ms of which 0 ms to minimize.
[2022-05-17 23:52:19] [INFO ] Deduced a trap composed of 77 places in 211 ms of which 1 ms to minimize.
[2022-05-17 23:52:19] [INFO ] Deduced a trap composed of 74 places in 211 ms of which 1 ms to minimize.
[2022-05-17 23:52:20] [INFO ] Deduced a trap composed of 73 places in 226 ms of which 0 ms to minimize.
[2022-05-17 23:52:20] [INFO ] Deduced a trap composed of 73 places in 204 ms of which 1 ms to minimize.
[2022-05-17 23:52:21] [INFO ] Deduced a trap composed of 76 places in 201 ms of which 0 ms to minimize.
[2022-05-17 23:52:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2575 ms
[2022-05-17 23:52:21] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 155 ms.
[2022-05-17 23:52:21] [INFO ] Added : 0 causal constraints over 0 iterations in 280 ms. Result :sat
Minimization took 3000 ms.
Current structural bounds on expressions (after SMT) : [10, 10, 10, -1, -1, -1, 10, 10] Max seen :[2, 4, 4, 4, 4, 2, 4, 2]
Incomplete Parikh walk after 535800 steps, including 58247 resets, run finished after 9027 ms. (steps per millisecond=59 ) properties (out of 8) seen :26 could not realise parikh vector
Incomplete Parikh walk after 298300 steps, including 32526 resets, run finished after 5015 ms. (steps per millisecond=59 ) properties (out of 8) seen :26 could not realise parikh vector
Incomplete Parikh walk after 644900 steps, including 70100 resets, run finished after 10777 ms. (steps per millisecond=59 ) properties (out of 8) seen :26 could not realise parikh vector
Incomplete Parikh walk after 644900 steps, including 70108 resets, run finished after 10773 ms. (steps per millisecond=59 ) properties (out of 8) seen :26 could not realise parikh vector
Incomplete Parikh walk after 535800 steps, including 58287 resets, run finished after 8909 ms. (steps per millisecond=60 ) properties (out of 8) seen :26 could not realise parikh vector
Incomplete Parikh walk after 535800 steps, including 58355 resets, run finished after 8915 ms. (steps per millisecond=60 ) properties (out of 8) seen :26 could not realise parikh vector
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 148 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 102 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:53:18] [INFO ] Computed 39 place invariants in 40 ms
[2022-05-17 23:53:18] [INFO ] Implicit Places using invariants in 143 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:53:18] [INFO ] Computed 39 place invariants in 33 ms
[2022-05-17 23:53:18] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:53:20] [INFO ] Implicit Places using invariants and state equation in 1600 ms returned []
Implicit Place search using SMT with State Equation took 1747 ms to find 0 implicit places.
[2022-05-17 23:53:20] [INFO ] Redundant transitions in 130 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:53:20] [INFO ] Computed 39 place invariants in 35 ms
[2022-05-17 23:53:20] [INFO ] Dead Transitions using invariants and state equation in 618 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-00
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:53:20] [INFO ] Computed 39 place invariants in 30 ms
Incomplete random walk after 10000 steps, including 1190 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:53:21] [INFO ] Computed 39 place invariants in 60 ms
[2022-05-17 23:53:21] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 23:53:21] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 9 ms returned sat
[2022-05-17 23:53:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:53:21] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2022-05-17 23:53:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:53:21] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2022-05-17 23:53:21] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2022-05-17 23:53:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:53:21] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2022-05-17 23:53:21] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:53:22] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1243 ms returned sat
[2022-05-17 23:53:23] [INFO ] Deduced a trap composed of 72 places in 210 ms of which 1 ms to minimize.
[2022-05-17 23:53:23] [INFO ] Deduced a trap composed of 80 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:53:23] [INFO ] Deduced a trap composed of 77 places in 214 ms of which 0 ms to minimize.
[2022-05-17 23:53:24] [INFO ] Deduced a trap composed of 74 places in 242 ms of which 0 ms to minimize.
[2022-05-17 23:53:24] [INFO ] Deduced a trap composed of 73 places in 215 ms of which 0 ms to minimize.
[2022-05-17 23:53:24] [INFO ] Deduced a trap composed of 73 places in 216 ms of which 0 ms to minimize.
[2022-05-17 23:53:25] [INFO ] Deduced a trap composed of 76 places in 209 ms of which 1 ms to minimize.
[2022-05-17 23:53:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2689 ms
[2022-05-17 23:53:25] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 167 ms.
[2022-05-17 23:53:25] [INFO ] Added : 0 causal constraints over 0 iterations in 291 ms. Result :sat
Minimization took 442 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 144 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:53:26] [INFO ] Computed 39 place invariants in 30 ms
[2022-05-17 23:53:27] [INFO ] Dead Transitions using invariants and state equation in 673 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:53:27] [INFO ] Computed 39 place invariants in 31 ms
Incomplete random walk after 1000000 steps, including 119410 resets, run finished after 11284 ms. (steps per millisecond=88 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 10010 resets, run finished after 1522 ms. (steps per millisecond=657 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:53:40] [INFO ] Computed 39 place invariants in 52 ms
[2022-05-17 23:53:40] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 23:53:40] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 10 ms returned sat
[2022-05-17 23:53:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:53:40] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2022-05-17 23:53:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:53:40] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 23:53:40] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-17 23:53:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:53:40] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2022-05-17 23:53:40] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:53:41] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1208 ms returned sat
[2022-05-17 23:53:42] [INFO ] Deduced a trap composed of 72 places in 222 ms of which 1 ms to minimize.
[2022-05-17 23:53:42] [INFO ] Deduced a trap composed of 80 places in 208 ms of which 0 ms to minimize.
[2022-05-17 23:53:42] [INFO ] Deduced a trap composed of 77 places in 209 ms of which 0 ms to minimize.
[2022-05-17 23:53:43] [INFO ] Deduced a trap composed of 74 places in 212 ms of which 1 ms to minimize.
[2022-05-17 23:53:43] [INFO ] Deduced a trap composed of 73 places in 207 ms of which 0 ms to minimize.
[2022-05-17 23:53:43] [INFO ] Deduced a trap composed of 73 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:53:44] [INFO ] Deduced a trap composed of 76 places in 223 ms of which 1 ms to minimize.
[2022-05-17 23:53:44] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2620 ms
[2022-05-17 23:53:44] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 150 ms.
[2022-05-17 23:53:44] [INFO ] Added : 0 causal constraints over 0 iterations in 276 ms. Result :sat
Minimization took 3004 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 109 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 108 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:53:48] [INFO ] Computed 39 place invariants in 38 ms
[2022-05-17 23:53:48] [INFO ] Implicit Places using invariants in 384 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:53:48] [INFO ] Computed 39 place invariants in 44 ms
[2022-05-17 23:53:48] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:53:54] [INFO ] Implicit Places using invariants and state equation in 6296 ms returned []
Implicit Place search using SMT with State Equation took 6690 ms to find 0 implicit places.
[2022-05-17 23:53:54] [INFO ] Redundant transitions in 57 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:53:54] [INFO ] Computed 39 place invariants in 37 ms
[2022-05-17 23:53:55] [INFO ] Dead Transitions using invariants and state equation in 605 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-00 in 34702 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-01
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:53:55] [INFO ] Computed 39 place invariants in 32 ms
Incomplete random walk after 10000 steps, including 1198 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:53:55] [INFO ] Computed 39 place invariants in 38 ms
[2022-05-17 23:53:55] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 23:53:55] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2022-05-17 23:53:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:53:56] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2022-05-17 23:53:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:53:56] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 23:53:56] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 13 ms returned sat
[2022-05-17 23:53:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:53:56] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2022-05-17 23:53:56] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:53:57] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1074 ms returned sat
[2022-05-17 23:53:57] [INFO ] Deduced a trap composed of 76 places in 221 ms of which 1 ms to minimize.
[2022-05-17 23:53:58] [INFO ] Deduced a trap composed of 51 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:53:58] [INFO ] Deduced a trap composed of 48 places in 224 ms of which 1 ms to minimize.
[2022-05-17 23:53:58] [INFO ] Deduced a trap composed of 75 places in 216 ms of which 0 ms to minimize.
[2022-05-17 23:53:59] [INFO ] Deduced a trap composed of 51 places in 256 ms of which 1 ms to minimize.
[2022-05-17 23:53:59] [INFO ] Deduced a trap composed of 65 places in 214 ms of which 1 ms to minimize.
[2022-05-17 23:54:00] [INFO ] Deduced a trap composed of 57 places in 225 ms of which 0 ms to minimize.
[2022-05-17 23:54:00] [INFO ] Deduced a trap composed of 56 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:54:00] [INFO ] Deduced a trap composed of 73 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:54:01] [INFO ] Deduced a trap composed of 72 places in 224 ms of which 1 ms to minimize.
[2022-05-17 23:54:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 229 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:54:01] [INFO ] Computed 39 place invariants in 35 ms
[2022-05-17 23:54:01] [INFO ] Dead Transitions using invariants and state equation in 600 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:54:02] [INFO ] Computed 39 place invariants in 31 ms
Incomplete random walk after 1000000 steps, including 119446 resets, run finished after 11339 ms. (steps per millisecond=88 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9738 resets, run finished after 1532 ms. (steps per millisecond=652 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:54:14] [INFO ] Computed 39 place invariants in 34 ms
[2022-05-17 23:54:14] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 23:54:14] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 5 ms returned sat
[2022-05-17 23:54:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:54:15] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2022-05-17 23:54:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:54:15] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 23:54:15] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 6 ms returned sat
[2022-05-17 23:54:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:54:15] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2022-05-17 23:54:15] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:54:16] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1092 ms returned sat
[2022-05-17 23:54:16] [INFO ] Deduced a trap composed of 59 places in 219 ms of which 0 ms to minimize.
[2022-05-17 23:54:17] [INFO ] Deduced a trap composed of 55 places in 216 ms of which 1 ms to minimize.
[2022-05-17 23:54:17] [INFO ] Deduced a trap composed of 65 places in 224 ms of which 1 ms to minimize.
[2022-05-17 23:54:17] [INFO ] Deduced a trap composed of 49 places in 220 ms of which 0 ms to minimize.
[2022-05-17 23:54:18] [INFO ] Deduced a trap composed of 55 places in 242 ms of which 0 ms to minimize.
[2022-05-17 23:54:18] [INFO ] Deduced a trap composed of 59 places in 217 ms of which 1 ms to minimize.
[2022-05-17 23:54:18] [INFO ] Deduced a trap composed of 53 places in 220 ms of which 1 ms to minimize.
[2022-05-17 23:54:18] [INFO ] Deduced a trap composed of 62 places in 215 ms of which 1 ms to minimize.
[2022-05-17 23:54:19] [INFO ] Deduced a trap composed of 37 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:54:19] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2832 ms
[2022-05-17 23:54:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 153 ms.
[2022-05-17 23:54:19] [INFO ] Added : 0 causal constraints over 0 iterations in 297 ms. Result :sat
Minimization took 1434 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 59200 steps, including 7986 resets, run finished after 701 ms. (steps per millisecond=84 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 102 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 102 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:54:22] [INFO ] Computed 39 place invariants in 30 ms
[2022-05-17 23:54:22] [INFO ] Implicit Places using invariants in 381 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 386 ms to find 10 implicit places.
[2022-05-17 23:54:22] [INFO ] Redundant transitions in 72 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:54:22] [INFO ] Computed 29 place invariants in 19 ms
[2022-05-17 23:54:23] [INFO ] Dead Transitions using invariants and state equation in 579 ms returned []
Starting structural reductions, iteration 1 : 150/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 102 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2022-05-17 23:54:23] [INFO ] Redundant transitions in 73 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:54:23] [INFO ] Computed 29 place invariants in 24 ms
[2022-05-17 23:54:23] [INFO ] Dead Transitions using invariants and state equation in 569 ms returned []
Finished structural reductions, in 2 iterations. Remains : 150/160 places, 1875/1875 transitions.
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:54:24] [INFO ] Computed 29 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 119335 resets, run finished after 11066 ms. (steps per millisecond=90 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9738 resets, run finished after 1469 ms. (steps per millisecond=680 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:54:36] [INFO ] Computed 29 place invariants in 30 ms
[2022-05-17 23:54:36] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 23:54:36] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 8 ms returned sat
[2022-05-17 23:54:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:54:36] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2022-05-17 23:54:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:54:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 23:54:36] [INFO ] [Nat]Absence check using 14 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-17 23:54:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:54:37] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2022-05-17 23:54:37] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:54:38] [INFO ] [Nat]Added 1010 Read/Feed constraints in 982 ms returned sat
[2022-05-17 23:54:38] [INFO ] Deduced a trap composed of 49 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:54:38] [INFO ] Deduced a trap composed of 71 places in 209 ms of which 0 ms to minimize.
[2022-05-17 23:54:39] [INFO ] Deduced a trap composed of 49 places in 219 ms of which 1 ms to minimize.
[2022-05-17 23:54:39] [INFO ] Deduced a trap composed of 73 places in 212 ms of which 0 ms to minimize.
[2022-05-17 23:54:39] [INFO ] Deduced a trap composed of 80 places in 244 ms of which 1 ms to minimize.
[2022-05-17 23:54:40] [INFO ] Deduced a trap composed of 65 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:54:40] [INFO ] Deduced a trap composed of 53 places in 224 ms of which 0 ms to minimize.
[2022-05-17 23:54:40] [INFO ] Deduced a trap composed of 43 places in 216 ms of which 1 ms to minimize.
[2022-05-17 23:54:40] [INFO ] Deduced a trap composed of 39 places in 239 ms of which 1 ms to minimize.
[2022-05-17 23:54:41] [INFO ] Deduced a trap composed of 47 places in 239 ms of which 1 ms to minimize.
[2022-05-17 23:54:41] [INFO ] Deduced a trap composed of 65 places in 237 ms of which 0 ms to minimize.
[2022-05-17 23:54:41] [INFO ] Deduced a trap composed of 55 places in 254 ms of which 0 ms to minimize.
[2022-05-17 23:54:42] [INFO ] Deduced a trap composed of 47 places in 251 ms of which 0 ms to minimize.
[2022-05-17 23:54:42] [INFO ] Deduced a trap composed of 57 places in 244 ms of which 0 ms to minimize.
[2022-05-17 23:54:42] [INFO ] Deduced a trap composed of 68 places in 240 ms of which 0 ms to minimize.
[2022-05-17 23:54:43] [INFO ] Deduced a trap composed of 39 places in 241 ms of which 0 ms to minimize.
[2022-05-17 23:54:43] [INFO ] Deduced a trap composed of 30 places in 247 ms of which 1 ms to minimize.
[2022-05-17 23:54:43] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 5229 ms
[2022-05-17 23:54:43] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 155 ms.
[2022-05-17 23:54:43] [INFO ] Added : 0 causal constraints over 0 iterations in 290 ms. Result :sat
Minimization took 1506 ms.
Current structural bounds on expressions (after SMT) : [411] Max seen :[4]
Incomplete Parikh walk after 64100 steps, including 8282 resets, run finished after 775 ms. (steps per millisecond=82 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 10 out of 150 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 101 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 1875/1875 transitions.
Starting structural reductions, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 100 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:54:46] [INFO ] Computed 29 place invariants in 26 ms
[2022-05-17 23:54:46] [INFO ] Implicit Places using invariants in 339 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:54:46] [INFO ] Computed 29 place invariants in 20 ms
[2022-05-17 23:54:47] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:54:52] [INFO ] Implicit Places using invariants and state equation in 5820 ms returned []
Implicit Place search using SMT with State Equation took 6161 ms to find 0 implicit places.
[2022-05-17 23:54:52] [INFO ] Redundant transitions in 76 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:54:52] [INFO ] Computed 29 place invariants in 28 ms
[2022-05-17 23:54:53] [INFO ] Dead Transitions using invariants and state equation in 574 ms returned []
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 1875/1875 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-01 in 57672 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-02
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:54:53] [INFO ] Computed 39 place invariants in 30 ms
Incomplete random walk after 10000 steps, including 1188 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:54:53] [INFO ] Computed 39 place invariants in 37 ms
[2022-05-17 23:54:53] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 23:54:53] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2022-05-17 23:54:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:54:53] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2022-05-17 23:54:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:54:53] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 23:54:53] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-17 23:54:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:54:54] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2022-05-17 23:54:54] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:54:55] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1073 ms returned sat
[2022-05-17 23:54:55] [INFO ] Deduced a trap composed of 76 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:54:55] [INFO ] Deduced a trap composed of 51 places in 248 ms of which 0 ms to minimize.
[2022-05-17 23:54:56] [INFO ] Deduced a trap composed of 48 places in 246 ms of which 0 ms to minimize.
[2022-05-17 23:54:56] [INFO ] Deduced a trap composed of 75 places in 220 ms of which 0 ms to minimize.
[2022-05-17 23:54:57] [INFO ] Deduced a trap composed of 51 places in 278 ms of which 0 ms to minimize.
[2022-05-17 23:54:57] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 0 ms to minimize.
[2022-05-17 23:54:57] [INFO ] Deduced a trap composed of 57 places in 255 ms of which 0 ms to minimize.
[2022-05-17 23:54:58] [INFO ] Deduced a trap composed of 56 places in 248 ms of which 0 ms to minimize.
[2022-05-17 23:54:58] [INFO ] Deduced a trap composed of 73 places in 255 ms of which 1 ms to minimize.
[2022-05-17 23:54:59] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 1 ms to minimize.
[2022-05-17 23:54:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 212 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:54:59] [INFO ] Computed 39 place invariants in 39 ms
[2022-05-17 23:54:59] [INFO ] Dead Transitions using invariants and state equation in 594 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:54:59] [INFO ] Computed 39 place invariants in 35 ms
Incomplete random walk after 1000000 steps, including 119364 resets, run finished after 11303 ms. (steps per millisecond=88 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9746 resets, run finished after 1514 ms. (steps per millisecond=660 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:55:12] [INFO ] Computed 39 place invariants in 36 ms
[2022-05-17 23:55:12] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 23:55:12] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 6 ms returned sat
[2022-05-17 23:55:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:55:13] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2022-05-17 23:55:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:55:13] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 23:55:13] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 12 ms returned sat
[2022-05-17 23:55:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:55:13] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2022-05-17 23:55:13] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:55:14] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1066 ms returned sat
[2022-05-17 23:55:14] [INFO ] Deduced a trap composed of 59 places in 211 ms of which 0 ms to minimize.
[2022-05-17 23:55:15] [INFO ] Deduced a trap composed of 55 places in 222 ms of which 1 ms to minimize.
[2022-05-17 23:55:15] [INFO ] Deduced a trap composed of 65 places in 218 ms of which 1 ms to minimize.
[2022-05-17 23:55:15] [INFO ] Deduced a trap composed of 49 places in 216 ms of which 1 ms to minimize.
[2022-05-17 23:55:15] [INFO ] Deduced a trap composed of 55 places in 220 ms of which 0 ms to minimize.
[2022-05-17 23:55:16] [INFO ] Deduced a trap composed of 59 places in 246 ms of which 0 ms to minimize.
[2022-05-17 23:55:16] [INFO ] Deduced a trap composed of 53 places in 225 ms of which 0 ms to minimize.
[2022-05-17 23:55:16] [INFO ] Deduced a trap composed of 62 places in 219 ms of which 0 ms to minimize.
[2022-05-17 23:55:17] [INFO ] Deduced a trap composed of 37 places in 225 ms of which 0 ms to minimize.
[2022-05-17 23:55:17] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2842 ms
[2022-05-17 23:55:17] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 168 ms.
[2022-05-17 23:55:17] [INFO ] Added : 0 causal constraints over 0 iterations in 301 ms. Result :sat
Minimization took 1422 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 59200 steps, including 7994 resets, run finished after 700 ms. (steps per millisecond=84 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 103 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 100 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:55:20] [INFO ] Computed 39 place invariants in 34 ms
[2022-05-17 23:55:20] [INFO ] Implicit Places using invariants in 370 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 374 ms to find 10 implicit places.
[2022-05-17 23:55:20] [INFO ] Redundant transitions in 72 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:55:20] [INFO ] Computed 29 place invariants in 25 ms
[2022-05-17 23:55:21] [INFO ] Dead Transitions using invariants and state equation in 565 ms returned []
Starting structural reductions, iteration 1 : 150/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 103 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2022-05-17 23:55:21] [INFO ] Redundant transitions in 71 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:55:21] [INFO ] Computed 29 place invariants in 26 ms
[2022-05-17 23:55:21] [INFO ] Dead Transitions using invariants and state equation in 590 ms returned []
Finished structural reductions, in 2 iterations. Remains : 150/160 places, 1875/1875 transitions.
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:55:21] [INFO ] Computed 29 place invariants in 29 ms
Incomplete random walk after 1000000 steps, including 119300 resets, run finished after 11098 ms. (steps per millisecond=90 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9738 resets, run finished after 1492 ms. (steps per millisecond=670 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:55:34] [INFO ] Computed 29 place invariants in 27 ms
[2022-05-17 23:55:34] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 23:55:34] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 11 ms returned sat
[2022-05-17 23:55:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:55:34] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2022-05-17 23:55:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:55:34] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 23:55:34] [INFO ] [Nat]Absence check using 14 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-17 23:55:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:55:35] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2022-05-17 23:55:35] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:55:36] [INFO ] [Nat]Added 1010 Read/Feed constraints in 990 ms returned sat
[2022-05-17 23:55:36] [INFO ] Deduced a trap composed of 49 places in 212 ms of which 1 ms to minimize.
[2022-05-17 23:55:36] [INFO ] Deduced a trap composed of 71 places in 213 ms of which 0 ms to minimize.
[2022-05-17 23:55:37] [INFO ] Deduced a trap composed of 49 places in 222 ms of which 1 ms to minimize.
[2022-05-17 23:55:37] [INFO ] Deduced a trap composed of 73 places in 219 ms of which 1 ms to minimize.
[2022-05-17 23:55:37] [INFO ] Deduced a trap composed of 80 places in 215 ms of which 0 ms to minimize.
[2022-05-17 23:55:37] [INFO ] Deduced a trap composed of 65 places in 220 ms of which 0 ms to minimize.
[2022-05-17 23:55:38] [INFO ] Deduced a trap composed of 53 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:55:38] [INFO ] Deduced a trap composed of 43 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:55:38] [INFO ] Deduced a trap composed of 39 places in 217 ms of which 1 ms to minimize.
[2022-05-17 23:55:39] [INFO ] Deduced a trap composed of 47 places in 223 ms of which 0 ms to minimize.
[2022-05-17 23:55:39] [INFO ] Deduced a trap composed of 65 places in 220 ms of which 0 ms to minimize.
[2022-05-17 23:55:39] [INFO ] Deduced a trap composed of 55 places in 214 ms of which 1 ms to minimize.
[2022-05-17 23:55:39] [INFO ] Deduced a trap composed of 47 places in 261 ms of which 1 ms to minimize.
[2022-05-17 23:55:40] [INFO ] Deduced a trap composed of 57 places in 226 ms of which 0 ms to minimize.
[2022-05-17 23:55:40] [INFO ] Deduced a trap composed of 68 places in 224 ms of which 0 ms to minimize.
[2022-05-17 23:55:40] [INFO ] Deduced a trap composed of 39 places in 215 ms of which 0 ms to minimize.
[2022-05-17 23:55:41] [INFO ] Deduced a trap composed of 30 places in 218 ms of which 2 ms to minimize.
[2022-05-17 23:55:41] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 5023 ms
[2022-05-17 23:55:41] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 184 ms.
[2022-05-17 23:55:41] [INFO ] Added : 0 causal constraints over 0 iterations in 306 ms. Result :sat
Minimization took 1504 ms.
Current structural bounds on expressions (after SMT) : [411] Max seen :[4]
Incomplete Parikh walk after 64100 steps, including 8248 resets, run finished after 773 ms. (steps per millisecond=82 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 10 out of 150 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 99 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 1875/1875 transitions.
Starting structural reductions, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 109 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:55:44] [INFO ] Computed 29 place invariants in 27 ms
[2022-05-17 23:55:44] [INFO ] Implicit Places using invariants in 324 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:55:44] [INFO ] Computed 29 place invariants in 19 ms
[2022-05-17 23:55:44] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:55:49] [INFO ] Implicit Places using invariants and state equation in 4935 ms returned []
Implicit Place search using SMT with State Equation took 5260 ms to find 0 implicit places.
[2022-05-17 23:55:49] [INFO ] Redundant transitions in 72 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:55:49] [INFO ] Computed 29 place invariants in 19 ms
[2022-05-17 23:55:49] [INFO ] Dead Transitions using invariants and state equation in 565 ms returned []
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 1875/1875 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-02 in 56842 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-03
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:55:50] [INFO ] Computed 39 place invariants in 29 ms
Incomplete random walk after 10000 steps, including 1191 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:55:50] [INFO ] Computed 39 place invariants in 31 ms
[2022-05-17 23:55:50] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 23:55:50] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2022-05-17 23:55:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:55:50] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2022-05-17 23:55:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:55:50] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 23:55:50] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 8 ms returned sat
[2022-05-17 23:55:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:55:50] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2022-05-17 23:55:50] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:55:52] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1153 ms returned sat
[2022-05-17 23:55:52] [INFO ] Deduced a trap composed of 68 places in 225 ms of which 0 ms to minimize.
[2022-05-17 23:55:52] [INFO ] Deduced a trap composed of 74 places in 223 ms of which 0 ms to minimize.
[2022-05-17 23:55:53] [INFO ] Deduced a trap composed of 72 places in 226 ms of which 0 ms to minimize.
[2022-05-17 23:55:53] [INFO ] Deduced a trap composed of 72 places in 224 ms of which 0 ms to minimize.
[2022-05-17 23:55:54] [INFO ] Deduced a trap composed of 46 places in 231 ms of which 1 ms to minimize.
[2022-05-17 23:55:54] [INFO ] Deduced a trap composed of 81 places in 267 ms of which 1 ms to minimize.
[2022-05-17 23:55:55] [INFO ] Deduced a trap composed of 83 places in 233 ms of which 0 ms to minimize.
[2022-05-17 23:55:55] [INFO ] Deduced a trap composed of 4 places in 282 ms of which 0 ms to minimize.
[2022-05-17 23:55:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 100 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 198 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:55:56] [INFO ] Computed 39 place invariants in 39 ms
[2022-05-17 23:55:56] [INFO ] Dead Transitions using invariants and state equation in 609 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:55:56] [INFO ] Computed 39 place invariants in 31 ms
Incomplete random walk after 1000000 steps, including 119456 resets, run finished after 12597 ms. (steps per millisecond=79 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9406 resets, run finished after 2567 ms. (steps per millisecond=389 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:56:11] [INFO ] Computed 39 place invariants in 39 ms
[2022-05-17 23:56:12] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 23:56:12] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 6 ms returned sat
[2022-05-17 23:56:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:56:12] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2022-05-17 23:56:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:56:12] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 23:56:12] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 6 ms returned sat
[2022-05-17 23:56:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:56:12] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2022-05-17 23:56:12] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:56:13] [INFO ] [Nat]Added 1010 Read/Feed constraints in 989 ms returned sat
[2022-05-17 23:56:13] [INFO ] Deduced a trap composed of 69 places in 225 ms of which 0 ms to minimize.
[2022-05-17 23:56:14] [INFO ] Deduced a trap composed of 62 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:56:14] [INFO ] Deduced a trap composed of 75 places in 225 ms of which 1 ms to minimize.
[2022-05-17 23:56:15] [INFO ] Deduced a trap composed of 49 places in 226 ms of which 1 ms to minimize.
[2022-05-17 23:56:15] [INFO ] Deduced a trap composed of 39 places in 215 ms of which 0 ms to minimize.
[2022-05-17 23:56:15] [INFO ] Deduced a trap composed of 59 places in 251 ms of which 0 ms to minimize.
[2022-05-17 23:56:16] [INFO ] Deduced a trap composed of 37 places in 215 ms of which 1 ms to minimize.
[2022-05-17 23:56:16] [INFO ] Deduced a trap composed of 75 places in 220 ms of which 1 ms to minimize.
[2022-05-17 23:56:16] [INFO ] Deduced a trap composed of 69 places in 209 ms of which 0 ms to minimize.
[2022-05-17 23:56:17] [INFO ] Deduced a trap composed of 64 places in 250 ms of which 0 ms to minimize.
[2022-05-17 23:56:17] [INFO ] Deduced a trap composed of 49 places in 256 ms of which 0 ms to minimize.
[2022-05-17 23:56:17] [INFO ] Deduced a trap composed of 59 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:56:18] [INFO ] Deduced a trap composed of 30 places in 228 ms of which 0 ms to minimize.
[2022-05-17 23:56:18] [INFO ] Deduced a trap composed of 57 places in 219 ms of which 1 ms to minimize.
[2022-05-17 23:56:18] [INFO ] Deduced a trap composed of 57 places in 212 ms of which 0 ms to minimize.
[2022-05-17 23:56:19] [INFO ] Deduced a trap composed of 81 places in 221 ms of which 9 ms to minimize.
[2022-05-17 23:56:19] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 5469 ms
[2022-05-17 23:56:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 162 ms.
[2022-05-17 23:56:19] [INFO ] Added : 0 causal constraints over 0 iterations in 298 ms. Result :sat
Minimization took 1580 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 162800 steps, including 1002 resets, run finished after 1170 ms. (steps per millisecond=139 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 100 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 102 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 108 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:56:22] [INFO ] Computed 39 place invariants in 37 ms
[2022-05-17 23:56:22] [INFO ] Implicit Places using invariants in 254 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 259 ms to find 10 implicit places.
[2022-05-17 23:56:22] [INFO ] Redundant transitions in 55 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:56:22] [INFO ] Computed 29 place invariants in 27 ms
[2022-05-17 23:56:23] [INFO ] Dead Transitions using invariants and state equation in 645 ms returned []
Starting structural reductions, iteration 1 : 150/160 places, 1875/1875 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 1865
Applied a total of 20 rules in 216 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:56:23] [INFO ] Computed 29 place invariants in 26 ms
[2022-05-17 23:56:23] [INFO ] Implicit Places using invariants in 215 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:56:23] [INFO ] Computed 29 place invariants in 19 ms
[2022-05-17 23:56:24] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:56:25] [INFO ] Implicit Places using invariants and state equation in 1768 ms returned []
Implicit Place search using SMT with State Equation took 1985 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 140/160 places, 1865/1875 transitions.
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:56:25] [INFO ] Computed 29 place invariants in 24 ms
Incomplete random walk after 1000000 steps, including 178922 resets, run finished after 17682 ms. (steps per millisecond=56 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 11363 resets, run finished after 2698 ms. (steps per millisecond=370 ) properties (out of 1) seen :4
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:56:46] [INFO ] Computed 29 place invariants in 25 ms
[2022-05-17 23:56:46] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 23:56:46] [INFO ] [Real]Absence check using 10 positive and 19 generalized place invariants in 5 ms returned sat
[2022-05-17 23:56:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:56:46] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2022-05-17 23:56:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:56:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-05-17 23:56:46] [INFO ] [Nat]Absence check using 10 positive and 19 generalized place invariants in 5 ms returned sat
[2022-05-17 23:56:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:56:46] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2022-05-17 23:56:46] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:56:47] [INFO ] [Nat]Added 1010 Read/Feed constraints in 989 ms returned sat
[2022-05-17 23:56:48] [INFO ] Deduced a trap composed of 75 places in 250 ms of which 1 ms to minimize.
[2022-05-17 23:56:48] [INFO ] Deduced a trap composed of 67 places in 245 ms of which 1 ms to minimize.
[2022-05-17 23:56:48] [INFO ] Deduced a trap composed of 71 places in 247 ms of which 0 ms to minimize.
[2022-05-17 23:56:49] [INFO ] Deduced a trap composed of 61 places in 254 ms of which 0 ms to minimize.
[2022-05-17 23:56:49] [INFO ] Deduced a trap composed of 76 places in 271 ms of which 0 ms to minimize.
[2022-05-17 23:56:49] [INFO ] Deduced a trap composed of 71 places in 243 ms of which 0 ms to minimize.
[2022-05-17 23:56:50] [INFO ] Deduced a trap composed of 59 places in 250 ms of which 0 ms to minimize.
[2022-05-17 23:56:50] [INFO ] Deduced a trap composed of 63 places in 262 ms of which 0 ms to minimize.
[2022-05-17 23:56:50] [INFO ] Deduced a trap composed of 54 places in 205 ms of which 0 ms to minimize.
[2022-05-17 23:56:51] [INFO ] Deduced a trap composed of 75 places in 236 ms of which 0 ms to minimize.
[2022-05-17 23:56:51] [INFO ] Deduced a trap composed of 69 places in 234 ms of which 0 ms to minimize.
[2022-05-17 23:56:51] [INFO ] Deduced a trap composed of 49 places in 233 ms of which 0 ms to minimize.
[2022-05-17 23:56:52] [INFO ] Deduced a trap composed of 30 places in 234 ms of which 0 ms to minimize.
[2022-05-17 23:56:52] [INFO ] Deduced a trap composed of 39 places in 232 ms of which 0 ms to minimize.
[2022-05-17 23:56:52] [INFO ] Deduced a trap composed of 69 places in 233 ms of which 1 ms to minimize.
[2022-05-17 23:56:52] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 5166 ms
[2022-05-17 23:56:53] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1820 transitions) in 145 ms.
[2022-05-17 23:56:53] [INFO ] Added : 0 causal constraints over 0 iterations in 270 ms. Result :sat
Minimization took 2231 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 222500 steps, including 46385 resets, run finished after 4151 ms. (steps per millisecond=53 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 100 out of 140 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 98 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 140/140 places, 1865/1865 transitions.
Starting structural reductions, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 95 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:56:59] [INFO ] Computed 29 place invariants in 25 ms
[2022-05-17 23:57:00] [INFO ] Implicit Places using invariants in 196 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:57:00] [INFO ] Computed 29 place invariants in 24 ms
[2022-05-17 23:57:00] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:57:01] [INFO ] Implicit Places using invariants and state equation in 1680 ms returned []
Implicit Place search using SMT with State Equation took 1878 ms to find 0 implicit places.
[2022-05-17 23:57:01] [INFO ] Redundant transitions in 60 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:57:01] [INFO ] Computed 29 place invariants in 26 ms
[2022-05-17 23:57:02] [INFO ] Dead Transitions using invariants and state equation in 564 ms returned []
Finished structural reductions, in 1 iterations. Remains : 140/140 places, 1865/1865 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-03 in 72384 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-04
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:57:02] [INFO ] Computed 39 place invariants in 30 ms
Incomplete random walk after 10000 steps, including 1198 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:57:02] [INFO ] Computed 39 place invariants in 39 ms
[2022-05-17 23:57:02] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 23:57:02] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2022-05-17 23:57:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:57:02] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2022-05-17 23:57:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:57:03] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 23:57:03] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-17 23:57:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:57:03] [INFO ] [Nat]Absence check using state equation in 324 ms returned sat
[2022-05-17 23:57:03] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:57:04] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1145 ms returned sat
[2022-05-17 23:57:04] [INFO ] Deduced a trap composed of 68 places in 221 ms of which 0 ms to minimize.
[2022-05-17 23:57:05] [INFO ] Deduced a trap composed of 74 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:57:05] [INFO ] Deduced a trap composed of 72 places in 224 ms of which 1 ms to minimize.
[2022-05-17 23:57:06] [INFO ] Deduced a trap composed of 72 places in 244 ms of which 0 ms to minimize.
[2022-05-17 23:57:06] [INFO ] Deduced a trap composed of 46 places in 215 ms of which 0 ms to minimize.
[2022-05-17 23:57:07] [INFO ] Deduced a trap composed of 81 places in 219 ms of which 0 ms to minimize.
[2022-05-17 23:57:07] [INFO ] Deduced a trap composed of 83 places in 224 ms of which 1 ms to minimize.
[2022-05-17 23:57:08] [INFO ] Deduced a trap composed of 4 places in 275 ms of which 0 ms to minimize.
[2022-05-17 23:57:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 100 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 204 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:57:08] [INFO ] Computed 39 place invariants in 38 ms
[2022-05-17 23:57:09] [INFO ] Dead Transitions using invariants and state equation in 587 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:57:09] [INFO ] Computed 39 place invariants in 33 ms
Incomplete random walk after 1000000 steps, including 119510 resets, run finished after 12634 ms. (steps per millisecond=79 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000000 steps, including 9406 resets, run finished after 2588 ms. (steps per millisecond=386 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:57:24] [INFO ] Computed 39 place invariants in 37 ms
[2022-05-17 23:57:24] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 23:57:24] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 5 ms returned sat
[2022-05-17 23:57:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:57:24] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2022-05-17 23:57:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:57:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 23:57:24] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 7 ms returned sat
[2022-05-17 23:57:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:57:25] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2022-05-17 23:57:25] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:57:26] [INFO ] [Nat]Added 1010 Read/Feed constraints in 994 ms returned sat
[2022-05-17 23:57:26] [INFO ] Deduced a trap composed of 69 places in 227 ms of which 0 ms to minimize.
[2022-05-17 23:57:26] [INFO ] Deduced a trap composed of 62 places in 213 ms of which 0 ms to minimize.
[2022-05-17 23:57:27] [INFO ] Deduced a trap composed of 75 places in 226 ms of which 0 ms to minimize.
[2022-05-17 23:57:27] [INFO ] Deduced a trap composed of 49 places in 258 ms of which 1 ms to minimize.
[2022-05-17 23:57:27] [INFO ] Deduced a trap composed of 39 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:57:28] [INFO ] Deduced a trap composed of 59 places in 221 ms of which 0 ms to minimize.
[2022-05-17 23:57:28] [INFO ] Deduced a trap composed of 37 places in 220 ms of which 0 ms to minimize.
[2022-05-17 23:57:28] [INFO ] Deduced a trap composed of 75 places in 223 ms of which 1 ms to minimize.
[2022-05-17 23:57:29] [INFO ] Deduced a trap composed of 69 places in 227 ms of which 1 ms to minimize.
[2022-05-17 23:57:29] [INFO ] Deduced a trap composed of 64 places in 225 ms of which 0 ms to minimize.
[2022-05-17 23:57:29] [INFO ] Deduced a trap composed of 49 places in 220 ms of which 0 ms to minimize.
[2022-05-17 23:57:30] [INFO ] Deduced a trap composed of 59 places in 243 ms of which 0 ms to minimize.
[2022-05-17 23:57:30] [INFO ] Deduced a trap composed of 30 places in 221 ms of which 0 ms to minimize.
[2022-05-17 23:57:30] [INFO ] Deduced a trap composed of 57 places in 217 ms of which 1 ms to minimize.
[2022-05-17 23:57:31] [INFO ] Deduced a trap composed of 57 places in 216 ms of which 1 ms to minimize.
[2022-05-17 23:57:31] [INFO ] Deduced a trap composed of 81 places in 219 ms of which 0 ms to minimize.
[2022-05-17 23:57:31] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 5318 ms
[2022-05-17 23:57:31] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 157 ms.
[2022-05-17 23:57:31] [INFO ] Added : 0 causal constraints over 0 iterations in 297 ms. Result :sat
Minimization took 1583 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 162800 steps, including 1002 resets, run finished after 1161 ms. (steps per millisecond=140 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 100 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 95 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 93 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:57:34] [INFO ] Computed 39 place invariants in 39 ms
[2022-05-17 23:57:34] [INFO ] Implicit Places using invariants in 235 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 240 ms to find 10 implicit places.
[2022-05-17 23:57:34] [INFO ] Redundant transitions in 55 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:57:35] [INFO ] Computed 29 place invariants in 26 ms
[2022-05-17 23:57:35] [INFO ] Dead Transitions using invariants and state equation in 566 ms returned []
Starting structural reductions, iteration 1 : 150/160 places, 1875/1875 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 1865
Applied a total of 20 rules in 200 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:57:35] [INFO ] Computed 29 place invariants in 27 ms
[2022-05-17 23:57:35] [INFO ] Implicit Places using invariants in 216 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:57:35] [INFO ] Computed 29 place invariants in 19 ms
[2022-05-17 23:57:36] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:57:37] [INFO ] Implicit Places using invariants and state equation in 1748 ms returned []
Implicit Place search using SMT with State Equation took 1966 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 140/160 places, 1865/1875 transitions.
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:57:37] [INFO ] Computed 29 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 178847 resets, run finished after 17051 ms. (steps per millisecond=58 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 11363 resets, run finished after 2588 ms. (steps per millisecond=386 ) properties (out of 1) seen :4
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:57:57] [INFO ] Computed 29 place invariants in 27 ms
[2022-05-17 23:57:57] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 23:57:57] [INFO ] [Real]Absence check using 10 positive and 19 generalized place invariants in 5 ms returned sat
[2022-05-17 23:57:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:57:57] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2022-05-17 23:57:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:57:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 23:57:57] [INFO ] [Nat]Absence check using 10 positive and 19 generalized place invariants in 5 ms returned sat
[2022-05-17 23:57:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:57:58] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2022-05-17 23:57:58] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:57:59] [INFO ] [Nat]Added 1010 Read/Feed constraints in 946 ms returned sat
[2022-05-17 23:57:59] [INFO ] Deduced a trap composed of 75 places in 207 ms of which 0 ms to minimize.
[2022-05-17 23:57:59] [INFO ] Deduced a trap composed of 67 places in 204 ms of which 0 ms to minimize.
[2022-05-17 23:58:00] [INFO ] Deduced a trap composed of 71 places in 204 ms of which 0 ms to minimize.
[2022-05-17 23:58:00] [INFO ] Deduced a trap composed of 61 places in 210 ms of which 1 ms to minimize.
[2022-05-17 23:58:00] [INFO ] Deduced a trap composed of 76 places in 215 ms of which 0 ms to minimize.
[2022-05-17 23:58:00] [INFO ] Deduced a trap composed of 71 places in 255 ms of which 0 ms to minimize.
[2022-05-17 23:58:01] [INFO ] Deduced a trap composed of 59 places in 215 ms of which 0 ms to minimize.
[2022-05-17 23:58:01] [INFO ] Deduced a trap composed of 63 places in 210 ms of which 0 ms to minimize.
[2022-05-17 23:58:01] [INFO ] Deduced a trap composed of 54 places in 211 ms of which 0 ms to minimize.
[2022-05-17 23:58:02] [INFO ] Deduced a trap composed of 75 places in 214 ms of which 0 ms to minimize.
[2022-05-17 23:58:02] [INFO ] Deduced a trap composed of 69 places in 204 ms of which 1 ms to minimize.
[2022-05-17 23:58:02] [INFO ] Deduced a trap composed of 49 places in 214 ms of which 0 ms to minimize.
[2022-05-17 23:58:03] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 0 ms to minimize.
[2022-05-17 23:58:03] [INFO ] Deduced a trap composed of 39 places in 235 ms of which 1 ms to minimize.
[2022-05-17 23:58:03] [INFO ] Deduced a trap composed of 69 places in 211 ms of which 0 ms to minimize.
[2022-05-17 23:58:03] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4726 ms
[2022-05-17 23:58:03] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1820 transitions) in 142 ms.
[2022-05-17 23:58:04] [INFO ] Added : 0 causal constraints over 0 iterations in 281 ms. Result :sat
Minimization took 2134 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 222500 steps, including 46410 resets, run finished after 4143 ms. (steps per millisecond=53 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 100 out of 140 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 95 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 140/140 places, 1865/1865 transitions.
Starting structural reductions, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 95 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:58:10] [INFO ] Computed 29 place invariants in 26 ms
[2022-05-17 23:58:10] [INFO ] Implicit Places using invariants in 206 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:58:10] [INFO ] Computed 29 place invariants in 18 ms
[2022-05-17 23:58:11] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:58:12] [INFO ] Implicit Places using invariants and state equation in 1545 ms returned []
Implicit Place search using SMT with State Equation took 1753 ms to find 0 implicit places.
[2022-05-17 23:58:12] [INFO ] Redundant transitions in 59 ms returned []
// Phase 1: matrix 1865 rows 140 cols
[2022-05-17 23:58:12] [INFO ] Computed 29 place invariants in 28 ms
[2022-05-17 23:58:12] [INFO ] Dead Transitions using invariants and state equation in 553 ms returned []
Finished structural reductions, in 1 iterations. Remains : 140/140 places, 1865/1865 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-04 in 70554 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-05
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:58:12] [INFO ] Computed 39 place invariants in 28 ms
Incomplete random walk after 10000 steps, including 1182 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:58:13] [INFO ] Computed 39 place invariants in 38 ms
[2022-05-17 23:58:13] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 23:58:13] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-17 23:58:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:58:13] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2022-05-17 23:58:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:58:13] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 23:58:13] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-17 23:58:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:58:13] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2022-05-17 23:58:13] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:58:15] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1108 ms returned sat
[2022-05-17 23:58:15] [INFO ] Deduced a trap composed of 80 places in 223 ms of which 0 ms to minimize.
[2022-05-17 23:58:15] [INFO ] Deduced a trap composed of 82 places in 253 ms of which 1 ms to minimize.
[2022-05-17 23:58:15] [INFO ] Deduced a trap composed of 60 places in 220 ms of which 0 ms to minimize.
[2022-05-17 23:58:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1021 ms
[2022-05-17 23:58:16] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 150 ms.
[2022-05-17 23:58:16] [INFO ] Added : 0 causal constraints over 0 iterations in 305 ms. Result :sat
Minimization took 2195 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 115 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:58:18] [INFO ] Computed 39 place invariants in 36 ms
[2022-05-17 23:58:19] [INFO ] Dead Transitions using invariants and state equation in 652 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:58:19] [INFO ] Computed 39 place invariants in 38 ms
Incomplete random walk after 1000000 steps, including 119419 resets, run finished after 11573 ms. (steps per millisecond=86 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 8524 resets, run finished after 1380 ms. (steps per millisecond=724 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:58:32] [INFO ] Computed 39 place invariants in 38 ms
[2022-05-17 23:58:32] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2022-05-17 23:58:32] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-17 23:58:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:58:32] [INFO ] [Real]Absence check using state equation in 312 ms returned sat
[2022-05-17 23:58:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:58:32] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 23:58:32] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-17 23:58:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:58:33] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2022-05-17 23:58:33] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:58:34] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1109 ms returned sat
[2022-05-17 23:58:34] [INFO ] Deduced a trap composed of 80 places in 249 ms of which 1 ms to minimize.
[2022-05-17 23:58:34] [INFO ] Deduced a trap composed of 82 places in 241 ms of which 0 ms to minimize.
[2022-05-17 23:58:35] [INFO ] Deduced a trap composed of 60 places in 211 ms of which 0 ms to minimize.
[2022-05-17 23:58:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1044 ms
[2022-05-17 23:58:35] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 149 ms.
[2022-05-17 23:58:35] [INFO ] Added : 0 causal constraints over 0 iterations in 266 ms. Result :sat
Minimization took 2327 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 298300 steps, including 32513 resets, run finished after 3732 ms. (steps per millisecond=79 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 97 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 97 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:58:41] [INFO ] Computed 39 place invariants in 38 ms
[2022-05-17 23:58:42] [INFO ] Implicit Places using invariants in 331 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:58:42] [INFO ] Computed 39 place invariants in 36 ms
[2022-05-17 23:58:42] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:58:48] [INFO ] Implicit Places using invariants and state equation in 5993 ms returned []
Implicit Place search using SMT with State Equation took 6325 ms to find 0 implicit places.
[2022-05-17 23:58:48] [INFO ] Redundant transitions in 56 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:58:48] [INFO ] Computed 39 place invariants in 36 ms
[2022-05-17 23:58:48] [INFO ] Dead Transitions using invariants and state equation in 589 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-05 in 35890 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-06
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:58:48] [INFO ] Computed 39 place invariants in 29 ms
Incomplete random walk after 10000 steps, including 1186 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10000 steps, including 95 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :4
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:58:49] [INFO ] Computed 39 place invariants in 36 ms
[2022-05-17 23:58:49] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 23:58:49] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2022-05-17 23:58:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:58:49] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2022-05-17 23:58:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:58:49] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 23:58:49] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-17 23:58:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:58:49] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2022-05-17 23:58:49] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:58:51] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1278 ms returned sat
[2022-05-17 23:58:51] [INFO ] Deduced a trap composed of 76 places in 226 ms of which 0 ms to minimize.
[2022-05-17 23:58:51] [INFO ] Deduced a trap composed of 51 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:58:52] [INFO ] Deduced a trap composed of 48 places in 255 ms of which 0 ms to minimize.
[2022-05-17 23:58:52] [INFO ] Deduced a trap composed of 75 places in 222 ms of which 1 ms to minimize.
[2022-05-17 23:58:53] [INFO ] Deduced a trap composed of 51 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:58:53] [INFO ] Deduced a trap composed of 65 places in 222 ms of which 0 ms to minimize.
[2022-05-17 23:58:53] [INFO ] Deduced a trap composed of 57 places in 228 ms of which 0 ms to minimize.
[2022-05-17 23:58:54] [INFO ] Deduced a trap composed of 56 places in 227 ms of which 0 ms to minimize.
[2022-05-17 23:58:54] [INFO ] Deduced a trap composed of 73 places in 221 ms of which 1 ms to minimize.
[2022-05-17 23:58:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 204 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:58:54] [INFO ] Computed 39 place invariants in 39 ms
[2022-05-17 23:58:55] [INFO ] Dead Transitions using invariants and state equation in 593 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/170 places, 1875/1885 transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:58:55] [INFO ] Computed 39 place invariants in 33 ms
Incomplete random walk after 1000000 steps, including 119317 resets, run finished after 11303 ms. (steps per millisecond=88 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9741 resets, run finished after 1513 ms. (steps per millisecond=660 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:59:08] [INFO ] Computed 39 place invariants in 37 ms
[2022-05-17 23:59:08] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 23:59:08] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 6 ms returned sat
[2022-05-17 23:59:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:59:08] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2022-05-17 23:59:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:59:08] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 23:59:08] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 6 ms returned sat
[2022-05-17 23:59:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:59:08] [INFO ] [Nat]Absence check using state equation in 264 ms returned sat
[2022-05-17 23:59:09] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:59:10] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1030 ms returned sat
[2022-05-17 23:59:10] [INFO ] Deduced a trap composed of 59 places in 224 ms of which 0 ms to minimize.
[2022-05-17 23:59:10] [INFO ] Deduced a trap composed of 55 places in 245 ms of which 0 ms to minimize.
[2022-05-17 23:59:10] [INFO ] Deduced a trap composed of 65 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:59:11] [INFO ] Deduced a trap composed of 49 places in 212 ms of which 0 ms to minimize.
[2022-05-17 23:59:11] [INFO ] Deduced a trap composed of 55 places in 216 ms of which 1 ms to minimize.
[2022-05-17 23:59:11] [INFO ] Deduced a trap composed of 59 places in 215 ms of which 0 ms to minimize.
[2022-05-17 23:59:11] [INFO ] Deduced a trap composed of 53 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:59:12] [INFO ] Deduced a trap composed of 62 places in 207 ms of which 1 ms to minimize.
[2022-05-17 23:59:12] [INFO ] Deduced a trap composed of 37 places in 210 ms of which 1 ms to minimize.
[2022-05-17 23:59:12] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2784 ms
[2022-05-17 23:59:13] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 172 ms.
[2022-05-17 23:59:13] [INFO ] Added : 0 causal constraints over 0 iterations in 306 ms. Result :sat
Minimization took 1393 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 59200 steps, including 7975 resets, run finished after 698 ms. (steps per millisecond=84 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 97 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 98 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2022-05-17 23:59:15] [INFO ] Computed 39 place invariants in 40 ms
[2022-05-17 23:59:15] [INFO ] Implicit Places using invariants in 378 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 382 ms to find 10 implicit places.
[2022-05-17 23:59:15] [INFO ] Redundant transitions in 54 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:59:15] [INFO ] Computed 29 place invariants in 30 ms
[2022-05-17 23:59:16] [INFO ] Dead Transitions using invariants and state equation in 624 ms returned []
Starting structural reductions, iteration 1 : 150/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 98 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2022-05-17 23:59:16] [INFO ] Redundant transitions in 56 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:59:16] [INFO ] Computed 29 place invariants in 24 ms
[2022-05-17 23:59:17] [INFO ] Dead Transitions using invariants and state equation in 563 ms returned []
Finished structural reductions, in 2 iterations. Remains : 150/160 places, 1875/1875 transitions.
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:59:17] [INFO ] Computed 29 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 119226 resets, run finished after 11146 ms. (steps per millisecond=89 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000000 steps, including 9736 resets, run finished after 1485 ms. (steps per millisecond=673 ) properties (out of 1) seen :4
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:59:29] [INFO ] Computed 29 place invariants in 26 ms
[2022-05-17 23:59:29] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 23:59:29] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-17 23:59:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:59:30] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2022-05-17 23:59:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:59:30] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 23:59:30] [INFO ] [Nat]Absence check using 14 positive and 15 generalized place invariants in 5 ms returned sat
[2022-05-17 23:59:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:59:30] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2022-05-17 23:59:30] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:59:31] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1108 ms returned sat
[2022-05-17 23:59:32] [INFO ] Deduced a trap composed of 49 places in 225 ms of which 0 ms to minimize.
[2022-05-17 23:59:32] [INFO ] Deduced a trap composed of 71 places in 223 ms of which 1 ms to minimize.
[2022-05-17 23:59:32] [INFO ] Deduced a trap composed of 49 places in 212 ms of which 0 ms to minimize.
[2022-05-17 23:59:32] [INFO ] Deduced a trap composed of 73 places in 209 ms of which 0 ms to minimize.
[2022-05-17 23:59:33] [INFO ] Deduced a trap composed of 80 places in 233 ms of which 0 ms to minimize.
[2022-05-17 23:59:33] [INFO ] Deduced a trap composed of 65 places in 211 ms of which 0 ms to minimize.
[2022-05-17 23:59:33] [INFO ] Deduced a trap composed of 53 places in 223 ms of which 0 ms to minimize.
[2022-05-17 23:59:34] [INFO ] Deduced a trap composed of 43 places in 218 ms of which 0 ms to minimize.
[2022-05-17 23:59:34] [INFO ] Deduced a trap composed of 39 places in 215 ms of which 1 ms to minimize.
[2022-05-17 23:59:34] [INFO ] Deduced a trap composed of 47 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:59:34] [INFO ] Deduced a trap composed of 65 places in 220 ms of which 0 ms to minimize.
[2022-05-17 23:59:35] [INFO ] Deduced a trap composed of 55 places in 217 ms of which 0 ms to minimize.
[2022-05-17 23:59:35] [INFO ] Deduced a trap composed of 47 places in 216 ms of which 1 ms to minimize.
[2022-05-17 23:59:35] [INFO ] Deduced a trap composed of 57 places in 213 ms of which 1 ms to minimize.
[2022-05-17 23:59:36] [INFO ] Deduced a trap composed of 68 places in 228 ms of which 0 ms to minimize.
[2022-05-17 23:59:36] [INFO ] Deduced a trap composed of 39 places in 214 ms of which 0 ms to minimize.
[2022-05-17 23:59:36] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 1 ms to minimize.
[2022-05-17 23:59:36] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4926 ms
[2022-05-17 23:59:36] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 143 ms.
[2022-05-17 23:59:36] [INFO ] Added : 0 causal constraints over 0 iterations in 274 ms. Result :sat
Minimization took 1493 ms.
Current structural bounds on expressions (after SMT) : [411] Max seen :[4]
Incomplete Parikh walk after 64100 steps, including 8270 resets, run finished after 787 ms. (steps per millisecond=81 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 10 out of 150 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 102 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 1875/1875 transitions.
Starting structural reductions, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 99 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:59:39] [INFO ] Computed 29 place invariants in 27 ms
[2022-05-17 23:59:39] [INFO ] Implicit Places using invariants in 327 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:59:39] [INFO ] Computed 29 place invariants in 25 ms
[2022-05-17 23:59:40] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:59:44] [INFO ] Implicit Places using invariants and state equation in 4966 ms returned []
Implicit Place search using SMT with State Equation took 5294 ms to find 0 implicit places.
[2022-05-17 23:59:44] [INFO ] Redundant transitions in 56 ms returned []
// Phase 1: matrix 1875 rows 150 cols
[2022-05-17 23:59:44] [INFO ] Computed 29 place invariants in 27 ms
[2022-05-17 23:59:45] [INFO ] Dead Transitions using invariants and state equation in 585 ms returned []
Finished structural reductions, in 1 iterations. Remains : 150/150 places, 1875/1875 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-06 in 56637 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-07
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:59:45] [INFO ] Computed 39 place invariants in 33 ms
Incomplete random walk after 10000 steps, including 1201 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:59:45] [INFO ] Computed 39 place invariants in 36 ms
[2022-05-17 23:59:45] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 23:59:45] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-17 23:59:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:59:45] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2022-05-17 23:59:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:59:46] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 23:59:46] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-17 23:59:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:59:46] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2022-05-17 23:59:46] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-17 23:59:47] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1196 ms returned sat
[2022-05-17 23:59:47] [INFO ] Deduced a trap composed of 72 places in 200 ms of which 0 ms to minimize.
[2022-05-17 23:59:48] [INFO ] Deduced a trap composed of 80 places in 205 ms of which 0 ms to minimize.
[2022-05-17 23:59:48] [INFO ] Deduced a trap composed of 77 places in 204 ms of which 0 ms to minimize.
[2022-05-17 23:59:48] [INFO ] Deduced a trap composed of 74 places in 202 ms of which 1 ms to minimize.
[2022-05-17 23:59:48] [INFO ] Deduced a trap composed of 73 places in 199 ms of which 0 ms to minimize.
[2022-05-17 23:59:49] [INFO ] Deduced a trap composed of 73 places in 204 ms of which 1 ms to minimize.
[2022-05-17 23:59:50] [INFO ] Deduced a trap composed of 76 places in 234 ms of which 0 ms to minimize.
[2022-05-17 23:59:50] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2586 ms
[2022-05-17 23:59:50] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 149 ms.
[2022-05-17 23:59:50] [INFO ] Added : 0 causal constraints over 0 iterations in 270 ms. Result :sat
Minimization took 638 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 102 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:59:51] [INFO ] Computed 39 place invariants in 36 ms
[2022-05-17 23:59:51] [INFO ] Dead Transitions using invariants and state equation in 603 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-17 23:59:51] [INFO ] Computed 39 place invariants in 34 ms
Incomplete random walk after 1000000 steps, including 119230 resets, run finished after 11159 ms. (steps per millisecond=89 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 10016 resets, run finished after 1464 ms. (steps per millisecond=683 ) properties (out of 1) seen :2
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 00:00:04] [INFO ] Computed 39 place invariants in 28 ms
[2022-05-18 00:00:04] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-18 00:00:04] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2022-05-18 00:00:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:00:04] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2022-05-18 00:00:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:00:04] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-18 00:00:04] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2022-05-18 00:00:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:00:05] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2022-05-18 00:00:05] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 00:00:06] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1193 ms returned sat
[2022-05-18 00:00:06] [INFO ] Deduced a trap composed of 72 places in 206 ms of which 1 ms to minimize.
[2022-05-18 00:00:06] [INFO ] Deduced a trap composed of 80 places in 209 ms of which 0 ms to minimize.
[2022-05-18 00:00:07] [INFO ] Deduced a trap composed of 77 places in 203 ms of which 1 ms to minimize.
[2022-05-18 00:00:07] [INFO ] Deduced a trap composed of 74 places in 215 ms of which 0 ms to minimize.
[2022-05-18 00:00:07] [INFO ] Deduced a trap composed of 73 places in 219 ms of which 0 ms to minimize.
[2022-05-18 00:00:07] [INFO ] Deduced a trap composed of 73 places in 223 ms of which 0 ms to minimize.
[2022-05-18 00:00:08] [INFO ] Deduced a trap composed of 76 places in 209 ms of which 1 ms to minimize.
[2022-05-18 00:00:08] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2678 ms
[2022-05-18 00:00:09] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 148 ms.
[2022-05-18 00:00:09] [INFO ] Added : 0 causal constraints over 0 iterations in 278 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 110 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 99 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 00:00:12] [INFO ] Computed 39 place invariants in 38 ms
[2022-05-18 00:00:12] [INFO ] Implicit Places using invariants in 363 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 00:00:12] [INFO ] Computed 39 place invariants in 37 ms
[2022-05-18 00:00:13] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2022-05-18 00:00:19] [INFO ] Implicit Places using invariants and state equation in 6175 ms returned []
Implicit Place search using SMT with State Equation took 6539 ms to find 0 implicit places.
[2022-05-18 00:00:19] [INFO ] Redundant transitions in 57 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2022-05-18 00:00:19] [INFO ] Computed 39 place invariants in 36 ms
[2022-05-18 00:00:19] [INFO ] Dead Transitions using invariants and state equation in 624 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-07 in 34266 ms.
[2022-05-18 00:00:20] [INFO ] Flatten gal took : 245 ms
[2022-05-18 00:00:20] [INFO ] Applying decomposition
[2022-05-18 00:00:20] [INFO ] Flatten gal took : 136 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12314123165645171112.txt, -o, /tmp/graph12314123165645171112.bin, -w, /tmp/graph12314123165645171112.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12314123165645171112.bin, -l, -1, -v, -w, /tmp/graph12314123165645171112.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-18 00:00:20] [INFO ] Decomposing Gal with order
[2022-05-18 00:00:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 00:00:21] [INFO ] Removed a total of 2750 redundant transitions.
[2022-05-18 00:00:21] [INFO ] Flatten gal took : 1072 ms
[2022-05-18 00:00:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 25 ms.
[2022-05-18 00:00:22] [INFO ] Time to serialize gal into /tmp/UpperBounds3399259537380070979.gal : 26 ms
[2022-05-18 00:00:22] [INFO ] Time to serialize properties into /tmp/UpperBounds9273411157061109891.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds3399259537380070979.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds9273411157061109891.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds3399259537380070979.gal -t CGAL -reachable-file /tmp/UpperBounds9273411157061109891.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds9273411157061109891.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,199051,120.259,2074968,2,181698,5,2.44736e+06,6,0,2588,708806,0
Total reachable state count : 199051

Verifying 8 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-PT-10-UpperBounds-00 :0 <= gi6.gu8.HasLeft_6+gu17.HasLeft_1+gi4.gu0.HasLeft_8+gi7.gu15.HasLeft_9+gi3.gu4.HasLeft_3+gi5.gu11.HasLeft_10+gi2.gu16.HasLeft_2+gi0.gu9.HasLeft_5+gi1.gu2.HasLeft_4+gi8.gu5.HasLeft_7 <= 2
FORMULA PhilosophersDyn-PT-10-UpperBounds-00 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-PT-10-UpperBounds-00,0,120.508,2074968,1,0,7,2.44736e+06,9,1,3110,708806,4
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-PT-10-UpperBounds-01 :0 <= gi7.gu15.Think_9+gi4.gu0.Think_8+gu17.Think_1+gi2.gu16.Think_2+gi3.gu4.Think_3+gi8.gu5.Think_7+gi6.gu8.Think_6+gi1.gu2.Think_4+gi0.gu9.Think_5+gi5.gu11.Think_10 <= 4
FORMULA PhilosophersDyn-PT-10-UpperBounds-01 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-PT-10-UpperBounds-01,0,120.755,2074968,1,0,8,2.44736e+06,10,1,3434,708806,5
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-PT-10-UpperBounds-02 :0 <= gi7.gu15.Think_9+gi4.gu0.Think_8+gu17.Think_1+gi2.gu16.Think_2+gi3.gu4.Think_3+gi8.gu5.Think_7+gi6.gu8.Think_6+gi1.gu2.Think_4+gi0.gu9.Think_5+gi5.gu11.Think_10 <= 4
FORMULA PhilosophersDyn-PT-10-UpperBounds-02 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-PT-10-UpperBounds-02,0,120.756,2074968,1,0,8,2.44736e+06,10,1,3434,708806,5
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-PT-10-UpperBounds-03 :0 <= gi3.gu4.Neighbourhood_7_3+gi5.gu11.Neighbourhood_2_10+gu17.Neighbourhood_9_1+gi4.gu0.Neighbourhood_3_8+gi2.gu16.Neighbourhood_8_2+gi0.gu9.Neighbourhood_5_5+gi7.gu15.Neighbourhood_8_9+gi1.gu2.Neighbourhood_3_4+gi8.gu5.Neighbourhood_7_7+gi6.gu8.Neighbourhood_3_6+gi4.gu0.Neighbourhood_4_8+gi5.gu11.Neighbourhood_5_10+gu17.Neighbourhood_5_1+gi0.gu9.Neighbourhood_6_5+gi7.gu15.Neighbourhood_1_9+gi8.gu5.Neighbourhood_1_7+gi3.gu4.Neighbourhood_6_3+gi2.gu16.Neighbourhood_9_2+gi2.gu16.Neighbourhood_2_2+gi1.gu2.Neighbourhood_10_4+gi0.gu9.Neighbourhood_7_5+gi2.gu16.Neighbourhood_1_2+gi4.gu0.Neighbourhood_5_8+gu17.Neighbourhood_6_1+gi7.gu15.Neighbourhood_9_9+gi8.gu5.Neighbourhood_2_7+gi8.gu5.Neighbourhood_6_7+gi2.gu16.Neighbourhood_10_2+gi1.gu2.Neighbourhood_4_4+gi6.gu8.Neighbourhood_2_6+gi3.gu4.Neighbourhood_5_3+gi5.gu11.Neighbourhood_4_10+gu17.Neighbourhood_3_1+gi1.gu2.Neighbourhood_9_4+gi8.gu5.Neighbourhood_9_7+gi0.gu9.Neighbourhood_8_5+gi3.gu4.Neighbourhood_4_3+gi4.gu0.Neighbourhood_6_8+gi6.gu8.Neighbourhood_9_6+gi4.gu0.Neighbourhood_10_8+gi6.gu8.Neighbourhood_1_6+gi4.gu0.Neighbourhood_9_8+gi1.gu2.Neighbourhood_1_4+gi7.gu15.Neighbourhood_6_9+gi5.gu11.Neighbourhood_7_10+gi8.gu5.Neighbourhood_8_7+gi4.gu0.Neighbourhood_7_8+gu17.Neighbourhood_4_1+gi5.gu11.Neighbourhood_6_10+gi2.gu16.Neighbourhood_4_2+gi3.gu4.Neighbourhood_3_3+gi0.gu9.Neighbourhood_1_5+gi1.gu2.Neighbourhood_2_4+gi4.gu0.Neighbourhood_8_8+gi7.gu15.Neighbourhood_7_9+gi6.gu8.Neighbourhood_10_6+gi0.gu9.Neighbourhood_10_5+gi2.gu16.Neighbourhood_3_2+gi3.gu4.Neighbourhood_9_3+gi8.gu5.Neighbourhood_4_7+gi1.gu2.Neighbourhood_6_4+gi3.gu4.Neighbourhood_2_3+gi2.gu16.Neighbourhood_5_2+gi6.gu8.Neighbourhood_6_6+gu17.Neighbourhood_8_1+gi3.gu4.Neighbourhood_10_3+gi0.gu9.Neighbourhood_2_5+gu17.Neighbourhood_1_1+gi8.gu5.Neighbourhood_10_7+gi3.gu4.Neighbourhood_1_3+gi0.gu9.Neighbourhood_9_5+gu17.Neighbourhood_7_1+gi8.gu5.Neighbourhood_3_7+gi6.gu8.Neighbourhood_8_6+gi2.gu16.Neighbourhood_6_2+gi1.gu2.Neighbourhood_5_4+gi5.gu11.Neighbourhood_8_10+gi7.gu15.Neighbourhood_5_9+gi5.gu11.Neighbourhood_9_10+gi7.gu15.Neighbourhood_4_9+gi6.gu8.Neighbourhood_7_6+gu17.Neighbourhood_2_1+gi4.gu0.Neighbourhood_1_8+gi0.gu9.Neighbourhood_3_5+gi7.gu15.Neighbourhood_10_9+gi7.gu15.Neighbourhood_3_9+gi1.gu2.Neighbourhood_8_4+gi6.gu8.Neighbourhood_5_6+gu17.Neighbourhood_10_1+gi2.gu16.Neighbourhood_7_2+gi0.gu9.Neighbourhood_4_5+gi4.gu0.Neighbourhood_2_8+gi5.gu11.Neighbourhood_10_10+gi6.gu8.Neighbourhood_4_6+gi1.gu2.Neighbourhood_7_4+gi3.gu4.Neighbourhood_8_3+gi5.gu11.Neighbourhood_1_10+gi7.gu15.Neighbourhood_2_9+gi8.gu5.Neighbourhood_5_7+gi5.gu11.Neighbourhood_3_10 <= 4
FORMULA PhilosophersDyn-PT-10-UpperBounds-03 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-PT-10-UpperBounds-03,0,121.056,2074968,1,0,9,2.44736e+06,11,1,3870,708806,6
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-PT-10-UpperBounds-04 :0 <= gi3.gu4.Neighbourhood_7_3+gi5.gu11.Neighbourhood_2_10+gu17.Neighbourhood_9_1+gi4.gu0.Neighbourhood_3_8+gi2.gu16.Neighbourhood_8_2+gi0.gu9.Neighbourhood_5_5+gi7.gu15.Neighbourhood_8_9+gi1.gu2.Neighbourhood_3_4+gi8.gu5.Neighbourhood_7_7+gi6.gu8.Neighbourhood_3_6+gi4.gu0.Neighbourhood_4_8+gi5.gu11.Neighbourhood_5_10+gu17.Neighbourhood_5_1+gi0.gu9.Neighbourhood_6_5+gi7.gu15.Neighbourhood_1_9+gi8.gu5.Neighbourhood_1_7+gi3.gu4.Neighbourhood_6_3+gi2.gu16.Neighbourhood_9_2+gi2.gu16.Neighbourhood_2_2+gi1.gu2.Neighbourhood_10_4+gi0.gu9.Neighbourhood_7_5+gi2.gu16.Neighbourhood_1_2+gi4.gu0.Neighbourhood_5_8+gu17.Neighbourhood_6_1+gi7.gu15.Neighbourhood_9_9+gi8.gu5.Neighbourhood_2_7+gi8.gu5.Neighbourhood_6_7+gi2.gu16.Neighbourhood_10_2+gi1.gu2.Neighbourhood_4_4+gi6.gu8.Neighbourhood_2_6+gi3.gu4.Neighbourhood_5_3+gi5.gu11.Neighbourhood_4_10+gu17.Neighbourhood_3_1+gi1.gu2.Neighbourhood_9_4+gi8.gu5.Neighbourhood_9_7+gi0.gu9.Neighbourhood_8_5+gi3.gu4.Neighbourhood_4_3+gi4.gu0.Neighbourhood_6_8+gi6.gu8.Neighbourhood_9_6+gi4.gu0.Neighbourhood_10_8+gi6.gu8.Neighbourhood_1_6+gi4.gu0.Neighbourhood_9_8+gi1.gu2.Neighbourhood_1_4+gi7.gu15.Neighbourhood_6_9+gi5.gu11.Neighbourhood_7_10+gi8.gu5.Neighbourhood_8_7+gi4.gu0.Neighbourhood_7_8+gu17.Neighbourhood_4_1+gi5.gu11.Neighbourhood_6_10+gi2.gu16.Neighbourhood_4_2+gi3.gu4.Neighbourhood_3_3+gi0.gu9.Neighbourhood_1_5+gi1.gu2.Neighbourhood_2_4+gi4.gu0.Neighbourhood_8_8+gi7.gu15.Neighbourhood_7_9+gi6.gu8.Neighbourhood_10_6+gi0.gu9.Neighbourhood_10_5+gi2.gu16.Neighbourhood_3_2+gi3.gu4.Neighbourhood_9_3+gi8.gu5.Neighbourhood_4_7+gi1.gu2.Neighbourhood_6_4+gi3.gu4.Neighbourhood_2_3+gi2.gu16.Neighbourhood_5_2+gi6.gu8.Neighbourhood_6_6+gu17.Neighbourhood_8_1+gi3.gu4.Neighbourhood_10_3+gi0.gu9.Neighbourhood_2_5+gu17.Neighbourhood_1_1+gi8.gu5.Neighbourhood_10_7+gi3.gu4.Neighbourhood_1_3+gi0.gu9.Neighbourhood_9_5+gu17.Neighbourhood_7_1+gi8.gu5.Neighbourhood_3_7+gi6.gu8.Neighbourhood_8_6+gi2.gu16.Neighbourhood_6_2+gi1.gu2.Neighbourhood_5_4+gi5.gu11.Neighbourhood_8_10+gi7.gu15.Neighbourhood_5_9+gi5.gu11.Neighbourhood_9_10+gi7.gu15.Neighbourhood_4_9+gi6.gu8.Neighbourhood_7_6+gu17.Neighbourhood_2_1+gi4.gu0.Neighbourhood_1_8+gi0.gu9.Neighbourhood_3_5+gi7.gu15.Neighbourhood_10_9+gi7.gu15.Neighbourhood_3_9+gi1.gu2.Neighbourhood_8_4+gi6.gu8.Neighbourhood_5_6+gu17.Neighbourhood_10_1+gi2.gu16.Neighbourhood_7_2+gi0.gu9.Neighbourhood_4_5+gi4.gu0.Neighbourhood_2_8+gi5.gu11.Neighbourhood_10_10+gi6.gu8.Neighbourhood_4_6+gi1.gu2.Neighbourhood_7_4+gi3.gu4.Neighbourhood_8_3+gi5.gu11.Neighbourhood_1_10+gi7.gu15.Neighbourhood_2_9+gi8.gu5.Neighbourhood_5_7+gi5.gu11.Neighbourhood_3_10 <= 4
FORMULA PhilosophersDyn-PT-10-UpperBounds-04 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-PT-10-UpperBounds-04,0,121.072,2074968,1,0,9,2.44736e+06,11,1,3870,708806,6
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-PT-10-UpperBounds-05 :0 <= gi5.gu11.Forks_10+gi4.gu0.Forks_8+gu17.Forks_1+gi8.gu5.Forks_7+gi6.gu8.Forks_6+gi0.gu9.Forks_5+gi1.gu2.Forks_4+gi3.gu4.Forks_3+gi7.gu15.Forks_9+gi2.gu16.Forks_2 <= 2
FORMULA PhilosophersDyn-PT-10-UpperBounds-05 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-PT-10-UpperBounds-05,0,121.309,2074968,1,0,10,2.44736e+06,12,1,4221,708806,7
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-PT-10-UpperBounds-06 :0 <= gi7.gu15.Think_9+gi4.gu0.Think_8+gu17.Think_1+gi2.gu16.Think_2+gi3.gu4.Think_3+gi8.gu5.Think_7+gi6.gu8.Think_6+gi1.gu2.Think_4+gi0.gu9.Think_5+gi5.gu11.Think_10 <= 4
FORMULA PhilosophersDyn-PT-10-UpperBounds-06 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-PT-10-UpperBounds-06,0,121.31,2074968,1,0,10,2.44736e+06,12,1,4221,708806,7
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-PT-10-UpperBounds-07 :0 <= gi6.gu8.HasLeft_6+gu17.HasLeft_1+gi4.gu0.HasLeft_8+gi7.gu15.HasLeft_9+gi3.gu4.HasLeft_3+gi5.gu11.HasLeft_10+gi2.gu16.HasLeft_2+gi0.gu9.HasLeft_5+gi1.gu2.HasLeft_4+gi8.gu5.HasLeft_7 <= 2
FORMULA PhilosophersDyn-PT-10-UpperBounds-07 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-PT-10-UpperBounds-07,0,121.311,2074968,1,0,10,2.44736e+06,12,1,4221,708806,7

BK_STOP 1652832145048

--------------------
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="PhilosophersDyn-PT-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is PhilosophersDyn-PT-10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-165277026900157"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-10.tgz
mv PhilosophersDyn-PT-10 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 ;