fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r261-smll-167863536600613
Last Updated
May 14, 2023

About the Execution of ITS-Tools for Peterson-PT-3

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
466.552 23834.00 39898.00 634.40 3 4 4 3 4 1 4 3 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.r261-smll-167863536600613.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 Peterson-PT-3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536600613
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 29K Feb 25 22:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 157K Feb 25 22:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 40K Feb 25 22:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 194K Feb 25 22:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 15K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 93K Feb 25 22:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 439K Feb 25 22:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 58K Feb 25 22:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 283K Feb 25 22:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 143K 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 Peterson-PT-3-UpperBounds-00
FORMULA_NAME Peterson-PT-3-UpperBounds-01
FORMULA_NAME Peterson-PT-3-UpperBounds-02
FORMULA_NAME Peterson-PT-3-UpperBounds-03
FORMULA_NAME Peterson-PT-3-UpperBounds-04
FORMULA_NAME Peterson-PT-3-UpperBounds-05
FORMULA_NAME Peterson-PT-3-UpperBounds-06
FORMULA_NAME Peterson-PT-3-UpperBounds-07
FORMULA_NAME Peterson-PT-3-UpperBounds-08
FORMULA_NAME Peterson-PT-3-UpperBounds-09
FORMULA_NAME Peterson-PT-3-UpperBounds-10
FORMULA_NAME Peterson-PT-3-UpperBounds-11
FORMULA_NAME Peterson-PT-3-UpperBounds-12
FORMULA_NAME Peterson-PT-3-UpperBounds-13
FORMULA_NAME Peterson-PT-3-UpperBounds-14
FORMULA_NAME Peterson-PT-3-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679044991143

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=Peterson-PT-3
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-17 09:23:13] [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-17 09:23:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 09:23:14] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2023-03-17 09:23:14] [INFO ] Transformed 244 places.
[2023-03-17 09:23:14] [INFO ] Transformed 332 transitions.
[2023-03-17 09:23:14] [INFO ] Found NUPN structural information;
[2023-03-17 09:23:14] [INFO ] Completing missing partition info from NUPN : creating a component with [TestAlone_1_2_3, TestAlone_2_2_3]
[2023-03-17 09:23:14] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 272 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
FORMULA Peterson-PT-3-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 308 out of 332 initially.
// Phase 1: matrix 308 rows 244 cols
[2023-03-17 09:23:14] [INFO ] Computed 15 place invariants in 30 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 13) seen :23
FORMULA Peterson-PT-3-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :19
[2023-03-17 09:23:14] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2023-03-17 09:23:14] [INFO ] Computed 15 place invariants in 6 ms
[2023-03-17 09:23:15] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned unsat
[2023-03-17 09:23:15] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned unsat
[2023-03-17 09:23:15] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned unsat
[2023-03-17 09:23:15] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-03-17 09:23:15] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-17 09:23:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 09:23:15] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2023-03-17 09:23:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 09:23:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-17 09:23:15] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-17 09:23:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 09:23:15] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2023-03-17 09:23:15] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-17 09:23:15] [INFO ] [Nat]Added 57 Read/Feed constraints in 16 ms returned sat
[2023-03-17 09:23:16] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 3 ms to minimize.
[2023-03-17 09:23:16] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 2 ms to minimize.
[2023-03-17 09:23:16] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 2 ms to minimize.
[2023-03-17 09:23:16] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 2 ms to minimize.
[2023-03-17 09:23:16] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 1 ms to minimize.
[2023-03-17 09:23:16] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 0 ms to minimize.
[2023-03-17 09:23:16] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 1 ms to minimize.
[2023-03-17 09:23:17] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
[2023-03-17 09:23:17] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 1 ms to minimize.
[2023-03-17 09:23:17] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 1 ms to minimize.
[2023-03-17 09:23:17] [INFO ] Deduced a trap composed of 88 places in 83 ms of which 1 ms to minimize.
[2023-03-17 09:23:17] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 0 ms to minimize.
[2023-03-17 09:23:17] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2023-03-17 09:23:17] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 1 ms to minimize.
[2023-03-17 09:23:18] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2023-03-17 09:23:18] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 0 ms to minimize.
[2023-03-17 09:23:18] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 1 ms to minimize.
[2023-03-17 09:23:18] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 0 ms to minimize.
[2023-03-17 09:23:18] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 1 ms to minimize.
[2023-03-17 09:23:19] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 0 ms to minimize.
[2023-03-17 09:23:19] [INFO ] Deduced a trap composed of 74 places in 126 ms of which 0 ms to minimize.
[2023-03-17 09:23:19] [INFO ] Deduced a trap composed of 18 places in 275 ms of which 2 ms to minimize.
[2023-03-17 09:23:19] [INFO ] Deduced a trap composed of 31 places in 239 ms of which 1 ms to minimize.
[2023-03-17 09:23:20] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 1 ms to minimize.
[2023-03-17 09:23:20] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 1 ms to minimize.
[2023-03-17 09:23:20] [INFO ] Deduced a trap composed of 87 places in 164 ms of which 2 ms to minimize.
[2023-03-17 09:23:20] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 1 ms to minimize.
[2023-03-17 09:23:20] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 0 ms to minimize.
[2023-03-17 09:23:20] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 0 ms to minimize.
[2023-03-17 09:23:20] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
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-17 09:23:20] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned unsat
[2023-03-17 09:23:20] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-17 09:23:20] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-17 09:23:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 09:23:21] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2023-03-17 09:23:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 09:23:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-17 09:23:21] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-17 09:23:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 09:23:21] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2023-03-17 09:23:21] [INFO ] [Nat]Added 57 Read/Feed constraints in 19 ms returned sat
[2023-03-17 09:23:21] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 1 ms to minimize.
[2023-03-17 09:23:21] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2023-03-17 09:23:21] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2023-03-17 09:23:21] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2023-03-17 09:23:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 440 ms
[2023-03-17 09:23:21] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2023-03-17 09:23:21] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-17 09:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 09:23:21] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2023-03-17 09:23:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 09:23:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2023-03-17 09:23:22] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-17 09:23:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 09:23:22] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2023-03-17 09:23:22] [INFO ] [Nat]Added 57 Read/Feed constraints in 17 ms returned sat
[2023-03-17 09:23:22] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 35 ms.
[2023-03-17 09:23:23] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 2 ms to minimize.
[2023-03-17 09:23:23] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 5 ms to minimize.
[2023-03-17 09:23:23] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2023-03-17 09:23:23] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 1 ms to minimize.
[2023-03-17 09:23:23] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 1 ms to minimize.
[2023-03-17 09:23:23] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 1 ms to minimize.
[2023-03-17 09:23:23] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 1 ms to minimize.
[2023-03-17 09:23:23] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2023-03-17 09:23:24] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1098 ms
[2023-03-17 09:23:24] [INFO ] Added : 163 causal constraints over 34 iterations in 2001 ms. Result :sat
Minimization took 83 ms.
[2023-03-17 09:23:24] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-17 09:23:24] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-17 09:23:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 09:23:24] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2023-03-17 09:23:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 09:23:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-17 09:23:24] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-17 09:23:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 09:23:24] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2023-03-17 09:23:24] [INFO ] [Nat]Added 57 Read/Feed constraints in 14 ms returned sat
[2023-03-17 09:23:24] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 20 ms.
[2023-03-17 09:23:24] [INFO ] Added : 10 causal constraints over 2 iterations in 110 ms. Result :sat
Minimization took 36 ms.
[2023-03-17 09:23:25] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-03-17 09:23:25] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-17 09:23:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 09:23:25] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2023-03-17 09:23:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 09:23:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2023-03-17 09:23:25] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-17 09:23:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 09:23:25] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2023-03-17 09:23:25] [INFO ] [Nat]Added 57 Read/Feed constraints in 18 ms returned sat
[2023-03-17 09:23:25] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 33 ms.
[2023-03-17 09:23:25] [INFO ] Added : 12 causal constraints over 3 iterations in 147 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : [4, 4, 4, 4, 4, 3, 1, 1, 1] Max seen :[4, 4, 4, 1, 4, 3, 0, 0, 0]
FORMULA Peterson-PT-3-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-3-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 93 rules applied. Total rules applied 93 place count 244 transition count 239
Reduce places removed 93 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 94 rules applied. Total rules applied 187 place count 151 transition count 238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 188 place count 150 transition count 238
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 188 place count 150 transition count 194
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 276 place count 106 transition count 194
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 300 place count 94 transition count 182
Applied a total of 300 rules in 54 ms. Remains 94 /244 variables (removed 150) and now considering 182/332 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 94/244 places, 182/332 transitions.
Normalized transition count is 158 out of 182 initially.
// Phase 1: matrix 158 rows 94 cols
[2023-03-17 09:23:25] [INFO ] Computed 15 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1422 ms. (steps per millisecond=703 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 483 ms. (steps per millisecond=2070 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 532 ms. (steps per millisecond=1879 ) properties (out of 2) seen :1
[2023-03-17 09:23:28] [INFO ] Flow matrix only has 158 transitions (discarded 24 similar events)
// Phase 1: matrix 158 rows 94 cols
[2023-03-17 09:23:28] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-17 09:23:28] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-17 09:23:28] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-17 09:23:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 09:23:28] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2023-03-17 09:23:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 09:23:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-17 09:23:28] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-17 09:23:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 09:23:28] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-17 09:23:28] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-17 09:23:28] [INFO ] [Nat]Added 57 Read/Feed constraints in 9 ms returned sat
[2023-03-17 09:23:28] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2023-03-17 09:23:28] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2023-03-17 09:23:28] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2023-03-17 09:23:28] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2023-03-17 09:23:28] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2023-03-17 09:23:28] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2023-03-17 09:23:29] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2023-03-17 09:23:29] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 0 ms to minimize.
[2023-03-17 09:23:29] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2023-03-17 09:23:29] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 2 ms to minimize.
[2023-03-17 09:23:29] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2023-03-17 09:23:29] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2023-03-17 09:23:29] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2023-03-17 09:23:29] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2023-03-17 09:23:29] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2023-03-17 09:23:29] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2023-03-17 09:23:29] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2023-03-17 09:23:29] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2023-03-17 09:23:29] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2023-03-17 09:23:29] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2023-03-17 09:23:29] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2023-03-17 09:23:29] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2023-03-17 09:23:30] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2023-03-17 09:23:30] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2023-03-17 09:23:30] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 3 ms to minimize.
[2023-03-17 09:23:30] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2023-03-17 09:23:30] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2023-03-17 09:23:30] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2023-03-17 09:23:30] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 2 ms to minimize.
[2023-03-17 09:23:30] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2023-03-17 09:23:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 30 trap constraints in 2234 ms
[2023-03-17 09:23:30] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-17 09:23:30] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-17 09:23:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 09:23:30] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-17 09:23:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 09:23:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-17 09:23:30] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-17 09:23:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 09:23:31] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-17 09:23:31] [INFO ] [Nat]Added 57 Read/Feed constraints in 7 ms returned sat
[2023-03-17 09:23:31] [INFO ] Computed and/alt/rep : 133/335/133 causal constraints (skipped 21 transitions) in 12 ms.
[2023-03-17 09:23:31] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2023-03-17 09:23:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-17 09:23:31] [INFO ] Added : 33 causal constraints over 7 iterations in 208 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[1, 0]
FORMULA Peterson-PT-3-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 94 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 181/181 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 93 transition count 179
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 1 place count 93 transition count 175
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 9 place count 89 transition count 175
Applied a total of 9 rules in 12 ms. Remains 89 /94 variables (removed 5) and now considering 175/181 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 89/94 places, 175/181 transitions.
Normalized transition count is 151 out of 175 initially.
// Phase 1: matrix 151 rows 89 cols
[2023-03-17 09:23:31] [INFO ] Computed 15 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1016 ms. (steps per millisecond=984 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 386 ms. (steps per millisecond=2590 ) properties (out of 1) seen :0
[2023-03-17 09:23:32] [INFO ] Flow matrix only has 151 transitions (discarded 24 similar events)
// Phase 1: matrix 151 rows 89 cols
[2023-03-17 09:23:32] [INFO ] Computed 15 place invariants in 5 ms
[2023-03-17 09:23:32] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-17 09:23:32] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-17 09:23:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 09:23:32] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-17 09:23:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 09:23:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-17 09:23:32] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-17 09:23:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 09:23:32] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-17 09:23:32] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-17 09:23:32] [INFO ] [Nat]Added 56 Read/Feed constraints in 9 ms returned sat
[2023-03-17 09:23:32] [INFO ] Computed and/alt/rep : 127/335/127 causal constraints (skipped 20 transitions) in 16 ms.
[2023-03-17 09:23:33] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2023-03-17 09:23:33] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2023-03-17 09:23:33] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2023-03-17 09:23:33] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2023-03-17 09:23:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 194 ms
[2023-03-17 09:23:33] [INFO ] Added : 84 causal constraints over 17 iterations in 442 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
FORMULA Peterson-PT-3-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 19569 ms.

BK_STOP 1679045014977

--------------------
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="Peterson-PT-3"
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 Peterson-PT-3, 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 r261-smll-167863536600613"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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