fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r140-tall-162089127600283
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for NoC3x3-PT-4B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
438.308 35112.00 51637.00 343.70 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 968K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 152K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 06:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 06:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 07:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 07:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 608K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1620958265155

Running Version 0
[2021-05-14 02:11:06] [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-14 02:11:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 02:11:06] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2021-05-14 02:11:06] [INFO ] Transformed 2328 places.
[2021-05-14 02:11:06] [INFO ] Transformed 2701 transitions.
[2021-05-14 02:11:06] [INFO ] Found NUPN structural information;
[2021-05-14 02:11:06] [INFO ] Parsed PT model containing 2328 places and 2701 transitions in 222 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 2701 rows 2328 cols
[2021-05-14 02:11:07] [INFO ] Computed 66 place invariants in 44 ms
Incomplete random walk after 10000 steps, including 5 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 16) seen :10
FORMULA NoC3x3-PT-4B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-13 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-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-01 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 13 ms. (steps per millisecond=769 ) properties (out of 6) 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 6) seen :1
FORMULA NoC3x3-PT-4B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) 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 5) seen :1
FORMULA NoC3x3-PT-4B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 2701 rows 2328 cols
[2021-05-14 02:11:07] [INFO ] Computed 66 place invariants in 15 ms
[2021-05-14 02:11:07] [INFO ] [Real]Absence check using 66 positive place invariants in 62 ms returned sat
[2021-05-14 02:11:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 02:11:08] [INFO ] [Real]Absence check using state equation in 893 ms returned sat
[2021-05-14 02:11:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 02:11:09] [INFO ] [Nat]Absence check using 66 positive place invariants in 66 ms returned sat
[2021-05-14 02:11:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 02:11:10] [INFO ] [Nat]Absence check using state equation in 908 ms returned sat
[2021-05-14 02:11:10] [INFO ] Deduced a trap composed of 118 places in 223 ms of which 5 ms to minimize.
[2021-05-14 02:11:10] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 2 ms to minimize.
[2021-05-14 02:11:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 664 ms
[2021-05-14 02:11:11] [INFO ] Computed and/alt/rep : 2700/4269/2700 causal constraints (skipped 0 transitions) in 167 ms.
[2021-05-14 02:11:15] [INFO ] Deduced a trap composed of 7 places in 1083 ms of which 3 ms to minimize.
[2021-05-14 02:11: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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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-14 02:11:15] [INFO ] [Real]Absence check using 66 positive place invariants in 64 ms returned sat
[2021-05-14 02:11:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 02:11:16] [INFO ] [Real]Absence check using state equation in 886 ms returned sat
[2021-05-14 02:11:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 02:11:16] [INFO ] [Nat]Absence check using 66 positive place invariants in 60 ms returned sat
[2021-05-14 02:11:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 02:11:17] [INFO ] [Nat]Absence check using state equation in 933 ms returned sat
[2021-05-14 02:11:17] [INFO ] Deduced a trap composed of 70 places in 164 ms of which 9 ms to minimize.
[2021-05-14 02:11:18] [INFO ] Deduced a trap composed of 76 places in 143 ms of which 1 ms to minimize.
[2021-05-14 02:11:18] [INFO ] Deduced a trap composed of 115 places in 143 ms of which 0 ms to minimize.
[2021-05-14 02:11:18] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 1 ms to minimize.
[2021-05-14 02:11:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 949 ms
[2021-05-14 02:11:18] [INFO ] Computed and/alt/rep : 2700/4269/2700 causal constraints (skipped 0 transitions) in 153 ms.
[2021-05-14 02:11:22] [INFO ] Deduced a trap composed of 7 places in 1017 ms of which 9 ms to minimize.
[2021-05-14 02:11:22] [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-14 02:11:22] [INFO ] [Real]Absence check using 66 positive place invariants in 57 ms returned sat
[2021-05-14 02:11:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 02:11:23] [INFO ] [Real]Absence check using state equation in 901 ms returned sat
[2021-05-14 02:11:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 02:11:24] [INFO ] [Nat]Absence check using 66 positive place invariants in 58 ms returned sat
[2021-05-14 02:11:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 02:11:25] [INFO ] [Nat]Absence check using state equation in 873 ms returned sat
[2021-05-14 02:11:25] [INFO ] Deduced a trap composed of 120 places in 104 ms of which 0 ms to minimize.
[2021-05-14 02:11:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2021-05-14 02:11:25] [INFO ] Computed and/alt/rep : 2700/4269/2700 causal constraints (skipped 0 transitions) in 138 ms.
[2021-05-14 02:11:28] [INFO ] Added : 150 causal constraints over 30 iterations in 3492 ms. Result :unknown
[2021-05-14 02:11:29] [INFO ] [Real]Absence check using 66 positive place invariants in 58 ms returned sat
[2021-05-14 02:11:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 02:11:30] [INFO ] [Real]Absence check using state equation in 889 ms returned sat
[2021-05-14 02:11:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 02:11:30] [INFO ] [Nat]Absence check using 66 positive place invariants in 58 ms returned sat
[2021-05-14 02:11:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 02:11:31] [INFO ] [Nat]Absence check using state equation in 884 ms returned sat
[2021-05-14 02:11:31] [INFO ] Deduced a trap composed of 76 places in 175 ms of which 0 ms to minimize.
[2021-05-14 02:11:31] [INFO ] Deduced a trap composed of 101 places in 136 ms of which 0 ms to minimize.
[2021-05-14 02:11:32] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 0 ms to minimize.
[2021-05-14 02:11:32] [INFO ] Deduced a trap composed of 106 places in 86 ms of which 0 ms to minimize.
[2021-05-14 02:11:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 874 ms
[2021-05-14 02:11:32] [INFO ] Computed and/alt/rep : 2700/4269/2700 causal constraints (skipped 0 transitions) in 128 ms.
[2021-05-14 02:11:36] [INFO ] Deduced a trap composed of 7 places in 1064 ms of which 3 ms to minimize.
[2021-05-14 02:11:36] [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: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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 324000 steps, including 658 resets, run finished after 1295 ms. (steps per millisecond=250 ) properties (out of 4) seen :2 could not realise parikh vector
FORMULA NoC3x3-PT-4B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 2328 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2328/2328 places, 2701/2701 transitions.
Graph (trivial) has 2322 edges and 2328 vertex of which 1399 / 2328 are part of one of the 33 SCC in 12 ms
Free SCC test removed 1366 places
Drop transitions removed 1653 transitions
Reduce isomorphic transitions removed 1653 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 962 transition count 1015
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 929 transition count 1015
Discarding 325 places :
Symmetric choice reduction at 2 with 325 rule applications. Total rules 392 place count 604 transition count 690
Iterating global reduction 2 with 325 rules applied. Total rules applied 717 place count 604 transition count 690
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 717 place count 604 transition count 622
Deduced a syphon composed of 68 places in 3 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 853 place count 536 transition count 622
Discarding 55 places :
Symmetric choice reduction at 2 with 55 rule applications. Total rules 908 place count 481 transition count 534
Iterating global reduction 2 with 55 rules applied. Total rules applied 963 place count 481 transition count 534
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 1161 place count 382 transition count 435
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1162 place count 381 transition count 433
Iterating global reduction 2 with 1 rules applied. Total rules applied 1163 place count 381 transition count 433
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1165 place count 380 transition count 447
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1167 place count 380 transition count 445
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 1173 place count 380 transition count 439
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1175 place count 379 transition count 450
Free-agglomeration rule applied 200 times.
Iterating global reduction 3 with 200 rules applied. Total rules applied 1375 place count 379 transition count 250
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (complete) has 488 edges and 179 vertex of which 24 are kept as prefixes of interest. Removing 155 places using SCC suffix rule.1 ms
Discarding 155 places :
Also discarding 149 output transitions
Drop transitions removed 149 transitions
Iterating post reduction 3 with 237 rules applied. Total rules applied 1612 place count 24 transition count 65
Drop transitions removed 41 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 4 with 44 rules applied. Total rules applied 1656 place count 24 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1657 place count 23 transition count 20
Reduce places removed 8 places and 0 transitions.
Graph (trivial) has 15 edges and 15 vertex of which 10 / 15 are part of one of the 2 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 5 with 9 rules applied. Total rules applied 1666 place count 7 transition count 20
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 1680 place count 7 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1680 place count 7 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1682 place count 6 transition count 5
Applied a total of 1682 rules in 293 ms. Remains 6 /2328 variables (removed 2322) and now considering 5/2701 (removed 2696) transitions.
Finished structural reductions, in 1 iterations. Remains : 6/2328 places, 5/2701 transitions.
// Phase 1: matrix 5 rows 6 cols
[2021-05-14 02:11:37] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1406 ms. (steps per millisecond=711 ) properties (out of 2) seen :2
FORMULA NoC3x3-PT-4B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620958300267

--------------------
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="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 r140-tall-162089127600283"
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 ;