fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of Smart+red for ShieldRVt-PT-040B

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
733.752 135300.00 167648.00 132.80 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r427-tajo-167905979500317.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ShieldRVt-PT-040B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r427-tajo-167905979500317
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 944K
-rw-r--r-- 1 mcc users 9.3K Feb 25 23:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 23:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 23:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 23:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 23:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 25 23:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 23:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 25 23:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 489K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679384291072

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-040B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 07:38:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-21 07:38:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 07:38:13] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2023-03-21 07:38:13] [INFO ] Transformed 2003 places.
[2023-03-21 07:38:13] [INFO ] Transformed 2003 transitions.
[2023-03-21 07:38:13] [INFO ] Found NUPN structural information;
[2023-03-21 07:38:13] [INFO ] Parsed PT model containing 2003 places and 2003 transitions and 4726 arcs in 320 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 2003 rows 2003 cols
[2023-03-21 07:38:14] [INFO ] Computed 161 place invariants in 38 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 16) seen :9
FORMULA ShieldRVt-PT-040B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 7) seen :0
[2023-03-21 07:38:14] [INFO ] Invariant cache hit.
[2023-03-21 07:38:15] [INFO ] [Real]Absence check using 161 positive place invariants in 79 ms returned sat
[2023-03-21 07:38:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 07:38:16] [INFO ] [Real]Absence check using state equation in 932 ms returned sat
[2023-03-21 07:38:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 07:38:16] [INFO ] [Nat]Absence check using 161 positive place invariants in 95 ms returned sat
[2023-03-21 07:38:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 07:38:17] [INFO ] [Nat]Absence check using state equation in 607 ms returned sat
[2023-03-21 07:38:18] [INFO ] Deduced a trap composed of 35 places in 645 ms of which 5 ms to minimize.
[2023-03-21 07:38:18] [INFO ] Deduced a trap composed of 33 places in 579 ms of which 1 ms to minimize.
[2023-03-21 07:38:19] [INFO ] Deduced a trap composed of 40 places in 746 ms of which 2 ms to minimize.
[2023-03-21 07:38:20] [INFO ] Deduced a trap composed of 35 places in 555 ms of which 10 ms to minimize.
[2023-03-21 07:38:20] [INFO ] Deduced a trap composed of 44 places in 572 ms of which 1 ms to minimize.
[2023-03-21 07:38:21] [INFO ] Deduced a trap composed of 50 places in 666 ms of which 2 ms to minimize.
[2023-03-21 07:38: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.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 07:38:22] [INFO ] [Real]Absence check using 161 positive place invariants in 58 ms returned sat
[2023-03-21 07:38:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 07:38:22] [INFO ] [Real]Absence check using state equation in 684 ms returned sat
[2023-03-21 07:38:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 07:38:23] [INFO ] [Nat]Absence check using 161 positive place invariants in 61 ms returned sat
[2023-03-21 07:38:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 07:38:23] [INFO ] [Nat]Absence check using state equation in 613 ms returned sat
[2023-03-21 07:38:24] [INFO ] Deduced a trap composed of 25 places in 452 ms of which 1 ms to minimize.
[2023-03-21 07:38:24] [INFO ] Deduced a trap composed of 35 places in 434 ms of which 1 ms to minimize.
[2023-03-21 07:38:25] [INFO ] Deduced a trap composed of 27 places in 441 ms of which 1 ms to minimize.
[2023-03-21 07:38:25] [INFO ] Deduced a trap composed of 28 places in 427 ms of which 1 ms to minimize.
[2023-03-21 07:38:26] [INFO ] Deduced a trap composed of 37 places in 434 ms of which 1 ms to minimize.
[2023-03-21 07:38:26] [INFO ] Deduced a trap composed of 34 places in 430 ms of which 1 ms to minimize.
[2023-03-21 07:38:27] [INFO ] Deduced a trap composed of 30 places in 398 ms of which 0 ms to minimize.
[2023-03-21 07:38:27] [INFO ] Deduced a trap composed of 31 places in 392 ms of which 1 ms to minimize.
[2023-03-21 07:38:27] [INFO ] Deduced a trap composed of 31 places in 364 ms of which 1 ms to minimize.
[2023-03-21 07:38:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 07:38:28] [INFO ] [Real]Absence check using 161 positive place invariants in 55 ms returned sat
[2023-03-21 07:38:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 07:38:28] [INFO ] [Real]Absence check using state equation in 591 ms returned sat
[2023-03-21 07:38:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 07:38:29] [INFO ] [Nat]Absence check using 161 positive place invariants in 108 ms returned sat
[2023-03-21 07:38:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 07:38:29] [INFO ] [Nat]Absence check using state equation in 588 ms returned sat
[2023-03-21 07:38:30] [INFO ] Deduced a trap composed of 29 places in 436 ms of which 1 ms to minimize.
[2023-03-21 07:38:30] [INFO ] Deduced a trap composed of 35 places in 411 ms of which 1 ms to minimize.
[2023-03-21 07:38:31] [INFO ] Deduced a trap composed of 44 places in 415 ms of which 1 ms to minimize.
[2023-03-21 07:38:31] [INFO ] Deduced a trap composed of 24 places in 455 ms of which 1 ms to minimize.
[2023-03-21 07:38:32] [INFO ] Deduced a trap composed of 43 places in 563 ms of which 1 ms to minimize.
[2023-03-21 07:38:32] [INFO ] Deduced a trap composed of 39 places in 428 ms of which 1 ms to minimize.
[2023-03-21 07:38:33] [INFO ] Deduced a trap composed of 36 places in 403 ms of which 1 ms to minimize.
[2023-03-21 07:38:33] [INFO ] Deduced a trap composed of 42 places in 421 ms of which 1 ms to minimize.
[2023-03-21 07:38:34] [INFO ] Deduced a trap composed of 46 places in 405 ms of which 1 ms to minimize.
[2023-03-21 07:38:34] [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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 07:38:34] [INFO ] [Real]Absence check using 161 positive place invariants in 108 ms returned sat
[2023-03-21 07:38:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 07:38:35] [INFO ] [Real]Absence check using state equation in 644 ms returned sat
[2023-03-21 07:38:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 07:38:35] [INFO ] [Nat]Absence check using 161 positive place invariants in 55 ms returned sat
[2023-03-21 07:38:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 07:38:36] [INFO ] [Nat]Absence check using state equation in 594 ms returned sat
[2023-03-21 07:38:36] [INFO ] Deduced a trap composed of 35 places in 404 ms of which 1 ms to minimize.
[2023-03-21 07:38:37] [INFO ] Deduced a trap composed of 75 places in 470 ms of which 1 ms to minimize.
[2023-03-21 07:38:37] [INFO ] Deduced a trap composed of 23 places in 404 ms of which 1 ms to minimize.
[2023-03-21 07:38:38] [INFO ] Deduced a trap composed of 24 places in 497 ms of which 1 ms to minimize.
[2023-03-21 07:38:38] [INFO ] Deduced a trap composed of 26 places in 736 ms of which 1 ms to minimize.
[2023-03-21 07:38:39] [INFO ] Deduced a trap composed of 63 places in 390 ms of which 1 ms to minimize.
[2023-03-21 07:38:39] [INFO ] Deduced a trap composed of 28 places in 390 ms of which 1 ms to minimize.
[2023-03-21 07:38:40] [INFO ] Deduced a trap composed of 31 places in 411 ms of which 1 ms to minimize.
[2023-03-21 07:38:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 07:38:40] [INFO ] [Real]Absence check using 161 positive place invariants in 55 ms returned sat
[2023-03-21 07:38:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 07:38:41] [INFO ] [Real]Absence check using state equation in 634 ms returned sat
[2023-03-21 07:38:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 07:38:41] [INFO ] [Nat]Absence check using 161 positive place invariants in 56 ms returned sat
[2023-03-21 07:38:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 07:38:42] [INFO ] [Nat]Absence check using state equation in 588 ms returned sat
[2023-03-21 07:38:42] [INFO ] Deduced a trap composed of 46 places in 402 ms of which 1 ms to minimize.
[2023-03-21 07:38:43] [INFO ] Deduced a trap composed of 29 places in 409 ms of which 3 ms to minimize.
[2023-03-21 07:38:43] [INFO ] Deduced a trap composed of 36 places in 431 ms of which 1 ms to minimize.
[2023-03-21 07:38:43] [INFO ] Deduced a trap composed of 51 places in 387 ms of which 1 ms to minimize.
[2023-03-21 07:38:44] [INFO ] Deduced a trap composed of 36 places in 389 ms of which 1 ms to minimize.
[2023-03-21 07:38:44] [INFO ] Deduced a trap composed of 30 places in 385 ms of which 1 ms to minimize.
[2023-03-21 07:38:45] [INFO ] Deduced a trap composed of 25 places in 393 ms of which 1 ms to minimize.
[2023-03-21 07:38:45] [INFO ] Deduced a trap composed of 28 places in 382 ms of which 2 ms to minimize.
[2023-03-21 07:38:46] [INFO ] Deduced a trap composed of 30 places in 376 ms of which 0 ms to minimize.
[2023-03-21 07:38:46] [INFO ] Deduced a trap composed of 75 places in 453 ms of which 3 ms to minimize.
[2023-03-21 07:38:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 07:38:46] [INFO ] [Real]Absence check using 161 positive place invariants in 56 ms returned sat
[2023-03-21 07:38:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 07:38:47] [INFO ] [Real]Absence check using state equation in 570 ms returned sat
[2023-03-21 07:38:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 07:38:47] [INFO ] [Nat]Absence check using 161 positive place invariants in 66 ms returned sat
[2023-03-21 07:38:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 07:38:48] [INFO ] [Nat]Absence check using state equation in 629 ms returned sat
[2023-03-21 07:38:48] [INFO ] Deduced a trap composed of 28 places in 405 ms of which 2 ms to minimize.
[2023-03-21 07:38:49] [INFO ] Deduced a trap composed of 56 places in 406 ms of which 1 ms to minimize.
[2023-03-21 07:38:49] [INFO ] Deduced a trap composed of 43 places in 390 ms of which 1 ms to minimize.
[2023-03-21 07:38:50] [INFO ] Deduced a trap composed of 26 places in 412 ms of which 1 ms to minimize.
[2023-03-21 07:38:50] [INFO ] Deduced a trap composed of 32 places in 378 ms of which 1 ms to minimize.
[2023-03-21 07:38:51] [INFO ] Deduced a trap composed of 32 places in 444 ms of which 1 ms to minimize.
[2023-03-21 07:38:51] [INFO ] Deduced a trap composed of 37 places in 400 ms of which 1 ms to minimize.
[2023-03-21 07:38:52] [INFO ] Deduced a trap composed of 37 places in 374 ms of which 1 ms to minimize.
[2023-03-21 07:38:52] [INFO ] Deduced a trap composed of 23 places in 375 ms of which 2 ms to minimize.
[2023-03-21 07:38:52] [INFO ] Deduced a trap composed of 25 places in 357 ms of which 1 ms to minimize.
[2023-03-21 07:38:52] [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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 07:38:53] [INFO ] [Real]Absence check using 161 positive place invariants in 52 ms returned sat
[2023-03-21 07:38:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 07:38:53] [INFO ] [Real]Absence check using state equation in 633 ms returned sat
[2023-03-21 07:38:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 07:38:54] [INFO ] [Nat]Absence check using 161 positive place invariants in 71 ms returned sat
[2023-03-21 07:38:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 07:38:54] [INFO ] [Nat]Absence check using state equation in 600 ms returned sat
[2023-03-21 07:38:55] [INFO ] Deduced a trap composed of 34 places in 420 ms of which 1 ms to minimize.
[2023-03-21 07:38:55] [INFO ] Deduced a trap composed of 24 places in 403 ms of which 1 ms to minimize.
[2023-03-21 07:38:56] [INFO ] Deduced a trap composed of 33 places in 427 ms of which 1 ms to minimize.
[2023-03-21 07:38:56] [INFO ] Deduced a trap composed of 35 places in 405 ms of which 10 ms to minimize.
[2023-03-21 07:38:57] [INFO ] Deduced a trap composed of 73 places in 409 ms of which 1 ms to minimize.
[2023-03-21 07:38:57] [INFO ] Deduced a trap composed of 26 places in 412 ms of which 2 ms to minimize.
[2023-03-21 07:38:57] [INFO ] Deduced a trap composed of 23 places in 386 ms of which 1 ms to minimize.
[2023-03-21 07:38:58] [INFO ] Deduced a trap composed of 36 places in 390 ms of which 1 ms to minimize.
[2023-03-21 07:38:58] [INFO ] Deduced a trap composed of 39 places in 390 ms of which 1 ms to minimize.
[2023-03-21 07:38:59] [INFO ] Deduced a trap composed of 46 places in 386 ms of which 1 ms to minimize.
[2023-03-21 07:38:59] [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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Drop transitions removed 635 transitions
Trivial Post-agglo rules discarded 635 transitions
Performed 635 trivial Post agglomeration. Transition count delta: 635
Iterating post reduction 0 with 635 rules applied. Total rules applied 635 place count 2003 transition count 1368
Reduce places removed 635 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 637 rules applied. Total rules applied 1272 place count 1368 transition count 1366
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 1277 place count 1367 transition count 1362
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1281 place count 1363 transition count 1362
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 159 Pre rules applied. Total rules applied 1281 place count 1363 transition count 1203
Deduced a syphon composed of 159 places in 6 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 4 with 318 rules applied. Total rules applied 1599 place count 1204 transition count 1203
Discarding 278 places :
Symmetric choice reduction at 4 with 278 rule applications. Total rules 1877 place count 926 transition count 925
Iterating global reduction 4 with 278 rules applied. Total rules applied 2155 place count 926 transition count 925
Performed 118 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 118 Pre rules applied. Total rules applied 2155 place count 926 transition count 807
Deduced a syphon composed of 118 places in 3 ms
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 4 with 236 rules applied. Total rules applied 2391 place count 808 transition count 807
Performed 359 Post agglomeration using F-continuation condition.Transition count delta: 359
Deduced a syphon composed of 359 places in 1 ms
Reduce places removed 359 places and 0 transitions.
Iterating global reduction 4 with 718 rules applied. Total rules applied 3109 place count 449 transition count 448
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3311 place count 348 transition count 546
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 3339 place count 334 transition count 559
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3340 place count 334 transition count 558
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3341 place count 334 transition count 557
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3342 place count 333 transition count 557
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 3343 place count 333 transition count 556
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3344 place count 332 transition count 555
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3345 place count 331 transition count 555
Applied a total of 3345 rules in 642 ms. Remains 331 /2003 variables (removed 1672) and now considering 555/2003 (removed 1448) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 651 ms. Remains : 331/2003 places, 555/2003 transitions.
// Phase 1: matrix 555 rows 331 cols
[2023-03-21 07:38:59] [INFO ] Computed 160 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 288 resets, run finished after 3978 ms. (steps per millisecond=251 ) properties (out of 7) seen :3
FORMULA ShieldRVt-PT-040B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 1909 ms. (steps per millisecond=523 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 30 resets, run finished after 1921 ms. (steps per millisecond=520 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 23 resets, run finished after 1912 ms. (steps per millisecond=523 ) properties (out of 4) seen :1
FORMULA ShieldRVt-PT-040B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-21 07:39:09] [INFO ] Invariant cache hit.
[2023-03-21 07:39:09] [INFO ] [Real]Absence check using 160 positive place invariants in 27 ms returned sat
[2023-03-21 07:39:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 07:39:09] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2023-03-21 07:39:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 07:39:09] [INFO ] [Nat]Absence check using 160 positive place invariants in 17 ms returned sat
[2023-03-21 07:39:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 07:39:10] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2023-03-21 07:39:10] [INFO ] Computed and/alt/rep : 552/1653/552 causal constraints (skipped 0 transitions) in 62 ms.
[2023-03-21 07:39:13] [INFO ] Added : 470 causal constraints over 95 iterations in 3174 ms. Result :sat
Minimization took 434 ms.
[2023-03-21 07:39:13] [INFO ] [Real]Absence check using 160 positive place invariants in 24 ms returned sat
[2023-03-21 07:39:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 07:39:14] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2023-03-21 07:39:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 07:39:14] [INFO ] [Nat]Absence check using 160 positive place invariants in 22 ms returned sat
[2023-03-21 07:39:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 07:39:14] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2023-03-21 07:39:14] [INFO ] Computed and/alt/rep : 552/1653/552 causal constraints (skipped 0 transitions) in 68 ms.
[2023-03-21 07:39:17] [INFO ] Added : 477 causal constraints over 96 iterations in 3188 ms. Result :sat
Minimization took 928 ms.
[2023-03-21 07:39:18] [INFO ] [Real]Absence check using 160 positive place invariants in 24 ms returned sat
[2023-03-21 07:39:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 07:39:18] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2023-03-21 07:39:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 07:39:18] [INFO ] [Nat]Absence check using 160 positive place invariants in 19 ms returned sat
[2023-03-21 07:39:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 07:39:18] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2023-03-21 07:39:18] [INFO ] Computed and/alt/rep : 552/1653/552 causal constraints (skipped 0 transitions) in 26 ms.
[2023-03-21 07:39:21] [INFO ] Added : 476 causal constraints over 96 iterations in 3022 ms. Result :sat
Minimization took 3002 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA ShieldRVt-PT-040B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-040B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 331 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 331/331 places, 555/555 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 331 transition count 553
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 329 transition count 553
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 329 transition count 551
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 327 transition count 551
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 324 transition count 548
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 322 transition count 551
Applied a total of 18 rules in 63 ms. Remains 322 /331 variables (removed 9) and now considering 551/555 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 322/331 places, 551/555 transitions.
// Phase 1: matrix 551 rows 322 cols
[2023-03-21 07:39:25] [INFO ] Computed 160 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 282 resets, run finished after 4449 ms. (steps per millisecond=224 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 28 resets, run finished after 2624 ms. (steps per millisecond=381 ) properties (out of 1) seen :0
[2023-03-21 07:39:33] [INFO ] Invariant cache hit.
[2023-03-21 07:39:33] [INFO ] [Real]Absence check using 160 positive place invariants in 25 ms returned sat
[2023-03-21 07:39:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 07:39:33] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2023-03-21 07:39:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 07:39:33] [INFO ] [Nat]Absence check using 160 positive place invariants in 17 ms returned sat
[2023-03-21 07:39:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 07:39:33] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2023-03-21 07:39:33] [INFO ] Computed and/alt/rep : 548/1685/548 causal constraints (skipped 0 transitions) in 29 ms.
[2023-03-21 07:39:36] [INFO ] Added : 465 causal constraints over 93 iterations in 2743 ms. Result :sat
Minimization took 1783 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 551/551 transitions.
Applied a total of 0 rules in 12 ms. Remains 322 /322 variables (removed 0) and now considering 551/551 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 322/322 places, 551/551 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 551/551 transitions.
Applied a total of 0 rules in 11 ms. Remains 322 /322 variables (removed 0) and now considering 551/551 (removed 0) transitions.
[2023-03-21 07:39:38] [INFO ] Invariant cache hit.
[2023-03-21 07:39:38] [INFO ] Implicit Places using invariants in 396 ms returned []
[2023-03-21 07:39:38] [INFO ] Invariant cache hit.
[2023-03-21 07:39:39] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 831 ms to find 0 implicit places.
[2023-03-21 07:39:39] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-21 07:39:39] [INFO ] Invariant cache hit.
[2023-03-21 07:39:39] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1048 ms. Remains : 322/322 places, 551/551 transitions.
Starting property specific reduction for ShieldRVt-PT-040B-UpperBounds-14
[2023-03-21 07:39:39] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
[2023-03-21 07:39:39] [INFO ] Invariant cache hit.
[2023-03-21 07:39:39] [INFO ] [Real]Absence check using 160 positive place invariants in 24 ms returned sat
[2023-03-21 07:39:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 07:39:39] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2023-03-21 07:39:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 07:39:39] [INFO ] [Nat]Absence check using 160 positive place invariants in 15 ms returned sat
[2023-03-21 07:39:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 07:39:40] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2023-03-21 07:39:40] [INFO ] Computed and/alt/rep : 548/1685/548 causal constraints (skipped 0 transitions) in 20 ms.
[2023-03-21 07:39:42] [INFO ] Added : 465 causal constraints over 93 iterations in 2291 ms. Result :sat
Minimization took 1540 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 551/551 transitions.
Applied a total of 0 rules in 7 ms. Remains 322 /322 variables (removed 0) and now considering 551/551 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 322/322 places, 551/551 transitions.
[2023-03-21 07:39:44] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 249 resets, run finished after 3913 ms. (steps per millisecond=255 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 27 resets, run finished after 2397 ms. (steps per millisecond=417 ) properties (out of 1) seen :0
[2023-03-21 07:39:50] [INFO ] Invariant cache hit.
[2023-03-21 07:39:50] [INFO ] [Real]Absence check using 160 positive place invariants in 21 ms returned sat
[2023-03-21 07:39:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 07:39:50] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2023-03-21 07:39:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 07:39:50] [INFO ] [Nat]Absence check using 160 positive place invariants in 17 ms returned sat
[2023-03-21 07:39:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 07:39:50] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2023-03-21 07:39:51] [INFO ] Computed and/alt/rep : 548/1685/548 causal constraints (skipped 0 transitions) in 23 ms.
[2023-03-21 07:39:53] [INFO ] Added : 465 causal constraints over 93 iterations in 2433 ms. Result :sat
Minimization took 1557 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 551/551 transitions.
Applied a total of 0 rules in 6 ms. Remains 322 /322 variables (removed 0) and now considering 551/551 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 322/322 places, 551/551 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 551/551 transitions.
Applied a total of 0 rules in 6 ms. Remains 322 /322 variables (removed 0) and now considering 551/551 (removed 0) transitions.
[2023-03-21 07:39:55] [INFO ] Invariant cache hit.
[2023-03-21 07:39:55] [INFO ] Implicit Places using invariants in 566 ms returned []
[2023-03-21 07:39:55] [INFO ] Invariant cache hit.
[2023-03-21 07:39:56] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 891 ms to find 0 implicit places.
[2023-03-21 07:39:56] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-21 07:39:56] [INFO ] Invariant cache hit.
[2023-03-21 07:39:56] [INFO ] Dead Transitions using invariants and state equation in 301 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1231 ms. Remains : 322/322 places, 551/551 transitions.
Ending property specific reduction for ShieldRVt-PT-040B-UpperBounds-14 in 16880 ms.
[2023-03-21 07:39:56] [INFO ] Flatten gal took : 149 ms
[2023-03-21 07:39:56] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-21 07:39:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 322 places, 551 transitions and 3114 arcs took 11 ms.
Total runtime 103453 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldRVt (PT), instance 040B
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 322 places, 551 transitions, 3114 arcs.
Final Score: 3747.513
Took : 28 seconds
Bounds file is: UpperBounds.xml
FORMULA ShieldRVt-PT-040B-UpperBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1679384426372

--------------------
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="ShieldRVt-PT-040B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is ShieldRVt-PT-040B, 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 r427-tajo-167905979500317"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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