Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r179-tall-165277027200373.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 QuasiCertifProtocol-PT-28, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277027200373
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 47K Apr 30 13:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 326K Apr 30 13:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 30 13:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 110K Apr 30 13:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 57K May 9 08:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 242K May 9 08:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 9 08:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 9 08:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 9 08:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.8K May 9 08:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 749K May 10 09:34 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652842496658

Running Version 0
[2022-05-18 02:54:58] [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-18 02:54:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 02:54:58] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2022-05-18 02:54:58] [INFO ] Transformed 2998 places.
[2022-05-18 02:54:58] [INFO ] Transformed 446 transitions.
[2022-05-18 02:54:58] [INFO ] Parsed PT model containing 2998 places and 446 transitions in 246 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
// Phase 1: matrix 446 rows 2998 cols
[2022-05-18 02:54:58] [INFO ] Computed 2553 place invariants in 165 ms
Incomplete random walk after 10000 steps, including 302 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 16) seen :69
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-14 16 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :47
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :47
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :47
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) seen :50
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :47
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :50
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) seen :57
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :49
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :47
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :49
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :47
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :46
// Phase 1: matrix 446 rows 2998 cols
[2022-05-18 02:54:59] [INFO ] Computed 2553 place invariants in 73 ms
[2022-05-18 02:54:59] [INFO ] [Real]Absence check using 32 positive place invariants in 92 ms returned sat
[2022-05-18 02:55:00] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 589 ms returned sat
[2022-05-18 02:55:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:55:01] [INFO ] [Real]Absence check using state equation in 923 ms returned sat
[2022-05-18 02:55:01] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 43 ms.
[2022-05-18 02:55:03] [INFO ] Added : 135 causal constraints over 27 iterations in 2489 ms. Result :sat
Minimization took 261 ms.
[2022-05-18 02:55:04] [INFO ] [Real]Absence check using 32 positive place invariants in 61 ms returned sat
[2022-05-18 02:55:05] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 487 ms returned sat
[2022-05-18 02:55:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:55:07] [INFO ] [Real]Absence check using state equation in 2164 ms returned sat
[2022-05-18 02:55:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:55:07] [INFO ] [Nat]Absence check using 32 positive place invariants in 59 ms returned sat
[2022-05-18 02:55:08] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 481 ms returned sat
[2022-05-18 02:55:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:55:08] [INFO ] [Nat]Absence check using state equation in 899 ms returned sat
[2022-05-18 02:55:09] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 32 ms.
[2022-05-18 02:55:10] [INFO ] Added : 119 causal constraints over 24 iterations in 1858 ms. Result :sat
Minimization took 425 ms.
[2022-05-18 02:55:11] [INFO ] [Real]Absence check using 32 positive place invariants in 64 ms returned sat
[2022-05-18 02:55:12] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 471 ms returned sat
[2022-05-18 02:55:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:55:13] [INFO ] [Real]Absence check using state equation in 1049 ms returned sat
[2022-05-18 02:55:13] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 34 ms.
[2022-05-18 02:55:15] [INFO ] Added : 122 causal constraints over 25 iterations in 2052 ms. Result :sat
Minimization took 262 ms.
[2022-05-18 02:55:16] [INFO ] [Real]Absence check using 32 positive place invariants in 54 ms returned sat
[2022-05-18 02:55:16] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 450 ms returned sat
[2022-05-18 02:55:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:55:17] [INFO ] [Real]Absence check using state equation in 910 ms returned sat
[2022-05-18 02:55:17] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 35 ms.
[2022-05-18 02:55:19] [INFO ] Added : 135 causal constraints over 27 iterations in 2372 ms. Result :sat
Minimization took 596 ms.
[2022-05-18 02:55:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:55:20] [INFO ] [Nat]Absence check using 32 positive place invariants in 78 ms returned sat
[2022-05-18 02:55:21] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 493 ms returned sat
[2022-05-18 02:55:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:55:22] [INFO ] [Nat]Absence check using state equation in 923 ms returned sat
[2022-05-18 02:55:22] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 51 ms.
[2022-05-18 02:55:24] [INFO ] Added : 135 causal constraints over 27 iterations in 2047 ms. Result :sat
Minimization took 642 ms.
[2022-05-18 02:55:25] [INFO ] [Real]Absence check using 32 positive place invariants in 53 ms returned sat
[2022-05-18 02:55:25] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 466 ms returned sat
[2022-05-18 02:55:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:55:29] [INFO ] [Real]Absence check using state equation in 3067 ms returned sat
[2022-05-18 02:55:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:55:29] [INFO ] [Nat]Absence check using 32 positive place invariants in 50 ms returned sat
[2022-05-18 02:55:29] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 500 ms returned sat
[2022-05-18 02:55:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:55:31] [INFO ] [Nat]Absence check using state equation in 1682 ms returned sat
[2022-05-18 02:55:31] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 30 ms.
[2022-05-18 02:55:32] [INFO ] Added : 63 causal constraints over 13 iterations in 993 ms. Result :sat
Minimization took 402 ms.
[2022-05-18 02:55:33] [INFO ] [Real]Absence check using 32 positive place invariants in 50 ms returned sat
[2022-05-18 02:55:33] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 498 ms returned sat
[2022-05-18 02:55:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:55:35] [INFO ] [Real]Absence check using state equation in 1390 ms returned sat
[2022-05-18 02:55:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:55:35] [INFO ] [Nat]Absence check using 32 positive place invariants in 50 ms returned sat
[2022-05-18 02:55:36] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 496 ms returned sat
[2022-05-18 02:55:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:55:37] [INFO ] [Nat]Absence check using state equation in 1312 ms returned sat
[2022-05-18 02:55:37] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 29 ms.
[2022-05-18 02:55:38] [INFO ] Added : 64 causal constraints over 13 iterations in 1031 ms. Result :sat
Minimization took 207 ms.
[2022-05-18 02:55:38] [INFO ] [Real]Absence check using 32 positive place invariants in 49 ms returned sat
[2022-05-18 02:55:39] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 452 ms returned sat
[2022-05-18 02:55:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:55:40] [INFO ] [Real]Absence check using state equation in 1192 ms returned sat
[2022-05-18 02:55:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:55:40] [INFO ] [Nat]Absence check using 32 positive place invariants in 50 ms returned sat
[2022-05-18 02:55:41] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 441 ms returned sat
[2022-05-18 02:55:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:55:45] [INFO ] [Nat]Absence check using state equation in 4318 ms returned unknown
[2022-05-18 02:55:46] [INFO ] [Real]Absence check using 32 positive place invariants in 54 ms returned sat
[2022-05-18 02:55:46] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 511 ms returned unsat
[2022-05-18 02:55:46] [INFO ] [Real]Absence check using 32 positive place invariants in 50 ms returned sat
[2022-05-18 02:55:47] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 500 ms returned sat
[2022-05-18 02:55:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:55:51] [INFO ] [Real]Absence check using state equation in 4230 ms returned unknown
[2022-05-18 02:55:51] [INFO ] [Real]Absence check using 32 positive place invariants in 54 ms returned sat
[2022-05-18 02:55:52] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 536 ms returned sat
[2022-05-18 02:55:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:55:54] [INFO ] [Real]Absence check using state equation in 1863 ms returned sat
[2022-05-18 02:55:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:55:54] [INFO ] [Nat]Absence check using 32 positive place invariants in 55 ms returned sat
[2022-05-18 02:55:55] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 534 ms returned sat
[2022-05-18 02:55:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:55:57] [INFO ] [Nat]Absence check using state equation in 1719 ms returned sat
[2022-05-18 02:55:57] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 27 ms.
[2022-05-18 02:55:58] [INFO ] Added : 59 causal constraints over 12 iterations in 968 ms. Result :sat
Minimization took 205 ms.
[2022-05-18 02:55:58] [INFO ] [Real]Absence check using 32 positive place invariants in 50 ms returned sat
[2022-05-18 02:55:59] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 508 ms returned sat
[2022-05-18 02:55:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:56:00] [INFO ] [Real]Absence check using state equation in 1039 ms returned sat
[2022-05-18 02:56:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:56:00] [INFO ] [Nat]Absence check using 32 positive place invariants in 50 ms returned sat
[2022-05-18 02:56:00] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 474 ms returned sat
[2022-05-18 02:56:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:56:04] [INFO ] [Nat]Absence check using state equation in 3719 ms returned sat
[2022-05-18 02:56:04] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 28 ms.
[2022-05-18 02:56:07] [INFO ] Deduced a trap composed of 10 places in 2663 ms of which 17 ms to minimize.
[2022-05-18 02:56:07] [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 10
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-18 02:56:08] [INFO ] [Real]Absence check using 32 positive place invariants in 52 ms returned sat
[2022-05-18 02:56:08] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 478 ms returned sat
[2022-05-18 02:56:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:56:09] [INFO ] [Real]Absence check using state equation in 1025 ms returned sat
[2022-05-18 02:56:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:56:10] [INFO ] [Nat]Absence check using 32 positive place invariants in 51 ms returned sat
[2022-05-18 02:56:10] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 498 ms returned sat
[2022-05-18 02:56:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:56:11] [INFO ] [Nat]Absence check using state equation in 923 ms returned sat
[2022-05-18 02:56:11] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 26 ms.
[2022-05-18 02:56:13] [INFO ] Added : 121 causal constraints over 25 iterations in 1909 ms. Result :sat
Minimization took 207 ms.
[2022-05-18 02:56:13] [INFO ] [Real]Absence check using 32 positive place invariants in 52 ms returned sat
[2022-05-18 02:56:14] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 496 ms returned sat
[2022-05-18 02:56:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:56:15] [INFO ] [Real]Absence check using state equation in 1053 ms returned sat
[2022-05-18 02:56:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:56:15] [INFO ] [Nat]Absence check using 32 positive place invariants in 52 ms returned sat
[2022-05-18 02:56:16] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 514 ms returned sat
[2022-05-18 02:56:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:56:17] [INFO ] [Nat]Absence check using state equation in 1322 ms returned sat
[2022-05-18 02:56:17] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 30 ms.
[2022-05-18 02:56:19] [INFO ] Added : 119 causal constraints over 24 iterations in 1815 ms. Result :sat
Minimization took 206 ms.
[2022-05-18 02:56:20] [INFO ] [Real]Absence check using 32 positive place invariants in 48 ms returned sat
[2022-05-18 02:56:20] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 456 ms returned sat
[2022-05-18 02:56:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:56:21] [INFO ] [Real]Absence check using state equation in 1058 ms returned sat
[2022-05-18 02:56:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 02:56:22] [INFO ] [Nat]Absence check using 32 positive place invariants in 50 ms returned sat
[2022-05-18 02:56:22] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 500 ms returned sat
[2022-05-18 02:56:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 02:56:23] [INFO ] [Nat]Absence check using state equation in 933 ms returned sat
[2022-05-18 02:56:23] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 27 ms.
[2022-05-18 02:56:25] [INFO ] Added : 121 causal constraints over 25 iterations in 1949 ms. Result :sat
Minimization took 227 ms.
Current structural bounds on expressions (after SMT) : [1, 841, 841, -1, -1, 1, -1, 29, 29, -1, -1, 29, 29, 29] Max seen :[0, 0, 0, 0, 0, 0, 28, 29, 0, 0, 0, 0, 0, 0]
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-07 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 17200 steps, including 144 resets, run finished after 264 ms. (steps per millisecond=65 ) properties (out of 13) seen :133 could not realise parikh vector
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 16700 steps, including 136 resets, run finished after 234 ms. (steps per millisecond=71 ) properties (out of 12) seen :130 could not realise parikh vector
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 17200 steps, including 145 resets, run finished after 245 ms. (steps per millisecond=70 ) properties (out of 11) seen :133 could not realise parikh vector
Incomplete Parikh walk after 6100 steps, including 99 resets, run finished after 42 ms. (steps per millisecond=145 ) properties (out of 11) seen :58 could not realise parikh vector
Incomplete Parikh walk after 6600 steps, including 99 resets, run finished after 49 ms. (steps per millisecond=134 ) properties (out of 11) seen :60 could not realise parikh vector
Incomplete Parikh walk after 6600 steps, including 99 resets, run finished after 45 ms. (steps per millisecond=146 ) properties (out of 11) seen :60 could not realise parikh vector
Incomplete Parikh walk after 19500 steps, including 168 resets, run finished after 258 ms. (steps per millisecond=75 ) properties (out of 11) seen :132 could not realise parikh vector
Incomplete Parikh walk after 20800 steps, including 194 resets, run finished after 321 ms. (steps per millisecond=64 ) properties (out of 11) seen :151 could not realise parikh vector
Incomplete Parikh walk after 12500 steps, including 118 resets, run finished after 129 ms. (steps per millisecond=96 ) properties (out of 11) seen :96 could not realise parikh vector
Support contains 149 out of 2998 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2935 are kept as prefixes of interest. Removing 63 places using SCC suffix rule.20 ms
Discarding 63 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 148 transitions
Reduce isomorphic transitions removed 148 transitions.
Discarding 57 places :
Implicit places reduction removed 57 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 206 rules applied. Total rules applied 207 place count 2878 transition count 295
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 208 place count 2877 transition count 295
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 208 place count 2877 transition count 267
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 264 place count 2849 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 265 place count 2848 transition count 266
Ensure Unique test removed 29 places
Iterating post reduction 2 with 29 rules applied. Total rules applied 294 place count 2819 transition count 266
Applied a total of 294 rules in 703 ms. Remains 2819 /2998 variables (removed 179) and now considering 266/446 (removed 180) transitions.
Finished structural reductions, in 1 iterations. Remains : 2819/2998 places, 266/446 transitions.
// Phase 1: matrix 266 rows 2819 cols
[2022-05-18 02:56:28] [INFO ] Computed 2553 place invariants in 22 ms
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-02 29 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 1000000 steps, including 9262 resets, run finished after 8917 ms. (steps per millisecond=112 ) properties (out of 8) seen :112
Interrupted Best-First random walk after 894124 steps, including 413 resets, run timeout after 5001 ms. (steps per millisecond=178 ) properties seen :{0=29, 1=14, 2=29, 3=29, 4=1, 5=1, 6=1, 7=1}
Incomplete Best-First random walk after 1000001 steps, including 522 resets, run finished after 4559 ms. (steps per millisecond=219 ) properties (out of 8) seen :111
Incomplete Best-First random walk after 1000001 steps, including 533 resets, run finished after 4370 ms. (steps per millisecond=228 ) properties (out of 8) seen :80
Incomplete Best-First random walk after 1000000 steps, including 524 resets, run finished after 4585 ms. (steps per millisecond=218 ) properties (out of 8) seen :110
Interrupted Best-First random walk after 804580 steps, including 297 resets, run timeout after 5001 ms. (steps per millisecond=160 ) properties seen :{0=19, 1=29, 2=29, 3=29, 4=1, 5=1, 6=1, 7=1}
Incomplete Best-First random walk after 1000001 steps, including 533 resets, run finished after 3974 ms. (steps per millisecond=251 ) properties (out of 8) seen :81
Incomplete Best-First random walk after 1000001 steps, including 525 resets, run finished after 4063 ms. (steps per millisecond=246 ) properties (out of 8) seen :111
Incomplete Best-First random walk after 1000000 steps, including 521 resets, run finished after 4131 ms. (steps per millisecond=242 ) properties (out of 8) seen :111
// Phase 1: matrix 266 rows 2819 cols
[2022-05-18 02:57:12] [INFO ] Computed 2553 place invariants in 25 ms
[2022-05-18 02:57:13] [INFO ] [Real]Absence check using 867 positive place invariants in 206 ms returned sat
[2022-05-18 02:57:13] [INFO ] [Real]Absence check using 867 positive and 1686 generalized place invariants in 345 ms returned sat
[2022-05-18 02:57:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:57:16] [INFO ] [Real]Absence check using state equation in 2556 ms returned unsat
[2022-05-18 02:57:16] [INFO ] [Real]Absence check using 867 positive place invariants in 185 ms returned sat
[2022-05-18 02:57:16] [INFO ] [Real]Absence check using 867 positive and 1686 generalized place invariants in 319 ms returned sat
[2022-05-18 02:57:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:57:18] [INFO ] [Real]Absence check using state equation in 1265 ms returned unsat
[2022-05-18 02:57:18] [INFO ] [Real]Absence check using 867 positive place invariants in 182 ms returned sat
[2022-05-18 02:57:18] [INFO ] [Real]Absence check using 867 positive and 1686 generalized place invariants in 324 ms returned unsat
[2022-05-18 02:57:19] [INFO ] [Real]Absence check using 867 positive place invariants in 193 ms returned sat
[2022-05-18 02:57:19] [INFO ] [Real]Absence check using 867 positive and 1686 generalized place invariants in 350 ms returned unsat
[2022-05-18 02:57:19] [INFO ] [Real]Absence check using 867 positive place invariants in 186 ms returned sat
[2022-05-18 02:57:20] [INFO ] [Real]Absence check using 867 positive and 1686 generalized place invariants in 359 ms returned sat
[2022-05-18 02:57:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:57:21] [INFO ] [Real]Absence check using state equation in 1193 ms returned unsat
[2022-05-18 02:57:21] [INFO ] [Real]Absence check using 867 positive place invariants in 184 ms returned sat
[2022-05-18 02:57:21] [INFO ] [Real]Absence check using 867 positive and 1686 generalized place invariants in 153 ms returned unsat
[2022-05-18 02:57:22] [INFO ] [Real]Absence check using 867 positive place invariants in 182 ms returned sat
[2022-05-18 02:57:22] [INFO ] [Real]Absence check using 867 positive and 1686 generalized place invariants in 344 ms returned sat
[2022-05-18 02:57:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:57:23] [INFO ] [Real]Absence check using state equation in 527 ms returned unsat
[2022-05-18 02:57:23] [INFO ] [Real]Absence check using 867 positive place invariants in 193 ms returned sat
[2022-05-18 02:57:23] [INFO ] [Real]Absence check using 867 positive and 1686 generalized place invariants in 330 ms returned sat
[2022-05-18 02:57:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 02:57:24] [INFO ] [Real]Absence check using state equation in 936 ms returned unsat
Current structural bounds on expressions (after SMT) : [29, 29, 29, 29, 1, 1, 1, 1] Max seen :[29, 29, 29, 29, 1, 1, 1, 1]
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-06 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-04 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-03 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-01 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652842648905

--------------------
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="QuasiCertifProtocol-PT-28"
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 QuasiCertifProtocol-PT-28, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-165277027200373"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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