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.r167-tall-167838853000405.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 FamilyReunion-PT-L00020M0002C001P001G001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838853000405
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 29K Feb 26 11:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 214K Feb 26 11:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 74K Feb 26 11:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 290K Feb 26 11:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 16K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 32K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 100K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 62K Feb 26 11:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 423K Feb 26 11:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113K Feb 26 11:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 417K Feb 26 11:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.3K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.3M 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 FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-00
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-01
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-02
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-03
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-04
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-05
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-06
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-07
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-08
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-09
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-10
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-11
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-12
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-13
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-14
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678474528207

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=FamilyReunion-PT-L00020M0002C001P001G001
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 18:55:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-10 18:55:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 18:55:29] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2023-03-10 18:55:29] [INFO ] Transformed 3271 places.
[2023-03-10 18:55:29] [INFO ] Transformed 2753 transitions.
[2023-03-10 18:55:29] [INFO ] Parsed PT model containing 3271 places and 2753 transitions and 8446 arcs in 204 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduce places removed 11 places and 0 transitions.
// Phase 1: matrix 2753 rows 3260 cols
[2023-03-10 18:55:30] [INFO ] Computed 748 place invariants in 164 ms
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 8 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 15) seen :63
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :15
[2023-03-10 18:55:30] [INFO ] Invariant cache hit.
[2023-03-10 18:55:31] [INFO ] [Real]Absence check using 61 positive place invariants in 65 ms returned sat
[2023-03-10 18:55:31] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 186 ms returned sat
[2023-03-10 18:55:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:55:32] [INFO ] [Real]Absence check using state equation in 1347 ms returned sat
[2023-03-10 18:55:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:55:33] [INFO ] [Nat]Absence check using 61 positive place invariants in 61 ms returned sat
[2023-03-10 18:55:33] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 183 ms returned sat
[2023-03-10 18:55:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:55:34] [INFO ] [Nat]Absence check using state equation in 1343 ms returned sat
[2023-03-10 18:55:35] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 159 ms.
[2023-03-10 18:55: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 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.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-10 18:55:38] [INFO ] [Real]Absence check using 61 positive place invariants in 68 ms returned sat
[2023-03-10 18:55:38] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 143 ms returned unsat
[2023-03-10 18:55:38] [INFO ] [Real]Absence check using 61 positive place invariants in 53 ms returned sat
[2023-03-10 18:55:38] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 186 ms returned sat
[2023-03-10 18:55:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:55:40] [INFO ] [Real]Absence check using state equation in 1470 ms returned sat
[2023-03-10 18:55:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:55:40] [INFO ] [Nat]Absence check using 61 positive place invariants in 53 ms returned sat
[2023-03-10 18:55:40] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 187 ms returned sat
[2023-03-10 18:55:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:55:42] [INFO ] [Nat]Absence check using state equation in 1657 ms returned sat
[2023-03-10 18:55:42] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 128 ms.
[2023-03-10 18:55:45] [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 2
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-10 18:55:45] [INFO ] [Real]Absence check using 61 positive place invariants in 50 ms returned sat
[2023-03-10 18:55:45] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 182 ms returned sat
[2023-03-10 18:55:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:55:47] [INFO ] [Real]Absence check using state equation in 1426 ms returned sat
[2023-03-10 18:55:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:55:47] [INFO ] [Nat]Absence check using 61 positive place invariants in 52 ms returned sat
[2023-03-10 18:55:48] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 182 ms returned sat
[2023-03-10 18:55:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:55:49] [INFO ] [Nat]Absence check using state equation in 1417 ms returned sat
[2023-03-10 18:55:49] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 132 ms.
[2023-03-10 18:55:54] [INFO ] Deduced a trap composed of 45 places in 2067 ms of which 11 ms to minimize.
[2023-03-10 18:55: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 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-10 18:55:54] [INFO ] [Real]Absence check using 61 positive place invariants in 48 ms returned sat
[2023-03-10 18:55:55] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 175 ms returned sat
[2023-03-10 18:55:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:55:56] [INFO ] [Real]Absence check using state equation in 1366 ms returned sat
[2023-03-10 18:55:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:55:56] [INFO ] [Nat]Absence check using 61 positive place invariants in 54 ms returned sat
[2023-03-10 18:55:57] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 195 ms returned sat
[2023-03-10 18:55:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:55:58] [INFO ] [Nat]Absence check using state equation in 1480 ms returned sat
[2023-03-10 18:55:58] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 148 ms.
[2023-03-10 18:56:03] [INFO ] Deduced a trap composed of 45 places in 2114 ms of which 4 ms to minimize.
[2023-03-10 18:56:03] [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-10 18:56:04] [INFO ] [Real]Absence check using 61 positive place invariants in 49 ms returned sat
[2023-03-10 18:56:04] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 192 ms returned sat
[2023-03-10 18:56:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:56:06] [INFO ] [Real]Absence check using state equation in 1702 ms returned sat
[2023-03-10 18:56:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:56:06] [INFO ] [Nat]Absence check using 61 positive place invariants in 55 ms returned sat
[2023-03-10 18:56:06] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 190 ms returned sat
[2023-03-10 18:56:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:56:08] [INFO ] [Nat]Absence check using state equation in 1655 ms returned sat
[2023-03-10 18:56:08] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 135 ms.
[2023-03-10 18:56:11] [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 5
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-10 18:56:11] [INFO ] [Real]Absence check using 61 positive place invariants in 50 ms returned sat
[2023-03-10 18:56:11] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 182 ms returned unsat
[2023-03-10 18:56:12] [INFO ] [Real]Absence check using 61 positive place invariants in 50 ms returned sat
[2023-03-10 18:56:12] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 195 ms returned sat
[2023-03-10 18:56:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:56:13] [INFO ] [Real]Absence check using state equation in 1365 ms returned sat
[2023-03-10 18:56:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:56:14] [INFO ] [Nat]Absence check using 61 positive place invariants in 50 ms returned sat
[2023-03-10 18:56:14] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 185 ms returned sat
[2023-03-10 18:56:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:56:15] [INFO ] [Nat]Absence check using state equation in 1357 ms returned sat
[2023-03-10 18:56:15] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 129 ms.
[2023-03-10 18:56:20] [INFO ] Deduced a trap composed of 45 places in 2077 ms of which 4 ms to minimize.
[2023-03-10 18:56:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
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-10 18:56:21] [INFO ] [Real]Absence check using 61 positive place invariants in 48 ms returned sat
[2023-03-10 18:56:21] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 184 ms returned sat
[2023-03-10 18:56:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:56:22] [INFO ] [Real]Absence check using state equation in 1327 ms returned sat
[2023-03-10 18:56:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:56:23] [INFO ] [Nat]Absence check using 61 positive place invariants in 51 ms returned sat
[2023-03-10 18:56:23] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 184 ms returned sat
[2023-03-10 18:56:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:56:24] [INFO ] [Nat]Absence check using state equation in 1486 ms returned sat
[2023-03-10 18:56:25] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 123 ms.
[2023-03-10 18:56:29] [INFO ] Deduced a trap composed of 45 places in 2127 ms of which 4 ms to minimize.
[2023-03-10 18:56:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-10 18:56:30] [INFO ] [Real]Absence check using 61 positive place invariants in 49 ms returned sat
[2023-03-10 18:56:30] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 105 ms returned unsat
[2023-03-10 18:56:30] [INFO ] [Real]Absence check using 61 positive place invariants in 49 ms returned sat
[2023-03-10 18:56:30] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 176 ms returned sat
[2023-03-10 18:56:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:56:32] [INFO ] [Real]Absence check using state equation in 1299 ms returned sat
[2023-03-10 18:56:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:56:32] [INFO ] [Nat]Absence check using 61 positive place invariants in 50 ms returned sat
[2023-03-10 18:56:32] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 181 ms returned sat
[2023-03-10 18:56:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:56:34] [INFO ] [Nat]Absence check using state equation in 1470 ms returned sat
[2023-03-10 18:56:34] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 129 ms.
[2023-03-10 18:56: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 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) : [361, 21, 750, 1065, 722, 722, 2, 4537, 1, 1, 1] Max seen :[3, 21, 1, 6, 7, 8, 2, 14, 0, 1, 0]
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-01 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 127 out of 3260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3260/3260 places, 2753/2753 transitions.
Graph (complete) has 4960 edges and 3260 vertex of which 3000 are kept as prefixes of interest. Removing 260 places using SCC suffix rule.13 ms
Discarding 260 places :
Also discarding 184 output transitions
Drop transitions removed 184 transitions
Drop transitions removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Discarding 378 places :
Implicit places reduction removed 378 places
Drop transitions removed 1178 transitions
Trivial Post-agglo rules discarded 1178 transitions
Performed 1178 trivial Post agglomeration. Transition count delta: 1178
Iterating post reduction 0 with 1599 rules applied. Total rules applied 1600 place count 2622 transition count 1348
Reduce places removed 1178 places and 0 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Iterating post reduction 1 with 1241 rules applied. Total rules applied 2841 place count 1444 transition count 1285
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 2904 place count 1381 transition count 1285
Performed 169 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 169 Pre rules applied. Total rules applied 2904 place count 1381 transition count 1116
Deduced a syphon composed of 169 places in 1 ms
Ensure Unique test removed 63 places
Reduce places removed 232 places and 0 transitions.
Iterating global reduction 3 with 401 rules applied. Total rules applied 3305 place count 1149 transition count 1116
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 3 with 42 rules applied. Total rules applied 3347 place count 1149 transition count 1074
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 3389 place count 1107 transition count 1074
Discarding 211 places :
Symmetric choice reduction at 5 with 211 rule applications. Total rules 3600 place count 896 transition count 863
Iterating global reduction 5 with 211 rules applied. Total rules applied 3811 place count 896 transition count 863
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 43 places :
Implicit places reduction removed 43 places
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 5 with 106 rules applied. Total rules applied 3917 place count 853 transition count 800
Reduce places removed 42 places and 0 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Iterating post reduction 6 with 84 rules applied. Total rules applied 4001 place count 811 transition count 758
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 7 with 42 rules applied. Total rules applied 4043 place count 769 transition count 758
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 43 Pre rules applied. Total rules applied 4043 place count 769 transition count 715
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 8 with 86 rules applied. Total rules applied 4129 place count 726 transition count 715
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 4134 place count 721 transition count 610
Iterating global reduction 8 with 5 rules applied. Total rules applied 4139 place count 721 transition count 610
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Discarding 63 places :
Implicit places reduction removed 63 places
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 8 with 126 rules applied. Total rules applied 4265 place count 658 transition count 547
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 4286 place count 637 transition count 547
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 42 Pre rules applied. Total rules applied 4286 place count 637 transition count 505
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 10 with 84 rules applied. Total rules applied 4370 place count 595 transition count 505
Discarding 42 places :
Symmetric choice reduction at 10 with 42 rule applications. Total rules 4412 place count 553 transition count 463
Iterating global reduction 10 with 42 rules applied. Total rules applied 4454 place count 553 transition count 463
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 10 with 105 rules applied. Total rules applied 4559 place count 532 transition count 379
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 11 with 42 rules applied. Total rules applied 4601 place count 490 transition count 379
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Ensure Unique test removed 21 places
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 12 with 105 rules applied. Total rules applied 4706 place count 427 transition count 337
Free-agglomeration rule (complex) applied 63 times.
Iterating global reduction 12 with 63 rules applied. Total rules applied 4769 place count 427 transition count 274
Ensure Unique test removed 42 places
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 12 with 105 rules applied. Total rules applied 4874 place count 322 transition count 274
Reduce places removed 21 places and 21 transitions.
Iterating global reduction 13 with 21 rules applied. Total rules applied 4895 place count 301 transition count 253
Applied a total of 4895 rules in 395 ms. Remains 301 /3260 variables (removed 2959) and now considering 253/2753 (removed 2500) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 396 ms. Remains : 301/3260 places, 253/2753 transitions.
// Phase 1: matrix 253 rows 301 cols
[2023-03-10 18:56:37] [INFO ] Computed 48 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 5099 resets, run finished after 4660 ms. (steps per millisecond=214 ) properties (out of 8) seen :73
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 381 resets, run finished after 913 ms. (steps per millisecond=1095 ) properties (out of 6) seen :26
Incomplete Best-First random walk after 1000001 steps, including 256 resets, run finished after 1026 ms. (steps per millisecond=974 ) properties (out of 6) seen :66
Incomplete Best-First random walk after 1000001 steps, including 288 resets, run finished after 971 ms. (steps per millisecond=1029 ) properties (out of 6) seen :51
Incomplete Best-First random walk after 1000001 steps, including 243 resets, run finished after 1137 ms. (steps per millisecond=879 ) properties (out of 6) seen :82
Incomplete Best-First random walk after 1000001 steps, including 243 resets, run finished after 1137 ms. (steps per millisecond=879 ) properties (out of 6) seen :82
Incomplete Best-First random walk after 1000001 steps, including 328 resets, run finished after 892 ms. (steps per millisecond=1121 ) properties (out of 6) seen :39
[2023-03-10 18:56:48] [INFO ] Invariant cache hit.
[2023-03-10 18:56:48] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned unsat
[2023-03-10 18:56:48] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 18:56:48] [INFO ] [Real]Absence check using 3 positive and 45 generalized place invariants in 6 ms returned sat
[2023-03-10 18:56:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:56:48] [INFO ] [Real]Absence check using state equation in 40 ms returned unsat
[2023-03-10 18:56:48] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned unsat
[2023-03-10 18:56:48] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 18:56:48] [INFO ] [Real]Absence check using 3 positive and 45 generalized place invariants in 6 ms returned unsat
[2023-03-10 18:56:48] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 18:56:48] [INFO ] [Real]Absence check using 3 positive and 45 generalized place invariants in 6 ms returned unsat
[2023-03-10 18:56:48] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : [21, 2, 21, 21, 21, 21] Max seen :[21, 2, 21, 21, 21, 21]
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-07 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-05 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-04 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-03 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-00 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 79201 ms.
ITS solved all properties within timeout

BK_STOP 1678474609800

--------------------
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="FamilyReunion-PT-L00020M0002C001P001G001"
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 FamilyReunion-PT-L00020M0002C001P001G001, 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 r167-tall-167838853000405"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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