Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 74K Feb 26 01:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 454K Feb 26 01:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 113K Feb 26 01:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 21K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 223K Feb 26 01:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.3M Feb 26 01:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 53K Feb 26 01:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 343K Feb 26 01:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 942K Mar 5 18:23 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-32-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678882113834

Running Version 202205111006
[2023-03-15 12:08:35] [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]
[2023-03-15 12:08:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 12:08:35] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2023-03-15 12:08:35] [INFO ] Transformed 3806 places.
[2023-03-15 12:08:35] [INFO ] Transformed 506 transitions.
[2023-03-15 12:08:35] [INFO ] Parsed PT model containing 3806 places and 506 transitions in 277 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 506 rows 3806 cols
[2023-03-15 12:08:35] [INFO ] Computed 3301 place invariants in 178 ms
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-03 19 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 267 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 15) seen :41
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-13 19 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-02 19 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :3
// Phase 1: matrix 506 rows 3806 cols
[2023-03-15 12:08:36] [INFO ] Computed 3301 place invariants in 92 ms
[2023-03-15 12:08:36] [INFO ] [Real]Absence check using 3 positive place invariants in 45 ms returned sat
[2023-03-15 12:08:37] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 720 ms returned sat
[2023-03-15 12:08:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:08:38] [INFO ] [Real]Absence check using state equation in 1310 ms returned sat
[2023-03-15 12:08:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:08:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 44 ms returned sat
[2023-03-15 12:08:40] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 802 ms returned sat
[2023-03-15 12:08:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:08:41] [INFO ] [Nat]Absence check using state equation in 1327 ms returned sat
[2023-03-15 12:08:41] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 47 ms.
[2023-03-15 12:08:42] [INFO ] Added : 67 causal constraints over 14 iterations in 1441 ms. Result :sat
Minimization took 192 ms.
[2023-03-15 12:08:43] [INFO ] [Real]Absence check using 3 positive place invariants in 54 ms returned sat
[2023-03-15 12:08:44] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 726 ms returned sat
[2023-03-15 12:08:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:08:45] [INFO ] [Real]Absence check using state equation in 1260 ms returned sat
[2023-03-15 12:08:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:08:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 43 ms returned sat
[2023-03-15 12:08:46] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 779 ms returned sat
[2023-03-15 12:08:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:08:48] [INFO ] [Nat]Absence check using state equation in 1360 ms returned sat
[2023-03-15 12:08:48] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 48 ms.
[2023-03-15 12:08:50] [INFO ] Added : 102 causal constraints over 21 iterations in 1957 ms. Result :sat
Minimization took 307 ms.
[2023-03-15 12:08:50] [INFO ] [Real]Absence check using 3 positive place invariants in 33 ms returned sat
[2023-03-15 12:08:51] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 735 ms returned sat
[2023-03-15 12:08:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:08:53] [INFO ] [Real]Absence check using state equation in 1385 ms returned sat
[2023-03-15 12:08:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:08:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 35 ms returned sat
[2023-03-15 12:08:54] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 722 ms returned sat
[2023-03-15 12:08:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:08:55] [INFO ] [Nat]Absence check using state equation in 1326 ms returned sat
[2023-03-15 12:08:55] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 66 ms.
[2023-03-15 12:09:02] [INFO ] Deduced a trap composed of 5 places in 4296 ms of which 11 ms to minimize.
[2023-03-15 12:09:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 12:09:03] [INFO ] [Real]Absence check using 3 positive place invariants in 31 ms returned sat
[2023-03-15 12:09:04] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 740 ms returned sat
[2023-03-15 12:09:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:09:05] [INFO ] [Real]Absence check using state equation in 1263 ms returned sat
[2023-03-15 12:09:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:09:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 32 ms returned sat
[2023-03-15 12:09:06] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 723 ms returned sat
[2023-03-15 12:09:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:09:08] [INFO ] [Nat]Absence check using state equation in 1302 ms returned sat
[2023-03-15 12:09:08] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 46 ms.
[2023-03-15 12:09:10] [INFO ] Added : 101 causal constraints over 21 iterations in 1900 ms. Result :sat
Minimization took 194 ms.
[2023-03-15 12:09:10] [INFO ] [Real]Absence check using 3 positive place invariants in 36 ms returned sat
[2023-03-15 12:09:11] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 735 ms returned sat
[2023-03-15 12:09:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:09:12] [INFO ] [Real]Absence check using state equation in 1276 ms returned sat
[2023-03-15 12:09:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:09:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 41 ms returned sat
[2023-03-15 12:09:13] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 787 ms returned sat
[2023-03-15 12:09:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:09:15] [INFO ] [Nat]Absence check using state equation in 1365 ms returned sat
[2023-03-15 12:09:15] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 48 ms.
[2023-03-15 12:09:16] [INFO ] Added : 78 causal constraints over 16 iterations in 1560 ms. Result :sat
Minimization took 191 ms.
[2023-03-15 12:09:17] [INFO ] [Real]Absence check using 3 positive place invariants in 33 ms returned sat
[2023-03-15 12:09:18] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 706 ms returned sat
[2023-03-15 12:09:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:09:19] [INFO ] [Real]Absence check using state equation in 1263 ms returned sat
[2023-03-15 12:09:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:09:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 32 ms returned sat
[2023-03-15 12:09:20] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 793 ms returned sat
[2023-03-15 12:09:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:09:22] [INFO ] [Nat]Absence check using state equation in 1352 ms returned sat
[2023-03-15 12:09:22] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 42 ms.
[2023-03-15 12:09:23] [INFO ] Added : 66 causal constraints over 14 iterations in 1327 ms. Result :sat
Minimization took 494 ms.
[2023-03-15 12:09:24] [INFO ] [Real]Absence check using 3 positive place invariants in 30 ms returned sat
[2023-03-15 12:09:25] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 714 ms returned sat
[2023-03-15 12:09:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:09:26] [INFO ] [Real]Absence check using state equation in 1225 ms returned sat
[2023-03-15 12:09:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:09:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 35 ms returned sat
[2023-03-15 12:09:27] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 770 ms returned sat
[2023-03-15 12:09:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:09:28] [INFO ] [Nat]Absence check using state equation in 1327 ms returned sat
[2023-03-15 12:09:29] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 35 ms.
[2023-03-15 12:09:30] [INFO ] Added : 101 causal constraints over 21 iterations in 1855 ms. Result :sat
Minimization took 183 ms.
[2023-03-15 12:09:31] [INFO ] [Real]Absence check using 3 positive place invariants in 33 ms returned sat
[2023-03-15 12:09:32] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 744 ms returned sat
[2023-03-15 12:09:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:09:33] [INFO ] [Real]Absence check using state equation in 1181 ms returned sat
[2023-03-15 12:09:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:09:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 35 ms returned sat
[2023-03-15 12:09:34] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 696 ms returned sat
[2023-03-15 12:09:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:09:35] [INFO ] [Nat]Absence check using state equation in 1260 ms returned sat
[2023-03-15 12:09:35] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 39 ms.
[2023-03-15 12:09:42] [INFO ] Deduced a trap composed of 5 places in 4227 ms of which 10 ms to minimize.
[2023-03-15 12:09:42] [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 7
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 12:09:43] [INFO ] [Real]Absence check using 3 positive place invariants in 28 ms returned sat
[2023-03-15 12:09:43] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 718 ms returned sat
[2023-03-15 12:09:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:09:43] [INFO ] [Real]Absence check using state equation in 109 ms returned unsat
[2023-03-15 12:09:44] [INFO ] [Real]Absence check using 3 positive place invariants in 27 ms returned sat
[2023-03-15 12:09:44] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 710 ms returned sat
[2023-03-15 12:09:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:09:46] [INFO ] [Real]Absence check using state equation in 1255 ms returned sat
[2023-03-15 12:09:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:09:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 30 ms returned sat
[2023-03-15 12:09:47] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 722 ms returned sat
[2023-03-15 12:09:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:09:48] [INFO ] [Nat]Absence check using state equation in 1278 ms returned sat
[2023-03-15 12:09:48] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 32 ms.
[2023-03-15 12:09:50] [INFO ] Added : 78 causal constraints over 16 iterations in 1450 ms. Result :sat
Minimization took 185 ms.
[2023-03-15 12:09:50] [INFO ] [Real]Absence check using 3 positive place invariants in 26 ms returned sat
[2023-03-15 12:09:51] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 718 ms returned sat
[2023-03-15 12:09:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:09:52] [INFO ] [Real]Absence check using state equation in 915 ms returned unsat
[2023-03-15 12:09:52] [INFO ] [Real]Absence check using 3 positive place invariants in 27 ms returned sat
[2023-03-15 12:09:53] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 671 ms returned sat
[2023-03-15 12:09:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:09:54] [INFO ] [Real]Absence check using state equation in 1193 ms returned sat
[2023-03-15 12:09:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:09:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 29 ms returned sat
[2023-03-15 12:09:55] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 669 ms returned sat
[2023-03-15 12:09:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:09:56] [INFO ] [Nat]Absence check using state equation in 1220 ms returned sat
[2023-03-15 12:09:56] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 32 ms.
[2023-03-15 12:09:57] [INFO ] Added : 49 causal constraints over 10 iterations in 924 ms. Result :sat
Minimization took 192 ms.
[2023-03-15 12:09:58] [INFO ] [Real]Absence check using 3 positive place invariants in 31 ms returned sat
[2023-03-15 12:09:59] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 732 ms returned sat
[2023-03-15 12:09:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:10:00] [INFO ] [Real]Absence check using state equation in 1263 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, -1, 1089, 1, 1, -1, 1, 33, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1]
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 100 out of 3806 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 2583 are kept as prefixes of interest. Removing 1223 places using SCC suffix rule.26 ms
Discarding 1223 places :
Also discarding 65 output transitions
Drop transitions removed 65 transitions
Drop transitions removed 203 transitions
Reduce isomorphic transitions removed 203 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 270 rules applied. Total rules applied 271 place count 2517 transition count 237
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 273 place count 2516 transition count 236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 274 place count 2515 transition count 236
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 274 place count 2515 transition count 203
Deduced a syphon composed of 33 places in 1 ms
Ensure Unique test removed 65 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 131 rules applied. Total rules applied 405 place count 2417 transition count 203
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 405 place count 2417 transition count 202
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 408 place count 2415 transition count 202
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 409 place count 2414 transition count 201
Applied a total of 409 rules in 727 ms. Remains 2414 /3806 variables (removed 1392) and now considering 201/506 (removed 305) transitions.
Finished structural reductions, in 1 iterations. Remains : 2414/3806 places, 201/506 transitions.
// Phase 1: matrix 201 rows 2414 cols
[2023-03-15 12:10:01] [INFO ] Computed 2213 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 5937 resets, run finished after 17706 ms. (steps per millisecond=56 ) properties (out of 4) seen :88
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 643233 steps, including 167 resets, run visited all 3 properties in 5001 ms. (steps per millisecond=128 )
Finished Best-First random walk after 439470 steps, including 76 resets, run visited all 3 properties in 5001 ms. (steps per millisecond=87 )
Finished Best-First random walk after 584790 steps, including 164 resets, run visited all 3 properties in 5001 ms. (steps per millisecond=116 )
// Phase 1: matrix 201 rows 2414 cols
[2023-03-15 12:10:34] [INFO ] Computed 2213 place invariants in 18 ms
[2023-03-15 12:10:34] [INFO ] [Real]Absence check using 68 positive place invariants in 43 ms returned sat
[2023-03-15 12:10:35] [INFO ] [Real]Absence check using 68 positive and 2145 generalized place invariants in 408 ms returned sat
[2023-03-15 12:10:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:10:35] [INFO ] [Real]Absence check using state equation in 34 ms returned unsat
[2023-03-15 12:10:35] [INFO ] [Real]Absence check using 68 positive place invariants in 39 ms returned sat
[2023-03-15 12:10:35] [INFO ] [Real]Absence check using 68 positive and 2145 generalized place invariants in 426 ms returned sat
[2023-03-15 12:10:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:10:36] [INFO ] [Real]Absence check using state equation in 405 ms returned unsat
[2023-03-15 12:10:36] [INFO ] [Real]Absence check using 68 positive place invariants in 28 ms returned sat
[2023-03-15 12:10:36] [INFO ] [Real]Absence check using 68 positive and 2145 generalized place invariants in 432 ms returned unsat
Current structural bounds on expressions (after SMT) : [33, 33, 33] Max seen :[33, 33, 33]
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-07 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-04 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-01 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 121839 ms.

BK_STOP 1678882236930

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is QuasiCertifProtocol-PT-32, 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 r319-tall-167873970000114"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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