Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r356-tall-171683762301021.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
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 r356-tall-171683762301021
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 21:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 21:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 21:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 11 21:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 489K May 18 16:43 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 1717084958183

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-040B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-30 16:02:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 16:02:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 16:02:39] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2024-05-30 16:02:39] [INFO ] Transformed 2003 places.
[2024-05-30 16:02:39] [INFO ] Transformed 2003 transitions.
[2024-05-30 16:02:39] [INFO ] Found NUPN structural information;
[2024-05-30 16:02:39] [INFO ] Parsed PT model containing 2003 places and 2003 transitions and 4726 arcs in 300 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 2003 rows 2003 cols
[2024-05-30 16:02:39] [INFO ] Computed 161 invariants in 45 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 80 ms. (123 steps per ms)
FORMULA ShieldRVt-PT-040B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-040B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-040B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-040B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-040B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-040B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-040B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90009 steps (18 resets) in 105 ms. (849 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-30 16:02:39] [INFO ] Invariant cache hit.
[2024-05-30 16:02:40] [INFO ] [Real]Absence check using 161 positive place invariants in 76 ms returned sat
[2024-05-30 16:02:41] [INFO ] [Real]Absence check using state equation in 773 ms returned sat
[2024-05-30 16:02:42] [INFO ] Deduced a trap composed of 34 places in 636 ms of which 68 ms to minimize.
[2024-05-30 16:02:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 16:02:42] [INFO ] [Nat]Absence check using 161 positive place invariants in 76 ms returned sat
[2024-05-30 16:02:43] [INFO ] [Nat]Absence check using state equation in 718 ms returned sat
[2024-05-30 16:02:43] [INFO ] Deduced a trap composed of 34 places in 443 ms of which 10 ms to minimize.
[2024-05-30 16:02:44] [INFO ] Deduced a trap composed of 45 places in 380 ms of which 7 ms to minimize.
[2024-05-30 16:02:44] [INFO ] Deduced a trap composed of 30 places in 432 ms of which 7 ms to minimize.
[2024-05-30 16:02:45] [INFO ] Deduced a trap composed of 49 places in 402 ms of which 7 ms to minimize.
[2024-05-30 16:02:45] [INFO ] Deduced a trap composed of 26 places in 391 ms of which 7 ms to minimize.
[2024-05-30 16:02:46] [INFO ] Deduced a trap composed of 37 places in 387 ms of which 8 ms to minimize.
[2024-05-30 16:02:46] [INFO ] Deduced a trap composed of 26 places in 355 ms of which 7 ms to minimize.
[2024-05-30 16:02:47] [INFO ] Deduced a trap composed of 40 places in 374 ms of which 7 ms to minimize.
[2024-05-30 16:02:47] [INFO ] Deduced a trap composed of 37 places in 349 ms of which 7 ms to minimize.
[2024-05-30 16:02:47] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-30 16:02:47] [INFO ] [Real]Absence check using 161 positive place invariants in 81 ms returned sat
[2024-05-30 16:02:48] [INFO ] [Real]Absence check using state equation in 714 ms returned sat
[2024-05-30 16:02:49] [INFO ] Deduced a trap composed of 35 places in 531 ms of which 10 ms to minimize.
[2024-05-30 16:02:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 16:02:49] [INFO ] [Nat]Absence check using 161 positive place invariants in 79 ms returned sat
[2024-05-30 16:02:50] [INFO ] [Nat]Absence check using state equation in 658 ms returned sat
[2024-05-30 16:02:51] [INFO ] Deduced a trap composed of 35 places in 569 ms of which 10 ms to minimize.
[2024-05-30 16:02:51] [INFO ] Deduced a trap composed of 40 places in 559 ms of which 9 ms to minimize.
[2024-05-30 16:02:52] [INFO ] Deduced a trap composed of 30 places in 537 ms of which 9 ms to minimize.
[2024-05-30 16:02:52] [INFO ] Deduced a trap composed of 28 places in 530 ms of which 9 ms to minimize.
[2024-05-30 16:02:53] [INFO ] Deduced a trap composed of 30 places in 532 ms of which 10 ms to minimize.
[2024-05-30 16:02:54] [INFO ] Deduced a trap composed of 32 places in 529 ms of which 9 ms to minimize.
[2024-05-30 16:02:54] [INFO ] Deduced a trap composed of 44 places in 501 ms of which 8 ms to minimize.
[2024-05-30 16:02: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 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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-30 16:02:55] [INFO ] [Real]Absence check using 161 positive place invariants in 75 ms returned sat
[2024-05-30 16:02:55] [INFO ] [Real]Absence check using state equation in 783 ms returned sat
[2024-05-30 16:02:56] [INFO ] Deduced a trap composed of 47 places in 401 ms of which 7 ms to minimize.
[2024-05-30 16:02:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 16:02:56] [INFO ] [Nat]Absence check using 161 positive place invariants in 77 ms returned sat
[2024-05-30 16:02:57] [INFO ] [Nat]Absence check using state equation in 751 ms returned sat
[2024-05-30 16:02:57] [INFO ] Deduced a trap composed of 47 places in 394 ms of which 8 ms to minimize.
[2024-05-30 16:02:58] [INFO ] Deduced a trap composed of 26 places in 383 ms of which 8 ms to minimize.
[2024-05-30 16:02:58] [INFO ] Deduced a trap composed of 30 places in 381 ms of which 8 ms to minimize.
[2024-05-30 16:02:59] [INFO ] Deduced a trap composed of 39 places in 376 ms of which 8 ms to minimize.
[2024-05-30 16:02:59] [INFO ] Deduced a trap composed of 33 places in 377 ms of which 7 ms to minimize.
[2024-05-30 16:03:00] [INFO ] Deduced a trap composed of 33 places in 377 ms of which 7 ms to minimize.
[2024-05-30 16:03:00] [INFO ] Deduced a trap composed of 37 places in 360 ms of which 7 ms to minimize.
[2024-05-30 16:03:01] [INFO ] Deduced a trap composed of 35 places in 340 ms of which 7 ms to minimize.
[2024-05-30 16:03:01] [INFO ] Deduced a trap composed of 39 places in 351 ms of which 7 ms to minimize.
[2024-05-30 16:03:01] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-30 16:03:01] [INFO ] [Real]Absence check using 161 positive place invariants in 76 ms returned sat
[2024-05-30 16:03:02] [INFO ] [Real]Absence check using state equation in 729 ms returned sat
[2024-05-30 16:03:03] [INFO ] Deduced a trap composed of 40 places in 560 ms of which 10 ms to minimize.
[2024-05-30 16:03:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 16:03:03] [INFO ] [Nat]Absence check using 161 positive place invariants in 77 ms returned sat
[2024-05-30 16:03:04] [INFO ] [Nat]Absence check using state equation in 707 ms returned sat
[2024-05-30 16:03:05] [INFO ] Deduced a trap composed of 40 places in 572 ms of which 10 ms to minimize.
[2024-05-30 16:03:05] [INFO ] Deduced a trap composed of 38 places in 575 ms of which 9 ms to minimize.
[2024-05-30 16:03:06] [INFO ] Deduced a trap composed of 32 places in 539 ms of which 9 ms to minimize.
[2024-05-30 16:03:06] [INFO ] Deduced a trap composed of 30 places in 530 ms of which 8 ms to minimize.
[2024-05-30 16:03:07] [INFO ] Deduced a trap composed of 43 places in 547 ms of which 12 ms to minimize.
[2024-05-30 16:03:08] [INFO ] Deduced a trap composed of 30 places in 505 ms of which 9 ms to minimize.
[2024-05-30 16:03:08] [INFO ] Deduced a trap composed of 30 places in 517 ms of which 9 ms to minimize.
[2024-05-30 16:03:08] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-30 16:03:09] [INFO ] [Real]Absence check using 161 positive place invariants in 74 ms returned sat
[2024-05-30 16:03:09] [INFO ] [Real]Absence check using state equation in 662 ms returned sat
[2024-05-30 16:03:10] [INFO ] Deduced a trap composed of 28 places in 407 ms of which 7 ms to minimize.
[2024-05-30 16:03:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 16:03:10] [INFO ] [Nat]Absence check using 161 positive place invariants in 77 ms returned sat
[2024-05-30 16:03:11] [INFO ] [Nat]Absence check using state equation in 688 ms returned sat
[2024-05-30 16:03:11] [INFO ] Deduced a trap composed of 28 places in 409 ms of which 8 ms to minimize.
[2024-05-30 16:03:12] [INFO ] Deduced a trap composed of 19 places in 412 ms of which 8 ms to minimize.
[2024-05-30 16:03:12] [INFO ] Deduced a trap composed of 30 places in 388 ms of which 7 ms to minimize.
[2024-05-30 16:03:13] [INFO ] Deduced a trap composed of 49 places in 379 ms of which 7 ms to minimize.
[2024-05-30 16:03:13] [INFO ] Deduced a trap composed of 37 places in 378 ms of which 8 ms to minimize.
[2024-05-30 16:03:14] [INFO ] Deduced a trap composed of 31 places in 353 ms of which 8 ms to minimize.
[2024-05-30 16:03:14] [INFO ] Deduced a trap composed of 45 places in 360 ms of which 7 ms to minimize.
[2024-05-30 16:03:14] [INFO ] Deduced a trap composed of 46 places in 361 ms of which 7 ms to minimize.
[2024-05-30 16:03:15] [INFO ] Deduced a trap composed of 44 places in 360 ms of which 7 ms to minimize.
[2024-05-30 16:03:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-30 16:03:15] [INFO ] [Real]Absence check using 161 positive place invariants in 75 ms returned sat
[2024-05-30 16:03:16] [INFO ] [Real]Absence check using state equation in 681 ms returned sat
[2024-05-30 16:03:17] [INFO ] Deduced a trap composed of 42 places in 788 ms of which 13 ms to minimize.
[2024-05-30 16:03:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 16:03:17] [INFO ] [Nat]Absence check using 161 positive place invariants in 73 ms returned sat
[2024-05-30 16:03:18] [INFO ] [Nat]Absence check using state equation in 691 ms returned sat
[2024-05-30 16:03:19] [INFO ] Deduced a trap composed of 42 places in 782 ms of which 13 ms to minimize.
[2024-05-30 16:03:20] [INFO ] Deduced a trap composed of 45 places in 792 ms of which 12 ms to minimize.
[2024-05-30 16:03:21] [INFO ] Deduced a trap composed of 23 places in 794 ms of which 12 ms to minimize.
[2024-05-30 16:03:21] [INFO ] Deduced a trap composed of 34 places in 797 ms of which 12 ms to minimize.
[2024-05-30 16:03:22] [INFO ] Deduced a trap composed of 38 places in 765 ms of which 12 ms to minimize.
[2024-05-30 16:03:22] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-30 16:03:23] [INFO ] [Real]Absence check using 161 positive place invariants in 74 ms returned sat
[2024-05-30 16:03:23] [INFO ] [Real]Absence check using state equation in 655 ms returned sat
[2024-05-30 16:03:24] [INFO ] Deduced a trap composed of 32 places in 552 ms of which 10 ms to minimize.
[2024-05-30 16:03:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 16:03:25] [INFO ] [Nat]Absence check using 161 positive place invariants in 77 ms returned sat
[2024-05-30 16:03:25] [INFO ] [Nat]Absence check using state equation in 686 ms returned sat
[2024-05-30 16:03:26] [INFO ] Deduced a trap composed of 32 places in 552 ms of which 10 ms to minimize.
[2024-05-30 16:03:26] [INFO ] Deduced a trap composed of 32 places in 556 ms of which 10 ms to minimize.
[2024-05-30 16:03:27] [INFO ] Deduced a trap composed of 32 places in 551 ms of which 13 ms to minimize.
[2024-05-30 16:03:28] [INFO ] Deduced a trap composed of 36 places in 547 ms of which 10 ms to minimize.
[2024-05-30 16:03:28] [INFO ] Deduced a trap composed of 34 places in 544 ms of which 10 ms to minimize.
[2024-05-30 16:03:29] [INFO ] Deduced a trap composed of 32 places in 546 ms of which 10 ms to minimize.
[2024-05-30 16:03:29] [INFO ] Deduced a trap composed of 38 places in 513 ms of which 9 ms to minimize.
[2024-05-30 16:03: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 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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-30 16:03:30] [INFO ] [Real]Absence check using 161 positive place invariants in 75 ms returned sat
[2024-05-30 16:03:31] [INFO ] [Real]Absence check using state equation in 679 ms returned sat
[2024-05-30 16:03:31] [INFO ] Deduced a trap composed of 37 places in 740 ms of which 12 ms to minimize.
[2024-05-30 16:03:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 16:03:32] [INFO ] [Nat]Absence check using 161 positive place invariants in 77 ms returned sat
[2024-05-30 16:03:33] [INFO ] [Nat]Absence check using state equation in 711 ms returned sat
[2024-05-30 16:03:33] [INFO ] Deduced a trap composed of 37 places in 736 ms of which 11 ms to minimize.
[2024-05-30 16:03:34] [INFO ] Deduced a trap composed of 22 places in 708 ms of which 11 ms to minimize.
[2024-05-30 16:03:35] [INFO ] Deduced a trap composed of 35 places in 699 ms of which 11 ms to minimize.
[2024-05-30 16:03:36] [INFO ] Deduced a trap composed of 36 places in 704 ms of which 11 ms to minimize.
[2024-05-30 16:03:36] [INFO ] Deduced a trap composed of 49 places in 689 ms of which 10 ms to minimize.
[2024-05-30 16:03:37] [INFO ] Deduced a trap composed of 32 places in 637 ms of which 10 ms to minimize.
[2024-05-30 16:03: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 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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-30 16:03:38] [INFO ] [Real]Absence check using 161 positive place invariants in 76 ms returned sat
[2024-05-30 16:03:38] [INFO ] [Real]Absence check using state equation in 691 ms returned sat
[2024-05-30 16:03:39] [INFO ] Deduced a trap composed of 40 places in 526 ms of which 9 ms to minimize.
[2024-05-30 16:03:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 16:03:39] [INFO ] [Nat]Absence check using 161 positive place invariants in 81 ms returned sat
[2024-05-30 16:03:40] [INFO ] [Nat]Absence check using state equation in 670 ms returned sat
[2024-05-30 16:03:41] [INFO ] Deduced a trap composed of 40 places in 547 ms of which 10 ms to minimize.
[2024-05-30 16:03:41] [INFO ] Deduced a trap composed of 47 places in 502 ms of which 9 ms to minimize.
[2024-05-30 16:03:42] [INFO ] Deduced a trap composed of 60 places in 480 ms of which 9 ms to minimize.
[2024-05-30 16:03:42] [INFO ] Deduced a trap composed of 25 places in 483 ms of which 9 ms to minimize.
[2024-05-30 16:03:43] [INFO ] Deduced a trap composed of 40 places in 487 ms of which 8 ms to minimize.
[2024-05-30 16:03:43] [INFO ] Deduced a trap composed of 33 places in 477 ms of which 8 ms to minimize.
[2024-05-30 16:03:44] [INFO ] Deduced a trap composed of 33 places in 484 ms of which 9 ms to minimize.
[2024-05-30 16:03:44] [INFO ] Deduced a trap composed of 32 places in 477 ms of which 9 ms to minimize.
[2024-05-30 16:03:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 636 transitions
Trivial Post-agglo rules discarded 636 transitions
Performed 636 trivial Post agglomeration. Transition count delta: 636
Iterating post reduction 0 with 636 rules applied. Total rules applied 636 place count 2003 transition count 1367
Reduce places removed 636 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 638 rules applied. Total rules applied 1274 place count 1367 transition count 1365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1275 place count 1366 transition count 1365
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 160 Pre rules applied. Total rules applied 1275 place count 1366 transition count 1205
Deduced a syphon composed of 160 places in 4 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 3 with 320 rules applied. Total rules applied 1595 place count 1206 transition count 1205
Discarding 277 places :
Symmetric choice reduction at 3 with 277 rule applications. Total rules 1872 place count 929 transition count 928
Iterating global reduction 3 with 277 rules applied. Total rules applied 2149 place count 929 transition count 928
Performed 118 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 118 Pre rules applied. Total rules applied 2149 place count 929 transition count 810
Deduced a syphon composed of 118 places in 3 ms
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 236 rules applied. Total rules applied 2385 place count 811 transition count 810
Performed 360 Post agglomeration using F-continuation condition.Transition count delta: 360
Deduced a syphon composed of 360 places in 1 ms
Reduce places removed 360 places and 0 transitions.
Iterating global reduction 3 with 720 rules applied. Total rules applied 3105 place count 451 transition count 450
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 3 with 202 rules applied. Total rules applied 3307 place count 350 transition count 548
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3341 place count 333 transition count 564
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3342 place count 333 transition count 563
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3344 place count 333 transition count 561
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3346 place count 331 transition count 561
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 3347 place count 331 transition count 560
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3348 place count 330 transition count 559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3349 place count 329 transition count 559
Applied a total of 3349 rules in 458 ms. Remains 329 /2003 variables (removed 1674) and now considering 559/2003 (removed 1444) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 469 ms. Remains : 329/2003 places, 559/2003 transitions.
// Phase 1: matrix 559 rows 329 cols
[2024-05-30 16:03:45] [INFO ] Computed 160 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (254 resets) in 4499 ms. (222 steps per ms)
FORMULA ShieldRVt-PT-040B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-040B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 7000006 steps (195 resets) in 17408 ms. (402 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2024-05-30 16:04:07] [INFO ] Invariant cache hit.
[2024-05-30 16:04:07] [INFO ] [Real]Absence check using 160 positive place invariants in 20 ms returned sat
[2024-05-30 16:04:07] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2024-05-30 16:04:07] [INFO ] Computed and/alt/rep : 556/1674/556 causal constraints (skipped 0 transitions) in 35 ms.
[2024-05-30 16:04:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 16:04:07] [INFO ] [Nat]Absence check using 160 positive place invariants in 19 ms returned sat
[2024-05-30 16:04:07] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2024-05-30 16:04:07] [INFO ] Computed and/alt/rep : 556/1674/556 causal constraints (skipped 0 transitions) in 30 ms.
[2024-05-30 16:04:12] [INFO ] Added : 478 causal constraints over 96 iterations in 4140 ms. Result :sat
Minimization took 2460 ms.
[2024-05-30 16:04:14] [INFO ] [Real]Absence check using 160 positive place invariants in 19 ms returned sat
[2024-05-30 16:04:14] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2024-05-30 16:04:14] [INFO ] Computed and/alt/rep : 556/1674/556 causal constraints (skipped 0 transitions) in 32 ms.
[2024-05-30 16:04:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 16:04:14] [INFO ] [Nat]Absence check using 160 positive place invariants in 19 ms returned sat
[2024-05-30 16:04:15] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2024-05-30 16:04:15] [INFO ] Computed and/alt/rep : 556/1674/556 causal constraints (skipped 0 transitions) in 34 ms.
[2024-05-30 16:04:19] [INFO ] Added : 469 causal constraints over 94 iterations in 4175 ms. Result :sat
Minimization took 970 ms.
[2024-05-30 16:04:20] [INFO ] [Real]Absence check using 160 positive place invariants in 22 ms returned sat
[2024-05-30 16:04:20] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2024-05-30 16:04:20] [INFO ] Computed and/alt/rep : 556/1674/556 causal constraints (skipped 0 transitions) in 36 ms.
[2024-05-30 16:04:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 16:04:20] [INFO ] [Nat]Absence check using 160 positive place invariants in 21 ms returned sat
[2024-05-30 16:04:20] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2024-05-30 16:04:20] [INFO ] Computed and/alt/rep : 556/1674/556 causal constraints (skipped 0 transitions) in 28 ms.
[2024-05-30 16:04:24] [INFO ] Added : 474 causal constraints over 95 iterations in 4178 ms. Result :sat
Minimization took 800 ms.
[2024-05-30 16:04:25] [INFO ] [Real]Absence check using 160 positive place invariants in 19 ms returned sat
[2024-05-30 16:04:26] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2024-05-30 16:04:26] [INFO ] Computed and/alt/rep : 556/1674/556 causal constraints (skipped 0 transitions) in 34 ms.
[2024-05-30 16:04:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 16:04:26] [INFO ] [Nat]Absence check using 160 positive place invariants in 18 ms returned sat
[2024-05-30 16:04:26] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2024-05-30 16:04:26] [INFO ] Computed and/alt/rep : 556/1674/556 causal constraints (skipped 0 transitions) in 29 ms.
[2024-05-30 16:04:30] [INFO ] Added : 480 causal constraints over 97 iterations in 4526 ms. Result :sat
Minimization took 738 ms.
[2024-05-30 16:04:31] [INFO ] [Real]Absence check using 160 positive place invariants in 20 ms returned sat
[2024-05-30 16:04:31] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2024-05-30 16:04:31] [INFO ] Computed and/alt/rep : 556/1674/556 causal constraints (skipped 0 transitions) in 27 ms.
[2024-05-30 16:04:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 16:04:32] [INFO ] [Nat]Absence check using 160 positive place invariants in 19 ms returned sat
[2024-05-30 16:04:32] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2024-05-30 16:04:32] [INFO ] Computed and/alt/rep : 556/1674/556 causal constraints (skipped 0 transitions) in 35 ms.
[2024-05-30 16:04:36] [INFO ] Added : 483 causal constraints over 97 iterations in 4316 ms. Result :sat
Minimization took 4502 ms.
[2024-05-30 16:04:41] [INFO ] [Real]Absence check using 160 positive place invariants in 21 ms returned sat
[2024-05-30 16:04:41] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2024-05-30 16:04:41] [INFO ] Computed and/alt/rep : 556/1674/556 causal constraints (skipped 0 transitions) in 29 ms.
[2024-05-30 16:04:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 16:04:41] [INFO ] [Nat]Absence check using 160 positive place invariants in 20 ms returned sat
[2024-05-30 16:04:41] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2024-05-30 16:04:41] [INFO ] Computed and/alt/rep : 556/1674/556 causal constraints (skipped 0 transitions) in 33 ms.
[2024-05-30 16:04:45] [INFO ] Added : 466 causal constraints over 94 iterations in 4305 ms. Result :sat
Minimization took 4502 ms.
[2024-05-30 16:04:50] [INFO ] [Real]Absence check using 160 positive place invariants in 19 ms returned sat
[2024-05-30 16:04:50] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2024-05-30 16:04:50] [INFO ] Computed and/alt/rep : 556/1674/556 causal constraints (skipped 0 transitions) in 38 ms.
[2024-05-30 16:04:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 16:04:50] [INFO ] [Nat]Absence check using 160 positive place invariants in 23 ms returned sat
[2024-05-30 16:04:50] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2024-05-30 16:04:50] [INFO ] Computed and/alt/rep : 556/1674/556 causal constraints (skipped 0 transitions) in 30 ms.
[2024-05-30 16:05:03] [INFO ] Added : 468 causal constraints over 94 iterations in 12923 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA ShieldRVt-PT-040B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-040B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-040B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-040B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-040B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-040B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-040B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 18 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-30 16:05:04] [INFO ] Flatten gal took : 82 ms
[2024-05-30 16:05:04] [INFO ] Flatten gal took : 42 ms
[2024-05-30 16:05:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14737702350315237004.gal : 23 ms
[2024-05-30 16:05:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10177305017900526641.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14737702350315237004.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10177305017900526641.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 145680 ms.

BK_STOP 1717085105018

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
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 r356-tall-171683762301021"
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 ;