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.r292-tall-162124156700579.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 MultiCrashLeafsetExtension-PT-S16C03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156700579
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.4M
-rw-r--r-- 1 mcc users 50K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 176K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.6K May 12 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 12 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 12 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 12 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 5.7K May 11 18:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 11 18:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 11 15:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 11 15:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 7 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 6.9M May 12 08:13 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 gen-UpperBounds-00
FORMULA_NAME gen-UpperBounds-01
FORMULA_NAME gen-UpperBounds-02
FORMULA_NAME gen-UpperBounds-03
FORMULA_NAME gen-UpperBounds-04
FORMULA_NAME gen-UpperBounds-05
FORMULA_NAME gen-UpperBounds-06
FORMULA_NAME gen-UpperBounds-07
FORMULA_NAME gen-UpperBounds-08
FORMULA_NAME gen-UpperBounds-09
FORMULA_NAME gen-UpperBounds-10
FORMULA_NAME gen-UpperBounds-11
FORMULA_NAME gen-UpperBounds-12
FORMULA_NAME gen-UpperBounds-13
FORMULA_NAME gen-UpperBounds-14
FORMULA_NAME gen-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621322097117

Running Version 0
[2021-05-18 07:14:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-18 07:14:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 07:14:58] [INFO ] Load time of PNML (sax parser for PT used): 349 ms
[2021-05-18 07:14:58] [INFO ] Transformed 3606 places.
[2021-05-18 07:14:59] [INFO ] Transformed 5141 transitions.
[2021-05-18 07:14:59] [INFO ] Parsed PT model containing 3606 places and 5141 transitions in 414 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Normalized transition count is 4869 out of 5141 initially.
// Phase 1: matrix 4869 rows 3606 cols
[2021-05-18 07:14:59] [INFO ] Computed 459 place invariants in 457 ms
Incomplete random walk after 10000 steps, including 317 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 16) seen :5
[2021-05-18 07:15:00] [INFO ] Flow matrix only has 4869 transitions (discarded 272 similar events)
// Phase 1: matrix 4869 rows 3606 cols
[2021-05-18 07:15:00] [INFO ] Computed 459 place invariants in 149 ms
[2021-05-18 07:15:00] [INFO ] [Real]Absence check using 44 positive place invariants in 45 ms returned sat
[2021-05-18 07:15:00] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 34 ms returned unsat
[2021-05-18 07:15:01] [INFO ] [Real]Absence check using 44 positive place invariants in 39 ms returned sat
[2021-05-18 07:15:01] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 29 ms returned unsat
[2021-05-18 07:15:01] [INFO ] [Real]Absence check using 44 positive place invariants in 40 ms returned sat
[2021-05-18 07:15:01] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 39 ms returned unsat
[2021-05-18 07:15:02] [INFO ] [Real]Absence check using 44 positive place invariants in 38 ms returned sat
[2021-05-18 07:15:02] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 131 ms returned sat
[2021-05-18 07:15:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 07:15:05] [INFO ] [Real]Absence check using state equation in 2813 ms returned sat
[2021-05-18 07:15:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 07:15:05] [INFO ] [Nat]Absence check using 44 positive place invariants in 40 ms returned sat
[2021-05-18 07:15:05] [INFO ] [Nat]Absence check using 44 positive and 415 generalized place invariants in 121 ms returned sat
[2021-05-18 07:15:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 07:15:07] [INFO ] [Nat]Absence check using state equation in 1884 ms returned sat
[2021-05-18 07:15:07] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2021-05-18 07:15:08] [INFO ] [Nat]Added 1379 Read/Feed constraints in 818 ms returned unsat
[2021-05-18 07:15:08] [INFO ] [Real]Absence check using 44 positive place invariants in 39 ms returned sat
[2021-05-18 07:15:08] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 34 ms returned unsat
[2021-05-18 07:15:09] [INFO ] [Real]Absence check using 44 positive place invariants in 38 ms returned sat
[2021-05-18 07:15:09] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 118 ms returned sat
[2021-05-18 07:15:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 07:15:11] [INFO ] [Real]Absence check using state equation in 2643 ms returned sat
[2021-05-18 07:15:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 07:15:12] [INFO ] [Nat]Absence check using 44 positive place invariants in 40 ms returned sat
[2021-05-18 07:15:12] [INFO ] [Nat]Absence check using 44 positive and 415 generalized place invariants in 121 ms returned sat
[2021-05-18 07:15:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 07:15:14] [INFO ] [Nat]Absence check using state equation in 1783 ms returned sat
[2021-05-18 07:15:16] [INFO ] [Nat]Added 1379 Read/Feed constraints in 2027 ms returned sat
[2021-05-18 07:15:19] [INFO ] Deduced a trap composed of 713 places in 2669 ms of which 5 ms to minimize.
[2021-05-18 07:15:19] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-18 07:15:19] [INFO ] [Real]Absence check using 44 positive place invariants in 38 ms returned sat
[2021-05-18 07:15:19] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 118 ms returned sat
[2021-05-18 07:15:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 07:15:22] [INFO ] [Real]Absence check using state equation in 2370 ms returned sat
[2021-05-18 07:15:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 07:15:22] [INFO ] [Nat]Absence check using 44 positive place invariants in 39 ms returned sat
[2021-05-18 07:15:22] [INFO ] [Nat]Absence check using 44 positive and 415 generalized place invariants in 126 ms returned sat
[2021-05-18 07:15:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 07:15:24] [INFO ] [Nat]Absence check using state equation in 1971 ms returned sat
[2021-05-18 07:15:25] [INFO ] [Nat]Added 1379 Read/Feed constraints in 1035 ms returned unsat
[2021-05-18 07:15:26] [INFO ] [Real]Absence check using 44 positive place invariants in 40 ms returned sat
[2021-05-18 07:15:26] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 100 ms returned unsat
[2021-05-18 07:15:26] [INFO ] [Real]Absence check using 44 positive place invariants in 38 ms returned sat
[2021-05-18 07:15:26] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 32 ms returned unsat
[2021-05-18 07:15:26] [INFO ] [Real]Absence check using 44 positive place invariants in 37 ms returned sat
[2021-05-18 07:15:27] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 86 ms returned unsat
[2021-05-18 07:15:27] [INFO ] [Real]Absence check using 44 positive place invariants in 38 ms returned sat
[2021-05-18 07:15:27] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 117 ms returned sat
[2021-05-18 07:15:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 07:15:29] [INFO ] [Real]Absence check using state equation in 1865 ms returned sat
[2021-05-18 07:15:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 07:15:29] [INFO ] [Nat]Absence check using 44 positive place invariants in 39 ms returned sat
[2021-05-18 07:15:30] [INFO ] [Nat]Absence check using 44 positive and 415 generalized place invariants in 119 ms returned sat
[2021-05-18 07:15:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 07:15:31] [INFO ] [Nat]Absence check using state equation in 1767 ms returned sat
[2021-05-18 07:15:32] [INFO ] [Nat]Added 1379 Read/Feed constraints in 1093 ms returned unsat
[2021-05-18 07:15:33] [INFO ] [Real]Absence check using 44 positive place invariants in 37 ms returned sat
[2021-05-18 07:15:33] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 119 ms returned sat
[2021-05-18 07:15:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 07:15:35] [INFO ] [Real]Absence check using state equation in 2334 ms returned sat
[2021-05-18 07:15:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 07:15:36] [INFO ] [Nat]Absence check using 44 positive place invariants in 39 ms returned sat
[2021-05-18 07:15:36] [INFO ] [Nat]Absence check using 44 positive and 415 generalized place invariants in 127 ms returned sat
[2021-05-18 07:15:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 07:15:38] [INFO ] [Nat]Absence check using state equation in 1844 ms returned sat
[2021-05-18 07:15:38] [INFO ] [Nat]Added 1379 Read/Feed constraints in 508 ms returned unsat
[2021-05-18 07:15:39] [INFO ] [Real]Absence check using 44 positive place invariants in 38 ms returned sat
[2021-05-18 07:15:39] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 28 ms returned unsat
[2021-05-18 07:15:39] [INFO ] [Real]Absence check using 44 positive place invariants in 38 ms returned sat
[2021-05-18 07:15:39] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 28 ms returned unsat
[2021-05-18 07:15:39] [INFO ] [Real]Absence check using 44 positive place invariants in 37 ms returned sat
[2021-05-18 07:15:39] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 118 ms returned sat
[2021-05-18 07:15:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 07:15:42] [INFO ] [Real]Absence check using state equation in 2207 ms returned sat
[2021-05-18 07:15:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 07:15:42] [INFO ] [Nat]Absence check using 44 positive place invariants in 39 ms returned sat
[2021-05-18 07:15:42] [INFO ] [Nat]Absence check using 44 positive and 415 generalized place invariants in 119 ms returned sat
[2021-05-18 07:15:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 07:15:44] [INFO ] [Nat]Absence check using state equation in 1898 ms returned sat
[2021-05-18 07:15:45] [INFO ] [Nat]Added 1379 Read/Feed constraints in 1242 ms returned unsat
[2021-05-18 07:15:46] [INFO ] [Real]Absence check using 44 positive place invariants in 37 ms returned sat
[2021-05-18 07:15:46] [INFO ] [Real]Absence check using 44 positive and 415 generalized place invariants in 121 ms returned sat
[2021-05-18 07:15:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 07:15:49] [INFO ] [Real]Absence check using state equation in 3342 ms returned sat
[2021-05-18 07:15:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 07:15:50] [INFO ] [Nat]Absence check using 44 positive place invariants in 40 ms returned sat
[2021-05-18 07:15:50] [INFO ] [Nat]Absence check using 44 positive and 415 generalized place invariants in 120 ms returned sat
[2021-05-18 07:15:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 07:15:52] [INFO ] [Nat]Absence check using state equation in 1846 ms returned sat
[2021-05-18 07:15:53] [INFO ] [Nat]Added 1379 Read/Feed constraints in 1269 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0] Max seen :[1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0]
FORMULA gen-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 3606 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3606/3606 places, 5141/5141 transitions.
Graph (complete) has 12103 edges and 3606 vertex of which 3580 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.15 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 816 transitions
Trivial Post-agglo rules discarded 816 transitions
Performed 816 trivial Post agglomeration. Transition count delta: 816
Iterating post reduction 0 with 816 rules applied. Total rules applied 817 place count 3580 transition count 4325
Reduce places removed 816 places and 0 transitions.
Iterating post reduction 1 with 816 rules applied. Total rules applied 1633 place count 2764 transition count 4325
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 1633 place count 2764 transition count 4223
Deduced a syphon composed of 102 places in 2 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 1837 place count 2662 transition count 4223
Discarding 714 places :
Symmetric choice reduction at 2 with 714 rule applications. Total rules 2551 place count 1948 transition count 3509
Iterating global reduction 2 with 714 rules applied. Total rules applied 3265 place count 1948 transition count 3509
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 3265 place count 1948 transition count 3503
Deduced a syphon composed of 6 places in 5 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 3277 place count 1942 transition count 3503
Discarding 238 places :
Symmetric choice reduction at 2 with 238 rule applications. Total rules 3515 place count 1704 transition count 2789
Iterating global reduction 2 with 238 rules applied. Total rules applied 3753 place count 1704 transition count 2789
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 3787 place count 1687 transition count 2772
Free-agglomeration rule (complex) applied 160 times.
Iterating global reduction 2 with 160 rules applied. Total rules applied 3947 place count 1687 transition count 3088
Reduce places removed 160 places and 0 transitions.
Iterating post reduction 2 with 160 rules applied. Total rules applied 4107 place count 1527 transition count 3088
Applied a total of 4107 rules in 1208 ms. Remains 1527 /3606 variables (removed 2079) and now considering 3088/5141 (removed 2053) transitions.
Finished structural reductions, in 1 iterations. Remains : 1527/3606 places, 3088/5141 transitions.
Normalized transition count is 2690 out of 3088 initially.
// Phase 1: matrix 2690 rows 1527 cols
[2021-05-18 07:15:54] [INFO ] Computed 433 place invariants in 76 ms
Incomplete random walk after 1000000 steps, including 52081 resets, run finished after 10797 ms. (steps per millisecond=92 ) properties (out of 1) seen :1
FORMULA gen-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621322166453

--------------------
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="MultiCrashLeafsetExtension-PT-S16C03"
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 MultiCrashLeafsetExtension-PT-S16C03, 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 r292-tall-162124156700579"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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