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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2592.819 427924.00 468980.00 1623.10 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-165252115900196.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-50b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r046-smll-165252115900196
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 6.7K Apr 29 15:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 29 15:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 15:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 29 15:55 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:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 127K 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-50b-UpperBounds-00
FORMULA_NAME DES-PT-50b-UpperBounds-01
FORMULA_NAME DES-PT-50b-UpperBounds-02
FORMULA_NAME DES-PT-50b-UpperBounds-03
FORMULA_NAME DES-PT-50b-UpperBounds-04
FORMULA_NAME DES-PT-50b-UpperBounds-05
FORMULA_NAME DES-PT-50b-UpperBounds-06
FORMULA_NAME DES-PT-50b-UpperBounds-07
FORMULA_NAME DES-PT-50b-UpperBounds-08
FORMULA_NAME DES-PT-50b-UpperBounds-09
FORMULA_NAME DES-PT-50b-UpperBounds-10
FORMULA_NAME DES-PT-50b-UpperBounds-11
FORMULA_NAME DES-PT-50b-UpperBounds-12
FORMULA_NAME DES-PT-50b-UpperBounds-13
FORMULA_NAME DES-PT-50b-UpperBounds-14
FORMULA_NAME DES-PT-50b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652526863348

Running Version 0
[2022-05-14 11:14:26] [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:14:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 11:14:26] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2022-05-14 11:14:26] [INFO ] Transformed 479 places.
[2022-05-14 11:14:26] [INFO ] Transformed 430 transitions.
[2022-05-14 11:14:26] [INFO ] Found NUPN structural information;
[2022-05-14 11:14:26] [INFO ] Parsed PT model containing 479 places and 430 transitions in 243 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
// Phase 1: matrix 430 rows 479 cols
[2022-05-14 11:14:27] [INFO ] Computed 65 place invariants in 65 ms
Incomplete random walk after 10000 steps, including 80 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 16) seen :10
FORMULA DES-PT-50b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
// Phase 1: matrix 430 rows 479 cols
[2022-05-14 11:14:27] [INFO ] Computed 65 place invariants in 63 ms
[2022-05-14 11:14:27] [INFO ] [Real]Absence check using 40 positive place invariants in 50 ms returned sat
[2022-05-14 11:14:27] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 41 ms returned sat
[2022-05-14 11:14:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:14:28] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2022-05-14 11:14:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:14:28] [INFO ] [Nat]Absence check using 40 positive place invariants in 46 ms returned sat
[2022-05-14 11:14:28] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 56 ms returned sat
[2022-05-14 11:14:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:14:29] [INFO ] [Nat]Absence check using state equation in 559 ms returned sat
[2022-05-14 11:14:29] [INFO ] Deduced a trap composed of 8 places in 370 ms of which 6 ms to minimize.
[2022-05-14 11:14:30] [INFO ] Deduced a trap composed of 31 places in 430 ms of which 4 ms to minimize.
[2022-05-14 11:14:30] [INFO ] Deduced a trap composed of 20 places in 367 ms of which 3 ms to minimize.
[2022-05-14 11:14:30] [INFO ] Deduced a trap composed of 20 places in 257 ms of which 2 ms to minimize.
[2022-05-14 11:14:31] [INFO ] Deduced a trap composed of 11 places in 267 ms of which 2 ms to minimize.
[2022-05-14 11:14:31] [INFO ] Deduced a trap composed of 13 places in 317 ms of which 2 ms to minimize.
[2022-05-14 11:14:32] [INFO ] Deduced a trap composed of 10 places in 335 ms of which 2 ms to minimize.
[2022-05-14 11:14:32] [INFO ] Deduced a trap composed of 13 places in 256 ms of which 2 ms to minimize.
[2022-05-14 11:14:32] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2022-05-14 11:14:32] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3223 ms
[2022-05-14 11:14:32] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 65 ms.
[2022-05-14 11:14:33] [INFO ] Deduced a trap composed of 14 places in 272 ms of which 2 ms to minimize.
[2022-05-14 11:14:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
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:14:33] [INFO ] [Real]Absence check using 40 positive place invariants in 20 ms returned sat
[2022-05-14 11:14:34] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 29 ms returned sat
[2022-05-14 11:14:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:14:34] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2022-05-14 11:14:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:14:34] [INFO ] [Nat]Absence check using 40 positive place invariants in 24 ms returned sat
[2022-05-14 11:14:34] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 35 ms returned sat
[2022-05-14 11:14:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:14:35] [INFO ] [Nat]Absence check using state equation in 488 ms returned sat
[2022-05-14 11:14:35] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 1 ms to minimize.
[2022-05-14 11:14:35] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 1 ms to minimize.
[2022-05-14 11:14:35] [INFO ] Deduced a trap composed of 31 places in 215 ms of which 1 ms to minimize.
[2022-05-14 11:14:35] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 1 ms to minimize.
[2022-05-14 11:14:36] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 1 ms to minimize.
[2022-05-14 11:14:36] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 1 ms to minimize.
[2022-05-14 11:14:36] [INFO ] Deduced a trap composed of 38 places in 215 ms of which 1 ms to minimize.
[2022-05-14 11:14:36] [INFO ] Deduced a trap composed of 29 places in 267 ms of which 3 ms to minimize.
[2022-05-14 11:14:37] [INFO ] Deduced a trap composed of 33 places in 274 ms of which 1 ms to minimize.
[2022-05-14 11:14:37] [INFO ] Deduced a trap composed of 37 places in 268 ms of which 1 ms to minimize.
[2022-05-14 11:14:37] [INFO ] Deduced a trap composed of 38 places in 281 ms of which 2 ms to minimize.
[2022-05-14 11:14:37] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2755 ms
[2022-05-14 11:14:37] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 111 ms.
[2022-05-14 11:14:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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:14:39] [INFO ] [Real]Absence check using 40 positive place invariants in 36 ms returned sat
[2022-05-14 11:14:39] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 41 ms returned sat
[2022-05-14 11:14:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:14:39] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2022-05-14 11:14:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:14:40] [INFO ] [Nat]Absence check using 40 positive place invariants in 37 ms returned sat
[2022-05-14 11:14:40] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 38 ms returned sat
[2022-05-14 11:14:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:14:40] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2022-05-14 11:14:41] [INFO ] Deduced a trap composed of 9 places in 302 ms of which 1 ms to minimize.
[2022-05-14 11:14:41] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 1 ms to minimize.
[2022-05-14 11:14:41] [INFO ] Deduced a trap composed of 13 places in 325 ms of which 1 ms to minimize.
[2022-05-14 11:14:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 926 ms
[2022-05-14 11:14:41] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 51 ms.
[2022-05-14 11:14:45] [INFO ] Deduced a trap composed of 14 places in 374 ms of which 1 ms to minimize.
[2022-05-14 11:14:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
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:14:45] [INFO ] [Real]Absence check using 40 positive place invariants in 35 ms returned sat
[2022-05-14 11:14:45] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 40 ms returned sat
[2022-05-14 11:14:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:14:46] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2022-05-14 11:14:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:14:46] [INFO ] [Nat]Absence check using 40 positive place invariants in 34 ms returned sat
[2022-05-14 11:14:46] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 183 ms returned sat
[2022-05-14 11:14:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:14:47] [INFO ] [Nat]Absence check using state equation in 614 ms returned sat
[2022-05-14 11:14:47] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2022-05-14 11:14:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2022-05-14 11:14:47] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 38 ms.
[2022-05-14 11:14:51] [INFO ] Added : 275 causal constraints over 55 iterations in 3944 ms. Result :unknown
[2022-05-14 11:14:51] [INFO ] [Real]Absence check using 40 positive place invariants in 36 ms returned sat
[2022-05-14 11:14:51] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 41 ms returned sat
[2022-05-14 11:14:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:14:51] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2022-05-14 11:14:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:14:51] [INFO ] [Nat]Absence check using 40 positive place invariants in 25 ms returned sat
[2022-05-14 11:14:51] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 35 ms returned sat
[2022-05-14 11:14:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:14:52] [INFO ] [Nat]Absence check using state equation in 522 ms returned sat
[2022-05-14 11:14:52] [INFO ] Deduced a trap composed of 17 places in 358 ms of which 1 ms to minimize.
[2022-05-14 11:14:53] [INFO ] Deduced a trap composed of 12 places in 346 ms of which 1 ms to minimize.
[2022-05-14 11:14:53] [INFO ] Deduced a trap composed of 38 places in 349 ms of which 2 ms to minimize.
[2022-05-14 11:14:53] [INFO ] Deduced a trap composed of 17 places in 352 ms of which 2 ms to minimize.
[2022-05-14 11:14:54] [INFO ] Deduced a trap composed of 20 places in 344 ms of which 1 ms to minimize.
[2022-05-14 11:14:54] [INFO ] Deduced a trap composed of 21 places in 325 ms of which 1 ms to minimize.
[2022-05-14 11:14:55] [INFO ] Deduced a trap composed of 52 places in 297 ms of which 1 ms to minimize.
[2022-05-14 11:14:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2671 ms
[2022-05-14 11:14:55] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 46 ms.
[2022-05-14 11:14:56] [INFO ] Added : 110 causal constraints over 22 iterations in 1645 ms. Result :unknown
[2022-05-14 11:14:56] [INFO ] [Real]Absence check using 40 positive place invariants in 39 ms returned sat
[2022-05-14 11:14:56] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 42 ms returned sat
[2022-05-14 11:14:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:14:57] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2022-05-14 11:14:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:14:57] [INFO ] [Nat]Absence check using 40 positive place invariants in 37 ms returned sat
[2022-05-14 11:14:57] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 373 ms returned sat
[2022-05-14 11:14:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:14:58] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2022-05-14 11:14:58] [INFO ] Deduced a trap composed of 18 places in 274 ms of which 3 ms to minimize.
[2022-05-14 11:14:58] [INFO ] Deduced a trap composed of 17 places in 266 ms of which 1 ms to minimize.
[2022-05-14 11:14:59] [INFO ] Deduced a trap composed of 9 places in 253 ms of which 1 ms to minimize.
[2022-05-14 11:14:59] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 1 ms to minimize.
[2022-05-14 11:14:59] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 1 ms to minimize.
[2022-05-14 11:14:59] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 1 ms to minimize.
[2022-05-14 11:14:59] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 1 ms to minimize.
[2022-05-14 11:14:59] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1626 ms
[2022-05-14 11:14:59] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 43 ms.
[2022-05-14 11:15:02] [INFO ] Added : 170 causal constraints over 34 iterations in 2575 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 148300 steps, including 1803 resets, run finished after 715 ms. (steps per millisecond=207 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 488700 steps, including 5253 resets, run finished after 1648 ms. (steps per millisecond=296 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 381700 steps, including 4346 resets, run finished after 975 ms. (steps per millisecond=391 ) properties (out of 6) seen :0 could not realise parikh vector
Support contains 6 out of 479 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 479/479 places, 430/430 transitions.
Graph (complete) has 1098 edges and 479 vertex of which 468 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.10 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 468 transition count 402
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 447 transition count 402
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 447 transition count 393
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 438 transition count 393
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 419 transition count 374
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 419 transition count 374
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 419 transition count 373
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 418 transition count 373
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 403 transition count 358
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 403 transition count 358
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 403 transition count 343
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 401 transition count 342
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 401 transition count 339
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 398 transition count 339
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 321 transition count 262
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 319 transition count 264
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 319 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 318 transition count 263
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 318 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 319 place count 317 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 320 place count 316 transition count 262
Applied a total of 320 rules in 444 ms. Remains 316 /479 variables (removed 163) and now considering 262/430 (removed 168) transitions.
Finished structural reductions, in 1 iterations. Remains : 316/479 places, 262/430 transitions.
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:15:06] [INFO ] Computed 60 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 47671 resets, run finished after 2643 ms. (steps per millisecond=378 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9151 resets, run finished after 1290 ms. (steps per millisecond=775 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9036 resets, run finished after 1030 ms. (steps per millisecond=970 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9078 resets, run finished after 1240 ms. (steps per millisecond=806 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9058 resets, run finished after 1045 ms. (steps per millisecond=956 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9131 resets, run finished after 1561 ms. (steps per millisecond=640 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9177 resets, run finished after 1169 ms. (steps per millisecond=855 ) properties (out of 6) seen :0
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:15:16] [INFO ] Computed 60 place invariants in 8 ms
[2022-05-14 11:15:16] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2022-05-14 11:15:16] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2022-05-14 11:15:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:15:16] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2022-05-14 11:15:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:15:16] [INFO ] [Nat]Absence check using 36 positive place invariants in 25 ms returned sat
[2022-05-14 11:15:16] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 231 ms returned sat
[2022-05-14 11:15:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:15:17] [INFO ] [Nat]Absence check using state equation in 401 ms returned sat
[2022-05-14 11:15:17] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 32 ms.
[2022-05-14 11:15:18] [INFO ] Added : 213 causal constraints over 43 iterations in 1499 ms. Result :sat
Minimization took 163 ms.
[2022-05-14 11:15:19] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2022-05-14 11:15:19] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 24 ms returned sat
[2022-05-14 11:15:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:15:19] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2022-05-14 11:15:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:15:19] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2022-05-14 11:15:19] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 149 ms returned sat
[2022-05-14 11:15:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:15:20] [INFO ] [Nat]Absence check using state equation in 639 ms returned sat
[2022-05-14 11:15:20] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 27 ms.
[2022-05-14 11:15:21] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2022-05-14 11:15:21] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2022-05-14 11:15:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 208 ms
[2022-05-14 11:15:21] [INFO ] Added : 124 causal constraints over 25 iterations in 1043 ms. Result :sat
Minimization took 243 ms.
[2022-05-14 11:15:21] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned sat
[2022-05-14 11:15:21] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2022-05-14 11:15:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:15:21] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2022-05-14 11:15:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:15:21] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2022-05-14 11:15:21] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 66 ms returned sat
[2022-05-14 11:15:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:15:22] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2022-05-14 11:15:22] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 1 ms to minimize.
[2022-05-14 11:15:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2022-05-14 11:15:22] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 45 ms.
[2022-05-14 11:15:23] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2022-05-14 11:15:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2022-05-14 11:15:23] [INFO ] Added : 80 causal constraints over 17 iterations in 786 ms. Result :sat
Minimization took 326 ms.
[2022-05-14 11:15:23] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2022-05-14 11:15:23] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 32 ms returned sat
[2022-05-14 11:15:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:15:23] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2022-05-14 11:15:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:15:24] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2022-05-14 11:15:24] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 97 ms returned sat
[2022-05-14 11:15:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:15:24] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2022-05-14 11:15:24] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 27 ms.
[2022-05-14 11:15:26] [INFO ] Added : 174 causal constraints over 35 iterations in 1510 ms. Result :sat
Minimization took 146 ms.
[2022-05-14 11:15:26] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2022-05-14 11:15:26] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 26 ms returned sat
[2022-05-14 11:15:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:15:26] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2022-05-14 11:15:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:15:26] [INFO ] [Nat]Absence check using 36 positive place invariants in 21 ms returned sat
[2022-05-14 11:15:26] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 140 ms returned sat
[2022-05-14 11:15:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:15:27] [INFO ] [Nat]Absence check using state equation in 669 ms returned sat
[2022-05-14 11:15:27] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 23 ms.
[2022-05-14 11:15:28] [INFO ] Added : 182 causal constraints over 37 iterations in 1325 ms. Result :sat
Minimization took 253 ms.
[2022-05-14 11:15:29] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2022-05-14 11:15:29] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 28 ms returned sat
[2022-05-14 11:15:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:15:29] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2022-05-14 11:15:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:15:29] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2022-05-14 11:15:29] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 193 ms returned sat
[2022-05-14 11:15:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:15:30] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2022-05-14 11:15:30] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 18 ms.
[2022-05-14 11:15:30] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2022-05-14 11:15:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2022-05-14 11:15:30] [INFO ] Added : 85 causal constraints over 18 iterations in 670 ms. Result :sat
Minimization took 186 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 190400 steps, including 12028 resets, run finished after 718 ms. (steps per millisecond=265 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 214700 steps, including 12226 resets, run finished after 517 ms. (steps per millisecond=415 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 203400 steps, including 11631 resets, run finished after 574 ms. (steps per millisecond=354 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 137300 steps, including 9119 resets, run finished after 432 ms. (steps per millisecond=317 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 54900 steps, including 3279 resets, run finished after 135 ms. (steps per millisecond=406 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 193100 steps, including 12437 resets, run finished after 468 ms. (steps per millisecond=412 ) properties (out of 6) seen :0 could not realise parikh vector
Support contains 6 out of 316 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 27 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 316/316 places, 262/262 transitions.
Starting structural reductions, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 15 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:15:34] [INFO ] Computed 60 place invariants in 7 ms
[2022-05-14 11:15:34] [INFO ] Implicit Places using invariants in 330 ms returned []
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:15:34] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-14 11:15:35] [INFO ] Implicit Places using invariants and state equation in 897 ms returned []
Implicit Place search using SMT with State Equation took 1231 ms to find 0 implicit places.
[2022-05-14 11:15:35] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:15:35] [INFO ] Computed 60 place invariants in 8 ms
[2022-05-14 11:15:35] [INFO ] Dead Transitions using invariants and state equation in 426 ms returned []
Finished structural reductions, in 1 iterations. Remains : 316/316 places, 262/262 transitions.
Starting property specific reduction for DES-PT-50b-UpperBounds-00
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:15:35] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 463 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 87 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:15:35] [INFO ] Computed 60 place invariants in 7 ms
[2022-05-14 11:15:35] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2022-05-14 11:15:35] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 22 ms returned sat
[2022-05-14 11:15:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:15:36] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2022-05-14 11:15:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:15:36] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2022-05-14 11:15:36] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 244 ms returned sat
[2022-05-14 11:15:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:15:36] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2022-05-14 11:15:36] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 18 ms.
[2022-05-14 11:15:38] [INFO ] Added : 213 causal constraints over 43 iterations in 1312 ms. Result :sat
Minimization took 191 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 193100 steps, including 12532 resets, run finished after 609 ms. (steps per millisecond=317 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 15 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 316/316 places, 262/262 transitions.
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:15:39] [INFO ] Computed 60 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 47727 resets, run finished after 2915 ms. (steps per millisecond=343 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9211 resets, run finished after 1362 ms. (steps per millisecond=734 ) properties (out of 1) seen :0
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:15:43] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-14 11:15:43] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2022-05-14 11:15:43] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 22 ms returned sat
[2022-05-14 11:15:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:15:43] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2022-05-14 11:15:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:15:43] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2022-05-14 11:15:43] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 147 ms returned sat
[2022-05-14 11:15:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:15:44] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2022-05-14 11:15:44] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 17 ms.
[2022-05-14 11:15:45] [INFO ] Added : 213 causal constraints over 43 iterations in 1387 ms. Result :sat
Minimization took 206 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 193100 steps, including 12497 resets, run finished after 670 ms. (steps per millisecond=288 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 13 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 316/316 places, 262/262 transitions.
Starting structural reductions, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 12 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:15:46] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-14 11:15:46] [INFO ] Implicit Places using invariants in 276 ms returned []
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:15:46] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-14 11:15:47] [INFO ] Implicit Places using invariants and state equation in 653 ms returned []
Implicit Place search using SMT with State Equation took 939 ms to find 0 implicit places.
[2022-05-14 11:15:47] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:15:47] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-14 11:15:47] [INFO ] Dead Transitions using invariants and state equation in 237 ms returned []
Finished structural reductions, in 1 iterations. Remains : 316/316 places, 262/262 transitions.
Ending property specific reduction for DES-PT-50b-UpperBounds-00 in 11853 ms.
Starting property specific reduction for DES-PT-50b-UpperBounds-04
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:15:47] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 459 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 84 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:15:47] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-14 11:15:47] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2022-05-14 11:15:47] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2022-05-14 11:15:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:15:47] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2022-05-14 11:15:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:15:48] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2022-05-14 11:15:48] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 161 ms returned sat
[2022-05-14 11:15:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:15:48] [INFO ] [Nat]Absence check using state equation in 636 ms returned sat
[2022-05-14 11:15:48] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 16 ms.
[2022-05-14 11:15:49] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 1 ms to minimize.
[2022-05-14 11:15:49] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 1 ms to minimize.
[2022-05-14 11:15:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 294 ms
[2022-05-14 11:15:49] [INFO ] Added : 124 causal constraints over 25 iterations in 939 ms. Result :sat
Minimization took 241 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 54900 steps, including 3244 resets, run finished after 217 ms. (steps per millisecond=252 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 20 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 316/316 places, 262/262 transitions.
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:15:50] [INFO ] Computed 60 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 47545 resets, run finished after 2550 ms. (steps per millisecond=392 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9200 resets, run finished after 1010 ms. (steps per millisecond=990 ) properties (out of 1) seen :0
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:15:53] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-14 11:15:53] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned sat
[2022-05-14 11:15:53] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2022-05-14 11:15:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:15:54] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2022-05-14 11:15:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:15:54] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2022-05-14 11:15:54] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 211 ms returned sat
[2022-05-14 11:15:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:15:55] [INFO ] [Nat]Absence check using state equation in 568 ms returned sat
[2022-05-14 11:15:55] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 17 ms.
[2022-05-14 11:15:55] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2022-05-14 11:15:55] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2022-05-14 11:15:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 194 ms
[2022-05-14 11:15:55] [INFO ] Added : 124 causal constraints over 25 iterations in 800 ms. Result :sat
Minimization took 240 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 54900 steps, including 3285 resets, run finished after 220 ms. (steps per millisecond=249 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 19 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 316/316 places, 262/262 transitions.
Starting structural reductions, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 18 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:15:56] [INFO ] Computed 60 place invariants in 10 ms
[2022-05-14 11:15:56] [INFO ] Implicit Places using invariants in 510 ms returned []
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:15:56] [INFO ] Computed 60 place invariants in 7 ms
[2022-05-14 11:15:57] [INFO ] Implicit Places using invariants and state equation in 828 ms returned []
Implicit Place search using SMT with State Equation took 1340 ms to find 0 implicit places.
[2022-05-14 11:15:57] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:15:57] [INFO ] Computed 60 place invariants in 6 ms
[2022-05-14 11:15:58] [INFO ] Dead Transitions using invariants and state equation in 360 ms returned []
Finished structural reductions, in 1 iterations. Remains : 316/316 places, 262/262 transitions.
Ending property specific reduction for DES-PT-50b-UpperBounds-04 in 10445 ms.
Starting property specific reduction for DES-PT-50b-UpperBounds-09
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:15:58] [INFO ] Computed 60 place invariants in 6 ms
Incomplete random walk after 10000 steps, including 488 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:15:58] [INFO ] Computed 60 place invariants in 6 ms
[2022-05-14 11:15:58] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2022-05-14 11:15:58] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 30 ms returned sat
[2022-05-14 11:15:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:15:58] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2022-05-14 11:15:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:15:58] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2022-05-14 11:15:58] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 64 ms returned sat
[2022-05-14 11:15:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:15:58] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2022-05-14 11:15:59] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 0 ms to minimize.
[2022-05-14 11:15:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2022-05-14 11:15:59] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 27 ms.
[2022-05-14 11:15:59] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2022-05-14 11:15:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2022-05-14 11:15:59] [INFO ] Added : 80 causal constraints over 17 iterations in 750 ms. Result :sat
Minimization took 322 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 137300 steps, including 9133 resets, run finished after 531 ms. (steps per millisecond=258 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 20 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 316/316 places, 262/262 transitions.
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:16:00] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 47745 resets, run finished after 2336 ms. (steps per millisecond=428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9038 resets, run finished after 992 ms. (steps per millisecond=1008 ) properties (out of 1) seen :0
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:16:04] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-14 11:16:04] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned sat
[2022-05-14 11:16:04] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2022-05-14 11:16:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:16:04] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2022-05-14 11:16:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:16:04] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2022-05-14 11:16:04] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 37 ms returned sat
[2022-05-14 11:16:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:16:04] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2022-05-14 11:16:04] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2022-05-14 11:16:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2022-05-14 11:16:04] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 24 ms.
[2022-05-14 11:16:05] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2022-05-14 11:16:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2022-05-14 11:16:05] [INFO ] Added : 80 causal constraints over 17 iterations in 709 ms. Result :sat
Minimization took 323 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 137300 steps, including 9117 resets, run finished after 541 ms. (steps per millisecond=253 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 17 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 316/316 places, 262/262 transitions.
Starting structural reductions, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 17 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:16:06] [INFO ] Computed 60 place invariants in 7 ms
[2022-05-14 11:16:06] [INFO ] Implicit Places using invariants in 468 ms returned []
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:16:06] [INFO ] Computed 60 place invariants in 7 ms
[2022-05-14 11:16:07] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 1335 ms to find 0 implicit places.
[2022-05-14 11:16:07] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:16:07] [INFO ] Computed 60 place invariants in 6 ms
[2022-05-14 11:16:08] [INFO ] Dead Transitions using invariants and state equation in 372 ms returned []
Finished structural reductions, in 1 iterations. Remains : 316/316 places, 262/262 transitions.
Ending property specific reduction for DES-PT-50b-UpperBounds-09 in 10071 ms.
Starting property specific reduction for DES-PT-50b-UpperBounds-10
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:16:08] [INFO ] Computed 60 place invariants in 6 ms
Incomplete random walk after 10000 steps, including 484 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:16:08] [INFO ] Computed 60 place invariants in 6 ms
[2022-05-14 11:16:08] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2022-05-14 11:16:08] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 21 ms returned sat
[2022-05-14 11:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:16:08] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2022-05-14 11:16:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:16:08] [INFO ] [Nat]Absence check using 36 positive place invariants in 19 ms returned sat
[2022-05-14 11:16:08] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 106 ms returned sat
[2022-05-14 11:16:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:16:09] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2022-05-14 11:16:09] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 27 ms.
[2022-05-14 11:16:10] [INFO ] Added : 174 causal constraints over 35 iterations in 1451 ms. Result :sat
Minimization took 143 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 203400 steps, including 11652 resets, run finished after 680 ms. (steps per millisecond=299 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 9 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 316/316 places, 262/262 transitions.
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:16:11] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 47787 resets, run finished after 2564 ms. (steps per millisecond=390 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8973 resets, run finished after 999 ms. (steps per millisecond=1001 ) properties (out of 1) seen :0
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:16:15] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-14 11:16:15] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2022-05-14 11:16:15] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2022-05-14 11:16:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:16:15] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2022-05-14 11:16:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:16:15] [INFO ] [Nat]Absence check using 36 positive place invariants in 9 ms returned sat
[2022-05-14 11:16:15] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 60 ms returned sat
[2022-05-14 11:16:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:16:15] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2022-05-14 11:16:15] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 17 ms.
[2022-05-14 11:16:17] [INFO ] Added : 174 causal constraints over 35 iterations in 1412 ms. Result :sat
Minimization took 151 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 203400 steps, including 11680 resets, run finished after 676 ms. (steps per millisecond=300 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 14 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 316/316 places, 262/262 transitions.
Starting structural reductions, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 9 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:16:17] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-14 11:16:18] [INFO ] Implicit Places using invariants in 305 ms returned []
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:16:18] [INFO ] Computed 60 place invariants in 7 ms
[2022-05-14 11:16:19] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 1213 ms to find 0 implicit places.
[2022-05-14 11:16:19] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:16:19] [INFO ] Computed 60 place invariants in 6 ms
[2022-05-14 11:16:19] [INFO ] Dead Transitions using invariants and state equation in 390 ms returned []
Finished structural reductions, in 1 iterations. Remains : 316/316 places, 262/262 transitions.
Ending property specific reduction for DES-PT-50b-UpperBounds-10 in 11466 ms.
Starting property specific reduction for DES-PT-50b-UpperBounds-13
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:16:19] [INFO ] Computed 60 place invariants in 6 ms
Incomplete random walk after 10000 steps, including 467 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:16:19] [INFO ] Computed 60 place invariants in 6 ms
[2022-05-14 11:16:19] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2022-05-14 11:16:19] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 28 ms returned sat
[2022-05-14 11:16:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:16:20] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2022-05-14 11:16:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:16:20] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2022-05-14 11:16:20] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 120 ms returned sat
[2022-05-14 11:16:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:16:20] [INFO ] [Nat]Absence check using state equation in 613 ms returned sat
[2022-05-14 11:16:20] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 16 ms.
[2022-05-14 11:16:22] [INFO ] Added : 182 causal constraints over 37 iterations in 1240 ms. Result :sat
Minimization took 253 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 214700 steps, including 12245 resets, run finished after 838 ms. (steps per millisecond=256 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 14 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 316/316 places, 262/262 transitions.
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:16:23] [INFO ] Computed 60 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 47812 resets, run finished after 2991 ms. (steps per millisecond=334 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9014 resets, run finished after 1001 ms. (steps per millisecond=999 ) properties (out of 1) seen :0
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:16:27] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-14 11:16:27] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2022-05-14 11:16:27] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2022-05-14 11:16:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:16:27] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2022-05-14 11:16:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:16:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2022-05-14 11:16:27] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 83 ms returned sat
[2022-05-14 11:16:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:16:28] [INFO ] [Nat]Absence check using state equation in 613 ms returned sat
[2022-05-14 11:16:28] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 17 ms.
[2022-05-14 11:16:29] [INFO ] Added : 182 causal constraints over 37 iterations in 1048 ms. Result :sat
Minimization took 233 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 214700 steps, including 12080 resets, run finished after 730 ms. (steps per millisecond=294 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 9 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 316/316 places, 262/262 transitions.
Starting structural reductions, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 8 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:16:30] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-14 11:16:30] [INFO ] Implicit Places using invariants in 295 ms returned []
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:16:30] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-14 11:16:31] [INFO ] Implicit Places using invariants and state equation in 780 ms returned []
Implicit Place search using SMT with State Equation took 1077 ms to find 0 implicit places.
[2022-05-14 11:16:31] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:16:31] [INFO ] Computed 60 place invariants in 6 ms
[2022-05-14 11:16:31] [INFO ] Dead Transitions using invariants and state equation in 376 ms returned []
Finished structural reductions, in 1 iterations. Remains : 316/316 places, 262/262 transitions.
Ending property specific reduction for DES-PT-50b-UpperBounds-13 in 12231 ms.
Starting property specific reduction for DES-PT-50b-UpperBounds-15
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:16:31] [INFO ] Computed 60 place invariants in 6 ms
Incomplete random walk after 10000 steps, including 480 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 99 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:16:31] [INFO ] Computed 60 place invariants in 6 ms
[2022-05-14 11:16:31] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2022-05-14 11:16:32] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 29 ms returned sat
[2022-05-14 11:16:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:16:32] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2022-05-14 11:16:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:16:32] [INFO ] [Nat]Absence check using 36 positive place invariants in 19 ms returned sat
[2022-05-14 11:16:32] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 197 ms returned sat
[2022-05-14 11:16:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:16:33] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2022-05-14 11:16:33] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 26 ms.
[2022-05-14 11:16:33] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2022-05-14 11:16:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2022-05-14 11:16:33] [INFO ] Added : 85 causal constraints over 18 iterations in 950 ms. Result :sat
Minimization took 244 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 190400 steps, including 12112 resets, run finished after 653 ms. (steps per millisecond=291 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 8 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 316/316 places, 262/262 transitions.
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:16:34] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 47692 resets, run finished after 2175 ms. (steps per millisecond=459 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9111 resets, run finished after 998 ms. (steps per millisecond=1002 ) properties (out of 1) seen :0
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:16:38] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-14 11:16:38] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2022-05-14 11:16:38] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2022-05-14 11:16:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:16:38] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2022-05-14 11:16:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:16:38] [INFO ] [Nat]Absence check using 36 positive place invariants in 19 ms returned sat
[2022-05-14 11:16:38] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 195 ms returned sat
[2022-05-14 11:16:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:16:39] [INFO ] [Nat]Absence check using state equation in 393 ms returned sat
[2022-05-14 11:16:39] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 26 ms.
[2022-05-14 11:16:39] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 0 ms to minimize.
[2022-05-14 11:16:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2022-05-14 11:16:40] [INFO ] Added : 85 causal constraints over 18 iterations in 991 ms. Result :sat
Minimization took 243 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 190400 steps, including 12013 resets, run finished after 740 ms. (steps per millisecond=257 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 14 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 316/316 places, 262/262 transitions.
Starting structural reductions, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 13 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:16:41] [INFO ] Computed 60 place invariants in 7 ms
[2022-05-14 11:16:41] [INFO ] Implicit Places using invariants in 455 ms returned []
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:16:41] [INFO ] Computed 60 place invariants in 6 ms
[2022-05-14 11:16:42] [INFO ] Implicit Places using invariants and state equation in 807 ms returned []
Implicit Place search using SMT with State Equation took 1264 ms to find 0 implicit places.
[2022-05-14 11:16:42] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 262 rows 316 cols
[2022-05-14 11:16:42] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-14 11:16:42] [INFO ] Dead Transitions using invariants and state equation in 192 ms returned []
Finished structural reductions, in 1 iterations. Remains : 316/316 places, 262/262 transitions.
Ending property specific reduction for DES-PT-50b-UpperBounds-15 in 10768 ms.
[2022-05-14 11:16:43] [INFO ] Flatten gal took : 170 ms
[2022-05-14 11:16:43] [INFO ] Applying decomposition
[2022-05-14 11:16:43] [INFO ] Flatten gal took : 69 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/graph12428782750542541139.txt, -o, /tmp/graph12428782750542541139.bin, -w, /tmp/graph12428782750542541139.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/graph12428782750542541139.bin, -l, -1, -v, -w, /tmp/graph12428782750542541139.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-14 11:16:43] [INFO ] Decomposing Gal with order
[2022-05-14 11:16:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 11:16:43] [INFO ] Removed a total of 47 redundant transitions.
[2022-05-14 11:16:43] [INFO ] Flatten gal took : 117 ms
[2022-05-14 11:16:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 14 ms.
[2022-05-14 11:16:43] [INFO ] Time to serialize gal into /tmp/UpperBounds9727442167759520055.gal : 17 ms
[2022-05-14 11:16:43] [INFO ] Time to serialize properties into /tmp/UpperBounds12655957455882804435.prop : 0 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/UpperBounds9727442167759520055.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds12655957455882804435.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/UpperBounds9727442167759520055.gal -t CGAL -reachable-file /tmp/UpperBounds12655957455882804435.prop --nowitness
Loading property file /tmp/UpperBounds12655957455882804435.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,6.83126e+13,174.184,2118800,91874,9002,3.69877e+06,16756,313,1.09996e+07,456,138411,0
Total reachable state count : 68312609047672

Verifying 6 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-50b-UpperBounds-00 :0 <= u15.p16 <= 1
FORMULA DES-PT-50b-UpperBounds-00 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-50b-UpperBounds-00,0,219.405,2119860,1,0,3.69877e+06,143145,495,1.09996e+07,606,580708,16737
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-50b-UpperBounds-04 :0 <= u15.p46 <= 1
FORMULA DES-PT-50b-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-50b-UpperBounds-04,0,233.139,2120388,1,0,3.69877e+06,196019,522,1.14119e+07,625,729287,16950
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-50b-UpperBounds-09 :0 <= u14.p134 <= 1
FORMULA DES-PT-50b-UpperBounds-09 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-50b-UpperBounds-09,0,246.253,2120388,1,0,3.69877e+06,203550,552,1.32593e+07,674,759141,22425
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-50b-UpperBounds-10 :0 <= u2.p181 <= 1
FORMULA DES-PT-50b-UpperBounds-10 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-50b-UpperBounds-10,0,246.254,2120388,1,0,3.69877e+06,203581,587,1.32593e+07,737,759202,22452
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-50b-UpperBounds-13 :0 <= u2.p172 <= 1
FORMULA DES-PT-50b-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-50b-UpperBounds-13,0,246.255,2120388,1,0,3.69877e+06,203621,602,1.32593e+07,818,759281,22478
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-50b-UpperBounds-15 :0 <= u49.p95 <= 1
FORMULA DES-PT-50b-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-50b-UpperBounds-15,0,285.905,2126264,1,0,3.69877e+06,237819,629,1.83772e+07,845,850052,26679
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1652527291272

--------------------
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-50b"
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-50b, 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-165252115900196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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