Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r083-tall-162048876100955.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r083-tall-162048876100955
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 524K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.2M May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 629K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.2M May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 34K Mar 28 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 144K Mar 28 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 84K Mar 28 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 225K Mar 28 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 50K Mar 23 10:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 198K Mar 23 10:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 163K Mar 22 18:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 428K Mar 22 18:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 21K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 55K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 24 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 4.7M May 5 16:51 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 1620713081330

Running Version 0
[2021-05-11 06:04:43] [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]
[2021-05-11 06:04:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 06:04:43] [INFO ] Load time of PNML (sax parser for PT used): 331 ms
[2021-05-11 06:04:43] [INFO ] Transformed 12194 places.
[2021-05-11 06:04:43] [INFO ] Transformed 10560 transitions.
[2021-05-11 06:04:43] [INFO ] Parsed PT model containing 12194 places and 10560 transitions in 447 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 96 ms.
Reduce places removed 17 places and 0 transitions.
// Phase 1: matrix 10560 rows 12177 cols
[2021-05-11 06:04:44] [INFO ] Computed 2768 place invariants in 1052 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 538 ms. (steps per millisecond=18 ) properties (out of 16) seen :106
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-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
// Phase 1: matrix 10560 rows 12177 cols
[2021-05-11 06:04:47] [INFO ] Computed 2768 place invariants in 960 ms
[2021-05-11 06:04:48] [INFO ] [Real]Absence check using 149 positive place invariants in 323 ms returned sat
[2021-05-11 06:04:50] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1133 ms returned sat
[2021-05-11 06:04:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 06:04:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-11 06:04:53] [INFO ] [Real]Absence check using 149 positive place invariants in 310 ms returned sat
[2021-05-11 06:04:54] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1184 ms returned sat
[2021-05-11 06:04:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 06:04:57] [INFO ] [Real]Absence check using state equation in 2099 ms returned unknown
[2021-05-11 06:04:58] [INFO ] [Real]Absence check using 149 positive place invariants in 284 ms returned sat
[2021-05-11 06:04:59] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1220 ms returned sat
[2021-05-11 06:04:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 06:05:02] [INFO ] [Real]Absence check using state equation in 2234 ms returned unknown
[2021-05-11 06:05:03] [INFO ] [Real]Absence check using 149 positive place invariants in 313 ms returned sat
[2021-05-11 06:05:04] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1145 ms returned sat
[2021-05-11 06:05:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 06:05:07] [INFO ] [Real]Absence check using state equation in 2387 ms returned unknown
[2021-05-11 06:05:08] [INFO ] [Real]Absence check using 149 positive place invariants in 301 ms returned sat
[2021-05-11 06:05:09] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1147 ms returned sat
[2021-05-11 06:05:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 06:05:12] [INFO ] [Real]Absence check using state equation in 2360 ms returned unknown
[2021-05-11 06:05:13] [INFO ] [Real]Absence check using 149 positive place invariants in 310 ms returned sat
[2021-05-11 06:05:14] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1149 ms returned sat
[2021-05-11 06:05:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 06:05:17] [INFO ] [Real]Absence check using state equation in 2336 ms returned unknown
[2021-05-11 06:05:18] [INFO ] [Real]Absence check using 149 positive place invariants in 276 ms returned sat
[2021-05-11 06:05:19] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1053 ms returned sat
[2021-05-11 06:05:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 06:05:22] [INFO ] [Real]Absence check using state equation in 2506 ms returned unknown
[2021-05-11 06:05:23] [INFO ] [Real]Absence check using 149 positive place invariants in 309 ms returned sat
[2021-05-11 06:05:24] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1260 ms returned sat
[2021-05-11 06:05:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 06:05:27] [INFO ] [Real]Absence check using state equation in 2257 ms returned unknown
[2021-05-11 06:05:28] [INFO ] [Real]Absence check using 149 positive place invariants in 302 ms returned sat
[2021-05-11 06:05:29] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1122 ms returned sat
[2021-05-11 06:05:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 06:05:32] [INFO ] [Real]Absence check using state equation in 2402 ms returned unknown
[2021-05-11 06:05:33] [INFO ] [Real]Absence check using 149 positive place invariants in 299 ms returned sat
[2021-05-11 06:05:34] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1129 ms returned sat
[2021-05-11 06:05:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 06:05:37] [INFO ] [Real]Absence check using state equation in 2385 ms returned unknown
[2021-05-11 06:05:38] [INFO ] [Real]Absence check using 149 positive place invariants in 281 ms returned sat
[2021-05-11 06:05:39] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1063 ms returned sat
[2021-05-11 06:05:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 06:05:42] [INFO ] [Real]Absence check using state equation in 2495 ms returned unknown
[2021-05-11 06:05:43] [INFO ] [Real]Absence check using 149 positive place invariants in 281 ms returned sat
[2021-05-11 06:05:44] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1090 ms returned sat
[2021-05-11 06:05:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 06:05:47] [INFO ] [Real]Absence check using state equation in 2476 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, -1, 1, 1, 1, 1] Max seen :[10, 13, 34, 10, 6, 9, 8, 12, 0, 0, 0, 0]
Support contains 1685 out of 12177 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12177/12177 places, 10560/10560 transitions.
Graph (complete) has 18927 edges and 12177 vertex of which 11028 are kept as prefixes of interest. Removing 1149 places using SCC suffix rule.38 ms
Discarding 1149 places :
Also discarding 1074 output transitions
Drop transitions removed 1074 transitions
Discarding 1528 places :
Implicit places reduction removed 1528 places
Drop transitions removed 2750 transitions
Trivial Post-agglo rules discarded 2750 transitions
Performed 2750 trivial Post agglomeration. Transition count delta: 2750
Iterating post reduction 0 with 4278 rules applied. Total rules applied 4279 place count 9500 transition count 6736
Reduce places removed 2750 places and 0 transitions.
Performed 359 Post agglomeration using F-continuation condition.Transition count delta: 359
Iterating post reduction 1 with 3109 rules applied. Total rules applied 7388 place count 6750 transition count 6377
Reduce places removed 359 places and 0 transitions.
Iterating post reduction 2 with 359 rules applied. Total rules applied 7747 place count 6391 transition count 6377
Performed 765 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 765 Pre rules applied. Total rules applied 7747 place count 6391 transition count 5612
Deduced a syphon composed of 765 places in 6 ms
Ensure Unique test removed 561 places
Reduce places removed 1326 places and 0 transitions.
Iterating global reduction 3 with 2091 rules applied. Total rules applied 9838 place count 5065 transition count 5612
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 3 with 204 rules applied. Total rules applied 10042 place count 5014 transition count 5459
Reduce places removed 153 places and 0 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 4 with 204 rules applied. Total rules applied 10246 place count 4861 transition count 5408
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 5 with 51 rules applied. Total rules applied 10297 place count 4810 transition count 5408
Discarding 765 places :
Symmetric choice reduction at 6 with 765 rule applications. Total rules 11062 place count 4045 transition count 4643
Iterating global reduction 6 with 765 rules applied. Total rules applied 11827 place count 4045 transition count 4643
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Drop transitions removed 306 transitions
Trivial Post-agglo rules discarded 306 transitions
Performed 306 trivial Post agglomeration. Transition count delta: 306
Iterating post reduction 6 with 510 rules applied. Total rules applied 12337 place count 3943 transition count 4235
Reduce places removed 306 places and 0 transitions.
Iterating post reduction 7 with 306 rules applied. Total rules applied 12643 place count 3637 transition count 4235
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 51 Pre rules applied. Total rules applied 12643 place count 3637 transition count 4184
Deduced a syphon composed of 51 places in 6 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 8 with 102 rules applied. Total rules applied 12745 place count 3586 transition count 4184
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 12749 place count 3582 transition count 3980
Iterating global reduction 8 with 4 rules applied. Total rules applied 12753 place count 3582 transition count 3980
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Discarding 153 places :
Implicit places reduction removed 153 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 8 with 408 rules applied. Total rules applied 13161 place count 3429 transition count 3725
Reduce places removed 51 places and 0 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 9 with 102 rules applied. Total rules applied 13263 place count 3378 transition count 3674
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 10 with 51 rules applied. Total rules applied 13314 place count 3327 transition count 3674
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 51 Pre rules applied. Total rules applied 13314 place count 3327 transition count 3623
Deduced a syphon composed of 51 places in 5 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 11 with 102 rules applied. Total rules applied 13416 place count 3276 transition count 3623
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Deduced a syphon composed of 153 places in 3 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 11 with 306 rules applied. Total rules applied 13722 place count 3123 transition count 3470
Free-agglomeration rule (complex) applied 408 times.
Iterating global reduction 11 with 408 rules applied. Total rules applied 14130 place count 3123 transition count 3062
Reduce places removed 408 places and 0 transitions.
Iterating post reduction 11 with 408 rules applied. Total rules applied 14538 place count 2715 transition count 3062
Applied a total of 14538 rules in 2116 ms. Remains 2715 /12177 variables (removed 9462) and now considering 3062/10560 (removed 7498) transitions.
Finished structural reductions, in 1 iterations. Remains : 2715/12177 places, 3062/10560 transitions.
// Phase 1: matrix 3062 rows 2715 cols
[2021-05-11 06:05:49] [INFO ] Computed 158 place invariants in 37 ms
Interrupted random walk after 892840 steps, including 1165 resets, run timeout after 30001 ms. (steps per millisecond=29 ) properties seen :{0=23, 1=26, 2=33, 3=19, 4=16, 5=21, 6=17, 7=22, 8=1, 9=1, 10=1, 11=1}
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 1000001 steps, including 27 resets, run finished after 2351 ms. (steps per millisecond=425 ) properties (out of 8) seen :123
Interrupted Best-First random walk after 841655 steps, including 25 resets, run timeout after 5001 ms. (steps per millisecond=168 ) properties seen :{0=1, 1=51, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1}
Interrupted Best-First random walk after 927678 steps, including 25 resets, run timeout after 5001 ms. (steps per millisecond=185 ) properties seen :{0=1, 1=1, 2=51, 3=1, 4=1, 5=1, 6=1, 7=1}
Interrupted Best-First random walk after 748620 steps, including 19 resets, run timeout after 5001 ms. (steps per millisecond=149 ) properties seen :{0=16, 1=23, 2=28, 3=51, 4=1, 5=1, 6=1, 7=20}
Incomplete Best-First random walk after 1000001 steps, including 20 resets, run finished after 2675 ms. (steps per millisecond=373 ) properties (out of 8) seen :183
Interrupted Best-First random walk after 737732 steps, including 17 resets, run timeout after 5001 ms. (steps per millisecond=147 ) properties seen :{0=17, 1=21, 2=25, 3=15, 4=1, 5=51, 6=1, 7=18}
Incomplete Best-First random walk after 1000001 steps, including 21 resets, run finished after 2626 ms. (steps per millisecond=380 ) properties (out of 8) seen :166
Interrupted Best-First random walk after 818272 steps, including 24 resets, run timeout after 5001 ms. (steps per millisecond=163 ) properties seen :{0=1, 1=1, 2=26, 3=1, 4=1, 5=1, 6=1, 7=51}
// Phase 1: matrix 3062 rows 2715 cols
[2021-05-11 06:06:52] [INFO ] Computed 158 place invariants in 22 ms
[2021-05-11 06:06:52] [INFO ] [Real]Absence check using 0 positive and 158 generalized place invariants in 57 ms returned sat
[2021-05-11 06:06:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 06:06:53] [INFO ] [Real]Absence check using state equation in 1012 ms returned unsat
[2021-05-11 06:06:53] [INFO ] [Real]Absence check using 0 positive and 158 generalized place invariants in 57 ms returned sat
[2021-05-11 06:06:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 06:06:54] [INFO ] [Real]Absence check using state equation in 647 ms returned unsat
[2021-05-11 06:06:54] [INFO ] [Real]Absence check using 0 positive and 158 generalized place invariants in 56 ms returned sat
[2021-05-11 06:06:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 06:06:55] [INFO ] [Real]Absence check using state equation in 478 ms returned unsat
[2021-05-11 06:06:55] [INFO ] [Real]Absence check using 0 positive and 158 generalized place invariants in 56 ms returned sat
[2021-05-11 06:06:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 06:07:05] [INFO ] [Real]Absence check using state equation in 10440 ms returned unsat
[2021-05-11 06:07:06] [INFO ] [Real]Absence check using 0 positive and 158 generalized place invariants in 55 ms returned sat
[2021-05-11 06:07:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 06:07:08] [INFO ] [Real]Absence check using state equation in 2154 ms returned unsat
[2021-05-11 06:07:08] [INFO ] [Real]Absence check using 0 positive and 158 generalized place invariants in 56 ms returned sat
[2021-05-11 06:07:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 06:07:10] [INFO ] [Real]Absence check using state equation in 1768 ms returned unsat
[2021-05-11 06:07:10] [INFO ] [Real]Absence check using 0 positive and 158 generalized place invariants in 55 ms returned sat
[2021-05-11 06:07:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 06:07:12] [INFO ] [Real]Absence check using state equation in 1857 ms returned unsat
[2021-05-11 06:07:12] [INFO ] [Real]Absence check using 0 positive and 158 generalized place invariants in 56 ms returned sat
[2021-05-11 06:07:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 06:07:13] [INFO ] [Real]Absence check using state equation in 799 ms returned unsat
Current structural bounds on expressions (after SMT) : [51, 51, 51, 51, 51, 51, 51, 51] Max seen :[51, 51, 51, 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 51 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.

BK_STOP 1620713234466

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FamilyReunion-PT-L00050M0005C002P002G001"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
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 r083-tall-162048876100955"
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 ;