fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r046-smll-165252115900202
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for DES-PT-60b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1563.756 498274.00 537914.00 2135.70 1 1 1 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/mcc2022-input.r046-smll-165252115900202.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is DES-PT-60b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r046-smll-165252115900202
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 7.0K Apr 29 15:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 29 15:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 29 15:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 29 15:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 9 07:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 139K May 10 09:33 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 DES-PT-60b-UpperBounds-00
FORMULA_NAME DES-PT-60b-UpperBounds-01
FORMULA_NAME DES-PT-60b-UpperBounds-02
FORMULA_NAME DES-PT-60b-UpperBounds-03
FORMULA_NAME DES-PT-60b-UpperBounds-04
FORMULA_NAME DES-PT-60b-UpperBounds-05
FORMULA_NAME DES-PT-60b-UpperBounds-06
FORMULA_NAME DES-PT-60b-UpperBounds-07
FORMULA_NAME DES-PT-60b-UpperBounds-08
FORMULA_NAME DES-PT-60b-UpperBounds-09
FORMULA_NAME DES-PT-60b-UpperBounds-10
FORMULA_NAME DES-PT-60b-UpperBounds-11
FORMULA_NAME DES-PT-60b-UpperBounds-12
FORMULA_NAME DES-PT-60b-UpperBounds-13
FORMULA_NAME DES-PT-60b-UpperBounds-14
FORMULA_NAME DES-PT-60b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652527304208

Running Version 0
[2022-05-14 11:21:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-14 11:21:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 11:21:47] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2022-05-14 11:21:47] [INFO ] Transformed 519 places.
[2022-05-14 11:21:47] [INFO ] Transformed 470 transitions.
[2022-05-14 11:21:47] [INFO ] Found NUPN structural information;
[2022-05-14 11:21:47] [INFO ] Parsed PT model containing 519 places and 470 transitions in 294 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
// Phase 1: matrix 470 rows 519 cols
[2022-05-14 11:21:47] [INFO ] Computed 65 place invariants in 92 ms
Incomplete random walk after 10000 steps, including 84 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 16) seen :8
FORMULA DES-PT-60b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
// Phase 1: matrix 470 rows 519 cols
[2022-05-14 11:21:48] [INFO ] Computed 65 place invariants in 48 ms
[2022-05-14 11:21:48] [INFO ] [Real]Absence check using 39 positive place invariants in 47 ms returned sat
[2022-05-14 11:21:48] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 45 ms returned sat
[2022-05-14 11:21:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:21:49] [INFO ] [Real]Absence check using state equation in 491 ms returned sat
[2022-05-14 11:21:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:21:49] [INFO ] [Nat]Absence check using 39 positive place invariants in 59 ms returned sat
[2022-05-14 11:21:51] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 1789 ms returned sat
[2022-05-14 11:21:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:21:52] [INFO ] [Nat]Absence check using state equation in 796 ms returned sat
[2022-05-14 11:21:52] [INFO ] Deduced a trap composed of 42 places in 410 ms of which 8 ms to minimize.
[2022-05-14 11:21:53] [INFO ] Deduced a trap composed of 8 places in 268 ms of which 2 ms to minimize.
[2022-05-14 11:21:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 883 ms
[2022-05-14 11:21:53] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 60 ms.
[2022-05-14 11:21:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-14 11:21:54] [INFO ] [Real]Absence check using 39 positive place invariants in 37 ms returned sat
[2022-05-14 11:21:54] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 41 ms returned sat
[2022-05-14 11:21:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:21:55] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2022-05-14 11:21:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:21:55] [INFO ] [Nat]Absence check using 39 positive place invariants in 37 ms returned sat
[2022-05-14 11:21:57] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 1780 ms returned sat
[2022-05-14 11:21:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:22:00] [INFO ] [Nat]Absence check using state equation in 3064 ms returned unknown
[2022-05-14 11:22:00] [INFO ] [Real]Absence check using 39 positive place invariants in 35 ms returned sat
[2022-05-14 11:22:00] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 42 ms returned sat
[2022-05-14 11:22:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:22:00] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2022-05-14 11:22:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:22:01] [INFO ] [Nat]Absence check using 39 positive place invariants in 42 ms returned sat
[2022-05-14 11:22:01] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 821 ms returned sat
[2022-05-14 11:22:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:22:02] [INFO ] [Nat]Absence check using state equation in 994 ms returned sat
[2022-05-14 11:22:03] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 2 ms to minimize.
[2022-05-14 11:22:03] [INFO ] Deduced a trap composed of 8 places in 233 ms of which 2 ms to minimize.
[2022-05-14 11:22:03] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 2 ms to minimize.
[2022-05-14 11:22:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 713 ms
[2022-05-14 11:22:03] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 63 ms.
[2022-05-14 11:22:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-14 11:22:06] [INFO ] [Real]Absence check using 39 positive place invariants in 37 ms returned sat
[2022-05-14 11:22:06] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 46 ms returned sat
[2022-05-14 11:22:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:22:06] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2022-05-14 11:22:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:22:06] [INFO ] [Nat]Absence check using 39 positive place invariants in 37 ms returned sat
[2022-05-14 11:22:07] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 477 ms returned sat
[2022-05-14 11:22:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:22:08] [INFO ] [Nat]Absence check using state equation in 1038 ms returned sat
[2022-05-14 11:22:08] [INFO ] Deduced a trap composed of 7 places in 279 ms of which 1 ms to minimize.
[2022-05-14 11:22:08] [INFO ] Deduced a trap composed of 31 places in 239 ms of which 1 ms to minimize.
[2022-05-14 11:22:09] [INFO ] Deduced a trap composed of 37 places in 227 ms of which 1 ms to minimize.
[2022-05-14 11:22:09] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 0 ms to minimize.
[2022-05-14 11:22:09] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 1 ms to minimize.
[2022-05-14 11:22:09] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 0 ms to minimize.
[2022-05-14 11:22:10] [INFO ] Deduced a trap composed of 14 places in 206 ms of which 1 ms to minimize.
[2022-05-14 11:22:10] [INFO ] Deduced a trap composed of 13 places in 276 ms of which 1 ms to minimize.
[2022-05-14 11:22:10] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2029 ms
[2022-05-14 11:22:10] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 53 ms.
[2022-05-14 11:22:11] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-14 11:22:11] [INFO ] [Real]Absence check using 39 positive place invariants in 25 ms returned sat
[2022-05-14 11:22:11] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 33 ms returned sat
[2022-05-14 11:22:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:22:12] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2022-05-14 11:22:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:22:12] [INFO ] [Nat]Absence check using 39 positive place invariants in 38 ms returned sat
[2022-05-14 11:22:12] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 49 ms returned sat
[2022-05-14 11:22:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:22:13] [INFO ] [Nat]Absence check using state equation in 1085 ms returned sat
[2022-05-14 11:22:13] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 1 ms to minimize.
[2022-05-14 11:22:14] [INFO ] Deduced a trap composed of 15 places in 313 ms of which 1 ms to minimize.
[2022-05-14 11:22:14] [INFO ] Deduced a trap composed of 14 places in 398 ms of which 1 ms to minimize.
[2022-05-14 11:22:14] [INFO ] Deduced a trap composed of 24 places in 334 ms of which 1 ms to minimize.
[2022-05-14 11:22:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1502 ms
[2022-05-14 11:22:15] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 83 ms.
[2022-05-14 11:22:17] [INFO ] Added : 5 causal constraints over 1 iterations in 2173 ms. Result :unknown
[2022-05-14 11:22:17] [INFO ] [Real]Absence check using 39 positive place invariants in 42 ms returned sat
[2022-05-14 11:22:17] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 33 ms returned sat
[2022-05-14 11:22:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:22:17] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2022-05-14 11:22:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:22:17] [INFO ] [Nat]Absence check using 39 positive place invariants in 41 ms returned sat
[2022-05-14 11:22:18] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 231 ms returned sat
[2022-05-14 11:22:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:22:18] [INFO ] [Nat]Absence check using state equation in 509 ms returned sat
[2022-05-14 11:22:18] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 1 ms to minimize.
[2022-05-14 11:22:19] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 0 ms to minimize.
[2022-05-14 11:22:19] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 1 ms to minimize.
[2022-05-14 11:22:19] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 0 ms to minimize.
[2022-05-14 11:22:19] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 1 ms to minimize.
[2022-05-14 11:22:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 903 ms
[2022-05-14 11:22:19] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 61 ms.
[2022-05-14 11:22:22] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-14 11:22:22] [INFO ] [Real]Absence check using 39 positive place invariants in 37 ms returned sat
[2022-05-14 11:22:22] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 48 ms returned sat
[2022-05-14 11:22:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:22:23] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
[2022-05-14 11:22:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:22:23] [INFO ] [Nat]Absence check using 39 positive place invariants in 39 ms returned sat
[2022-05-14 11:22:24] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 674 ms returned sat
[2022-05-14 11:22:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:22:25] [INFO ] [Nat]Absence check using state equation in 893 ms returned sat
[2022-05-14 11:22:25] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 1 ms to minimize.
[2022-05-14 11:22:26] [INFO ] Deduced a trap composed of 21 places in 267 ms of which 1 ms to minimize.
[2022-05-14 11:22:26] [INFO ] Deduced a trap composed of 12 places in 315 ms of which 1 ms to minimize.
[2022-05-14 11:22:27] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 1 ms to minimize.
[2022-05-14 11:22:27] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 1 ms to minimize.
[2022-05-14 11:22:27] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 0 ms to minimize.
[2022-05-14 11:22:27] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 1 ms to minimize.
[2022-05-14 11:22:27] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 1 ms to minimize.
[2022-05-14 11:22:27] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 1 ms to minimize.
[2022-05-14 11:22:28] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 1 ms to minimize.
[2022-05-14 11:22:28] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 0 ms to minimize.
[2022-05-14 11:22:28] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2022-05-14 11:22:28] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 10 ms to minimize.
[2022-05-14 11:22:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-14 11:22:28] [INFO ] [Real]Absence check using 39 positive place invariants in 37 ms returned sat
[2022-05-14 11:22:28] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 52 ms returned sat
[2022-05-14 11:22:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:22:29] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2022-05-14 11:22:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:22:29] [INFO ] [Nat]Absence check using 39 positive place invariants in 38 ms returned sat
[2022-05-14 11:22:29] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 49 ms returned sat
[2022-05-14 11:22:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:22:29] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2022-05-14 11:22:30] [INFO ] Deduced a trap composed of 14 places in 261 ms of which 2 ms to minimize.
[2022-05-14 11:22:30] [INFO ] Deduced a trap composed of 24 places in 326 ms of which 1 ms to minimize.
[2022-05-14 11:22:30] [INFO ] Deduced a trap composed of 47 places in 321 ms of which 1 ms to minimize.
[2022-05-14 11:22:31] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 1 ms to minimize.
[2022-05-14 11:22:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1245 ms
[2022-05-14 11:22:31] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 53 ms.
[2022-05-14 11:22:34] [INFO ] Added : 170 causal constraints over 34 iterations in 3157 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 125500 steps, including 1242 resets, run finished after 595 ms. (steps per millisecond=210 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 85500 steps, including 1285 resets, run finished after 305 ms. (steps per millisecond=280 ) properties (out of 8) seen :0 could not realise parikh vector
Support contains 8 out of 519 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 519/519 places, 470/470 transitions.
Graph (complete) has 1218 edges and 519 vertex of which 508 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.8 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 508 transition count 442
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 487 transition count 442
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 487 transition count 433
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 478 transition count 433
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 459 transition count 414
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 459 transition count 414
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 459 transition count 413
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 458 transition count 413
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 443 transition count 398
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 443 transition count 398
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 148 place count 443 transition count 383
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 441 transition count 382
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 441 transition count 379
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 438 transition count 379
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 2 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 361 transition count 302
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 359 transition count 304
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 359 transition count 303
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 358 transition count 303
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 358 transition count 303
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 319 place count 357 transition count 302
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 320 place count 356 transition count 302
Applied a total of 320 rules in 520 ms. Remains 356 /519 variables (removed 163) and now considering 302/470 (removed 168) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/519 places, 302/470 transitions.
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:22:35] [INFO ] Computed 60 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 47896 resets, run finished after 2745 ms. (steps per millisecond=364 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9098 resets, run finished after 1019 ms. (steps per millisecond=981 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9209 resets, run finished after 1034 ms. (steps per millisecond=967 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9215 resets, run finished after 1019 ms. (steps per millisecond=981 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9052 resets, run finished after 1019 ms. (steps per millisecond=981 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9095 resets, run finished after 1022 ms. (steps per millisecond=978 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9119 resets, run finished after 1020 ms. (steps per millisecond=980 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9117 resets, run finished after 1041 ms. (steps per millisecond=960 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9182 resets, run finished after 1020 ms. (steps per millisecond=980 ) properties (out of 8) seen :0
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:22:46] [INFO ] Computed 60 place invariants in 25 ms
[2022-05-14 11:22:46] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2022-05-14 11:22:46] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 36 ms returned sat
[2022-05-14 11:22:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:22:47] [INFO ] [Real]Absence check using state equation in 402 ms returned sat
[2022-05-14 11:22:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:22:47] [INFO ] [Nat]Absence check using 36 positive place invariants in 23 ms returned sat
[2022-05-14 11:22:47] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 308 ms returned sat
[2022-05-14 11:22:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:22:48] [INFO ] [Nat]Absence check using state equation in 967 ms returned sat
[2022-05-14 11:22:48] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 22 ms.
[2022-05-14 11:22:50] [INFO ] Added : 153 causal constraints over 31 iterations in 1386 ms. Result :sat
Minimization took 173 ms.
[2022-05-14 11:22:50] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2022-05-14 11:22:50] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 40 ms returned sat
[2022-05-14 11:22:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:22:50] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2022-05-14 11:22:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:22:50] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned sat
[2022-05-14 11:22:51] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 308 ms returned sat
[2022-05-14 11:22:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:23:00] [INFO ] [Nat]Absence check using state equation in 9636 ms returned unknown
[2022-05-14 11:23:00] [INFO ] [Real]Absence check using 36 positive place invariants in 9 ms returned sat
[2022-05-14 11:23:00] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2022-05-14 11:23:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:23:01] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2022-05-14 11:23:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:23:01] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned sat
[2022-05-14 11:23:01] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 359 ms returned sat
[2022-05-14 11:23:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:23:02] [INFO ] [Nat]Absence check using state equation in 808 ms returned sat
[2022-05-14 11:23:02] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2022-05-14 11:23:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2022-05-14 11:23:02] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 17 ms.
[2022-05-14 11:23:04] [INFO ] Added : 223 causal constraints over 45 iterations in 1799 ms. Result :sat
Minimization took 211 ms.
[2022-05-14 11:23:04] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2022-05-14 11:23:04] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 34 ms returned sat
[2022-05-14 11:23:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:23:05] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2022-05-14 11:23:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:23:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned sat
[2022-05-14 11:23:05] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 385 ms returned sat
[2022-05-14 11:23:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:23:06] [INFO ] [Nat]Absence check using state equation in 1220 ms returned sat
[2022-05-14 11:23:06] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 31 ms.
[2022-05-14 11:23:07] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 1 ms to minimize.
[2022-05-14 11:23:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2022-05-14 11:23:08] [INFO ] Added : 103 causal constraints over 21 iterations in 1198 ms. Result :sat
Minimization took 278 ms.
[2022-05-14 11:23:08] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2022-05-14 11:23:08] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 35 ms returned sat
[2022-05-14 11:23:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:23:08] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2022-05-14 11:23:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:23:09] [INFO ] [Nat]Absence check using 36 positive place invariants in 19 ms returned sat
[2022-05-14 11:23:09] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 282 ms returned sat
[2022-05-14 11:23:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:23:10] [INFO ] [Nat]Absence check using state equation in 909 ms returned sat
[2022-05-14 11:23:10] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 25 ms.
[2022-05-14 11:23:11] [INFO ] Added : 107 causal constraints over 22 iterations in 1121 ms. Result :sat
Minimization took 303 ms.
[2022-05-14 11:23:11] [INFO ] [Real]Absence check using 36 positive place invariants in 22 ms returned sat
[2022-05-14 11:23:11] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 33 ms returned sat
[2022-05-14 11:23:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:23:12] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2022-05-14 11:23:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:23:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 19 ms returned sat
[2022-05-14 11:23:12] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 363 ms returned sat
[2022-05-14 11:23:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:23:19] [INFO ] [Nat]Absence check using state equation in 6240 ms returned sat
[2022-05-14 11:23:19] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 0 ms to minimize.
[2022-05-14 11:23:19] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 0 ms to minimize.
[2022-05-14 11:23:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 398 ms
[2022-05-14 11:23:19] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 32 ms.
[2022-05-14 11:23:22] [INFO ] Added : 276 causal constraints over 56 iterations in 3209 ms. Result :sat
Minimization took 214 ms.
[2022-05-14 11:23:22] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2022-05-14 11:23:22] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 36 ms returned sat
[2022-05-14 11:23:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:23:23] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2022-05-14 11:23:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:23:23] [INFO ] [Nat]Absence check using 36 positive place invariants in 19 ms returned sat
[2022-05-14 11:23:23] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 304 ms returned sat
[2022-05-14 11:23:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:23:24] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2022-05-14 11:23:24] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 28 ms.
[2022-05-14 11:23:26] [INFO ] Added : 237 causal constraints over 48 iterations in 2164 ms. Result :sat
Minimization took 173 ms.
[2022-05-14 11:23:26] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2022-05-14 11:23:26] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 35 ms returned sat
[2022-05-14 11:23:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:23:27] [INFO ] [Real]Absence check using state equation in 414 ms returned sat
[2022-05-14 11:23:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:23:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned sat
[2022-05-14 11:23:27] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 309 ms returned sat
[2022-05-14 11:23:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:23:28] [INFO ] [Nat]Absence check using state equation in 777 ms returned sat
[2022-05-14 11:23:28] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 52 ms.
[2022-05-14 11:23:29] [INFO ] Added : 96 causal constraints over 20 iterations in 883 ms. Result :sat
Minimization took 260 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 222200 steps, including 12712 resets, run finished after 943 ms. (steps per millisecond=235 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 255500 steps, including 16570 resets, run finished after 637 ms. (steps per millisecond=401 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 289600 steps, including 15304 resets, run finished after 727 ms. (steps per millisecond=398 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 220800 steps, including 12597 resets, run finished after 547 ms. (steps per millisecond=403 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 64600 steps, including 4113 resets, run finished after 159 ms. (steps per millisecond=406 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 251800 steps, including 16912 resets, run finished after 623 ms. (steps per millisecond=404 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 130600 steps, including 6546 resets, run finished after 329 ms. (steps per millisecond=396 ) properties (out of 8) seen :0 could not realise parikh vector
Support contains 8 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 33 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 15 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:23:33] [INFO ] Computed 60 place invariants in 18 ms
[2022-05-14 11:23:34] [INFO ] Implicit Places using invariants in 500 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:23:34] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-14 11:23:35] [INFO ] Implicit Places using invariants and state equation in 1123 ms returned []
Implicit Place search using SMT with State Equation took 1626 ms to find 0 implicit places.
[2022-05-14 11:23:35] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:23:35] [INFO ] Computed 60 place invariants in 8 ms
[2022-05-14 11:23:35] [INFO ] Dead Transitions using invariants and state equation in 489 ms returned []
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Starting property specific reduction for DES-PT-60b-UpperBounds-01
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:23:35] [INFO ] Computed 60 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 484 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:23:35] [INFO ] Computed 60 place invariants in 8 ms
[2022-05-14 11:23:35] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2022-05-14 11:23:35] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 35 ms returned sat
[2022-05-14 11:23:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:23:36] [INFO ] [Real]Absence check using state equation in 400 ms returned sat
[2022-05-14 11:23:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:23:36] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned sat
[2022-05-14 11:23:36] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 309 ms returned sat
[2022-05-14 11:23:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:23:37] [INFO ] [Nat]Absence check using state equation in 876 ms returned sat
[2022-05-14 11:23:37] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 20 ms.
[2022-05-14 11:23:39] [INFO ] Added : 153 causal constraints over 31 iterations in 1501 ms. Result :sat
Minimization took 174 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 130600 steps, including 6496 resets, run finished after 523 ms. (steps per millisecond=249 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 22 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:23:39] [INFO ] Computed 60 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 47574 resets, run finished after 2387 ms. (steps per millisecond=418 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9200 resets, run finished after 994 ms. (steps per millisecond=1006 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:23:43] [INFO ] Computed 60 place invariants in 16 ms
[2022-05-14 11:23:43] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2022-05-14 11:23:43] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 34 ms returned sat
[2022-05-14 11:23:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:23:43] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2022-05-14 11:23:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:23:44] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2022-05-14 11:23:44] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 284 ms returned sat
[2022-05-14 11:23:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:23:45] [INFO ] [Nat]Absence check using state equation in 858 ms returned sat
[2022-05-14 11:23:45] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 28 ms.
[2022-05-14 11:23:46] [INFO ] Added : 153 causal constraints over 31 iterations in 1506 ms. Result :sat
Minimization took 172 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 130600 steps, including 6524 resets, run finished after 526 ms. (steps per millisecond=248 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 23 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 20 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:23:47] [INFO ] Computed 60 place invariants in 9 ms
[2022-05-14 11:23:47] [INFO ] Implicit Places using invariants in 312 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:23:47] [INFO ] Computed 60 place invariants in 9 ms
[2022-05-14 11:23:48] [INFO ] Implicit Places using invariants and state equation in 1142 ms returned []
Implicit Place search using SMT with State Equation took 1456 ms to find 0 implicit places.
[2022-05-14 11:23:48] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:23:48] [INFO ] Computed 60 place invariants in 8 ms
[2022-05-14 11:23:49] [INFO ] Dead Transitions using invariants and state equation in 445 ms returned []
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Ending property specific reduction for DES-PT-60b-UpperBounds-01 in 13618 ms.
Starting property specific reduction for DES-PT-60b-UpperBounds-04
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:23:49] [INFO ] Computed 60 place invariants in 16 ms
Incomplete random walk after 10000 steps, including 486 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:23:49] [INFO ] Computed 60 place invariants in 9 ms
[2022-05-14 11:23:49] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2022-05-14 11:23:49] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 34 ms returned sat
[2022-05-14 11:23:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:23:50] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2022-05-14 11:23:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:23:50] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned sat
[2022-05-14 11:23:50] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 307 ms returned sat
[2022-05-14 11:23:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:23:55] [INFO ] [Nat]Absence check using state equation in 4603 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 24 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:23:55] [INFO ] Computed 60 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 47736 resets, run finished after 2831 ms. (steps per millisecond=353 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9100 resets, run finished after 1446 ms. (steps per millisecond=691 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:23:59] [INFO ] Computed 60 place invariants in 9 ms
[2022-05-14 11:23:59] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2022-05-14 11:23:59] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 27 ms returned sat
[2022-05-14 11:23:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:23:59] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2022-05-14 11:23:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:23:59] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned sat
[2022-05-14 11:24:00] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 306 ms returned sat
[2022-05-14 11:24:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:24:10] [INFO ] [Nat]Absence check using state equation in 9811 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 13 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 12 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:24:10] [INFO ] Computed 60 place invariants in 9 ms
[2022-05-14 11:24:10] [INFO ] Implicit Places using invariants in 496 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:24:10] [INFO ] Computed 60 place invariants in 11 ms
[2022-05-14 11:24:11] [INFO ] Implicit Places using invariants and state equation in 1155 ms returned []
Implicit Place search using SMT with State Equation took 1656 ms to find 0 implicit places.
[2022-05-14 11:24:11] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:24:11] [INFO ] Computed 60 place invariants in 8 ms
[2022-05-14 11:24:12] [INFO ] Dead Transitions using invariants and state equation in 398 ms returned []
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Ending property specific reduction for DES-PT-60b-UpperBounds-04 in 22742 ms.
Starting property specific reduction for DES-PT-60b-UpperBounds-06
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:24:12] [INFO ] Computed 60 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 446 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:24:12] [INFO ] Computed 60 place invariants in 9 ms
[2022-05-14 11:24:12] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2022-05-14 11:24:12] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 34 ms returned sat
[2022-05-14 11:24:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:24:12] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2022-05-14 11:24:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:24:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 19 ms returned sat
[2022-05-14 11:24:13] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 339 ms returned sat
[2022-05-14 11:24:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:24:13] [INFO ] [Nat]Absence check using state equation in 806 ms returned sat
[2022-05-14 11:24:13] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2022-05-14 11:24:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2022-05-14 11:24:14] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 32 ms.
[2022-05-14 11:24:16] [INFO ] Added : 223 causal constraints over 45 iterations in 2024 ms. Result :sat
Minimization took 207 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 251800 steps, including 16902 resets, run finished after 878 ms. (steps per millisecond=286 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 12 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:24:17] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 47562 resets, run finished after 2386 ms. (steps per millisecond=419 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9025 resets, run finished after 1009 ms. (steps per millisecond=991 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:24:20] [INFO ] Computed 60 place invariants in 8 ms
[2022-05-14 11:24:20] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2022-05-14 11:24:20] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 21 ms returned sat
[2022-05-14 11:24:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:24:20] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2022-05-14 11:24:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:24:20] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2022-05-14 11:24:21] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 291 ms returned sat
[2022-05-14 11:24:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:24:21] [INFO ] [Nat]Absence check using state equation in 798 ms returned sat
[2022-05-14 11:24:22] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
[2022-05-14 11:24:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2022-05-14 11:24:22] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 27 ms.
[2022-05-14 11:24:23] [INFO ] Added : 223 causal constraints over 45 iterations in 1897 ms. Result :sat
Minimization took 202 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 251800 steps, including 17034 resets, run finished after 1002 ms. (steps per millisecond=251 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 18 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 17 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:24:25] [INFO ] Computed 60 place invariants in 7 ms
[2022-05-14 11:24:25] [INFO ] Implicit Places using invariants in 597 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:24:25] [INFO ] Computed 60 place invariants in 9 ms
[2022-05-14 11:24:26] [INFO ] Implicit Places using invariants and state equation in 988 ms returned []
Implicit Place search using SMT with State Equation took 1588 ms to find 0 implicit places.
[2022-05-14 11:24:26] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:24:26] [INFO ] Computed 60 place invariants in 9 ms
[2022-05-14 11:24:27] [INFO ] Dead Transitions using invariants and state equation in 244 ms returned []
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Ending property specific reduction for DES-PT-60b-UpperBounds-06 in 14947 ms.
Starting property specific reduction for DES-PT-60b-UpperBounds-08
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:24:27] [INFO ] Computed 60 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 482 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:24:27] [INFO ] Computed 60 place invariants in 12 ms
[2022-05-14 11:24:27] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2022-05-14 11:24:27] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 21 ms returned sat
[2022-05-14 11:24:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:24:27] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2022-05-14 11:24:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:24:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 21 ms returned sat
[2022-05-14 11:24:27] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 290 ms returned sat
[2022-05-14 11:24:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:24:29] [INFO ] [Nat]Absence check using state equation in 1326 ms returned sat
[2022-05-14 11:24:29] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 28 ms.
[2022-05-14 11:24:30] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2022-05-14 11:24:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2022-05-14 11:24:30] [INFO ] Added : 103 causal constraints over 21 iterations in 1120 ms. Result :sat
Minimization took 281 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 64600 steps, including 4133 resets, run finished after 254 ms. (steps per millisecond=254 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 17 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:24:30] [INFO ] Computed 60 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 47719 resets, run finished after 2391 ms. (steps per millisecond=418 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9096 resets, run finished after 991 ms. (steps per millisecond=1009 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:24:34] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-14 11:24:34] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned sat
[2022-05-14 11:24:34] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 37 ms returned sat
[2022-05-14 11:24:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:24:34] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2022-05-14 11:24:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:24:35] [INFO ] [Nat]Absence check using 36 positive place invariants in 19 ms returned sat
[2022-05-14 11:24:35] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 385 ms returned sat
[2022-05-14 11:24:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:24:36] [INFO ] [Nat]Absence check using state equation in 1577 ms returned sat
[2022-05-14 11:24:37] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 28 ms.
[2022-05-14 11:24:37] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 1 ms to minimize.
[2022-05-14 11:24:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2022-05-14 11:24:38] [INFO ] Added : 103 causal constraints over 21 iterations in 1026 ms. Result :sat
Minimization took 286 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 64600 steps, including 4144 resets, run finished after 257 ms. (steps per millisecond=251 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 17 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 17 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:24:38] [INFO ] Computed 60 place invariants in 8 ms
[2022-05-14 11:24:39] [INFO ] Implicit Places using invariants in 576 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:24:39] [INFO ] Computed 60 place invariants in 7 ms
[2022-05-14 11:24:40] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 1573 ms to find 0 implicit places.
[2022-05-14 11:24:40] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:24:40] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-14 11:24:40] [INFO ] Dead Transitions using invariants and state equation in 429 ms returned []
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Ending property specific reduction for DES-PT-60b-UpperBounds-08 in 13577 ms.
Starting property specific reduction for DES-PT-60b-UpperBounds-12
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:24:40] [INFO ] Computed 60 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 480 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:24:40] [INFO ] Computed 60 place invariants in 7 ms
[2022-05-14 11:24:40] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2022-05-14 11:24:40] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 36 ms returned sat
[2022-05-14 11:24:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:24:41] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2022-05-14 11:24:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:24:41] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned sat
[2022-05-14 11:24:41] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 306 ms returned sat
[2022-05-14 11:24:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:24:42] [INFO ] [Nat]Absence check using state equation in 1137 ms returned sat
[2022-05-14 11:24:42] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 30 ms.
[2022-05-14 11:24:43] [INFO ] Added : 107 causal constraints over 22 iterations in 1111 ms. Result :sat
Minimization took 302 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 220800 steps, including 12620 resets, run finished after 789 ms. (steps per millisecond=279 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 9 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:24:45] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 47841 resets, run finished after 2182 ms. (steps per millisecond=458 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9053 resets, run finished after 997 ms. (steps per millisecond=1003 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:24:48] [INFO ] Computed 60 place invariants in 7 ms
[2022-05-14 11:24:48] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2022-05-14 11:24:48] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 34 ms returned sat
[2022-05-14 11:24:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:24:48] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2022-05-14 11:24:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:24:48] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2022-05-14 11:24:48] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 203 ms returned sat
[2022-05-14 11:24:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:24:49] [INFO ] [Nat]Absence check using state equation in 681 ms returned sat
[2022-05-14 11:24:49] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 25 ms.
[2022-05-14 11:24:50] [INFO ] Added : 107 causal constraints over 22 iterations in 1056 ms. Result :sat
Minimization took 301 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 220800 steps, including 12635 resets, run finished after 875 ms. (steps per millisecond=252 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 17 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 13 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:24:51] [INFO ] Computed 60 place invariants in 7 ms
[2022-05-14 11:24:52] [INFO ] Implicit Places using invariants in 312 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:24:52] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-14 11:24:53] [INFO ] Implicit Places using invariants and state equation in 1008 ms returned []
Implicit Place search using SMT with State Equation took 1323 ms to find 0 implicit places.
[2022-05-14 11:24:53] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:24:53] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-14 11:24:53] [INFO ] Dead Transitions using invariants and state equation in 455 ms returned []
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Ending property specific reduction for DES-PT-60b-UpperBounds-12 in 13098 ms.
Starting property specific reduction for DES-PT-60b-UpperBounds-13
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:24:53] [INFO ] Computed 60 place invariants in 8 ms
Incomplete random walk after 10000 steps, including 464 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:24:53] [INFO ] Computed 60 place invariants in 7 ms
[2022-05-14 11:24:53] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2022-05-14 11:24:53] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 34 ms returned sat
[2022-05-14 11:24:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:24:54] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2022-05-14 11:24:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:24:54] [INFO ] [Nat]Absence check using 36 positive place invariants in 19 ms returned sat
[2022-05-14 11:24:54] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 358 ms returned sat
[2022-05-14 11:24:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:24:59] [INFO ] [Nat]Absence check using state equation in 4552 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 16 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:24:59] [INFO ] Computed 60 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 47777 resets, run finished after 2417 ms. (steps per millisecond=413 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9005 resets, run finished after 992 ms. (steps per millisecond=1008 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:25:02] [INFO ] Computed 60 place invariants in 7 ms
[2022-05-14 11:25:02] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2022-05-14 11:25:02] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 34 ms returned sat
[2022-05-14 11:25:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:25:03] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2022-05-14 11:25:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:25:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned sat
[2022-05-14 11:25:03] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 358 ms returned sat
[2022-05-14 11:25:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:25:11] [INFO ] [Nat]Absence check using state equation in 7219 ms returned sat
[2022-05-14 11:25:11] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 1 ms to minimize.
[2022-05-14 11:25:11] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 1 ms to minimize.
[2022-05-14 11:25:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 475 ms
[2022-05-14 11:25:11] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 30 ms.
[2022-05-14 11:25:14] [INFO ] Added : 276 causal constraints over 56 iterations in 3277 ms. Result :sat
Minimization took 211 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 289600 steps, including 15363 resets, run finished after 1067 ms. (steps per millisecond=271 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 10 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 10 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:25:16] [INFO ] Computed 60 place invariants in 7 ms
[2022-05-14 11:25:16] [INFO ] Implicit Places using invariants in 538 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:25:16] [INFO ] Computed 60 place invariants in 7 ms
[2022-05-14 11:25:17] [INFO ] Implicit Places using invariants and state equation in 1073 ms returned []
Implicit Place search using SMT with State Equation took 1616 ms to find 0 implicit places.
[2022-05-14 11:25:17] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:25:17] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-14 11:25:18] [INFO ] Dead Transitions using invariants and state equation in 386 ms returned []
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Ending property specific reduction for DES-PT-60b-UpperBounds-13 in 24394 ms.
Starting property specific reduction for DES-PT-60b-UpperBounds-14
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:25:18] [INFO ] Computed 60 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 462 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:25:18] [INFO ] Computed 60 place invariants in 7 ms
[2022-05-14 11:25:18] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2022-05-14 11:25:18] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 33 ms returned sat
[2022-05-14 11:25:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:25:18] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2022-05-14 11:25:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:25:18] [INFO ] [Nat]Absence check using 36 positive place invariants in 19 ms returned sat
[2022-05-14 11:25:19] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 304 ms returned sat
[2022-05-14 11:25:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:25:19] [INFO ] [Nat]Absence check using state equation in 712 ms returned sat
[2022-05-14 11:25:19] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 31 ms.
[2022-05-14 11:25:21] [INFO ] Added : 237 causal constraints over 48 iterations in 2182 ms. Result :sat
Minimization took 166 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 255500 steps, including 16529 resets, run finished after 914 ms. (steps per millisecond=279 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 9 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:25:23] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 47764 resets, run finished after 2191 ms. (steps per millisecond=456 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9340 resets, run finished after 989 ms. (steps per millisecond=1011 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:25:26] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-14 11:25:26] [INFO ] [Real]Absence check using 36 positive place invariants in 24 ms returned sat
[2022-05-14 11:25:26] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 35 ms returned sat
[2022-05-14 11:25:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:25:26] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2022-05-14 11:25:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:25:26] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2022-05-14 11:25:27] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 226 ms returned sat
[2022-05-14 11:25:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:25:27] [INFO ] [Nat]Absence check using state equation in 593 ms returned sat
[2022-05-14 11:25:27] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 19 ms.
[2022-05-14 11:25:29] [INFO ] Added : 237 causal constraints over 48 iterations in 1960 ms. Result :sat
Minimization took 164 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 255500 steps, including 16522 resets, run finished after 869 ms. (steps per millisecond=294 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 10 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 9 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:25:30] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-14 11:25:31] [INFO ] Implicit Places using invariants in 558 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:25:31] [INFO ] Computed 60 place invariants in 8 ms
[2022-05-14 11:25:32] [INFO ] Implicit Places using invariants and state equation in 1110 ms returned []
Implicit Place search using SMT with State Equation took 1670 ms to find 0 implicit places.
[2022-05-14 11:25:32] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:25:32] [INFO ] Computed 60 place invariants in 6 ms
[2022-05-14 11:25:32] [INFO ] Dead Transitions using invariants and state equation in 456 ms returned []
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Ending property specific reduction for DES-PT-60b-UpperBounds-14 in 14671 ms.
Starting property specific reduction for DES-PT-60b-UpperBounds-15
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:25:32] [INFO ] Computed 60 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 470 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:25:32] [INFO ] Computed 60 place invariants in 8 ms
[2022-05-14 11:25:32] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2022-05-14 11:25:33] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 33 ms returned sat
[2022-05-14 11:25:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:25:33] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2022-05-14 11:25:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:25:33] [INFO ] [Nat]Absence check using 36 positive place invariants in 19 ms returned sat
[2022-05-14 11:25:33] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 283 ms returned sat
[2022-05-14 11:25:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:25:34] [INFO ] [Nat]Absence check using state equation in 663 ms returned sat
[2022-05-14 11:25:34] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 27 ms.
[2022-05-14 11:25:35] [INFO ] Added : 96 causal constraints over 20 iterations in 768 ms. Result :sat
Minimization took 255 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 222200 steps, including 12681 resets, run finished after 889 ms. (steps per millisecond=249 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 10 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:25:36] [INFO ] Computed 60 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 47706 resets, run finished after 2286 ms. (steps per millisecond=437 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9025 resets, run finished after 1040 ms. (steps per millisecond=961 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:25:39] [INFO ] Computed 60 place invariants in 7 ms
[2022-05-14 11:25:39] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2022-05-14 11:25:39] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 35 ms returned sat
[2022-05-14 11:25:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:25:40] [INFO ] [Real]Absence check using state equation in 405 ms returned sat
[2022-05-14 11:25:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:25:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 21 ms returned sat
[2022-05-14 11:25:40] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 309 ms returned sat
[2022-05-14 11:25:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:25:41] [INFO ] [Nat]Absence check using state equation in 712 ms returned sat
[2022-05-14 11:25:41] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 26 ms.
[2022-05-14 11:25:42] [INFO ] Added : 96 causal constraints over 20 iterations in 783 ms. Result :sat
Minimization took 272 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 222200 steps, including 12686 resets, run finished after 883 ms. (steps per millisecond=251 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 10 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 9 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:25:43] [INFO ] Computed 60 place invariants in 7 ms
[2022-05-14 11:25:43] [INFO ] Implicit Places using invariants in 414 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:25:43] [INFO ] Computed 60 place invariants in 8 ms
[2022-05-14 11:25:45] [INFO ] Implicit Places using invariants and state equation in 1150 ms returned []
Implicit Place search using SMT with State Equation took 1572 ms to find 0 implicit places.
[2022-05-14 11:25:45] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2022-05-14 11:25:45] [INFO ] Computed 60 place invariants in 7 ms
[2022-05-14 11:25:45] [INFO ] Dead Transitions using invariants and state equation in 450 ms returned []
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Ending property specific reduction for DES-PT-60b-UpperBounds-15 in 12711 ms.
[2022-05-14 11:25:46] [INFO ] Flatten gal took : 162 ms
[2022-05-14 11:25:46] [INFO ] Applying decomposition
[2022-05-14 11:25:46] [INFO ] Flatten gal took : 70 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7861130238901448084.txt, -o, /tmp/graph7861130238901448084.bin, -w, /tmp/graph7861130238901448084.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7861130238901448084.bin, -l, -1, -v, -w, /tmp/graph7861130238901448084.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-14 11:25:46] [INFO ] Decomposing Gal with order
[2022-05-14 11:25:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 11:25:46] [INFO ] Removed a total of 46 redundant transitions.
[2022-05-14 11:25:46] [INFO ] Flatten gal took : 140 ms
[2022-05-14 11:25:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 18 ms.
[2022-05-14 11:25:46] [INFO ] Time to serialize gal into /tmp/UpperBounds16620092261941513582.gal : 19 ms
[2022-05-14 11:25:46] [INFO ] Time to serialize properties into /tmp/UpperBounds7760098768153735895.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds16620092261941513582.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds7760098768153735895.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds16620092261941513582.gal -t CGAL -reachable-file /tmp/UpperBounds7760098768153735895.prop --nowitness
Loading property file /tmp/UpperBounds7760098768153735895.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,9.97064e+13,92.5394,1028100,17886,12704,1.13112e+06,26528,297,6.85364e+06,531,397838,0
Total reachable state count : 99706440827392

Verifying 8 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60b-UpperBounds-01 :0 <= u2.p226 <= 1
FORMULA DES-PT-60b-UpperBounds-01 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60b-UpperBounds-01,0,201.709,1028896,1,0,1.13112e+06,26528,472,6.85364e+06,647,845320,1598
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60b-UpperBounds-04 :0 <= u2.p215 <= 1
FORMULA DES-PT-60b-UpperBounds-04 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60b-UpperBounds-04,0,202.692,1028896,1,0,1.13112e+06,26528,493,6.85364e+06,722,845566,1632
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60b-UpperBounds-06 :0 <= u14.p23 <= 1
FORMULA DES-PT-60b-UpperBounds-06 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60b-UpperBounds-06,0,214.439,1028896,1,0,1.13112e+06,26528,519,7.36131e+06,821,862659,1829
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60b-UpperBounds-08 :0 <= u49.p113 <= 1
FORMULA DES-PT-60b-UpperBounds-08 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60b-UpperBounds-08,0,245.46,1034176,1,0,1.13112e+06,26528,542,9.27204e+06,856,891533,2029
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60b-UpperBounds-12 :0 <= u2.p238 <= 1
FORMULA DES-PT-60b-UpperBounds-12 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60b-UpperBounds-12,0,245.472,1034176,1,0,1.13112e+06,26528,563,9.27212e+06,877,891596,2063
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60b-UpperBounds-13 :0 <= u2.p195 <= 1
FORMULA DES-PT-60b-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60b-UpperBounds-13,0,245.531,1034440,1,0,1.13112e+06,26528,584,9.27407e+06,996,892002,2097
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60b-UpperBounds-14 :0 <= u14.p20 <= 1
FORMULA DES-PT-60b-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60b-UpperBounds-14,0,253.988,1075096,1,0,1.13112e+06,26528,607,9.51032e+06,1101,924059,2293
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60b-UpperBounds-15 :0 <= u2.p237 <= 1
FORMULA DES-PT-60b-UpperBounds-15 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60b-UpperBounds-15,0,254.019,1075360,1,0,1.13112e+06,26528,628,9.5119e+06,1124,924129,2327

BK_STOP 1652527802482

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-60b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is DES-PT-60b, 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 r046-smll-165252115900202"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-60b.tgz
mv DES-PT-60b execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;