fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r389-oct2-167903713400349
Last Updated
May 14, 2023

About the Execution of ITS-Tools for ShieldIIPt-PT-100B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1163.987 291786.00 334355.00 613.20 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/mcc2023-input.r389-oct2-167903713400349.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldIIPt-PT-100B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713400349
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.5K Feb 25 17:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 17:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 17:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 17:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 17:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 25 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 25 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.7M Mar 5 18:23 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 ShieldIIPt-PT-100B-UpperBounds-00
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-01
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-02
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-03
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-04
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-05
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-06
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-07
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-08
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-09
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-10
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-11
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-12
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-13
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-14
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679192493209

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-100B
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-19 02:21:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 02:21:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 02:21:35] [INFO ] Load time of PNML (sax parser for PT used): 221 ms
[2023-03-19 02:21:35] [INFO ] Transformed 7003 places.
[2023-03-19 02:21:35] [INFO ] Transformed 6503 transitions.
[2023-03-19 02:21:35] [INFO ] Found NUPN structural information;
[2023-03-19 02:21:35] [INFO ] Parsed PT model containing 7003 places and 6503 transitions and 16206 arcs in 686 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 6503 rows 7003 cols
[2023-03-19 02:21:36] [INFO ] Computed 901 place invariants in 83 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 16) seen :8
FORMULA ShieldIIPt-PT-100B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-03 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 8) 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 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) 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 8) 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 8) 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 8) seen :0
[2023-03-19 02:21:36] [INFO ] Invariant cache hit.
[2023-03-19 02:21:39] [INFO ] [Real]Absence check using 901 positive place invariants in 1124 ms returned sat
[2023-03-19 02:21:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 02:21:41] [INFO ] [Real]Absence check using state equation in 2603 ms returned unknown
[2023-03-19 02:21:43] [INFO ] [Real]Absence check using 901 positive place invariants in 659 ms returned sat
[2023-03-19 02:21:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 02:21: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 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2023-03-19 02:21:49] [INFO ] [Real]Absence check using 901 positive place invariants in 705 ms returned sat
[2023-03-19 02:21:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 02:21:51] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2023-03-19 02:21:54] [INFO ] [Real]Absence check using 901 positive place invariants in 689 ms returned sat
[2023-03-19 02:21:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 02:21:57] [INFO ] [Real]Absence check using state equation in 3013 ms returned unknown
[2023-03-19 02:21:58] [INFO ] [Real]Absence check using 901 positive place invariants in 591 ms returned sat
[2023-03-19 02:21:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 02:22:02] [INFO ] [Real]Absence check using state equation in 3331 ms returned unknown
[2023-03-19 02:22:03] [INFO ] [Real]Absence check using 901 positive place invariants in 732 ms returned sat
[2023-03-19 02:22:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 02:22:07] [INFO ] [Real]Absence check using state equation in 3072 ms returned unknown
[2023-03-19 02:22:08] [INFO ] [Real]Absence check using 901 positive place invariants in 618 ms returned sat
[2023-03-19 02:22:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 02:22: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: Broken pipe ... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2023-03-19 02:22:14] [INFO ] [Real]Absence check using 901 positive place invariants in 725 ms returned sat
[2023-03-19 02:22:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 02:22:17] [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: Broken pipe ... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
Support contains 8 out of 7003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7003/7003 places, 6503/6503 transitions.
Drop transitions removed 1699 transitions
Trivial Post-agglo rules discarded 1699 transitions
Performed 1699 trivial Post agglomeration. Transition count delta: 1699
Iterating post reduction 0 with 1699 rules applied. Total rules applied 1699 place count 7003 transition count 4804
Reduce places removed 1699 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1701 rules applied. Total rules applied 3400 place count 5304 transition count 4802
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3401 place count 5303 transition count 4802
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 3401 place count 5303 transition count 4402
Deduced a syphon composed of 400 places in 24 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 4201 place count 4903 transition count 4402
Discarding 696 places :
Symmetric choice reduction at 3 with 696 rule applications. Total rules 4897 place count 4207 transition count 3706
Iterating global reduction 3 with 696 rules applied. Total rules applied 5593 place count 4207 transition count 3706
Performed 298 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 298 Pre rules applied. Total rules applied 5593 place count 4207 transition count 3408
Deduced a syphon composed of 298 places in 16 ms
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 3 with 596 rules applied. Total rules applied 6189 place count 3909 transition count 3408
Performed 1701 Post agglomeration using F-continuation condition.Transition count delta: 1701
Deduced a syphon composed of 1701 places in 5 ms
Reduce places removed 1701 places and 0 transitions.
Iterating global reduction 3 with 3402 rules applied. Total rules applied 9591 place count 2208 transition count 1707
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9793 place count 2107 transition count 1773
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9995 place count 2006 transition count 1838
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 96 places in 6 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 10187 place count 1910 transition count 1903
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 10188 place count 1910 transition count 1902
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 10189 place count 1910 transition count 1901
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 10190 place count 1909 transition count 1901
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 5 with 100 rules applied. Total rules applied 10290 place count 1909 transition count 1901
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 10291 place count 1908 transition count 1900
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 10293 place count 1906 transition count 1900
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 10293 place count 1906 transition count 1899
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 10295 place count 1905 transition count 1899
Applied a total of 10295 rules in 2688 ms. Remains 1905 /7003 variables (removed 5098) and now considering 1899/6503 (removed 4604) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2689 ms. Remains : 1905/7003 places, 1899/6503 transitions.
// Phase 1: matrix 1899 rows 1905 cols
[2023-03-19 02:22:19] [INFO ] Computed 899 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 14803 ms. (steps per millisecond=67 ) properties (out of 8) seen :0
Interrupted Best-First random walk after 471147 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=94 ) properties seen 0
Interrupted Best-First random walk after 473923 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=94 ) properties seen 0
Interrupted Best-First random walk after 468896 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=93 ) properties seen 0
Interrupted Best-First random walk after 482302 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=96 ) properties seen 0
Interrupted Best-First random walk after 486371 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=97 ) properties seen 0
Interrupted Best-First random walk after 472543 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=94 ) properties seen 0
Interrupted Best-First random walk after 479393 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen 0
Interrupted Best-First random walk after 465101 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=93 ) properties seen 0
[2023-03-19 02:23:14] [INFO ] Invariant cache hit.
[2023-03-19 02:23:15] [INFO ] [Real]Absence check using 899 positive place invariants in 214 ms returned sat
[2023-03-19 02:23:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 02:23:16] [INFO ] [Real]Absence check using state equation in 846 ms returned sat
[2023-03-19 02:23:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 02:23:16] [INFO ] [Nat]Absence check using 899 positive place invariants in 162 ms returned sat
[2023-03-19 02:23:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 02:23:17] [INFO ] [Nat]Absence check using state equation in 995 ms returned sat
[2023-03-19 02:23:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 02:23:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-19 02:23:18] [INFO ] Computed and/alt/rep : 1896/3390/1896 causal constraints (skipped 0 transitions) in 181 ms.
[2023-03-19 02:23:38] [INFO ] Added : 730 causal constraints over 146 iterations in 20145 ms.(timeout) Result :sat
Minimization took 311 ms.
[2023-03-19 02:23:38] [INFO ] [Real]Absence check using 899 positive place invariants in 214 ms returned sat
[2023-03-19 02:23:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 02:23:39] [INFO ] [Real]Absence check using state equation in 777 ms returned sat
[2023-03-19 02:23:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 02:23:40] [INFO ] [Nat]Absence check using 899 positive place invariants in 195 ms returned sat
[2023-03-19 02:23:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 02:23:40] [INFO ] [Nat]Absence check using state equation in 801 ms returned sat
[2023-03-19 02:23:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-19 02:23:41] [INFO ] Computed and/alt/rep : 1896/3390/1896 causal constraints (skipped 0 transitions) in 139 ms.
[2023-03-19 02:24:01] [INFO ] Added : 755 causal constraints over 151 iterations in 20054 ms.(timeout) Result :sat
Minimization took 338 ms.
[2023-03-19 02:24:02] [INFO ] [Real]Absence check using 899 positive place invariants in 207 ms returned sat
[2023-03-19 02:24:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 02:24:02] [INFO ] [Real]Absence check using state equation in 798 ms returned sat
[2023-03-19 02:24:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 02:24:03] [INFO ] [Nat]Absence check using 899 positive place invariants in 164 ms returned sat
[2023-03-19 02:24:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 02:24:03] [INFO ] [Nat]Absence check using state equation in 729 ms returned sat
[2023-03-19 02:24:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-19 02:24:04] [INFO ] Computed and/alt/rep : 1896/3390/1896 causal constraints (skipped 0 transitions) in 126 ms.
[2023-03-19 02:24:24] [INFO ] Added : 790 causal constraints over 158 iterations in 20046 ms.(timeout) Result :sat
Minimization took 458 ms.
[2023-03-19 02:24:25] [INFO ] [Real]Absence check using 899 positive place invariants in 234 ms returned sat
[2023-03-19 02:24:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 02:24:26] [INFO ] [Real]Absence check using state equation in 811 ms returned sat
[2023-03-19 02:24:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 02:24:26] [INFO ] [Nat]Absence check using 899 positive place invariants in 179 ms returned sat
[2023-03-19 02:24:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 02:24:27] [INFO ] [Nat]Absence check using state equation in 919 ms returned sat
[2023-03-19 02:24:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-19 02:24:27] [INFO ] Computed and/alt/rep : 1896/3390/1896 causal constraints (skipped 0 transitions) in 140 ms.
[2023-03-19 02:24:47] [INFO ] Added : 685 causal constraints over 137 iterations in 20205 ms.(timeout) Result :sat
Minimization took 386 ms.
[2023-03-19 02:24:48] [INFO ] [Real]Absence check using 899 positive place invariants in 155 ms returned sat
[2023-03-19 02:24:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 02:24:49] [INFO ] [Real]Absence check using state equation in 792 ms returned sat
[2023-03-19 02:24:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 02:24:50] [INFO ] [Nat]Absence check using 899 positive place invariants in 138 ms returned sat
[2023-03-19 02:24:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 02:24:50] [INFO ] [Nat]Absence check using state equation in 768 ms returned sat
[2023-03-19 02:24:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-19 02:24:50] [INFO ] Computed and/alt/rep : 1896/3390/1896 causal constraints (skipped 0 transitions) in 102 ms.
[2023-03-19 02:25:11] [INFO ] Added : 710 causal constraints over 142 iterations in 20120 ms.(timeout) Result :sat
Minimization took 372 ms.
[2023-03-19 02:25:11] [INFO ] [Real]Absence check using 899 positive place invariants in 202 ms returned sat
[2023-03-19 02:25:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 02:25:12] [INFO ] [Real]Absence check using state equation in 814 ms returned sat
[2023-03-19 02:25:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 02:25:13] [INFO ] [Nat]Absence check using 899 positive place invariants in 160 ms returned sat
[2023-03-19 02:25:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 02:25:14] [INFO ] [Nat]Absence check using state equation in 867 ms returned sat
[2023-03-19 02:25:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-19 02:25:14] [INFO ] Computed and/alt/rep : 1896/3390/1896 causal constraints (skipped 0 transitions) in 101 ms.
[2023-03-19 02:25:34] [INFO ] Added : 735 causal constraints over 147 iterations in 20186 ms.(timeout) Result :sat
Minimization took 341 ms.
[2023-03-19 02:25:35] [INFO ] [Real]Absence check using 899 positive place invariants in 150 ms returned sat
[2023-03-19 02:25:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 02:25:35] [INFO ] [Real]Absence check using state equation in 800 ms returned sat
[2023-03-19 02:25:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 02:25:36] [INFO ] [Nat]Absence check using 899 positive place invariants in 183 ms returned sat
[2023-03-19 02:25:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 02:25:37] [INFO ] [Nat]Absence check using state equation in 843 ms returned sat
[2023-03-19 02:25:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-19 02:25:37] [INFO ] Computed and/alt/rep : 1896/3390/1896 causal constraints (skipped 0 transitions) in 148 ms.
[2023-03-19 02:25:57] [INFO ] Added : 650 causal constraints over 130 iterations in 20156 ms.(timeout) Result :sat
Minimization took 323 ms.
[2023-03-19 02:25:58] [INFO ] [Real]Absence check using 899 positive place invariants in 342 ms returned sat
[2023-03-19 02:25:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 02:25:59] [INFO ] [Real]Absence check using state equation in 925 ms returned sat
[2023-03-19 02:25:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 02:26:00] [INFO ] [Nat]Absence check using 899 positive place invariants in 159 ms returned sat
[2023-03-19 02:26:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 02:26:00] [INFO ] [Nat]Absence check using state equation in 800 ms returned sat
[2023-03-19 02:26:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 21 ms returned sat
[2023-03-19 02:26:01] [INFO ] Computed and/alt/rep : 1896/3390/1896 causal constraints (skipped 0 transitions) in 116 ms.
[2023-03-19 02:26:21] [INFO ] Added : 650 causal constraints over 130 iterations in 20095 ms.(timeout) Result :sat
Minimization took 325 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
FORMULA ShieldIIPt-PT-100B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 289423 ms.

BK_STOP 1679192784995

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="ShieldIIPt-PT-100B"
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-5348"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-PT-100B, 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 r389-oct2-167903713400349"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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