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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.9M
-rw-r--r-- 1 mcc users 52K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 191K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 42K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 140K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.5K May 12 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 12 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 12 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 12 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 4.7K May 11 18:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 11 18:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 11 15:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 11 15:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 6 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 8.4M 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 1621308220475

Running Version 0
[2021-05-18 03:23:42] [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 03:23:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 03:23:42] [INFO ] Load time of PNML (sax parser for PT used): 335 ms
[2021-05-18 03:23:42] [INFO ] Transformed 5622 places.
[2021-05-18 03:23:42] [INFO ] Transformed 5449 transitions.
[2021-05-18 03:23:42] [INFO ] Parsed PT model containing 5622 places and 5449 transitions in 405 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 5449 rows 5622 cols
[2021-05-18 03:23:43] [INFO ] Computed 173 place invariants in 757 ms
Incomplete random walk after 10000 steps, including 383 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 16) seen :10
FORMULA gen-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA gen-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA gen-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA gen-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA gen-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA gen-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA gen-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA gen-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :1
FORMULA gen-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :2
FORMULA gen-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :1
// Phase 1: matrix 5449 rows 5622 cols
[2021-05-18 03:23:44] [INFO ] Computed 173 place invariants in 324 ms
[2021-05-18 03:23:44] [INFO ] [Real]Absence check using 35 positive place invariants in 76 ms returned sat
[2021-05-18 03:23:44] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 110 ms returned unsat
[2021-05-18 03:23:45] [INFO ] [Real]Absence check using 35 positive place invariants in 59 ms returned sat
[2021-05-18 03:23:45] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 122 ms returned sat
[2021-05-18 03:23:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 03:23:48] [INFO ] [Real]Absence check using state equation in 2857 ms returned sat
[2021-05-18 03:23:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 03:23:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 61 ms returned sat
[2021-05-18 03:23:49] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 115 ms returned sat
[2021-05-18 03:23:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 03:23:52] [INFO ] [Nat]Absence check using state equation in 2857 ms returned sat
[2021-05-18 03:23:52] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 346 ms.
[2021-05-18 03:24:00] [INFO ] Deduced a trap composed of 2 places in 6557 ms of which 14 ms to minimize.
[2021-05-18 03:24:00] [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 1
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.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
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 03:24:00] [INFO ] [Real]Absence check using 35 positive place invariants in 63 ms returned sat
[2021-05-18 03:24:00] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 124 ms returned sat
[2021-05-18 03:24:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 03:24:03] [INFO ] [Real]Absence check using state equation in 2860 ms returned sat
[2021-05-18 03:24:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 03:24:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 62 ms returned sat
[2021-05-18 03:24:04] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 122 ms returned sat
[2021-05-18 03:24:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 03:24:07] [INFO ] [Nat]Absence check using state equation in 2888 ms returned sat
[2021-05-18 03:24:08] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 412 ms.
[2021-05-18 03:24:15] [INFO ] Deduced a trap composed of 2 places in 6541 ms of which 5 ms to minimize.
[2021-05-18 03:24:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
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 03:24:16] [INFO ] [Real]Absence check using 35 positive place invariants in 58 ms returned sat
[2021-05-18 03:24:16] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 133 ms returned sat
[2021-05-18 03:24:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 03:24:19] [INFO ] [Real]Absence check using state equation in 2872 ms returned sat
[2021-05-18 03:24:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 03:24:19] [INFO ] [Nat]Absence check using 35 positive place invariants in 60 ms returned sat
[2021-05-18 03:24:19] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 126 ms returned sat
[2021-05-18 03:24:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 03:24:22] [INFO ] [Nat]Absence check using state equation in 2814 ms returned sat
[2021-05-18 03:24:23] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 304 ms.
[2021-05-18 03:24:24] [INFO ] Added : 11 causal constraints over 3 iterations in 1325 ms. Result :unknown
[2021-05-18 03:24:24] [INFO ] [Real]Absence check using 35 positive place invariants in 57 ms returned sat
[2021-05-18 03:24:25] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 117 ms returned sat
[2021-05-18 03:24:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 03:24:27] [INFO ] [Real]Absence check using state equation in 2833 ms returned sat
[2021-05-18 03:24:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 03:24:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 59 ms returned sat
[2021-05-18 03:24:28] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 119 ms returned sat
[2021-05-18 03:24:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 03:24:31] [INFO ] [Nat]Absence check using state equation in 2883 ms returned sat
[2021-05-18 03:24:32] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 283 ms.
[2021-05-18 03:24:33] [INFO ] Added : 11 causal constraints over 3 iterations in 1300 ms. Result :unknown
[2021-05-18 03:24:33] [INFO ] [Real]Absence check using 35 positive place invariants in 58 ms returned sat
[2021-05-18 03:24:33] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 106 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, -1, 1, 1] Max seen :[1, 0, 0, 1, 0, 1]
FORMULA gen-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 1500 steps, including 129 resets, run finished after 15 ms. (steps per millisecond=100 ) properties (out of 4) seen :1 could not realise parikh vector
FORMULA gen-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 1600 steps, including 95 resets, run finished after 17 ms. (steps per millisecond=94 ) properties (out of 3) seen :2 could not realise parikh vector
Support contains 3 out of 5622 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5622/5622 places, 5449/5449 transitions.
Graph (complete) has 11001 edges and 5622 vertex of which 209 are kept as prefixes of interest. Removing 5413 places using SCC suffix rule.15 ms
Discarding 5413 places :
Also discarding 3184 output transitions
Drop transitions removed 3184 transitions
Drop transitions removed 1104 transitions
Reduce isomorphic transitions removed 1104 transitions.
Discarding 16 places :
Implicit places reduction removed 16 places
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 1152 rules applied. Total rules applied 1153 place count 193 transition count 1129
Reduce places removed 35 places and 0 transitions.
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 68 rules applied. Total rules applied 1221 place count 158 transition count 1096
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 1238 place count 141 transition count 1096
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1238 place count 141 transition count 1093
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1244 place count 138 transition count 1093
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1259 place count 123 transition count 1078
Iterating global reduction 3 with 15 rules applied. Total rules applied 1274 place count 123 transition count 1078
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1276 place count 122 transition count 1077
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1277 place count 122 transition count 1076
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1278 place count 121 transition count 1076
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 4 with 17 rules applied. Total rules applied 1295 place count 121 transition count 1059
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 1312 place count 104 transition count 1059
Drop transitions removed 465 transitions
Redundant transition composition rules discarded 465 transitions
Iterating global reduction 5 with 465 rules applied. Total rules applied 1777 place count 104 transition count 594
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 1790 place count 91 transition count 360
Iterating global reduction 5 with 13 rules applied. Total rules applied 1803 place count 91 transition count 360
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 5 with 29 rules applied. Total rules applied 1832 place count 91 transition count 360
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 1833 place count 90 transition count 360
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1834 place count 90 transition count 359
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1835 place count 89 transition count 359
Applied a total of 1835 rules in 204 ms. Remains 89 /5622 variables (removed 5533) and now considering 359/5449 (removed 5090) transitions.
Finished structural reductions, in 1 iterations. Remains : 89/5622 places, 359/5449 transitions.
Successfully produced net in file /tmp/petri1000_10298781842427466016.dot
Successfully produced net in file /tmp/petri1001_16036863123086555574.dot
Successfully produced net in file /tmp/petri1002_6156552113394065209.dot
Successfully produced net in file /tmp/petri1003_17627584530529687790.dot
Successfully produced net in file /tmp/petri1004_13512273638451965708.dot
Successfully produced net in file /tmp/petri1005_15906056149588000260.dot
Successfully produced net in file /tmp/petri1006_2254409426340497047.dot
Successfully produced net in file /tmp/petri1007_211674406325383918.dot
Successfully produced net in file /tmp/petri1008_12599805738677575903.dot
Successfully produced net in file /tmp/petri1009_6293549795666009758.dot
Successfully produced net in file /tmp/petri1010_3372829422914758316.dot
Successfully produced net in file /tmp/petri1011_16998001222681401438.dot
Successfully produced net in file /tmp/petri1012_1509512834495976984.dot
Successfully produced net in file /tmp/petri1013_3348069539107468412.dot
Successfully produced net in file /tmp/petri1014_10331658333351299027.dot
Drop transitions removed 15 transitions
Dominated transitions for bounds rules discarded 15 transitions
Normalized transition count is 87 out of 344 initially.
// Phase 1: matrix 87 rows 89 cols
[2021-05-18 03:24:34] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 139477 resets, run finished after 3019 ms. (steps per millisecond=331 ) properties (out of 3) seen :5
FORMULA gen-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA gen-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 14813 resets, run finished after 608 ms. (steps per millisecond=1644 ) properties (out of 1) seen :3
[2021-05-18 03:24:37] [INFO ] Flow matrix only has 87 transitions (discarded 257 similar events)
// Phase 1: matrix 87 rows 89 cols
[2021-05-18 03:24:37] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-18 03:24:37] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2021-05-18 03:24:37] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-18 03:24:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 03:24:37] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
Current structural bounds on expressions (after SMT) : [3] Max seen :[3]
FORMULA gen-UpperBounds-08 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621308282684

--------------------
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="LeafsetExtension-PT-S32C3"
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 LeafsetExtension-PT-S32C3, 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-162124156600531"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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