Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r114-smll-165264477400205.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is HealthRecord-PT-17, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-165264477400205
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-rw-r--r-- 1 mcc users 7.7K Apr 30 11:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 30 11:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Apr 30 11:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 30K Apr 30 11:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 175K May 10 09:34 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME HealthRecord-PT-17-UpperBounds-00
FORMULA_NAME HealthRecord-PT-17-UpperBounds-01
FORMULA_NAME HealthRecord-PT-17-UpperBounds-02
FORMULA_NAME HealthRecord-PT-17-UpperBounds-03
FORMULA_NAME HealthRecord-PT-17-UpperBounds-04
FORMULA_NAME HealthRecord-PT-17-UpperBounds-05
FORMULA_NAME HealthRecord-PT-17-UpperBounds-06
FORMULA_NAME HealthRecord-PT-17-UpperBounds-07
FORMULA_NAME HealthRecord-PT-17-UpperBounds-08
FORMULA_NAME HealthRecord-PT-17-UpperBounds-09
FORMULA_NAME HealthRecord-PT-17-UpperBounds-10
FORMULA_NAME HealthRecord-PT-17-UpperBounds-11
FORMULA_NAME HealthRecord-PT-17-UpperBounds-12
FORMULA_NAME HealthRecord-PT-17-UpperBounds-13
FORMULA_NAME HealthRecord-PT-17-UpperBounds-14
FORMULA_NAME HealthRecord-PT-17-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652702812830

Running Version 202205111006
[2022-05-16 12:06:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 12:06:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 12:06:55] [INFO ] Load time of PNML (sax parser for PT used): 269 ms
[2022-05-16 12:06:55] [INFO ] Transformed 624 places.
[2022-05-16 12:06:55] [INFO ] Transformed 828 transitions.
[2022-05-16 12:06:55] [INFO ] Found NUPN structural information;
[2022-05-16 12:06:55] [INFO ] Parsed PT model containing 624 places and 828 transitions in 548 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
// Phase 1: matrix 828 rows 624 cols
[2022-05-16 12:06:55] [INFO ] Computed 18 place invariants in 49 ms
Incomplete random walk after 10000 steps, including 87 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 16) seen :6
FORMULA HealthRecord-PT-17-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
// Phase 1: matrix 828 rows 624 cols
[2022-05-16 12:06:56] [INFO ] Computed 18 place invariants in 11 ms
[2022-05-16 12:06:56] [INFO ] [Real]Absence check using 10 positive place invariants in 37 ms returned sat
[2022-05-16 12:06:56] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 16 ms returned sat
[2022-05-16 12:06:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 12:06:57] [INFO ] [Real]Absence check using state equation in 489 ms returned sat
[2022-05-16 12:06:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 12:06:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 22 ms returned sat
[2022-05-16 12:06:57] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 12 ms returned sat
[2022-05-16 12:06:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 12:06:57] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2022-05-16 12:06:58] [INFO ] Deduced a trap composed of 116 places in 245 ms of which 9 ms to minimize.
[2022-05-16 12:06:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 366 ms
[2022-05-16 12:06:58] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 115 ms.
[2022-05-16 12:07:02] [INFO ] Added : 264 causal constraints over 54 iterations in 4023 ms. Result :sat
Minimization took 13 ms.
[2022-05-16 12:07:02] [INFO ] [Real]Absence check using 10 positive place invariants in 37 ms returned sat
[2022-05-16 12:07:02] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 22 ms returned sat
[2022-05-16 12:07:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 12:07:03] [INFO ] [Real]Absence check using state equation in 739 ms returned sat
[2022-05-16 12:07:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 12:07:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 36 ms returned sat
[2022-05-16 12:07:03] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 33 ms returned sat
[2022-05-16 12:07:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 12:07:04] [INFO ] [Nat]Absence check using state equation in 545 ms returned sat
[2022-05-16 12:07:04] [INFO ] Deduced a trap composed of 154 places in 482 ms of which 2 ms to minimize.
[2022-05-16 12:07:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 580 ms
[2022-05-16 12:07:05] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 62 ms.
[2022-05-16 12:07:08] [INFO ] Added : 249 causal constraints over 51 iterations in 3637 ms. Result :unknown
[2022-05-16 12:07:08] [INFO ] [Real]Absence check using 10 positive place invariants in 25 ms returned sat
[2022-05-16 12:07:08] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 15 ms returned sat
[2022-05-16 12:07:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 12:07:09] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2022-05-16 12:07:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 12:07:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 32 ms returned sat
[2022-05-16 12:07:09] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 13 ms returned sat
[2022-05-16 12:07:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 12:07:09] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2022-05-16 12:07:10] [INFO ] Deduced a trap composed of 132 places in 254 ms of which 2 ms to minimize.
[2022-05-16 12:07:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 330 ms
[2022-05-16 12:07:10] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 60 ms.
[2022-05-16 12:07:11] [INFO ] Added : 86 causal constraints over 18 iterations in 1364 ms. Result :sat
Minimization took 191 ms.
[2022-05-16 12:07:12] [INFO ] [Real]Absence check using 10 positive place invariants in 31 ms returned sat
[2022-05-16 12:07:12] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 19 ms returned sat
[2022-05-16 12:07:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 12:07:12] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2022-05-16 12:07:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 12:07:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 31 ms returned sat
[2022-05-16 12:07:12] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 17 ms returned sat
[2022-05-16 12:07:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 12:07:13] [INFO ] [Nat]Absence check using state equation in 452 ms returned sat
[2022-05-16 12:07:13] [INFO ] Deduced a trap composed of 130 places in 415 ms of which 2 ms to minimize.
[2022-05-16 12:07:14] [INFO ] Deduced a trap composed of 130 places in 403 ms of which 2 ms to minimize.
[2022-05-16 12:07:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 987 ms
[2022-05-16 12:07:14] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 93 ms.
[2022-05-16 12:07:15] [INFO ] Added : 88 causal constraints over 18 iterations in 1280 ms. Result :sat
Minimization took 183 ms.
[2022-05-16 12:07:16] [INFO ] [Real]Absence check using 10 positive place invariants in 34 ms returned sat
[2022-05-16 12:07:16] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 18 ms returned sat
[2022-05-16 12:07:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 12:07:16] [INFO ] [Real]Absence check using state equation in 536 ms returned sat
[2022-05-16 12:07:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 12:07:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 35 ms returned sat
[2022-05-16 12:07:17] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 19 ms returned sat
[2022-05-16 12:07:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 12:07:17] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2022-05-16 12:07:17] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 94 ms.
[2022-05-16 12:07:19] [INFO ] Added : 91 causal constraints over 19 iterations in 1623 ms. Result :sat
Minimization took 176 ms.
[2022-05-16 12:07:19] [INFO ] [Real]Absence check using 10 positive place invariants in 34 ms returned sat
[2022-05-16 12:07:19] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 22 ms returned sat
[2022-05-16 12:07:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 12:07:20] [INFO ] [Real]Absence check using state equation in 567 ms returned sat
[2022-05-16 12:07:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 12:07:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 35 ms returned sat
[2022-05-16 12:07:20] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 22 ms returned sat
[2022-05-16 12:07:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 12:07:21] [INFO ] [Nat]Absence check using state equation in 497 ms returned sat
[2022-05-16 12:07:21] [INFO ] Deduced a trap composed of 96 places in 513 ms of which 3 ms to minimize.
[2022-05-16 12:07:22] [INFO ] Deduced a trap composed of 131 places in 431 ms of which 1 ms to minimize.
[2022-05-16 12:07:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1125 ms
[2022-05-16 12:07:22] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 88 ms.
[2022-05-16 12:07:24] [INFO ] Added : 106 causal constraints over 22 iterations in 1824 ms. Result :sat
Minimization took 138 ms.
[2022-05-16 12:07:24] [INFO ] [Real]Absence check using 10 positive place invariants in 23 ms returned sat
[2022-05-16 12:07:24] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 14 ms returned sat
[2022-05-16 12:07:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 12:07:24] [INFO ] [Real]Absence check using state equation in 337 ms returned sat
[2022-05-16 12:07:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 12:07:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 35 ms returned sat
[2022-05-16 12:07:25] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 19 ms returned sat
[2022-05-16 12:07:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 12:07:25] [INFO ] [Nat]Absence check using state equation in 516 ms returned sat
[2022-05-16 12:07:26] [INFO ] Deduced a trap composed of 126 places in 397 ms of which 2 ms to minimize.
[2022-05-16 12:07:26] [INFO ] Deduced a trap composed of 115 places in 365 ms of which 1 ms to minimize.
[2022-05-16 12:07:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 913 ms
[2022-05-16 12:07:26] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 85 ms.
[2022-05-16 12:07:28] [INFO ] Added : 128 causal constraints over 26 iterations in 1954 ms. Result :sat
Minimization took 183 ms.
[2022-05-16 12:07:29] [INFO ] [Real]Absence check using 10 positive place invariants in 33 ms returned sat
[2022-05-16 12:07:29] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 22 ms returned sat
[2022-05-16 12:07:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 12:07:29] [INFO ] [Real]Absence check using state equation in 500 ms returned sat
[2022-05-16 12:07:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 12:07:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 35 ms returned sat
[2022-05-16 12:07:29] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 20 ms returned sat
[2022-05-16 12:07:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 12:07:30] [INFO ] [Nat]Absence check using state equation in 495 ms returned sat
[2022-05-16 12:07:30] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 96 ms.
[2022-05-16 12:07:32] [INFO ] Added : 116 causal constraints over 24 iterations in 1735 ms. Result :sat
Minimization took 119 ms.
[2022-05-16 12:07:32] [INFO ] [Real]Absence check using 10 positive place invariants in 25 ms returned sat
[2022-05-16 12:07:32] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 14 ms returned sat
[2022-05-16 12:07:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 12:07:33] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2022-05-16 12:07:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 12:07:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 33 ms returned sat
[2022-05-16 12:07:33] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 17 ms returned sat
[2022-05-16 12:07:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 12:07:33] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2022-05-16 12:07:33] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 78 ms.
[2022-05-16 12:07:37] [INFO ] Deduced a trap composed of 140 places in 378 ms of which 2 ms to minimize.
[2022-05-16 12:07:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 517 ms
[2022-05-16 12:07:37] [INFO ] Added : 215 causal constraints over 44 iterations in 3608 ms. Result :sat
Minimization took 244 ms.
[2022-05-16 12:07:37] [INFO ] [Real]Absence check using 10 positive place invariants in 33 ms returned sat
[2022-05-16 12:07:37] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 19 ms returned sat
[2022-05-16 12:07:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 12:07:38] [INFO ] [Real]Absence check using state equation in 517 ms returned sat
[2022-05-16 12:07:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 12:07:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 37 ms returned sat
[2022-05-16 12:07:38] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 22 ms returned sat
[2022-05-16 12:07:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 12:07:39] [INFO ] [Nat]Absence check using state equation in 494 ms returned sat
[2022-05-16 12:07:39] [INFO ] Deduced a trap composed of 115 places in 501 ms of which 2 ms to minimize.
[2022-05-16 12:07:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 603 ms
[2022-05-16 12:07:40] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 91 ms.
[2022-05-16 12:07:44] [INFO ] Deduced a trap composed of 51 places in 607 ms of which 2 ms to minimize.
[2022-05-16 12:07:44] [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 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA HealthRecord-PT-17-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-17-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-17-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-17-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 6 out of 624 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 624/624 places, 828/828 transitions.
Graph (trivial) has 737 edges and 624 vertex of which 87 / 624 are part of one of the 21 SCC in 12 ms
Free SCC test removed 66 places
Drop transitions removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Graph (complete) has 1200 edges and 558 vertex of which 511 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.8 ms
Discarding 47 places :
Also discarding 30 output transitions
Drop transitions removed 30 transitions
Drop transitions removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Drop transitions removed 289 transitions
Trivial Post-agglo rules discarded 289 transitions
Performed 289 trivial Post agglomeration. Transition count delta: 289
Iterating post reduction 0 with 413 rules applied. Total rules applied 415 place count 511 transition count 289
Reduce places removed 289 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 330 rules applied. Total rules applied 745 place count 222 transition count 248
Reduce places removed 17 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 23 rules applied. Total rules applied 768 place count 205 transition count 242
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 776 place count 199 transition count 240
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 776 place count 199 transition count 227
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 802 place count 186 transition count 227
Discarding 82 places :
Symmetric choice reduction at 4 with 82 rule applications. Total rules 884 place count 104 transition count 145
Iterating global reduction 4 with 82 rules applied. Total rules applied 966 place count 104 transition count 145
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 966 place count 104 transition count 138
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 980 place count 97 transition count 138
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 989 place count 88 transition count 129
Iterating global reduction 4 with 9 rules applied. Total rules applied 998 place count 88 transition count 129
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1007 place count 79 transition count 120
Iterating global reduction 4 with 9 rules applied. Total rules applied 1016 place count 79 transition count 120
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1022 place count 79 transition count 114
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1027 place count 74 transition count 109
Iterating global reduction 5 with 5 rules applied. Total rules applied 1032 place count 74 transition count 109
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1037 place count 74 transition count 104
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 1075 place count 55 transition count 85
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1076 place count 54 transition count 84
Iterating global reduction 6 with 1 rules applied. Total rules applied 1077 place count 54 transition count 84
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1083 place count 51 transition count 98
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1091 place count 51 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1093 place count 50 transition count 98
Free-agglomeration rule applied 13 times.
Iterating global reduction 6 with 13 rules applied. Total rules applied 1106 place count 50 transition count 85
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1119 place count 37 transition count 85
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1120 place count 37 transition count 84
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 1122 place count 37 transition count 84
Applied a total of 1122 rules in 167 ms. Remains 37 /624 variables (removed 587) and now considering 84/828 (removed 744) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/624 places, 84/828 transitions.
Normalized transition count is 63 out of 84 initially.
// Phase 1: matrix 63 rows 37 cols
[2022-05-16 12:07:44] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 131309 resets, run finished after 2810 ms. (steps per millisecond=355 ) properties (out of 6) seen :6
FORMULA HealthRecord-PT-17-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 52786 ms.

BK_STOP 1652702867862

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-17"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-17, 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 r114-smll-165264477400205"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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