fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r168-tall-165277017300877
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for PolyORBNT-PT-S10J60

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
718.852 110279.00 129534.00 606.50 1 1 1 1 1 1 3 1 1 4 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/mcc2022-input.r168-tall-165277017300877.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 PolyORBNT-PT-S10J60, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017300877
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 17M
-rw-r--r-- 1 mcc users 55K Apr 30 04:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 229K Apr 30 04:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 355K Apr 30 03:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M Apr 30 03:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 19K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 268K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 799K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.7K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 14M 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 PolyORBNT-PT-S10J60-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652976643430

Running Version 202205111006
[2022-05-19 16:10:44] [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 16:10:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 16:10:45] [INFO ] Load time of PNML (sax parser for PT used): 716 ms
[2022-05-19 16:10:45] [INFO ] Transformed 1234 places.
[2022-05-19 16:10:45] [INFO ] Transformed 12920 transitions.
[2022-05-19 16:10:45] [INFO ] Parsed PT model containing 1234 places and 12920 transitions in 948 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Normalized transition count is 2801 out of 2810 initially.
// Phase 1: matrix 2801 rows 1234 cols
[2022-05-19 16:10:45] [INFO ] Computed 152 place invariants in 272 ms
FORMULA PolyORBNT-PT-S10J60-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J60-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J60-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 560 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :3
[2022-05-19 16:10:46] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1234 cols
[2022-05-19 16:10:47] [INFO ] Computed 152 place invariants in 114 ms
[2022-05-19 16:10:47] [INFO ] [Real]Absence check using 121 positive place invariants in 44 ms returned sat
[2022-05-19 16:10:47] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 51 ms returned sat
[2022-05-19 16:10:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 16:10:48] [INFO ] [Real]Absence check using state equation in 875 ms returned sat
[2022-05-19 16:10:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 16:10:48] [INFO ] [Nat]Absence check using 121 positive place invariants in 34 ms returned sat
[2022-05-19 16:10:48] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 40 ms returned sat
[2022-05-19 16:10:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 16:10:51] [INFO ] [Nat]Absence check using state equation in 3032 ms returned sat
[2022-05-19 16:10:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 16:10:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 793 ms returned sat
[2022-05-19 16:10:53] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 338 ms.
[2022-05-19 16:10:53] [INFO ] Added : 15 causal constraints over 3 iterations in 808 ms. Result :unknown
[2022-05-19 16:10:53] [INFO ] [Real]Absence check using 121 positive place invariants in 35 ms returned sat
[2022-05-19 16:10:53] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 39 ms returned sat
[2022-05-19 16:10:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 16:10:57] [INFO ] [Real]Absence check using state equation in 3446 ms returned sat
[2022-05-19 16:10:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 16:10:57] [INFO ] [Nat]Absence check using 121 positive place invariants in 33 ms returned sat
[2022-05-19 16:10:57] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 54 ms returned sat
[2022-05-19 16:10:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 16:11:02] [INFO ] [Nat]Absence check using state equation in 4800 ms returned unknown
[2022-05-19 16:11:02] [INFO ] [Real]Absence check using 121 positive place invariants in 33 ms returned sat
[2022-05-19 16:11:02] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 44 ms returned sat
[2022-05-19 16:11:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 16:11:07] [INFO ] [Real]Absence check using state equation in 4814 ms returned unknown
[2022-05-19 16:11:07] [INFO ] [Real]Absence check using 121 positive place invariants in 31 ms returned sat
[2022-05-19 16:11:07] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 43 ms returned sat
[2022-05-19 16:11:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 16:11:09] [INFO ] [Real]Absence check using state equation in 1547 ms returned sat
[2022-05-19 16:11:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 16:11:09] [INFO ] [Nat]Absence check using 121 positive place invariants in 32 ms returned sat
[2022-05-19 16:11:09] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 45 ms returned sat
[2022-05-19 16:11:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 16:11:14] [INFO ] [Nat]Absence check using state equation in 4801 ms returned unknown
[2022-05-19 16:11:14] [INFO ] [Real]Absence check using 121 positive place invariants in 30 ms returned sat
[2022-05-19 16:11:14] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 42 ms returned sat
[2022-05-19 16:11:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 16:11:16] [INFO ] [Real]Absence check using state equation in 1923 ms returned sat
[2022-05-19 16:11:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 16:11:16] [INFO ] [Nat]Absence check using 121 positive place invariants in 34 ms returned sat
[2022-05-19 16:11:16] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 40 ms returned sat
[2022-05-19 16:11:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 16:11:17] [INFO ] [Nat]Absence check using state equation in 977 ms returned sat
[2022-05-19 16:11:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 2318 ms returned sat
[2022-05-19 16:11:20] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 230 ms.
[2022-05-19 16:11:21] [INFO ] Deduced a trap composed of 149 places in 423 ms of which 3 ms to minimize.
[2022-05-19 16:11:21] [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 4
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 16:11:21] [INFO ] [Real]Absence check using 121 positive place invariants in 28 ms returned sat
[2022-05-19 16:11:21] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 20 ms returned unsat
[2022-05-19 16:11:22] [INFO ] [Real]Absence check using 121 positive place invariants in 31 ms returned sat
[2022-05-19 16:11:22] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 32 ms returned unsat
[2022-05-19 16:11:22] [INFO ] [Real]Absence check using 121 positive place invariants in 31 ms returned sat
[2022-05-19 16:11:22] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 44 ms returned sat
[2022-05-19 16:11:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 16:11:24] [INFO ] [Real]Absence check using state equation in 2172 ms returned sat
[2022-05-19 16:11:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 16:11:24] [INFO ] [Nat]Absence check using 121 positive place invariants in 31 ms returned sat
[2022-05-19 16:11:24] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 39 ms returned sat
[2022-05-19 16:11:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 16:11:29] [INFO ] [Nat]Absence check using state equation in 4829 ms returned unknown
[2022-05-19 16:11:29] [INFO ] [Real]Absence check using 121 positive place invariants in 31 ms returned sat
[2022-05-19 16:11:29] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 42 ms returned sat
[2022-05-19 16:11:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 16:11:31] [INFO ] [Real]Absence check using state equation in 1548 ms returned sat
[2022-05-19 16:11:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 16:11:31] [INFO ] [Nat]Absence check using 121 positive place invariants in 33 ms returned sat
[2022-05-19 16:11:31] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 39 ms returned sat
[2022-05-19 16:11:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 16:11:35] [INFO ] [Nat]Absence check using state equation in 4032 ms returned sat
[2022-05-19 16:11:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 178 ms returned sat
[2022-05-19 16:11:36] [INFO ] Deduced a trap composed of 644 places in 780 ms of which 2 ms to minimize.
[2022-05-19 16: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 8
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.verifyPossible(DeadlockTester.java:918)
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 16:11:36] [INFO ] [Real]Absence check using 121 positive place invariants in 30 ms returned sat
[2022-05-19 16:11:36] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 12 ms returned unsat
[2022-05-19 16:11:37] [INFO ] [Real]Absence check using 121 positive place invariants in 31 ms returned sat
[2022-05-19 16:11:37] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 39 ms returned sat
[2022-05-19 16:11:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 16:11:38] [INFO ] [Real]Absence check using state equation in 1438 ms returned sat
[2022-05-19 16:11:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 16:11:38] [INFO ] [Nat]Absence check using 121 positive place invariants in 31 ms returned sat
[2022-05-19 16:11:38] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 41 ms returned sat
[2022-05-19 16:11:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 16:11:43] [INFO ] [Nat]Absence check using state equation in 4813 ms returned unknown
[2022-05-19 16:11:43] [INFO ] [Real]Absence check using 121 positive place invariants in 31 ms returned sat
[2022-05-19 16:11:43] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 43 ms returned sat
[2022-05-19 16:11:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 16:11:46] [INFO ] [Real]Absence check using state equation in 2300 ms returned sat
[2022-05-19 16:11:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 16:11:46] [INFO ] [Nat]Absence check using 121 positive place invariants in 35 ms returned sat
[2022-05-19 16:11:46] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 44 ms returned sat
[2022-05-19 16:11:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 16:11:50] [INFO ] [Nat]Absence check using state equation in 4066 ms returned sat
[2022-05-19 16:11:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 28 ms returned sat
[2022-05-19 16:11:50] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 221 ms.
[2022-05-19 16:11:51] [INFO ] Added : 6 causal constraints over 2 iterations in 614 ms. Result :unknown
[2022-05-19 16:11:51] [INFO ] [Real]Absence check using 121 positive place invariants in 30 ms returned sat
[2022-05-19 16:11:51] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 43 ms returned sat
[2022-05-19 16:11:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 16:11:52] [INFO ] [Real]Absence check using state equation in 964 ms returned sat
[2022-05-19 16:11:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 16:11:52] [INFO ] [Nat]Absence check using 121 positive place invariants in 33 ms returned sat
[2022-05-19 16:11:52] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 46 ms returned sat
[2022-05-19 16:11:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 16:11:54] [INFO ] [Nat]Absence check using state equation in 1820 ms returned sat
[2022-05-19 16:11:57] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-19 16:11:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 2993 ms returned unknown
Current structural bounds on expressions (after SMT) : [70, 1, 201, 73, 69, 1, 1, 1, 4, 1, 28, 1, 1] Max seen :[0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0]
FORMULA PolyORBNT-PT-S10J60-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 128 out of 1234 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 1224 transition count 2806
Reduce places removed 4 places and 0 transitions.
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Iterating post reduction 1 with 65 rules applied. Total rules applied 79 place count 1220 transition count 2745
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 2 with 61 rules applied. Total rules applied 140 place count 1159 transition count 2745
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 140 place count 1159 transition count 2741
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 148 place count 1155 transition count 2741
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 149 place count 1154 transition count 2740
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 1154 transition count 2740
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 154 place count 1152 transition count 2738
Applied a total of 154 rules in 593 ms. Remains 1152 /1234 variables (removed 82) and now considering 2738/2810 (removed 72) transitions.
[2022-05-19 16:11:58] [INFO ] Flow matrix only has 2729 transitions (discarded 9 similar events)
// Phase 1: matrix 2729 rows 1152 cols
[2022-05-19 16:11:58] [INFO ] Computed 142 place invariants in 97 ms
[2022-05-19 16:12:00] [INFO ] Dead Transitions using invariants and state equation in 2421 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 1152/1234 places, 2123/2810 transitions.
Applied a total of 0 rules in 73 ms. Remains 1152 /1152 variables (removed 0) and now considering 2123/2123 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1152/1234 places, 2123/2810 transitions.
Normalized transition count is 2114 out of 2123 initially.
// Phase 1: matrix 2114 rows 1152 cols
[2022-05-19 16:12:00] [INFO ] Computed 142 place invariants in 91 ms
Incomplete random walk after 1000000 steps, including 71680 resets, run finished after 13860 ms. (steps per millisecond=72 ) properties (out of 9) seen :12
FORMULA PolyORBNT-PT-S10J60-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 7187 resets, run finished after 2265 ms. (steps per millisecond=441 ) properties (out of 5) seen :5
Incomplete Best-First random walk after 1000001 steps, including 7284 resets, run finished after 3440 ms. (steps per millisecond=290 ) properties (out of 5) seen :5
Incomplete Best-First random walk after 1000001 steps, including 7182 resets, run finished after 2286 ms. (steps per millisecond=437 ) properties (out of 5) seen :5
Incomplete Best-First random walk after 1000000 steps, including 7242 resets, run finished after 3337 ms. (steps per millisecond=299 ) properties (out of 5) seen :5
Incomplete Best-First random walk after 1000001 steps, including 6367 resets, run finished after 2169 ms. (steps per millisecond=461 ) properties (out of 5) seen :5
[2022-05-19 16:12:28] [INFO ] Flow matrix only has 2114 transitions (discarded 9 similar events)
// Phase 1: matrix 2114 rows 1152 cols
[2022-05-19 16:12:28] [INFO ] Computed 142 place invariants in 72 ms
[2022-05-19 16:12:28] [INFO ] [Real]Absence check using 120 positive place invariants in 30 ms returned sat
[2022-05-19 16:12:28] [INFO ] [Real]Absence check using 120 positive and 22 generalized place invariants in 29 ms returned unsat
[2022-05-19 16:12:28] [INFO ] [Real]Absence check using 120 positive place invariants in 28 ms returned sat
[2022-05-19 16:12:28] [INFO ] [Real]Absence check using 120 positive and 22 generalized place invariants in 29 ms returned unsat
[2022-05-19 16:12:28] [INFO ] [Real]Absence check using 120 positive place invariants in 29 ms returned sat
[2022-05-19 16:12:28] [INFO ] [Real]Absence check using 120 positive and 22 generalized place invariants in 28 ms returned unsat
[2022-05-19 16:12:28] [INFO ] [Real]Absence check using 120 positive place invariants in 28 ms returned sat
[2022-05-19 16:12:28] [INFO ] [Real]Absence check using 120 positive and 22 generalized place invariants in 31 ms returned sat
[2022-05-19 16:12:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 16:12:33] [INFO ] [Real]Absence check using state equation in 4363 ms returned sat
[2022-05-19 16:12:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 16:12:33] [INFO ] [Nat]Absence check using 120 positive place invariants in 29 ms returned sat
[2022-05-19 16:12:33] [INFO ] [Nat]Absence check using 120 positive and 22 generalized place invariants in 30 ms returned unsat
[2022-05-19 16:12:33] [INFO ] [Real]Absence check using 120 positive place invariants in 29 ms returned sat
[2022-05-19 16:12:33] [INFO ] [Real]Absence check using 120 positive and 22 generalized place invariants in 32 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[1, 1, 1, 1, 1]
FORMULA PolyORBNT-PT-S10J60-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 109073 ms.

BK_STOP 1652976753709

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S10J60"
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 PolyORBNT-PT-S10J60, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-165277017300877"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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