Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r168-tall-165277016900629.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBLF-PT-S02J06T10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016900629
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 22K Apr 29 13:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 29 13:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 38K Apr 29 13:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 200K Apr 29 13:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 17K May 9 08:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 9 08:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 9 08:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 9 08:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K May 9 08:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.0K May 9 08:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.1M May 10 09:34 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 PolyORBLF-PT-S02J06T10-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652898664742

Running Version 202205111006
[2022-05-18 18:31:05] [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]
[2022-05-18 18:31:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 18:31:06] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2022-05-18 18:31:06] [INFO ] Transformed 844 places.
[2022-05-18 18:31:06] [INFO ] Transformed 1812 transitions.
[2022-05-18 18:31:06] [INFO ] Parsed PT model containing 844 places and 1812 transitions in 307 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Normalized transition count is 1632 out of 1652 initially.
// Phase 1: matrix 1632 rows 844 cols
[2022-05-18 18:31:06] [INFO ] Computed 58 place invariants in 128 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 16) seen :18
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :15
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :14
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :14
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :15
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :14
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :15
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :15
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :15
[2022-05-18 18:31:06] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 844 cols
[2022-05-18 18:31:07] [INFO ] Computed 58 place invariants in 64 ms
[2022-05-18 18:31:07] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2022-05-18 18:31:07] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 31 ms returned unsat
[2022-05-18 18:31:07] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2022-05-18 18:31:07] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 36 ms returned unsat
[2022-05-18 18:31:07] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2022-05-18 18:31:07] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 40 ms returned sat
[2022-05-18 18:31:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 18:31:10] [INFO ] [Real]Absence check using state equation in 2573 ms returned sat
[2022-05-18 18:31:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 18:31:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2022-05-18 18:31:10] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 44 ms returned sat
[2022-05-18 18:31:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 18:31:12] [INFO ] [Nat]Absence check using state equation in 2037 ms returned sat
[2022-05-18 18:31:12] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 18:31:13] [INFO ] [Nat]Added 120 Read/Feed constraints in 885 ms returned sat
[2022-05-18 18:31:13] [INFO ] Computed and/alt/rep : 780/1548/770 causal constraints (skipped 860 transitions) in 188 ms.
[2022-05-18 18:31:15] [INFO ] Deduced a trap composed of 3 places in 478 ms of which 4 ms to minimize.
[2022-05-18 18:31: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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 18:31:15] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2022-05-18 18:31:15] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 41 ms returned sat
[2022-05-18 18:31:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 18:31:18] [INFO ] [Real]Absence check using state equation in 2187 ms returned sat
[2022-05-18 18:31:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 18:31:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2022-05-18 18:31:18] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 37 ms returned sat
[2022-05-18 18:31:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 18:31:20] [INFO ] [Nat]Absence check using state equation in 2451 ms returned sat
[2022-05-18 18:31:23] [INFO ] [Nat]Added 120 Read/Feed constraints in 2350 ms returned sat
[2022-05-18 18:31:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1001)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 18:31:23] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2022-05-18 18:31:23] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 28 ms returned unsat
[2022-05-18 18:31:23] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2022-05-18 18:31:23] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 36 ms returned unsat
[2022-05-18 18:31:23] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2022-05-18 18:31:23] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 35 ms returned unsat
[2022-05-18 18:31:23] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2022-05-18 18:31:23] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 36 ms returned unsat
[2022-05-18 18:31:23] [INFO ] [Real]Absence check using 13 positive place invariants in 20 ms returned sat
[2022-05-18 18:31:23] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 35 ms returned unsat
[2022-05-18 18:31:24] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2022-05-18 18:31:24] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 41 ms returned unsat
[2022-05-18 18:31:24] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2022-05-18 18:31:24] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 27 ms returned unsat
[2022-05-18 18:31:24] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2022-05-18 18:31:24] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 41 ms returned sat
[2022-05-18 18:31:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 18:31:26] [INFO ] [Real]Absence check using state equation in 1640 ms returned sat
[2022-05-18 18:31:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 18:31:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2022-05-18 18:31:26] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 38 ms returned sat
[2022-05-18 18:31:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 18:31:29] [INFO ] [Nat]Absence check using state equation in 2832 ms returned sat
[2022-05-18 18:31:31] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 18:31:31] [INFO ] [Nat]Added 120 Read/Feed constraints in 2059 ms returned unknown
[2022-05-18 18:31:31] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2022-05-18 18:31:31] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 37 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, -1, -1, 2, 1, 1, 1, 1, 1, 1, -1, 1] Max seen :[1, 1, 2, 0, 2, 1, 1, 1, 1, 1, 1, 2, 1]
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 12 out of 844 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 842 transition count 1563
Reduce places removed 89 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 90 rules applied. Total rules applied 181 place count 753 transition count 1562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 182 place count 752 transition count 1562
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 182 place count 752 transition count 1462
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 382 place count 652 transition count 1462
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 2 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 522 place count 582 transition count 1392
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 3 with 19 rules applied. Total rules applied 541 place count 582 transition count 1373
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 560 place count 563 transition count 1373
Applied a total of 560 rules in 283 ms. Remains 563 /844 variables (removed 281) and now considering 1373/1652 (removed 279) transitions.
[2022-05-18 18:31:31] [INFO ] Flow matrix only has 1353 transitions (discarded 20 similar events)
// Phase 1: matrix 1353 rows 563 cols
[2022-05-18 18:31:31] [INFO ] Computed 56 place invariants in 23 ms
[2022-05-18 18:31:32] [INFO ] Dead Transitions using invariants and state equation in 1410 ms found 110 transitions.
Found 110 dead transitions using SMT.
Drop transitions removed 110 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 110 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 563/844 places, 1263/1652 transitions.
Reduce places removed 1 places and 20 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 562 transition count 1243
Reduce places removed 20 places and 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 21 place count 542 transition count 1223
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 21 rules in 88 ms. Remains 542 /563 variables (removed 21) and now considering 1223/1263 (removed 40) transitions.
Finished structural reductions, in 2 iterations. Remains : 542/844 places, 1223/1652 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 1203 out of 1223 initially.
// Phase 1: matrix 1203 rows 541 cols
[2022-05-18 18:31:33] [INFO ] Computed 56 place invariants in 31 ms
Incomplete random walk after 1000000 steps, including 332 resets, run finished after 5397 ms. (steps per millisecond=185 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000000 steps, including 142 resets, run finished after 2419 ms. (steps per millisecond=413 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 1000000 steps, including 116 resets, run finished after 2310 ms. (steps per millisecond=432 ) properties (out of 2) seen :4
[2022-05-18 18:31:43] [INFO ] Flow matrix only has 1203 transitions (discarded 20 similar events)
// Phase 1: matrix 1203 rows 541 cols
[2022-05-18 18:31:43] [INFO ] Computed 56 place invariants in 22 ms
[2022-05-18 18:31:43] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2022-05-18 18:31:43] [INFO ] [Real]Absence check using 16 positive and 40 generalized place invariants in 10 ms returned unsat
[2022-05-18 18:31:43] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2022-05-18 18:31:43] [INFO ] [Real]Absence check using 16 positive and 40 generalized place invariants in 12 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, 2, -1] Max seen :[2, 2, 2]
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 37520 ms.

BK_STOP 1652898703502

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="PolyORBLF-PT-S02J06T10"
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 PolyORBLF-PT-S02J06T10, 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 r168-tall-165277016900629"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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