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.r199-smll-167840345900365.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 lolaxred
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 r199-smll-167840345900365
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 6.1K Feb 26 17:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 17:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 17:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 17:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 17:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 175K Mar 5 18:22 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 1678526048774

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-17
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 09:14:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 09:14:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 09:14:13] [INFO ] Load time of PNML (sax parser for PT used): 195 ms
[2023-03-11 09:14:13] [INFO ] Transformed 624 places.
[2023-03-11 09:14:13] [INFO ] Transformed 828 transitions.
[2023-03-11 09:14:13] [INFO ] Found NUPN structural information;
[2023-03-11 09:14:13] [INFO ] Parsed PT model containing 624 places and 828 transitions and 1879 arcs in 406 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
// Phase 1: matrix 828 rows 624 cols
[2023-03-11 09:14:13] [INFO ] Computed 18 place invariants in 58 ms
Incomplete random walk after 10000 steps, including 85 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 16) seen :4
FORMULA HealthRecord-PT-17-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :1
FORMULA HealthRecord-PT-17-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :0
[2023-03-11 09:14:13] [INFO ] Invariant cache hit.
[2023-03-11 09:14:14] [INFO ] [Real]Absence check using 10 positive place invariants in 47 ms returned sat
[2023-03-11 09:14:14] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 23 ms returned sat
[2023-03-11 09:14:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:14:15] [INFO ] [Real]Absence check using state equation in 631 ms returned sat
[2023-03-11 09:14:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:14:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 38 ms returned sat
[2023-03-11 09:14:15] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 18 ms returned sat
[2023-03-11 09:14:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:14:16] [INFO ] [Nat]Absence check using state equation in 568 ms returned sat
[2023-03-11 09:14:16] [INFO ] Deduced a trap composed of 108 places in 343 ms of which 7 ms to minimize.
[2023-03-11 09:14:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 520 ms
[2023-03-11 09:14:16] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 149 ms.
[2023-03-11 09:14:21] [INFO ] Deduced a trap composed of 51 places in 705 ms of which 2 ms to minimize.
[2023-03-11 09:14:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
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-11 09:14:21] [INFO ] [Real]Absence check using 10 positive place invariants in 36 ms returned sat
[2023-03-11 09:14:21] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 21 ms returned sat
[2023-03-11 09:14:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:14:21] [INFO ] [Real]Absence check using state equation in 513 ms returned sat
[2023-03-11 09:14:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:14:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 38 ms returned sat
[2023-03-11 09:14:22] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 20 ms returned sat
[2023-03-11 09:14:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:14:22] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2023-03-11 09:14:22] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 115 ms.
[2023-03-11 09:14:24] [INFO ] Added : 123 causal constraints over 25 iterations in 2134 ms. Result :sat
Minimization took 204 ms.
[2023-03-11 09:14:25] [INFO ] [Real]Absence check using 10 positive place invariants in 36 ms returned sat
[2023-03-11 09:14:25] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 31 ms returned sat
[2023-03-11 09:14:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:14:26] [INFO ] [Real]Absence check using state equation in 573 ms returned sat
[2023-03-11 09:14:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:14:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 35 ms returned sat
[2023-03-11 09:14:26] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 18 ms returned sat
[2023-03-11 09:14:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:14:26] [INFO ] [Nat]Absence check using state equation in 514 ms returned sat
[2023-03-11 09:14:27] [INFO ] Deduced a trap composed of 132 places in 438 ms of which 3 ms to minimize.
[2023-03-11 09:14:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 555 ms
[2023-03-11 09:14:27] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 182 ms.
[2023-03-11 09:14:29] [INFO ] Added : 108 causal constraints over 23 iterations in 1839 ms. Result :sat
Minimization took 191 ms.
[2023-03-11 09:14:29] [INFO ] [Real]Absence check using 10 positive place invariants in 33 ms returned sat
[2023-03-11 09:14:29] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 20 ms returned sat
[2023-03-11 09:14:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:14:30] [INFO ] [Real]Absence check using state equation in 524 ms returned sat
[2023-03-11 09:14:30] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 106 ms.
[2023-03-11 09:14:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:14:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 35 ms returned sat
[2023-03-11 09:14:32] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 19 ms returned sat
[2023-03-11 09:14:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:14:32] [INFO ] [Nat]Absence check using state equation in 537 ms returned sat
[2023-03-11 09:14:32] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 115 ms.
[2023-03-11 09:14:37] [INFO ] Deduced a trap composed of 51 places in 602 ms of which 3 ms to minimize.
[2023-03-11 09:14:37] [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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
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-11 09:14:37] [INFO ] [Real]Absence check using 10 positive place invariants in 35 ms returned sat
[2023-03-11 09:14:37] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 20 ms returned sat
[2023-03-11 09:14:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:14:38] [INFO ] [Real]Absence check using state equation in 508 ms returned sat
[2023-03-11 09:14:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:14:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 35 ms returned sat
[2023-03-11 09:14:38] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 17 ms returned sat
[2023-03-11 09:14:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:14:39] [INFO ] [Nat]Absence check using state equation in 489 ms returned sat
[2023-03-11 09:14:39] [INFO ] Deduced a trap composed of 116 places in 511 ms of which 2 ms to minimize.
[2023-03-11 09:14:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 612 ms
[2023-03-11 09:14:39] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 94 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2023-03-11 09:14:43] [INFO ] Deduced a trap composed of 51 places in 590 ms of which 2 ms to minimize.
[2023-03-11 09:14:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
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-11 09:14:44] [INFO ] [Real]Absence check using 10 positive place invariants in 33 ms returned sat
[2023-03-11 09:14:44] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 21 ms returned sat
[2023-03-11 09:14:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:14:44] [INFO ] [Real]Absence check using state equation in 538 ms returned sat
[2023-03-11 09:14:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:14:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 36 ms returned sat
[2023-03-11 09:14:45] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 19 ms returned sat
[2023-03-11 09:14:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:14:45] [INFO ] [Nat]Absence check using state equation in 444 ms returned sat
[2023-03-11 09:14:45] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 92 ms.
[2023-03-11 09:14:47] [INFO ] Deduced a trap composed of 131 places in 316 ms of which 1 ms to minimize.
[2023-03-11 09:14:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 465 ms
[2023-03-11 09:14:48] [INFO ] Added : 129 causal constraints over 27 iterations in 2867 ms. Result :sat
Minimization took 211 ms.
[2023-03-11 09:14:48] [INFO ] [Real]Absence check using 10 positive place invariants in 33 ms returned sat
[2023-03-11 09:14:49] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 19 ms returned sat
[2023-03-11 09:14:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:14:49] [INFO ] [Real]Absence check using state equation in 501 ms returned sat
[2023-03-11 09:14:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:14:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 35 ms returned sat
[2023-03-11 09:14:49] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 17 ms returned sat
[2023-03-11 09:14:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:14:50] [INFO ] [Nat]Absence check using state equation in 513 ms returned sat
[2023-03-11 09:14:50] [INFO ] Deduced a trap composed of 120 places in 465 ms of which 2 ms to minimize.
[2023-03-11 09:14:51] [INFO ] Deduced a trap composed of 119 places in 445 ms of which 1 ms to minimize.
[2023-03-11 09:14:51] [INFO ] Deduced a trap composed of 180 places in 256 ms of which 1 ms to minimize.
[2023-03-11 09:14:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1376 ms
[2023-03-11 09:14:51] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 99 ms.
[2023-03-11 09:14:54] [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 6
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
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-11 09:14:54] [INFO ] [Real]Absence check using 10 positive place invariants in 34 ms returned sat
[2023-03-11 09:14:54] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 21 ms returned sat
[2023-03-11 09:14:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:14:55] [INFO ] [Real]Absence check using state equation in 545 ms returned sat
[2023-03-11 09:14:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:14:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 35 ms returned sat
[2023-03-11 09:14:55] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 17 ms returned sat
[2023-03-11 09:14:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:14:56] [INFO ] [Nat]Absence check using state equation in 555 ms returned sat
[2023-03-11 09:14:56] [INFO ] Deduced a trap composed of 121 places in 441 ms of which 1 ms to minimize.
[2023-03-11 09:14:57] [INFO ] Deduced a trap composed of 133 places in 381 ms of which 1 ms to minimize.
[2023-03-11 09:14:57] [INFO ] Deduced a trap composed of 121 places in 407 ms of which 2 ms to minimize.
[2023-03-11 09:14:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1435 ms
[2023-03-11 09:14:57] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 102 ms.
[2023-03-11 09:14:59] [INFO ] Added : 121 causal constraints over 25 iterations in 2021 ms. Result :sat
Minimization took 220 ms.
[2023-03-11 09:15:00] [INFO ] [Real]Absence check using 10 positive place invariants in 34 ms returned sat
[2023-03-11 09:15:00] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 20 ms returned sat
[2023-03-11 09:15:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:15:00] [INFO ] [Real]Absence check using state equation in 522 ms returned sat
[2023-03-11 09:15:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:15:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 37 ms returned sat
[2023-03-11 09:15:01] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 20 ms returned sat
[2023-03-11 09:15:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:15:01] [INFO ] [Nat]Absence check using state equation in 488 ms returned sat
[2023-03-11 09:15:01] [INFO ] Deduced a trap composed of 132 places in 254 ms of which 1 ms to minimize.
[2023-03-11 09:15:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 361 ms
[2023-03-11 09:15:02] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 82 ms.
[2023-03-11 09:15:04] [INFO ] Added : 124 causal constraints over 25 iterations in 2167 ms. Result :sat
Minimization took 199 ms.
[2023-03-11 09:15:04] [INFO ] [Real]Absence check using 10 positive place invariants in 34 ms returned sat
[2023-03-11 09:15:04] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 21 ms returned sat
[2023-03-11 09:15:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:15:05] [INFO ] [Real]Absence check using state equation in 536 ms returned sat
[2023-03-11 09:15:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:15:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 33 ms returned sat
[2023-03-11 09:15:05] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 18 ms returned sat
[2023-03-11 09:15:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:15:06] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2023-03-11 09:15:06] [INFO ] Deduced a trap composed of 117 places in 504 ms of which 1 ms to minimize.
[2023-03-11 09:15:07] [INFO ] Deduced a trap composed of 93 places in 373 ms of which 8 ms to minimize.
[2023-03-11 09:15:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1028 ms
[2023-03-11 09:15:07] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 91 ms.
[2023-03-11 09:15:09] [INFO ] Added : 131 causal constraints over 27 iterations in 2368 ms. Result :sat
Minimization took 202 ms.
[2023-03-11 09:15:09] [INFO ] [Real]Absence check using 10 positive place invariants in 33 ms returned sat
[2023-03-11 09:15:09] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 21 ms returned sat
[2023-03-11 09:15:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:15:10] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2023-03-11 09:15:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:15:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 34 ms returned sat
[2023-03-11 09:15:10] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 19 ms returned sat
[2023-03-11 09:15:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:15:11] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2023-03-11 09:15:11] [INFO ] Deduced a trap composed of 78 places in 473 ms of which 1 ms to minimize.
[2023-03-11 09:15:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 577 ms
[2023-03-11 09:15:11] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 88 ms.
[2023-03-11 09:15:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA HealthRecord-PT-17-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 10 out of 624 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 624/624 places, 828/828 transitions.
Graph (trivial) has 728 edges and 624 vertex of which 85 / 624 are part of one of the 20 SCC in 12 ms
Free SCC test removed 65 places
Drop transitions removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Graph (complete) has 1202 edges and 559 vertex of which 543 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.4 ms
Discarding 16 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 287 transitions
Trivial Post-agglo rules discarded 287 transitions
Performed 287 trivial Post agglomeration. Transition count delta: 287
Iterating post reduction 0 with 287 rules applied. Total rules applied 289 place count 543 transition count 440
Reduce places removed 287 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 323 rules applied. Total rules applied 612 place count 256 transition count 404
Reduce places removed 11 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 18 rules applied. Total rules applied 630 place count 245 transition count 397
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 9 rules applied. Total rules applied 639 place count 238 transition count 395
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 640 place count 237 transition count 395
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 640 place count 237 transition count 385
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 660 place count 227 transition count 385
Discarding 81 places :
Symmetric choice reduction at 5 with 81 rule applications. Total rules 741 place count 146 transition count 225
Iterating global reduction 5 with 81 rules applied. Total rules applied 822 place count 146 transition count 225
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 831 place count 137 transition count 208
Iterating global reduction 5 with 9 rules applied. Total rules applied 840 place count 137 transition count 208
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 852 place count 125 transition count 196
Iterating global reduction 5 with 12 rules applied. Total rules applied 864 place count 125 transition count 196
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 873 place count 125 transition count 187
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 943 place count 90 transition count 152
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 946 place count 90 transition count 149
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 947 place count 89 transition count 148
Iterating global reduction 7 with 1 rules applied. Total rules applied 948 place count 89 transition count 148
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 964 place count 81 transition count 202
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 968 place count 81 transition count 198
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 8 with 25 rules applied. Total rules applied 993 place count 81 transition count 173
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 995 place count 80 transition count 184
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 996 place count 79 transition count 181
Iterating global reduction 8 with 1 rules applied. Total rules applied 997 place count 79 transition count 181
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1005 place count 79 transition count 173
Free-agglomeration rule applied 16 times.
Iterating global reduction 8 with 16 rules applied. Total rules applied 1021 place count 79 transition count 157
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 1039 place count 63 transition count 155
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1041 place count 63 transition count 153
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 9 with 15 rules applied. Total rules applied 1056 place count 63 transition count 153
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1058 place count 63 transition count 151
Applied a total of 1058 rules in 345 ms. Remains 63 /624 variables (removed 561) and now considering 151/828 (removed 677) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 345 ms. Remains : 63/624 places, 151/828 transitions.
Normalized transition count is 142 out of 151 initially.
// Phase 1: matrix 142 rows 63 cols
[2023-03-11 09:15:16] [INFO ] Computed 9 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 4761 resets, run finished after 866 ms. (steps per millisecond=1154 ) properties (out of 10) seen :4
FORMULA HealthRecord-PT-17-UpperBounds-14 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
FORMULA HealthRecord-PT-17-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 5550 resets, run finished after 436 ms. (steps per millisecond=2293 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 848 resets, run finished after 393 ms. (steps per millisecond=2544 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1171 resets, run finished after 377 ms. (steps per millisecond=2652 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2905 resets, run finished after 417 ms. (steps per millisecond=2398 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 694 resets, run finished after 509 ms. (steps per millisecond=1964 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2760 resets, run finished after 443 ms. (steps per millisecond=2257 ) properties (out of 6) seen :1
FORMULA HealthRecord-PT-17-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-11 09:15:19] [INFO ] Flow matrix only has 142 transitions (discarded 9 similar events)
// Phase 1: matrix 142 rows 63 cols
[2023-03-11 09:15:19] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 09:15:19] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-11 09:15:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:15:19] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-11 09:15:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:15:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-11 09:15:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:15:19] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-11 09:15:19] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-11 09:15:19] [INFO ] [Nat]Added 21 Read/Feed constraints in 5 ms returned sat
[2023-03-11 09:15:19] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2023-03-11 09:15:20] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2023-03-11 09:15:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 127 ms
[2023-03-11 09:15:20] [INFO ] Computed and/alt/rep : 38/120/38 causal constraints (skipped 96 transitions) in 17 ms.
[2023-03-11 09:15:20] [INFO ] Added : 8 causal constraints over 2 iterations in 70 ms. Result :sat
Minimization took 29 ms.
[2023-03-11 09:15:20] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-11 09:15:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:15:20] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2023-03-11 09:15:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:15:20] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-11 09:15:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:15:20] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-11 09:15:20] [INFO ] [Nat]Added 21 Read/Feed constraints in 11 ms returned sat
[2023-03-11 09:15:20] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2023-03-11 09:15:20] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2023-03-11 09:15:20] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2023-03-11 09:15:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 243 ms
[2023-03-11 09:15:20] [INFO ] Computed and/alt/rep : 38/120/38 causal constraints (skipped 96 transitions) in 18 ms.
[2023-03-11 09:15:20] [INFO ] Added : 2 causal constraints over 1 iterations in 54 ms. Result :sat
Minimization took 26 ms.
[2023-03-11 09:15:20] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-11 09:15:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:15:20] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2023-03-11 09:15:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:15:20] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-11 09:15:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:15:20] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-11 09:15:20] [INFO ] [Nat]Added 21 Read/Feed constraints in 10 ms returned sat
[2023-03-11 09:15:21] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2023-03-11 09:15:21] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2023-03-11 09:15:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 176 ms
[2023-03-11 09:15:21] [INFO ] Computed and/alt/rep : 38/120/38 causal constraints (skipped 96 transitions) in 17 ms.
[2023-03-11 09:15:21] [INFO ] Added : 8 causal constraints over 3 iterations in 80 ms. Result :sat
Minimization took 30 ms.
[2023-03-11 09:15:21] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-11 09:15:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:15:21] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-11 09:15:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:15:21] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-11 09:15:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:15:21] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-11 09:15:21] [INFO ] [Nat]Added 21 Read/Feed constraints in 9 ms returned sat
[2023-03-11 09:15:21] [INFO ] Computed and/alt/rep : 38/120/38 causal constraints (skipped 96 transitions) in 23 ms.
[2023-03-11 09:15:21] [INFO ] Added : 10 causal constraints over 3 iterations in 93 ms. Result :sat
Minimization took 31 ms.
[2023-03-11 09:15:21] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-11 09:15:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:15:21] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-11 09:15:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:15:21] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2023-03-11 09:15:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:15:21] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-11 09:15:21] [INFO ] [Nat]Added 21 Read/Feed constraints in 8 ms returned sat
[2023-03-11 09:15:21] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2023-03-11 09:15:22] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 0 ms to minimize.
[2023-03-11 09:15:22] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 0 ms to minimize.
[2023-03-11 09:15:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 257 ms
[2023-03-11 09:15:22] [INFO ] Computed and/alt/rep : 38/120/38 causal constraints (skipped 96 transitions) in 23 ms.
[2023-03-11 09:15:22] [INFO ] Added : 6 causal constraints over 2 iterations in 72 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA HealthRecord-PT-17-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-17-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-17-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-17-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 151/151 transitions.
Graph (trivial) has 33 edges and 63 vertex of which 2 / 63 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 269 edges and 62 vertex of which 51 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 0 output transitions
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 26 rules applied. Total rules applied 28 place count 51 transition count 123
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 32 place count 47 transition count 123
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 32 place count 47 transition count 122
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 46 transition count 122
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 43 transition count 118
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 43 transition count 118
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 40 place count 43 transition count 117
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 42 transition count 117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 41 transition count 115
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 41 transition count 115
Performed 5 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 54 place count 36 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 36 transition count 104
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 35 transition count 101
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 35 transition count 101
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 61 place count 33 transition count 103
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 33 transition count 101
Applied a total of 63 rules in 33 ms. Remains 33 /63 variables (removed 30) and now considering 101/151 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 33/63 places, 101/151 transitions.
Successfully produced net in file /tmp/petri1000_1227043108310296049.dot
Successfully produced net in file /tmp/petri1001_1055506491119721326.dot
Successfully produced net in file /tmp/petri1002_12829694741428591891.dot
Successfully produced net in file /tmp/petri1003_7241477906420943675.dot
Successfully produced net in file /tmp/petri1004_6678236376170070379.dot
Successfully produced net in file /tmp/petri1005_10322745855254342750.dot
Successfully produced net in file /tmp/petri1006_2659063429707999740.dot
Successfully produced net in file /tmp/petri1007_2987129141420938477.dot
Successfully produced net in file /tmp/petri1008_2290275021385283673.dot
Successfully produced net in file /tmp/petri1009_16340756474820119625.dot
Successfully produced net in file /tmp/petri1010_8089233193753291231.dot
Successfully produced net in file /tmp/petri1011_16184196835580857188.dot
Successfully produced net in file /tmp/petri1012_8750100658635376988.dot
Successfully produced net in file /tmp/petri1013_13905818297904703276.dot
Successfully produced net in file /tmp/petri1014_12792562749162407461.dot
Successfully produced net in file /tmp/petri1015_14386633345152941683.dot
Successfully produced net in file /tmp/petri1016_15027904062203883608.dot
Successfully produced net in file /tmp/petri1017_14440813097617344886.dot
Drop transitions removed 18 transitions
Dominated transitions for bounds rules discarded 18 transitions
Normalized transition count is 74 out of 83 initially.
// Phase 1: matrix 74 rows 33 cols
[2023-03-11 09:15:22] [INFO ] Computed 4 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 167771 resets, run finished after 2343 ms. (steps per millisecond=426 ) properties (out of 1) seen :1
FORMULA HealthRecord-PT-17-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 72002 ms.
ITS solved all properties within timeout

BK_STOP 1678526125781

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="lolaxred"
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 lolaxred"
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 r199-smll-167840345900365"
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 ;