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.r170-tall-167838857200413.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 FamilyReunion-PT-L00050M0005C002P002G001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857200413
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.6M
-rw-r--r-- 1 mcc users 113K Feb 26 12:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 682K Feb 26 12:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 198K Feb 26 12:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 726K Feb 26 12:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 32K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 81K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 238K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 197K Feb 26 12:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Feb 26 12:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 297K Feb 26 12:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 994K Feb 26 12:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 35K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.7M Mar 5 18:22 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 FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-00
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-01
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-02
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-03
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-04
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-05
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-06
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-07
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-08
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-09
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-10
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-11
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-12
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-13
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-14
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678538793100

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=FamilyReunion-PT-L00050M0005C002P002G001
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 12:46:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 12:46:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 12:46:34] [INFO ] Load time of PNML (sax parser for PT used): 366 ms
[2023-03-11 12:46:35] [INFO ] Transformed 12194 places.
[2023-03-11 12:46:35] [INFO ] Transformed 10560 transitions.
[2023-03-11 12:46:35] [INFO ] Parsed PT model containing 12194 places and 10560 transitions and 32238 arcs in 474 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 70 ms.
Reduce places removed 17 places and 0 transitions.
// Phase 1: matrix 10560 rows 12177 cols
[2023-03-11 12:46:36] [INFO ] Computed 2768 place invariants in 732 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 16) seen :96
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 12) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :5
[2023-03-11 12:46:36] [INFO ] Invariant cache hit.
[2023-03-11 12:46:38] [INFO ] [Real]Absence check using 149 positive place invariants in 313 ms returned sat
[2023-03-11 12:46:40] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1276 ms returned sat
[2023-03-11 12:46:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:46:41] [INFO ] [Real]Absence check using state equation in 1904 ms returned unknown
[2023-03-11 12:46:43] [INFO ] [Real]Absence check using 149 positive place invariants in 313 ms returned sat
[2023-03-11 12:46:44] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1295 ms returned sat
[2023-03-11 12:46:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:46:46] [INFO ] [Real]Absence check using state equation in 2360 ms returned unknown
[2023-03-11 12:46:48] [INFO ] [Real]Absence check using 149 positive place invariants in 281 ms returned sat
[2023-03-11 12:46:49] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1230 ms returned sat
[2023-03-11 12:46:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:46:51] [INFO ] [Real]Absence check using state equation in 2508 ms returned unknown
[2023-03-11 12:46:53] [INFO ] [Real]Absence check using 149 positive place invariants in 282 ms returned sat
[2023-03-11 12:46:54] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1068 ms returned sat
[2023-03-11 12:46:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:46:57] [INFO ] [Real]Absence check using state equation in 2605 ms returned unknown
[2023-03-11 12:46:58] [INFO ] [Real]Absence check using 149 positive place invariants in 284 ms returned sat
[2023-03-11 12:46:59] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1176 ms returned sat
[2023-03-11 12:46:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:47:02] [INFO ] [Real]Absence check using state equation in 2504 ms returned unknown
[2023-03-11 12:47:03] [INFO ] [Real]Absence check using 149 positive place invariants in 278 ms returned sat
[2023-03-11 12:47:04] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1303 ms returned sat
[2023-03-11 12:47:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:47:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-11 12:47:08] [INFO ] [Real]Absence check using 149 positive place invariants in 270 ms returned sat
[2023-03-11 12:47:09] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1199 ms returned sat
[2023-03-11 12:47:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:47:12] [INFO ] [Real]Absence check using state equation in 2562 ms returned unknown
[2023-03-11 12:47:13] [INFO ] [Real]Absence check using 149 positive place invariants in 291 ms returned sat
[2023-03-11 12:47:14] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1223 ms returned sat
[2023-03-11 12:47:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:47:17] [INFO ] [Real]Absence check using state equation in 2427 ms returned unknown
[2023-03-11 12:47:18] [INFO ] [Real]Absence check using 149 positive place invariants in 285 ms returned sat
[2023-03-11 12:47:19] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1187 ms returned sat
[2023-03-11 12:47:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:47:22] [INFO ] [Real]Absence check using state equation in 2497 ms returned unknown
[2023-03-11 12:47:23] [INFO ] [Real]Absence check using 149 positive place invariants in 291 ms returned sat
[2023-03-11 12:47:24] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 633 ms returned unsat
[2023-03-11 12:47:25] [INFO ] [Real]Absence check using 149 positive place invariants in 285 ms returned sat
[2023-03-11 12:47:26] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1249 ms returned sat
[2023-03-11 12:47:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:47:29] [INFO ] [Real]Absence check using state equation in 2417 ms returned unknown
[2023-03-11 12:47:30] [INFO ] [Real]Absence check using 149 positive place invariants in 291 ms returned sat
[2023-03-11 12:47:31] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1231 ms returned sat
[2023-03-11 12:47:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:47:34] [INFO ] [Real]Absence check using state equation in 2442 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1, -1, 53, -1, -1, -1, -1, -1, 1, 1, 1, 1] Max seen :[11, 9, 1, 11, 9, 40, 4, 6, 0, 1, 0, 0]
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1023 out of 12177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12177/12177 places, 10560/10560 transitions.
Graph (complete) has 18927 edges and 12177 vertex of which 11603 are kept as prefixes of interest. Removing 574 places using SCC suffix rule.23 ms
Discarding 574 places :
Also discarding 448 output transitions
Drop transitions removed 448 transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 1530 places :
Implicit places reduction removed 1530 places
Drop transitions removed 3618 transitions
Trivial Post-agglo rules discarded 3618 transitions
Performed 3618 trivial Post agglomeration. Transition count delta: 3618
Iterating post reduction 0 with 5154 rules applied. Total rules applied 5155 place count 10073 transition count 6488
Reduce places removed 3618 places and 0 transitions.
Performed 462 Post agglomeration using F-continuation condition.Transition count delta: 462
Iterating post reduction 1 with 4080 rules applied. Total rules applied 9235 place count 6455 transition count 6026
Reduce places removed 462 places and 0 transitions.
Iterating post reduction 2 with 462 rules applied. Total rules applied 9697 place count 5993 transition count 6026
Performed 766 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 766 Pre rules applied. Total rules applied 9697 place count 5993 transition count 5260
Deduced a syphon composed of 766 places in 11 ms
Ensure Unique test removed 306 places
Reduce places removed 1072 places and 0 transitions.
Iterating global reduction 3 with 1838 rules applied. Total rules applied 11535 place count 4921 transition count 5260
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 11535 place count 4921 transition count 5209
Deduced a syphon composed of 51 places in 10 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 11637 place count 4870 transition count 5209
Discarding 970 places :
Symmetric choice reduction at 3 with 970 rule applications. Total rules 12607 place count 3900 transition count 4239
Iterating global reduction 3 with 970 rules applied. Total rules applied 13577 place count 3900 transition count 4239
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 3 with 306 rules applied. Total rules applied 13883 place count 3798 transition count 4035
Reduce places removed 102 places and 0 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 4 with 153 rules applied. Total rules applied 14036 place count 3696 transition count 3984
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 5 with 51 rules applied. Total rules applied 14087 place count 3645 transition count 3984
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 153 Pre rules applied. Total rules applied 14087 place count 3645 transition count 3831
Deduced a syphon composed of 153 places in 3 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 6 with 306 rules applied. Total rules applied 14393 place count 3492 transition count 3831
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 14403 place count 3482 transition count 3321
Iterating global reduction 6 with 10 rules applied. Total rules applied 14413 place count 3482 transition count 3321
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 53 places :
Implicit places reduction removed 53 places
Iterating post reduction 6 with 155 rules applied. Total rules applied 14568 place count 3429 transition count 3219
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 51 Pre rules applied. Total rules applied 14568 place count 3429 transition count 3168
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 7 with 102 rules applied. Total rules applied 14670 place count 3378 transition count 3168
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 14671 place count 3377 transition count 3117
Iterating global reduction 7 with 1 rules applied. Total rules applied 14672 place count 3377 transition count 3117
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 7 with 51 rules applied. Total rules applied 14723 place count 3326 transition count 3117
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 51 Pre rules applied. Total rules applied 14723 place count 3326 transition count 3066
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 8 with 102 rules applied. Total rules applied 14825 place count 3275 transition count 3066
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Deduced a syphon composed of 153 places in 2 ms
Ensure Unique test removed 51 places
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 8 with 357 rules applied. Total rules applied 15182 place count 3071 transition count 2913
Free-agglomeration rule (complex) applied 408 times.
Iterating global reduction 8 with 408 rules applied. Total rules applied 15590 place count 3071 transition count 2505
Ensure Unique test removed 357 places
Reduce places removed 765 places and 0 transitions.
Iterating post reduction 8 with 765 rules applied. Total rules applied 16355 place count 2306 transition count 2505
Applied a total of 16355 rules in 2258 ms. Remains 2306 /12177 variables (removed 9871) and now considering 2505/10560 (removed 8055) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2258 ms. Remains : 2306/12177 places, 2505/10560 transitions.
// Phase 1: matrix 2505 rows 2306 cols
[2023-03-11 12:47:36] [INFO ] Computed 158 place invariants in 36 ms
Incomplete random walk after 1000000 steps, including 1294 resets, run finished after 24422 ms. (steps per millisecond=40 ) properties (out of 11) seen :148
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 697561 steps, including 20 resets, run visited all 8 properties in 5001 ms. (steps per millisecond=139 )
Incomplete Best-First random walk after 1000001 steps, including 24 resets, run finished after 4486 ms. (steps per millisecond=222 ) properties (out of 8) seen :122
Incomplete Best-First random walk after 1000001 steps, including 22 resets, run finished after 2427 ms. (steps per millisecond=412 ) properties (out of 8) seen :110
Incomplete Best-First random walk after 1000001 steps, including 21 resets, run finished after 2313 ms. (steps per millisecond=432 ) properties (out of 8) seen :138
Incomplete Best-First random walk after 1000001 steps, including 23 resets, run finished after 2405 ms. (steps per millisecond=415 ) properties (out of 8) seen :132
Finished Best-First random walk after 687418 steps, including 18 resets, run visited all 8 properties in 5001 ms. (steps per millisecond=137 )
Incomplete Best-First random walk after 1000001 steps, including 20 resets, run finished after 2455 ms. (steps per millisecond=407 ) properties (out of 8) seen :154
Incomplete Best-First random walk after 1000001 steps, including 14 resets, run finished after 2344 ms. (steps per millisecond=426 ) properties (out of 8) seen :104
[2023-03-11 12:48:27] [INFO ] Invariant cache hit.
[2023-03-11 12:48:27] [INFO ] [Real]Absence check using 0 positive and 158 generalized place invariants in 68 ms returned sat
[2023-03-11 12:48:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:48:28] [INFO ] [Real]Absence check using state equation in 458 ms returned unsat
[2023-03-11 12:48:28] [INFO ] [Real]Absence check using 0 positive and 158 generalized place invariants in 65 ms returned sat
[2023-03-11 12:48:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:48:28] [INFO ] [Real]Absence check using state equation in 452 ms returned unsat
[2023-03-11 12:48:29] [INFO ] [Real]Absence check using 0 positive and 158 generalized place invariants in 67 ms returned sat
[2023-03-11 12:48:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:48:29] [INFO ] [Real]Absence check using state equation in 447 ms returned unsat
[2023-03-11 12:48:29] [INFO ] [Real]Absence check using 0 positive and 158 generalized place invariants in 63 ms returned sat
[2023-03-11 12:48:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:48:30] [INFO ] [Real]Absence check using state equation in 455 ms returned unsat
[2023-03-11 12:48:30] [INFO ] [Real]Absence check using 0 positive and 158 generalized place invariants in 64 ms returned sat
[2023-03-11 12:48:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:48:30] [INFO ] [Real]Absence check using state equation in 463 ms returned unsat
[2023-03-11 12:48:31] [INFO ] [Real]Absence check using 0 positive and 158 generalized place invariants in 65 ms returned sat
[2023-03-11 12:48:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:48:31] [INFO ] [Real]Absence check using state equation in 235 ms returned unsat
[2023-03-11 12:48:31] [INFO ] [Real]Absence check using 0 positive and 158 generalized place invariants in 65 ms returned sat
[2023-03-11 12:48:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:48:32] [INFO ] [Real]Absence check using state equation in 464 ms returned unsat
[2023-03-11 12:48:32] [INFO ] [Real]Absence check using 0 positive and 158 generalized place invariants in 61 ms returned sat
[2023-03-11 12:48:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:48:32] [INFO ] [Real]Absence check using state equation in 457 ms returned unsat
Current structural bounds on expressions (after SMT) : [51, 51, 2, 51, 51, 51, 51, 51] Max seen :[51, 51, 2, 51, 51, 51, 51, 51]
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-07 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-06 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-05 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-04 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-03 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-01 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-00 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 118305 ms.
ITS solved all properties within timeout

BK_STOP 1678538913841

--------------------
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="FamilyReunion-PT-L00050M0005C002P002G001"
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 FamilyReunion-PT-L00050M0005C002P002G001, 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 r170-tall-167838857200413"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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