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.r298-tall-167873952400909.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 marciexred
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 r298-tall-167873952400909
=====================================================================

--------------------
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 1679691666075

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-32
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 21:01:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-24 21:01:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 21:01:07] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2023-03-24 21:01:07] [INFO ] Transformed 3806 places.
[2023-03-24 21:01:07] [INFO ] Transformed 506 transitions.
[2023-03-24 21:01:07] [INFO ] Parsed PT model containing 3806 places and 506 transitions and 8173 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 506 rows 3806 cols
[2023-03-24 21:01:07] [INFO ] Computed 3301 place invariants in 160 ms
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-03 19 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 267 resets, run finished after 88 ms. (steps per millisecond=113 ) 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 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 10 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 11 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10000 steps, including 10 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 9 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 14 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 14 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10000 steps, including 8 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 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 9 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 9 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 6 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :3
[2023-03-24 21:01:08] [INFO ] Invariant cache hit.
[2023-03-24 21:01:08] [INFO ] [Real]Absence check using 3 positive place invariants in 46 ms returned sat
[2023-03-24 21:01:09] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 748 ms returned sat
[2023-03-24 21:01:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 21:01:11] [INFO ] [Real]Absence check using state equation in 1348 ms returned sat
[2023-03-24 21:01:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 21:01:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 42 ms returned sat
[2023-03-24 21:01:12] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 741 ms returned sat
[2023-03-24 21:01:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 21:01:13] [INFO ] [Nat]Absence check using state equation in 1310 ms returned sat
[2023-03-24 21:01:13] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 48 ms.
[2023-03-24 21:01:15] [INFO ] Added : 67 causal constraints over 14 iterations in 1414 ms. Result :sat
Minimization took 186 ms.
[2023-03-24 21:01:15] [INFO ] [Real]Absence check using 3 positive place invariants in 51 ms returned sat
[2023-03-24 21:01:16] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 768 ms returned sat
[2023-03-24 21:01:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 21:01:17] [INFO ] [Real]Absence check using state equation in 1330 ms returned sat
[2023-03-24 21:01:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 21:01:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 41 ms returned sat
[2023-03-24 21:01:19] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 771 ms returned sat
[2023-03-24 21:01:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 21:01:20] [INFO ] [Nat]Absence check using state equation in 1351 ms returned sat
[2023-03-24 21:01:20] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 43 ms.
[2023-03-24 21:01:22] [INFO ] Added : 102 causal constraints over 21 iterations in 1886 ms. Result :sat
Minimization took 311 ms.
[2023-03-24 21:01:23] [INFO ] [Real]Absence check using 3 positive place invariants in 34 ms returned sat
[2023-03-24 21:01:23] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 733 ms returned sat
[2023-03-24 21:01:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 21:01:25] [INFO ] [Real]Absence check using state equation in 1358 ms returned sat
[2023-03-24 21:01:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 21:01:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 36 ms returned sat
[2023-03-24 21:01:26] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 780 ms returned sat
[2023-03-24 21:01:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 21:01:27] [INFO ] [Nat]Absence check using state equation in 1415 ms returned sat
[2023-03-24 21:01:28] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 50 ms.
[2023-03-24 21:01:34] [INFO ] Deduced a trap composed of 5 places in 4299 ms of which 9 ms to minimize.
[2023-03-24 21:01:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 21:01:35] [INFO ] [Real]Absence check using 3 positive place invariants in 36 ms returned sat
[2023-03-24 21:01:35] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 770 ms returned sat
[2023-03-24 21:01:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 21:01:37] [INFO ] [Real]Absence check using state equation in 1388 ms returned sat
[2023-03-24 21:01:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 21:01:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 35 ms returned sat
[2023-03-24 21:01:38] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 776 ms returned sat
[2023-03-24 21:01:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 21:01:39] [INFO ] [Nat]Absence check using state equation in 1361 ms returned sat
[2023-03-24 21:01:39] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 43 ms.
[2023-03-24 21:01:41] [INFO ] Added : 101 causal constraints over 21 iterations in 1851 ms. Result :sat
Minimization took 201 ms.
[2023-03-24 21:01:42] [INFO ] [Real]Absence check using 3 positive place invariants in 39 ms returned sat
[2023-03-24 21:01:43] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 773 ms returned sat
[2023-03-24 21:01:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 21:01:44] [INFO ] [Real]Absence check using state equation in 1319 ms returned sat
[2023-03-24 21:01:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 21:01:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 47 ms returned sat
[2023-03-24 21:01:45] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 735 ms returned sat
[2023-03-24 21:01:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 21:01:46] [INFO ] [Nat]Absence check using state equation in 1304 ms returned sat
[2023-03-24 21:01:47] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 41 ms.
[2023-03-24 21:01:48] [INFO ] Added : 78 causal constraints over 16 iterations in 1474 ms. Result :sat
Minimization took 212 ms.
[2023-03-24 21:01:49] [INFO ] [Real]Absence check using 3 positive place invariants in 29 ms returned sat
[2023-03-24 21:01:49] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 763 ms returned sat
[2023-03-24 21:01:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 21:01:51] [INFO ] [Real]Absence check using state equation in 1370 ms returned sat
[2023-03-24 21:01:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 21:01:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 32 ms returned sat
[2023-03-24 21:01:52] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 790 ms returned sat
[2023-03-24 21:01:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 21:01:53] [INFO ] [Nat]Absence check using state equation in 1308 ms returned sat
[2023-03-24 21:01:54] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 41 ms.
[2023-03-24 21:01:55] [INFO ] Added : 66 causal constraints over 14 iterations in 1301 ms. Result :sat
Minimization took 497 ms.
[2023-03-24 21:01:56] [INFO ] [Real]Absence check using 3 positive place invariants in 29 ms returned sat
[2023-03-24 21:01:56] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 763 ms returned sat
[2023-03-24 21:01:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 21:01:58] [INFO ] [Real]Absence check using state equation in 1351 ms returned sat
[2023-03-24 21:01:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 21:01:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 35 ms returned sat
[2023-03-24 21:01:59] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 750 ms returned sat
[2023-03-24 21:01:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 21:02:00] [INFO ] [Nat]Absence check using state equation in 1345 ms returned sat
[2023-03-24 21:02:01] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 35 ms.
[2023-03-24 21:02:02] [INFO ] Added : 101 causal constraints over 21 iterations in 1861 ms. Result :sat
Minimization took 199 ms.
[2023-03-24 21:02:03] [INFO ] [Real]Absence check using 3 positive place invariants in 31 ms returned sat
[2023-03-24 21:02:04] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 736 ms returned sat
[2023-03-24 21:02:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 21:02:05] [INFO ] [Real]Absence check using state equation in 1342 ms returned sat
[2023-03-24 21:02:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 21:02:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 32 ms returned sat
[2023-03-24 21:02:06] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 750 ms returned sat
[2023-03-24 21:02:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 21:02:08] [INFO ] [Nat]Absence check using state equation in 1343 ms returned sat
[2023-03-24 21:02:08] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 42 ms.
[2023-03-24 21:02:14] [INFO ] Deduced a trap composed of 5 places in 4021 ms of which 4 ms to minimize.
[2023-03-24 21:02:14] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 21:02:15] [INFO ] [Real]Absence check using 3 positive place invariants in 31 ms returned sat
[2023-03-24 21:02:15] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 765 ms returned sat
[2023-03-24 21:02:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 21:02:15] [INFO ] [Real]Absence check using state equation in 121 ms returned unsat
[2023-03-24 21:02:16] [INFO ] [Real]Absence check using 3 positive place invariants in 28 ms returned sat
[2023-03-24 21:02:17] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 740 ms returned sat
[2023-03-24 21:02:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 21:02:18] [INFO ] [Real]Absence check using state equation in 1301 ms returned sat
[2023-03-24 21:02:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 21:02:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 38 ms returned sat
[2023-03-24 21:02:19] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 730 ms returned sat
[2023-03-24 21:02:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 21:02:20] [INFO ] [Nat]Absence check using state equation in 1330 ms returned sat
[2023-03-24 21:02:20] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 35 ms.
[2023-03-24 21:02:22] [INFO ] Added : 78 causal constraints over 16 iterations in 1447 ms. Result :sat
Minimization took 187 ms.
[2023-03-24 21:02:22] [INFO ] [Real]Absence check using 3 positive place invariants in 28 ms returned sat
[2023-03-24 21:02:23] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 801 ms returned sat
[2023-03-24 21:02:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 21:02:24] [INFO ] [Real]Absence check using state equation in 979 ms returned unsat
[2023-03-24 21:02:25] [INFO ] [Real]Absence check using 3 positive place invariants in 31 ms returned sat
[2023-03-24 21:02:25] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 765 ms returned sat
[2023-03-24 21:02:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 21:02:27] [INFO ] [Real]Absence check using state equation in 1300 ms returned sat
[2023-03-24 21:02:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 21:02:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 30 ms returned sat
[2023-03-24 21:02:28] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 749 ms returned sat
[2023-03-24 21:02:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 21:02:29] [INFO ] [Nat]Absence check using state equation in 1333 ms returned sat
[2023-03-24 21:02:29] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 36 ms.
[2023-03-24 21:02:30] [INFO ] Added : 49 causal constraints over 10 iterations in 897 ms. Result :sat
Minimization took 187 ms.
[2023-03-24 21:02:31] [INFO ] [Real]Absence check using 3 positive place invariants in 32 ms returned sat
[2023-03-24 21:02:31] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 753 ms returned sat
[2023-03-24 21:02:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 21:02:33] [INFO ] [Real]Absence check using state equation in 1295 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 REACHABILITY 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.20 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 2 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 568 ms. Remains 2414 /3806 variables (removed 1392) and now considering 201/506 (removed 305) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 569 ms. Remains : 2414/3806 places, 201/506 transitions.
// Phase 1: matrix 201 rows 2414 cols
[2023-03-24 21:02:34] [INFO ] Computed 2213 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 5937 resets, run finished after 17021 ms. (steps per millisecond=58 ) properties (out of 4) seen :87
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 668448 steps, including 173 resets, run visited all 3 properties in 5001 ms. (steps per millisecond=133 )
Finished Best-First random walk after 449025 steps, including 77 resets, run visited all 3 properties in 5001 ms. (steps per millisecond=89 )
Finished Best-First random walk after 631630 steps, including 178 resets, run visited all 3 properties in 5001 ms. (steps per millisecond=126 )
[2023-03-24 21:03:06] [INFO ] Invariant cache hit.
[2023-03-24 21:03:06] [INFO ] [Real]Absence check using 68 positive place invariants in 35 ms returned sat
[2023-03-24 21:03:07] [INFO ] [Real]Absence check using 68 positive and 2145 generalized place invariants in 438 ms returned sat
[2023-03-24 21:03:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 21:03:07] [INFO ] [Real]Absence check using state equation in 34 ms returned unsat
[2023-03-24 21:03:07] [INFO ] [Real]Absence check using 68 positive place invariants in 44 ms returned sat
[2023-03-24 21:03:07] [INFO ] [Real]Absence check using 68 positive and 2145 generalized place invariants in 430 ms returned sat
[2023-03-24 21:03:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 21:03:08] [INFO ] [Real]Absence check using state equation in 425 ms returned unsat
[2023-03-24 21:03:08] [INFO ] [Real]Absence check using 68 positive place invariants in 31 ms returned sat
[2023-03-24 21:03:08] [INFO ] [Real]Absence check using 68 positive and 2145 generalized place invariants in 421 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 121435 ms.
ITS solved all properties within timeout

BK_STOP 1679691789941

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="marciexred"
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 marciexred"
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 r298-tall-167873952400909"
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 ;