About the Execution of Smart+red for EisenbergMcGuire-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12986.243 | 3600000.00 | 3656272.00 | 8506.30 | 1 ? 1 ? 1 1 1 1 1 1 1 1 ? 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r523-tall-167987247800277.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is EisenbergMcGuire-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r523-tall-167987247800277
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 15K Mar 23 15:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Mar 23 15:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 3.1M Mar 31 16:48 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 EisenbergMcGuire-PT-10-UpperBounds-00
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-01
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-02
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-03
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-04
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-05
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-06
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-07
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-08
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-09
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-10
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-11
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-12
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-13
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-14
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1680818663022
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-10
Applying reductions before tool smart
Invoking reducer
Running Version 202304061127
[2023-04-06 22:04:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-04-06 22:04:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 22:04:25] [INFO ] Load time of PNML (sax parser for PT used): 231 ms
[2023-04-06 22:04:25] [INFO ] Transformed 1090 places.
[2023-04-06 22:04:25] [INFO ] Transformed 5200 transitions.
[2023-04-06 22:04:25] [INFO ] Found NUPN structural information;
[2023-04-06 22:04:25] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 433 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Normalized transition count is 2330 out of 5200 initially.
// Phase 1: matrix 2330 rows 1090 cols
[2023-04-06 22:04:25] [INFO ] Computed 31 invariants in 48 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 16) seen :10
FORMULA EisenbergMcGuire-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :0
[2023-04-06 22:04:25] [INFO ] Flow matrix only has 2330 transitions (discarded 2870 similar events)
// Phase 1: matrix 2330 rows 1090 cols
[2023-04-06 22:04:25] [INFO ] Computed 31 invariants in 19 ms
[2023-04-06 22:04:25] [INFO ] [Real]Absence check using 21 positive place invariants in 43 ms returned sat
[2023-04-06 22:04:26] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 8 ms returned sat
[2023-04-06 22:04:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:04:26] [INFO ] [Real]Absence check using state equation in 640 ms returned sat
[2023-04-06 22:04:26] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:04:26] [INFO ] [Nat]Absence check using 21 positive place invariants in 22 ms returned sat
[2023-04-06 22:04:26] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-06 22:04:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:04:27] [INFO ] [Nat]Absence check using state equation in 533 ms returned sat
[2023-04-06 22:04:27] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-06 22:04:27] [INFO ] [Nat]Added 1246 Read/Feed constraints in 183 ms returned sat
[2023-04-06 22:04:28] [INFO ] Deduced a trap composed of 3 places in 532 ms of which 5 ms to minimize.
[2023-04-06 22:04:28] [INFO ] Deduced a trap composed of 39 places in 537 ms of which 2 ms to minimize.
[2023-04-06 22:04:29] [INFO ] Deduced a trap composed of 80 places in 466 ms of which 1 ms to minimize.
[2023-04-06 22:04:30] [INFO ] Deduced a trap composed of 3 places in 591 ms of which 1 ms to minimize.
[2023-04-06 22:04:30] [INFO ] Deduced a trap composed of 3 places in 449 ms of which 1 ms to minimize.
[2023-04-06 22:04:31] [INFO ] Deduced a trap composed of 6 places in 369 ms of which 1 ms to minimize.
[2023-04-06 22:04:31] [INFO ] Deduced a trap composed of 70 places in 452 ms of which 1 ms to minimize.
[2023-04-06 22:04:32] [INFO ] Deduced a trap composed of 3 places in 417 ms of which 1 ms to minimize.
[2023-04-06 22:04:32] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-06 22:04:32] [INFO ] [Real]Absence check using 21 positive place invariants in 22 ms returned sat
[2023-04-06 22:04:32] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-06 22:04:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:04:32] [INFO ] [Real]Absence check using state equation in 559 ms returned sat
[2023-04-06 22:04:32] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:04:33] [INFO ] [Nat]Absence check using 21 positive place invariants in 24 ms returned sat
[2023-04-06 22:04:33] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-06 22:04:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:04:33] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2023-04-06 22:04:34] [INFO ] [Nat]Added 1246 Read/Feed constraints in 190 ms returned sat
[2023-04-06 22:04:34] [INFO ] Deduced a trap composed of 3 places in 662 ms of which 2 ms to minimize.
[2023-04-06 22:04:35] [INFO ] Deduced a trap composed of 324 places in 648 ms of which 0 ms to minimize.
[2023-04-06 22:04:36] [INFO ] Deduced a trap composed of 88 places in 636 ms of which 1 ms to minimize.
[2023-04-06 22:04:36] [INFO ] Deduced a trap composed of 29 places in 516 ms of which 1 ms to minimize.
[2023-04-06 22:04:37] [INFO ] Deduced a trap composed of 6 places in 482 ms of which 1 ms to minimize.
[2023-04-06 22:04:37] [INFO ] Deduced a trap composed of 35 places in 491 ms of which 1 ms to minimize.
[2023-04-06 22:04:38] [INFO ] Deduced a trap composed of 3 places in 737 ms of which 1 ms to minimize.
[2023-04-06 22:04:38] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-06 22:04:38] [INFO ] [Real]Absence check using 21 positive place invariants in 23 ms returned sat
[2023-04-06 22:04:38] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 7 ms returned sat
[2023-04-06 22:04:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:04:39] [INFO ] [Real]Absence check using state equation in 582 ms returned sat
[2023-04-06 22:04:39] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:04:39] [INFO ] [Nat]Absence check using 21 positive place invariants in 23 ms returned sat
[2023-04-06 22:04:39] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-06 22:04:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:04:40] [INFO ] [Nat]Absence check using state equation in 602 ms returned sat
[2023-04-06 22:04:40] [INFO ] [Nat]Added 1246 Read/Feed constraints in 219 ms returned sat
[2023-04-06 22:04:41] [INFO ] Deduced a trap composed of 3 places in 471 ms of which 1 ms to minimize.
[2023-04-06 22:04:41] [INFO ] Deduced a trap composed of 50 places in 458 ms of which 1 ms to minimize.
[2023-04-06 22:04:42] [INFO ] Deduced a trap composed of 35 places in 452 ms of which 0 ms to minimize.
[2023-04-06 22:04:42] [INFO ] Deduced a trap composed of 3 places in 470 ms of which 2 ms to minimize.
[2023-04-06 22:04:43] [INFO ] Deduced a trap composed of 3 places in 471 ms of which 1 ms to minimize.
[2023-04-06 22:04:43] [INFO ] Deduced a trap composed of 41 places in 415 ms of which 1 ms to minimize.
[2023-04-06 22:04:44] [INFO ] Deduced a trap composed of 54 places in 351 ms of which 1 ms to minimize.
[2023-04-06 22:04:44] [INFO ] Deduced a trap composed of 44 places in 280 ms of which 0 ms to minimize.
[2023-04-06 22:04:44] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-06 22:04:44] [INFO ] [Real]Absence check using 21 positive place invariants in 25 ms returned sat
[2023-04-06 22:04:44] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-06 22:04:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:04:45] [INFO ] [Real]Absence check using state equation in 566 ms returned sat
[2023-04-06 22:04:45] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:04:45] [INFO ] [Nat]Absence check using 21 positive place invariants in 23 ms returned sat
[2023-04-06 22:04:45] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 14 ms returned sat
[2023-04-06 22:04:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:04:46] [INFO ] [Nat]Absence check using state equation in 548 ms returned sat
[2023-04-06 22:04:46] [INFO ] [Nat]Added 1246 Read/Feed constraints in 193 ms returned sat
[2023-04-06 22:04:47] [INFO ] Deduced a trap composed of 3 places in 503 ms of which 1 ms to minimize.
[2023-04-06 22:04:47] [INFO ] Deduced a trap composed of 64 places in 484 ms of which 1 ms to minimize.
[2023-04-06 22:04:48] [INFO ] Deduced a trap composed of 4 places in 483 ms of which 0 ms to minimize.
[2023-04-06 22:04:48] [INFO ] Deduced a trap composed of 3 places in 484 ms of which 1 ms to minimize.
[2023-04-06 22:04:49] [INFO ] Deduced a trap composed of 50 places in 423 ms of which 0 ms to minimize.
[2023-04-06 22:04:49] [INFO ] Deduced a trap composed of 3 places in 405 ms of which 0 ms to minimize.
[2023-04-06 22:04:50] [INFO ] Deduced a trap composed of 41 places in 444 ms of which 1 ms to minimize.
[2023-04-06 22:04:50] [INFO ] Deduced a trap composed of 46 places in 404 ms of which 0 ms to minimize.
[2023-04-06 22:04:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-06 22:04:51] [INFO ] [Real]Absence check using 21 positive place invariants in 21 ms returned sat
[2023-04-06 22:04:51] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:04:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:04:51] [INFO ] [Real]Absence check using state equation in 517 ms returned sat
[2023-04-06 22:04:51] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:04:51] [INFO ] [Nat]Absence check using 21 positive place invariants in 23 ms returned sat
[2023-04-06 22:04:51] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:04:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:04:52] [INFO ] [Nat]Absence check using state equation in 491 ms returned sat
[2023-04-06 22:04:52] [INFO ] [Nat]Added 1246 Read/Feed constraints in 148 ms returned sat
[2023-04-06 22:04:53] [INFO ] Deduced a trap composed of 3 places in 471 ms of which 1 ms to minimize.
[2023-04-06 22:04:53] [INFO ] Deduced a trap composed of 3 places in 471 ms of which 1 ms to minimize.
[2023-04-06 22:04:54] [INFO ] Deduced a trap composed of 45 places in 473 ms of which 0 ms to minimize.
[2023-04-06 22:04:54] [INFO ] Deduced a trap composed of 47 places in 476 ms of which 2 ms to minimize.
[2023-04-06 22:04:55] [INFO ] Deduced a trap composed of 3 places in 487 ms of which 0 ms to minimize.
[2023-04-06 22:04:55] [INFO ] Deduced a trap composed of 3 places in 497 ms of which 1 ms to minimize.
[2023-04-06 22:04:56] [INFO ] Deduced a trap composed of 3 places in 484 ms of which 1 ms to minimize.
[2023-04-06 22:04:56] [INFO ] Deduced a trap composed of 35 places in 412 ms of which 0 ms to minimize.
[2023-04-06 22:04:56] [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 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-06 22:04:57] [INFO ] [Real]Absence check using 21 positive place invariants in 20 ms returned sat
[2023-04-06 22:04:57] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-06 22:04:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:04:57] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
[2023-04-06 22:04:57] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:04:57] [INFO ] [Nat]Absence check using 21 positive place invariants in 22 ms returned sat
[2023-04-06 22:04:57] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 15 ms returned sat
[2023-04-06 22:04:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:04:58] [INFO ] [Nat]Absence check using state equation in 509 ms returned sat
[2023-04-06 22:04:58] [INFO ] [Nat]Added 1246 Read/Feed constraints in 188 ms returned sat
[2023-04-06 22:04:58] [INFO ] Deduced a trap composed of 3 places in 474 ms of which 2 ms to minimize.
[2023-04-06 22:04:59] [INFO ] Deduced a trap composed of 3 places in 520 ms of which 0 ms to minimize.
[2023-04-06 22:05:00] [INFO ] Deduced a trap composed of 51 places in 506 ms of which 1 ms to minimize.
[2023-04-06 22:05:00] [INFO ] Deduced a trap composed of 45 places in 503 ms of which 1 ms to minimize.
[2023-04-06 22:05:01] [INFO ] Deduced a trap composed of 3 places in 509 ms of which 0 ms to minimize.
[2023-04-06 22:05:01] [INFO ] Deduced a trap composed of 82 places in 438 ms of which 1 ms to minimize.
[2023-04-06 22:05:02] [INFO ] Deduced a trap composed of 41 places in 374 ms of which 1 ms to minimize.
[2023-04-06 22:05:02] [INFO ] Deduced a trap composed of 44 places in 354 ms of which 1 ms to minimize.
[2023-04-06 22:05:02] [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 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1090 transition count 5190
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 1080 transition count 5190
Performed 308 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 308 Pre rules applied. Total rules applied 20 place count 1080 transition count 4882
Deduced a syphon composed of 308 places in 7 ms
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 2 with 616 rules applied. Total rules applied 636 place count 772 transition count 4882
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 726 place count 682 transition count 3982
Iterating global reduction 2 with 90 rules applied. Total rules applied 816 place count 682 transition count 3982
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 9 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 994 place count 593 transition count 3893
Applied a total of 994 rules in 648 ms. Remains 593 /1090 variables (removed 497) and now considering 3893/5200 (removed 1307) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 649 ms. Remains : 593/1090 places, 3893/5200 transitions.
Normalized transition count is 1023 out of 3893 initially.
// Phase 1: matrix 1023 rows 593 cols
[2023-04-06 22:05:03] [INFO ] Computed 31 invariants in 12 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3629 ms. (steps per millisecond=275 ) properties (out of 6) seen :1
FORMULA EisenbergMcGuire-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 674 ms. (steps per millisecond=1483 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 648 ms. (steps per millisecond=1543 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 649 ms. (steps per millisecond=1540 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 649 ms. (steps per millisecond=1540 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 650 ms. (steps per millisecond=1538 ) properties (out of 5) seen :0
[2023-04-06 22:05:10] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
// Phase 1: matrix 1023 rows 593 cols
[2023-04-06 22:05:10] [INFO ] Computed 31 invariants in 3 ms
[2023-04-06 22:05:10] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:05:10] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:05:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:05:10] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2023-04-06 22:05:10] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:05:10] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:05:10] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:05:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:05:11] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2023-04-06 22:05:11] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:05:11] [INFO ] [Nat]Added 436 Read/Feed constraints in 61 ms returned sat
[2023-04-06 22:05:11] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 0 ms to minimize.
[2023-04-06 22:05:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2023-04-06 22:05:11] [INFO ] Computed and/alt/rep : 873/1973/603 causal constraints (skipped 410 transitions) in 197 ms.
[2023-04-06 22:05:12] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2023-04-06 22:05:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2023-04-06 22:05:12] [INFO ] Added : 102 causal constraints over 21 iterations in 1556 ms. Result :sat
Minimization took 126 ms.
[2023-04-06 22:05:13] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:05:13] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:05:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:05:13] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2023-04-06 22:05:13] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:05:13] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:05:13] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:05:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:05:13] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2023-04-06 22:05:13] [INFO ] [Nat]Added 436 Read/Feed constraints in 55 ms returned sat
[2023-04-06 22:05:13] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2023-04-06 22:05:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2023-04-06 22:05:13] [INFO ] Computed and/alt/rep : 873/1973/603 causal constraints (skipped 410 transitions) in 93 ms.
[2023-04-06 22:05:14] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2023-04-06 22:05:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-04-06 22:05:14] [INFO ] Added : 44 causal constraints over 9 iterations in 739 ms. Result :sat
Minimization took 107 ms.
[2023-04-06 22:05:14] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:05:14] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:05:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:05:15] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2023-04-06 22:05:15] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:05:15] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:05:15] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-06 22:05:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:05:15] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2023-04-06 22:05:15] [INFO ] [Nat]Added 436 Read/Feed constraints in 64 ms returned sat
[2023-04-06 22:05:15] [INFO ] Computed and/alt/rep : 873/1973/603 causal constraints (skipped 410 transitions) in 93 ms.
[2023-04-06 22:05:15] [INFO ] Added : 28 causal constraints over 6 iterations in 444 ms. Result :sat
Minimization took 106 ms.
[2023-04-06 22:05:16] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:05:16] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:05:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:05:16] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2023-04-06 22:05:16] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:05:16] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:05:16] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:05:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:05:16] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2023-04-06 22:05:16] [INFO ] [Nat]Added 436 Read/Feed constraints in 76 ms returned sat
[2023-04-06 22:05:16] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 0 ms to minimize.
[2023-04-06 22:05:17] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2023-04-06 22:05:17] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-06 22:05:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 386 ms
[2023-04-06 22:05:17] [INFO ] Computed and/alt/rep : 873/1973/603 causal constraints (skipped 410 transitions) in 94 ms.
[2023-04-06 22:05:18] [INFO ] Added : 100 causal constraints over 20 iterations in 1138 ms. Result :sat
Minimization took 116 ms.
[2023-04-06 22:05:18] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:05:18] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:05:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:05:18] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2023-04-06 22:05:18] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:05:18] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-04-06 22:05:18] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-06 22:05:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:05:19] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2023-04-06 22:05:19] [INFO ] [Nat]Added 436 Read/Feed constraints in 53 ms returned sat
[2023-04-06 22:05:19] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2023-04-06 22:05:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-04-06 22:05:19] [INFO ] Computed and/alt/rep : 873/1973/603 causal constraints (skipped 410 transitions) in 91 ms.
[2023-04-06 22:05:20] [INFO ] Added : 69 causal constraints over 14 iterations in 808 ms. Result :sat
Minimization took 112 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA EisenbergMcGuire-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 3893/3893 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 592 transition count 3892
Applied a total of 2 rules in 181 ms. Remains 592 /593 variables (removed 1) and now considering 3892/3893 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 592/593 places, 3892/3893 transitions.
Normalized transition count is 1022 out of 3892 initially.
// Phase 1: matrix 1022 rows 592 cols
[2023-04-06 22:05:21] [INFO ] Computed 31 invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3406 ms. (steps per millisecond=293 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 656 ms. (steps per millisecond=1524 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 649 ms. (steps per millisecond=1540 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 666 ms. (steps per millisecond=1501 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 699 ms. (steps per millisecond=1430 ) properties (out of 4) seen :0
[2023-04-06 22:05:27] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
// Phase 1: matrix 1022 rows 592 cols
[2023-04-06 22:05:27] [INFO ] Computed 31 invariants in 12 ms
[2023-04-06 22:05:27] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:05:27] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 10 ms returned sat
[2023-04-06 22:05:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:05:28] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2023-04-06 22:05:28] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:05:28] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-04-06 22:05:28] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:05:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:05:28] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2023-04-06 22:05:28] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:05:28] [INFO ] [Nat]Added 436 Read/Feed constraints in 65 ms returned sat
[2023-04-06 22:05:28] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 0 ms to minimize.
[2023-04-06 22:05:28] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 4 ms to minimize.
[2023-04-06 22:05:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 319 ms
[2023-04-06 22:05:28] [INFO ] Computed and/alt/rep : 872/1972/602 causal constraints (skipped 410 transitions) in 95 ms.
[2023-04-06 22:05:29] [INFO ] Added : 42 causal constraints over 9 iterations in 581 ms. Result :sat
Minimization took 118 ms.
[2023-04-06 22:05:29] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-06 22:05:29] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:05:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:05:29] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2023-04-06 22:05:29] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:05:30] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:05:30] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:05:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:05:30] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2023-04-06 22:05:30] [INFO ] [Nat]Added 436 Read/Feed constraints in 52 ms returned sat
[2023-04-06 22:05:30] [INFO ] Computed and/alt/rep : 872/1972/602 causal constraints (skipped 410 transitions) in 92 ms.
[2023-04-06 22:05:31] [INFO ] Added : 82 causal constraints over 17 iterations in 938 ms. Result :sat
Minimization took 113 ms.
[2023-04-06 22:05:31] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-04-06 22:05:31] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:05:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:05:31] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2023-04-06 22:05:31] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:05:31] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:05:31] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:05:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:05:32] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2023-04-06 22:05:32] [INFO ] [Nat]Added 436 Read/Feed constraints in 74 ms returned sat
[2023-04-06 22:05:32] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2023-04-06 22:05:32] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 0 ms to minimize.
[2023-04-06 22:05:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 271 ms
[2023-04-06 22:05:32] [INFO ] Computed and/alt/rep : 872/1972/602 causal constraints (skipped 410 transitions) in 97 ms.
[2023-04-06 22:05:33] [INFO ] Added : 40 causal constraints over 8 iterations in 574 ms. Result :sat
Minimization took 111 ms.
[2023-04-06 22:05:33] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:05:33] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:05:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:05:33] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2023-04-06 22:05:33] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:05:33] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:05:33] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 10 ms returned sat
[2023-04-06 22:05:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:05:33] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2023-04-06 22:05:33] [INFO ] [Nat]Added 436 Read/Feed constraints in 60 ms returned sat
[2023-04-06 22:05:34] [INFO ] Computed and/alt/rep : 872/1972/602 causal constraints (skipped 410 transitions) in 116 ms.
[2023-04-06 22:05:34] [INFO ] Added : 23 causal constraints over 5 iterations in 426 ms. Result :sat
Minimization took 117 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA EisenbergMcGuire-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 3892/3892 transitions.
Applied a total of 0 rules in 149 ms. Remains 592 /592 variables (removed 0) and now considering 3892/3892 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 592/592 places, 3892/3892 transitions.
Normalized transition count is 1022 out of 3892 initially.
// Phase 1: matrix 1022 rows 592 cols
[2023-04-06 22:05:35] [INFO ] Computed 31 invariants in 12 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4088 ms. (steps per millisecond=244 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 736 ms. (steps per millisecond=1358 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 745 ms. (steps per millisecond=1342 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 752 ms. (steps per millisecond=1329 ) properties (out of 3) seen :0
[2023-04-06 22:05:42] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
// Phase 1: matrix 1022 rows 592 cols
[2023-04-06 22:05:42] [INFO ] Computed 31 invariants in 10 ms
[2023-04-06 22:05:42] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-04-06 22:05:42] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:05:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:05:42] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2023-04-06 22:05:42] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:05:42] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-04-06 22:05:42] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:05:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:05:42] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2023-04-06 22:05:42] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:05:42] [INFO ] [Nat]Added 436 Read/Feed constraints in 65 ms returned sat
[2023-04-06 22:05:43] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 0 ms to minimize.
[2023-04-06 22:05:43] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 0 ms to minimize.
[2023-04-06 22:05:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 315 ms
[2023-04-06 22:05:43] [INFO ] Computed and/alt/rep : 872/1972/602 causal constraints (skipped 410 transitions) in 107 ms.
[2023-04-06 22:05:43] [INFO ] Added : 42 causal constraints over 9 iterations in 618 ms. Result :sat
Minimization took 115 ms.
[2023-04-06 22:05:44] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:05:44] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 13 ms returned sat
[2023-04-06 22:05:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:05:44] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2023-04-06 22:05:44] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:05:44] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-04-06 22:05:44] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-06 22:05:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:05:44] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2023-04-06 22:05:44] [INFO ] [Nat]Added 436 Read/Feed constraints in 57 ms returned sat
[2023-04-06 22:05:44] [INFO ] Computed and/alt/rep : 872/1972/602 causal constraints (skipped 410 transitions) in 99 ms.
[2023-04-06 22:05:45] [INFO ] Added : 82 causal constraints over 17 iterations in 965 ms. Result :sat
Minimization took 110 ms.
[2023-04-06 22:05:46] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:05:46] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:05:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:05:46] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2023-04-06 22:05:46] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:05:46] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:05:46] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 12 ms returned sat
[2023-04-06 22:05:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:05:46] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2023-04-06 22:05:46] [INFO ] [Nat]Added 436 Read/Feed constraints in 59 ms returned sat
[2023-04-06 22:05:46] [INFO ] Computed and/alt/rep : 872/1972/602 causal constraints (skipped 410 transitions) in 94 ms.
[2023-04-06 22:05:47] [INFO ] Added : 23 causal constraints over 5 iterations in 407 ms. Result :sat
Minimization took 121 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 3892/3892 transitions.
Applied a total of 0 rules in 137 ms. Remains 592 /592 variables (removed 0) and now considering 3892/3892 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 592/592 places, 3892/3892 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 3892/3892 transitions.
Applied a total of 0 rules in 141 ms. Remains 592 /592 variables (removed 0) and now considering 3892/3892 (removed 0) transitions.
[2023-04-06 22:05:48] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
[2023-04-06 22:05:48] [INFO ] Invariant cache hit.
[2023-04-06 22:05:49] [INFO ] Implicit Places using invariants in 695 ms returned []
[2023-04-06 22:05:49] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
[2023-04-06 22:05:49] [INFO ] Invariant cache hit.
[2023-04-06 22:05:49] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:05:53] [INFO ] Implicit Places using invariants and state equation in 3930 ms returned []
Implicit Place search using SMT with State Equation took 4626 ms to find 0 implicit places.
[2023-04-06 22:05:53] [INFO ] Redundant transitions in 227 ms returned []
[2023-04-06 22:05:53] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
[2023-04-06 22:05:53] [INFO ] Invariant cache hit.
[2023-04-06 22:05:54] [INFO ] Dead Transitions using invariants and state equation in 1372 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6373 ms. Remains : 592/592 places, 3892/3892 transitions.
Starting property specific reduction for EisenbergMcGuire-PT-10-UpperBounds-01
Normalized transition count is 1022 out of 3892 initially.
// Phase 1: matrix 1022 rows 592 cols
[2023-04-06 22:05:54] [INFO ] Computed 31 invariants in 8 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-04-06 22:05:54] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
// Phase 1: matrix 1022 rows 592 cols
[2023-04-06 22:05:54] [INFO ] Computed 31 invariants in 8 ms
[2023-04-06 22:05:54] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:05:54] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:05:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:05:55] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2023-04-06 22:05:55] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:05:55] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-04-06 22:05:55] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:05:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:05:55] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2023-04-06 22:05:55] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:05:55] [INFO ] [Nat]Added 436 Read/Feed constraints in 62 ms returned sat
[2023-04-06 22:05:55] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 0 ms to minimize.
[2023-04-06 22:05:55] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 0 ms to minimize.
[2023-04-06 22:05:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 293 ms
[2023-04-06 22:05:55] [INFO ] Computed and/alt/rep : 872/1972/602 causal constraints (skipped 410 transitions) in 121 ms.
[2023-04-06 22:05:56] [INFO ] Added : 42 causal constraints over 9 iterations in 610 ms. Result :sat
Minimization took 117 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 3892/3892 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 592 transition count 3890
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 590 transition count 3890
Applied a total of 4 rules in 145 ms. Remains 590 /592 variables (removed 2) and now considering 3890/3892 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 590/592 places, 3890/3892 transitions.
Normalized transition count is 1020 out of 3890 initially.
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 22:05:56] [INFO ] Computed 31 invariants in 13 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3538 ms. (steps per millisecond=282 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 669 ms. (steps per millisecond=1494 ) properties (out of 1) seen :0
[2023-04-06 22:06:01] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 22:06:01] [INFO ] Computed 31 invariants in 9 ms
[2023-04-06 22:06:01] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-04-06 22:06:01] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:06:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:06:01] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2023-04-06 22:06:01] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:06:01] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:06:01] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 22:06:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:06:01] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2023-04-06 22:06:01] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:06:01] [INFO ] [Nat]Added 436 Read/Feed constraints in 63 ms returned sat
[2023-04-06 22:06:01] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2023-04-06 22:06:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2023-04-06 22:06:02] [INFO ] Computed and/alt/rep : 870/1970/600 causal constraints (skipped 410 transitions) in 109 ms.
[2023-04-06 22:06:02] [INFO ] Added : 56 causal constraints over 12 iterations in 725 ms. Result :sat
Minimization took 114 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 141 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 134 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 22:06:03] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:06:03] [INFO ] Invariant cache hit.
[2023-04-06 22:06:04] [INFO ] Implicit Places using invariants in 648 ms returned []
[2023-04-06 22:06:04] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:06:04] [INFO ] Invariant cache hit.
[2023-04-06 22:06:04] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:06:07] [INFO ] Implicit Places using invariants and state equation in 3829 ms returned []
Implicit Place search using SMT with State Equation took 4479 ms to find 0 implicit places.
[2023-04-06 22:06:08] [INFO ] Redundant transitions in 220 ms returned []
[2023-04-06 22:06:08] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 22:06:08] [INFO ] Invariant cache hit.
[2023-04-06 22:06:09] [INFO ] Dead Transitions using invariants and state equation in 1316 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6162 ms. Remains : 590/590 places, 3890/3890 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-10-UpperBounds-01 in 14775 ms.
Starting property specific reduction for EisenbergMcGuire-PT-10-UpperBounds-03
Normalized transition count is 1022 out of 3892 initially.
// Phase 1: matrix 1022 rows 592 cols
[2023-04-06 22:06:09] [INFO ] Computed 31 invariants in 5 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-04-06 22:06:09] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
// Phase 1: matrix 1022 rows 592 cols
[2023-04-06 22:06:09] [INFO ] Computed 31 invariants in 4 ms
[2023-04-06 22:06:09] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-06 22:06:09] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:06:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:06:09] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2023-04-06 22:06:09] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:06:09] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:06:09] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:06:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:06:10] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2023-04-06 22:06:10] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:06:10] [INFO ] [Nat]Added 436 Read/Feed constraints in 54 ms returned sat
[2023-04-06 22:06:10] [INFO ] Computed and/alt/rep : 872/1972/602 causal constraints (skipped 410 transitions) in 93 ms.
[2023-04-06 22:06:11] [INFO ] Added : 82 causal constraints over 17 iterations in 933 ms. Result :sat
Minimization took 113 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 3892/3892 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 592 transition count 3891
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 591 transition count 3891
Applied a total of 2 rules in 146 ms. Remains 591 /592 variables (removed 1) and now considering 3891/3892 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 591/592 places, 3891/3892 transitions.
Normalized transition count is 1021 out of 3891 initially.
// Phase 1: matrix 1021 rows 591 cols
[2023-04-06 22:06:11] [INFO ] Computed 31 invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3385 ms. (steps per millisecond=295 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 654 ms. (steps per millisecond=1529 ) properties (out of 1) seen :0
[2023-04-06 22:06:15] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
// Phase 1: matrix 1021 rows 591 cols
[2023-04-06 22:06:15] [INFO ] Computed 31 invariants in 6 ms
[2023-04-06 22:06:15] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2023-04-06 22:06:15] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-06 22:06:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:06:16] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2023-04-06 22:06:16] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:06:16] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:06:16] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-06 22:06:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:06:16] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2023-04-06 22:06:16] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:06:16] [INFO ] [Nat]Added 436 Read/Feed constraints in 59 ms returned sat
[2023-04-06 22:06:16] [INFO ] Computed and/alt/rep : 871/1971/601 causal constraints (skipped 410 transitions) in 98 ms.
[2023-04-06 22:06:17] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 0 ms to minimize.
[2023-04-06 22:06:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2023-04-06 22:06:17] [INFO ] Added : 70 causal constraints over 14 iterations in 1003 ms. Result :sat
Minimization took 128 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 134 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 591/591 places, 3891/3891 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 129 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
[2023-04-06 22:06:18] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-06 22:06:18] [INFO ] Invariant cache hit.
[2023-04-06 22:06:18] [INFO ] Implicit Places using invariants in 608 ms returned []
[2023-04-06 22:06:18] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-06 22:06:18] [INFO ] Invariant cache hit.
[2023-04-06 22:06:19] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:06:22] [INFO ] Implicit Places using invariants and state equation in 3624 ms returned []
Implicit Place search using SMT with State Equation took 4232 ms to find 0 implicit places.
[2023-04-06 22:06:22] [INFO ] Redundant transitions in 120 ms returned []
[2023-04-06 22:06:22] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-06 22:06:22] [INFO ] Invariant cache hit.
[2023-04-06 22:06:23] [INFO ] Dead Transitions using invariants and state equation in 1277 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5764 ms. Remains : 591/591 places, 3891/3891 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-10-UpperBounds-03 in 14477 ms.
Starting property specific reduction for EisenbergMcGuire-PT-10-UpperBounds-12
Normalized transition count is 1022 out of 3892 initially.
// Phase 1: matrix 1022 rows 592 cols
[2023-04-06 22:06:23] [INFO ] Computed 31 invariants in 4 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-04-06 22:06:23] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
// Phase 1: matrix 1022 rows 592 cols
[2023-04-06 22:06:23] [INFO ] Computed 31 invariants in 6 ms
[2023-04-06 22:06:24] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-04-06 22:06:24] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-06 22:06:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:06:24] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2023-04-06 22:06:24] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:06:24] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:06:24] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:06:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:06:24] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2023-04-06 22:06:24] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:06:24] [INFO ] [Nat]Added 436 Read/Feed constraints in 62 ms returned sat
[2023-04-06 22:06:24] [INFO ] Computed and/alt/rep : 872/1972/602 causal constraints (skipped 410 transitions) in 107 ms.
[2023-04-06 22:06:25] [INFO ] Added : 23 causal constraints over 5 iterations in 416 ms. Result :sat
Minimization took 116 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 3892/3892 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 592 transition count 3891
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 591 transition count 3891
Applied a total of 2 rules in 138 ms. Remains 591 /592 variables (removed 1) and now considering 3891/3892 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 591/592 places, 3891/3892 transitions.
Normalized transition count is 1021 out of 3891 initially.
// Phase 1: matrix 1021 rows 591 cols
[2023-04-06 22:06:25] [INFO ] Computed 31 invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3455 ms. (steps per millisecond=289 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 667 ms. (steps per millisecond=1499 ) properties (out of 1) seen :0
[2023-04-06 22:06:29] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
// Phase 1: matrix 1021 rows 591 cols
[2023-04-06 22:06:29] [INFO ] Computed 31 invariants in 6 ms
[2023-04-06 22:06:29] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:06:29] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:06:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 22:06:30] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2023-04-06 22:06:30] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 22:06:30] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 22:06:30] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 22:06:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 22:06:30] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2023-04-06 22:06:30] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:06:30] [INFO ] [Nat]Added 436 Read/Feed constraints in 60 ms returned sat
[2023-04-06 22:06:30] [INFO ] Computed and/alt/rep : 871/1971/601 causal constraints (skipped 410 transitions) in 95 ms.
[2023-04-06 22:06:31] [INFO ] Added : 60 causal constraints over 12 iterations in 705 ms. Result :sat
Minimization took 107 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 133 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 591/591 places, 3891/3891 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 134 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
[2023-04-06 22:06:31] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-06 22:06:31] [INFO ] Invariant cache hit.
[2023-04-06 22:06:32] [INFO ] Implicit Places using invariants in 624 ms returned []
[2023-04-06 22:06:32] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-06 22:06:32] [INFO ] Invariant cache hit.
[2023-04-06 22:06:32] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 22:06:36] [INFO ] Implicit Places using invariants and state equation in 3705 ms returned []
Implicit Place search using SMT with State Equation took 4332 ms to find 0 implicit places.
[2023-04-06 22:06:36] [INFO ] Redundant transitions in 115 ms returned []
[2023-04-06 22:06:36] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-06 22:06:36] [INFO ] Invariant cache hit.
[2023-04-06 22:06:37] [INFO ] Dead Transitions using invariants and state equation in 1333 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5927 ms. Remains : 591/591 places, 3891/3891 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-10-UpperBounds-12 in 13882 ms.
[2023-04-06 22:06:38] [INFO ] Flatten gal took : 289 ms
[2023-04-06 22:06:38] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-04-06 22:06:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 592 places, 3892 transitions and 20984 arcs took 21 ms.
Total runtime 133575 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running EisenbergMcGuire (PT), instance 10
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart
PNML FILE: model.pnml
Petri model created: 592 places, 3892 transitions, 20984 arcs.
Final Score: 135285.506
Took : 61 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 3161872 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16101332 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Caught signal 15, terminating.
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="EisenbergMcGuire-PT-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is EisenbergMcGuire-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 r523-tall-167987247800277"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-10.tgz
mv EisenbergMcGuire-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 '
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 ;