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.r150-smll-165276998500173.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 NoC3x3-PT-4B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998500173
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 856K
-rw-r--r-- 1 mcc users 7.9K Apr 29 13:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 29 13:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 29 13:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 29 13:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 608K 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 NoC3x3-PT-4B-UpperBounds-00
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-01
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-02
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-03
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-04
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-05
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-06
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-07
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-08
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-09
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-10
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-11
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-12
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-13
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-14
FORMULA_NAME NoC3x3-PT-4B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652996134375

Running Version 202205111006
[2022-05-19 21:35:36] [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-19 21:35:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 21:35:37] [INFO ] Load time of PNML (sax parser for PT used): 490 ms
[2022-05-19 21:35:37] [INFO ] Transformed 2328 places.
[2022-05-19 21:35:37] [INFO ] Transformed 2701 transitions.
[2022-05-19 21:35:37] [INFO ] Found NUPN structural information;
[2022-05-19 21:35:37] [INFO ] Parsed PT model containing 2328 places and 2701 transitions in 786 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
// Phase 1: matrix 2701 rows 2328 cols
[2022-05-19 21:35:37] [INFO ] Computed 66 place invariants in 74 ms
Incomplete random walk after 10000 steps, including 5 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 16) seen :12
FORMULA NoC3x3-PT-4B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
// Phase 1: matrix 2701 rows 2328 cols
[2022-05-19 21:35:38] [INFO ] Computed 66 place invariants in 16 ms
[2022-05-19 21:35:39] [INFO ] [Real]Absence check using 66 positive place invariants in 134 ms returned sat
[2022-05-19 21:35:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 21:35:41] [INFO ] [Real]Absence check using state equation in 2029 ms returned sat
[2022-05-19 21:35:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 21:35:42] [INFO ] [Nat]Absence check using 66 positive place invariants in 111 ms returned sat
[2022-05-19 21:35:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 21:35:44] [INFO ] [Nat]Absence check using state equation in 1578 ms returned sat
[2022-05-19 21:35:44] [INFO ] Deduced a trap composed of 107 places in 378 ms of which 12 ms to minimize.
[2022-05-19 21:35:45] [INFO ] Deduced a trap composed of 120 places in 262 ms of which 2 ms to minimize.
[2022-05-19 21:35:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1137 ms
[2022-05-19 21:35:45] [INFO ] Computed and/alt/rep : 2700/4269/2700 causal constraints (skipped 0 transitions) in 356 ms.
[2022-05-19 21:35:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
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-19 21:35:47] [INFO ] [Real]Absence check using 66 positive place invariants in 103 ms returned sat
[2022-05-19 21:35:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 21:35:49] [INFO ] [Real]Absence check using state equation in 1910 ms returned sat
[2022-05-19 21:35:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 21:35:50] [INFO ] [Nat]Absence check using 66 positive place invariants in 100 ms returned sat
[2022-05-19 21:35:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 21:35:52] [INFO ] [Nat]Absence check using state equation in 1823 ms returned sat
[2022-05-19 21:35:52] [INFO ] Deduced a trap composed of 68 places in 429 ms of which 2 ms to minimize.
[2022-05-19 21:35:53] [INFO ] Deduced a trap composed of 106 places in 319 ms of which 3 ms to minimize.
[2022-05-19 21:35:53] [INFO ] Deduced a trap composed of 120 places in 221 ms of which 1 ms to minimize.
[2022-05-19 21:35:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1624 ms
[2022-05-19 21:35:53] [INFO ] Computed and/alt/rep : 2700/4269/2700 causal constraints (skipped 0 transitions) in 318 ms.
[2022-05-19 21:35:54] [INFO ] Added : 15 causal constraints over 3 iterations in 885 ms. Result :unknown
[2022-05-19 21:35:55] [INFO ] [Real]Absence check using 66 positive place invariants in 104 ms returned sat
[2022-05-19 21:35:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 21:35:57] [INFO ] [Real]Absence check using state equation in 1833 ms returned sat
[2022-05-19 21:35:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 21:35:57] [INFO ] [Nat]Absence check using 66 positive place invariants in 158 ms returned sat
[2022-05-19 21:35:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 21:35:59] [INFO ] [Nat]Absence check using state equation in 1763 ms returned sat
[2022-05-19 21:36:00] [INFO ] Deduced a trap composed of 115 places in 281 ms of which 1 ms to minimize.
[2022-05-19 21:36:00] [INFO ] Deduced a trap composed of 77 places in 379 ms of which 1 ms to minimize.
[2022-05-19 21:36:00] [INFO ] Deduced a trap composed of 69 places in 180 ms of which 1 ms to minimize.
[2022-05-19 21:36:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1378 ms
[2022-05-19 21:36:01] [INFO ] Computed and/alt/rep : 2700/4269/2700 causal constraints (skipped 0 transitions) in 217 ms.
[2022-05-19 21:36:04] [INFO ] Deduced a trap composed of 7 places in 2413 ms of which 6 ms to minimize.
[2022-05-19 21:36:04] [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-19 21:36:05] [INFO ] [Real]Absence check using 66 positive place invariants in 126 ms returned sat
[2022-05-19 21:36:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 21:36:07] [INFO ] [Real]Absence check using state equation in 1686 ms returned sat
[2022-05-19 21:36:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 21:36:07] [INFO ] [Nat]Absence check using 66 positive place invariants in 97 ms returned sat
[2022-05-19 21:36:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 21:36:09] [INFO ] [Nat]Absence check using state equation in 1638 ms returned sat
[2022-05-19 21:36:09] [INFO ] Deduced a trap composed of 113 places in 333 ms of which 1 ms to minimize.
[2022-05-19 21:36:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 641 ms
[2022-05-19 21:36:10] [INFO ] Computed and/alt/rep : 2700/4269/2700 causal constraints (skipped 0 transitions) in 215 ms.
[2022-05-19 21:36:12] [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 3
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.refineWithCausalOrder(DeadlockTester.java:1188)
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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA NoC3x3-PT-4B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 2328 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2328/2328 places, 2701/2701 transitions.
Graph (trivial) has 2321 edges and 2328 vertex of which 1397 / 2328 are part of one of the 33 SCC in 21 ms
Free SCC test removed 1364 places
Drop transitions removed 1650 transitions
Reduce isomorphic transitions removed 1650 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 964 transition count 1018
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 931 transition count 1017
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 930 transition count 1017
Discarding 327 places :
Symmetric choice reduction at 3 with 327 rule applications. Total rules 396 place count 603 transition count 690
Iterating global reduction 3 with 327 rules applied. Total rules applied 723 place count 603 transition count 690
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 69 Pre rules applied. Total rules applied 723 place count 603 transition count 621
Deduced a syphon composed of 69 places in 7 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 861 place count 534 transition count 621
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 917 place count 478 transition count 531
Iterating global reduction 3 with 56 rules applied. Total rules applied 973 place count 478 transition count 531
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 2 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 1169 place count 380 transition count 433
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
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 1171 place count 379 transition count 447
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1173 place count 379 transition count 445
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 1179 place count 379 transition count 439
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1181 place count 378 transition count 450
Free-agglomeration rule applied 199 times.
Iterating global reduction 4 with 199 rules applied. Total rules applied 1380 place count 378 transition count 251
Reduce places removed 199 places and 0 transitions.
Drop transitions removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Graph (complete) has 489 edges and 179 vertex of which 6 are kept as prefixes of interest. Removing 173 places using SCC suffix rule.6 ms
Discarding 173 places :
Also discarding 196 output transitions
Drop transitions removed 196 transitions
Iterating post reduction 4 with 235 rules applied. Total rules applied 1615 place count 6 transition count 20
Drop transitions removed 12 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 1630 place count 6 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1631 place count 5 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1632 place count 4 transition count 4
Applied a total of 1632 rules in 628 ms. Remains 4 /2328 variables (removed 2324) and now considering 4/2701 (removed 2697) transitions.
Finished structural reductions, in 1 iterations. Remains : 4/2328 places, 4/2701 transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-19 21:36:14] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 702 ms. (steps per millisecond=1424 ) properties (out of 2) seen :2
FORMULA NoC3x3-PT-4B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 38045 ms.

BK_STOP 1652996174951

--------------------
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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="NoC3x3-PT-4B"
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 NoC3x3-PT-4B, 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 r150-smll-165276998500173"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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