About the Execution of GreatSPN+red for CANInsertWithFailure-PT-090
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15721.735 | 2863702.00 | 5746090.00 | 4818.20 | ? ? ? ? ? 1 ? ? ? ? ? ? ? ? ? ? | normal |
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.r069-tall-171620503900165.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 greatspnxred
Input is CANInsertWithFailure-PT-090, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503900165
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 50M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 19 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 49M May 18 16:42 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 CANInsertWithFailure-PT-090-UpperBounds-00
FORMULA_NAME CANInsertWithFailure-PT-090-UpperBounds-01
FORMULA_NAME CANInsertWithFailure-PT-090-UpperBounds-02
FORMULA_NAME CANInsertWithFailure-PT-090-UpperBounds-03
FORMULA_NAME CANInsertWithFailure-PT-090-UpperBounds-04
FORMULA_NAME CANInsertWithFailure-PT-090-UpperBounds-05
FORMULA_NAME CANInsertWithFailure-PT-090-UpperBounds-06
FORMULA_NAME CANInsertWithFailure-PT-090-UpperBounds-07
FORMULA_NAME CANInsertWithFailure-PT-090-UpperBounds-08
FORMULA_NAME CANInsertWithFailure-PT-090-UpperBounds-09
FORMULA_NAME CANInsertWithFailure-PT-090-UpperBounds-10
FORMULA_NAME CANInsertWithFailure-PT-090-UpperBounds-11
FORMULA_NAME CANInsertWithFailure-PT-090-UpperBounds-12
FORMULA_NAME CANInsertWithFailure-PT-090-UpperBounds-13
FORMULA_NAME CANInsertWithFailure-PT-090-UpperBounds-14
FORMULA_NAME CANInsertWithFailure-PT-090-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716408115421
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-090
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 20:01:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-22 20:01:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 20:01:57] [INFO ] Load time of PNML (sax parser for PT used): 1195 ms
[2024-05-22 20:01:57] [INFO ] Transformed 17284 places.
[2024-05-22 20:01:58] [INFO ] Transformed 49140 transitions.
[2024-05-22 20:01:58] [INFO ] Parsed PT model containing 17284 places and 49140 transitions and 131400 arcs in 1489 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
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:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 49140 rows 17284 cols
[2024-05-22 20:02:14] [INFO ] Computed 93 invariants in 15988 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:[90, 90, 90, 90, 90, 1, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90]
RANDOM walk for 10000 steps (4 resets) in 365 ms. (27 steps per ms)
FORMULA CANInsertWithFailure-PT-090-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 150015 steps (30 resets) in 317 ms. (471 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1] Max Struct:[90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90]
[2024-05-22 20:02:15] [INFO ] Invariant cache hit.
[2024-05-22 20:02:19] [INFO ] [Real]Absence check using 91 positive place invariants in 604 ms returned sat
[2024-05-22 20:02:20] [INFO ] [Real]Absence check using 91 positive and 2 generalized place invariants in 200 ms returned sat
[2024-05-22 20:02:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
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-22 20:02:24] [INFO ] [Real]Absence check using 91 positive place invariants in 592 ms returned sat
[2024-05-22 20:02:25] [INFO ] [Real]Absence check using 91 positive and 2 generalized place invariants in 206 ms returned sat
[2024-05-22 20:02: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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
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-22 20:02:30] [INFO ] [Real]Absence check using 91 positive place invariants in 569 ms returned sat
[2024-05-22 20:02:30] [INFO ] [Real]Absence check using 91 positive and 2 generalized place invariants in 194 ms returned sat
[2024-05-22 20:02:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
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-22 20:02:35] [INFO ] [Real]Absence check using 91 positive place invariants in 556 ms returned sat
[2024-05-22 20:02:35] [INFO ] [Real]Absence check using 91 positive and 2 generalized place invariants in 188 ms returned sat
[2024-05-22 20:02: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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
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-22 20:02:40] [INFO ] [Real]Absence check using 91 positive place invariants in 556 ms returned sat
[2024-05-22 20:02:40] [INFO ] [Real]Absence check using 91 positive and 2 generalized place invariants in 193 ms returned sat
[2024-05-22 20:02:42] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
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-22 20:02:45] [INFO ] [Real]Absence check using 91 positive place invariants in 546 ms returned sat
[2024-05-22 20:02:45] [INFO ] [Real]Absence check using 91 positive and 2 generalized place invariants in 193 ms returned sat
[2024-05-22 20: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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
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-22 20:02:50] [INFO ] [Real]Absence check using 91 positive place invariants in 556 ms returned sat
[2024-05-22 20:02:50] [INFO ] [Real]Absence check using 91 positive and 2 generalized place invariants in 193 ms returned sat
[2024-05-22 20:02:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
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-22 20:02:55] [INFO ] [Real]Absence check using 91 positive place invariants in 537 ms returned sat
[2024-05-22 20:02:55] [INFO ] [Real]Absence check using 91 positive and 2 generalized place invariants in 191 ms returned sat
[2024-05-22 20:02:57] [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.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
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-22 20:03:04] [INFO ] [Real]Absence check using 91 positive place invariants in 538 ms returned sat
[2024-05-22 20:03:04] [INFO ] [Real]Absence check using 91 positive and 2 generalized place invariants in 192 ms returned sat
[2024-05-22 20:03:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
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, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1] Max Struct:[90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1] Max Struct:[90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90]
Support contains 15 out of 17284 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17284/17284 places, 49140/49140 transitions.
Graph (complete) has 66151 edges and 17284 vertex of which 17283 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.54 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 631 place count 17283 transition count 48510
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1261 place count 16653 transition count 48510
Performed 8002 Post agglomeration using F-continuation condition.Transition count delta: 8002
Deduced a syphon composed of 8002 places in 25 ms
Reduce places removed 8002 places and 0 transitions.
Iterating global reduction 2 with 16004 rules applied. Total rules applied 17265 place count 8651 transition count 40508
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 17266 place count 8651 transition count 40507
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17267 place count 8650 transition count 40507
Partial Free-agglomeration rule applied 8184 times.
Drop transitions (Partial Free agglomeration) removed 8184 transitions
Iterating global reduction 3 with 8184 rules applied. Total rules applied 25451 place count 8650 transition count 40507
Applied a total of 25451 rules in 23663 ms. Remains 8650 /17284 variables (removed 8634) and now considering 40507/49140 (removed 8633) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23684 ms. Remains : 8650/17284 places, 40507/49140 transitions.
[2024-05-22 20:03:36] [INFO ] Flow matrix only has 40500 transitions (discarded 7 similar events)
// Phase 1: matrix 40500 rows 8650 cols
[2024-05-22 20:03:40] [INFO ] Computed 92 invariants in 3588 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1] Max Struct:[90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90]
RANDOM walk for 794926 steps (1469 resets) in 30001 ms. (26 steps per ms)
BEST_FIRST walk for 15000015 steps (224 resets) in 34441 ms. (435 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90]
[2024-05-22 20:04:44] [INFO ] Flow matrix only has 40500 transitions (discarded 7 similar events)
[2024-05-22 20:04:44] [INFO ] Invariant cache hit.
[2024-05-22 20:04:45] [INFO ] [Real]Absence check using 90 positive place invariants in 178 ms returned sat
[2024-05-22 20:04:45] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 87 ms returned sat
[2024-05-22 20:05:01] [INFO ] [Real]Absence check using state equation in 15735 ms returned sat
[2024-05-22 20:05:02] [INFO ] State equation strengthened by 40200 read => feed constraints.
[2024-05-22 20:05:08] [INFO ] [Real]Added 40200 Read/Feed constraints in 5848 ms returned sat
[2024-05-22 20:05:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 20:05:10] [INFO ] [Nat]Absence check using 90 positive place invariants in 179 ms returned sat
[2024-05-22 20:05:10] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 74 ms returned sat
[2024-05-22 20:05:27] [INFO ] [Nat]Absence check using state equation in 16808 ms returned sat
[2024-05-22 20:05:33] [INFO ] [Nat]Added 40200 Read/Feed constraints in 6062 ms returned sat
[2024-05-22 20:05:36] [INFO ] Computed and/alt/rep : 31873/87549/31866 causal constraints (skipped 8544 transitions) in 2535 ms.
Minimization took 17574 ms.
[2024-05-22 20:05:55] [INFO ] [Real]Absence check using 90 positive place invariants in 189 ms returned sat
[2024-05-22 20:05:55] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 75 ms returned sat
[2024-05-22 20:06:10] [INFO ] [Real]Absence check using state equation in 14997 ms returned sat
[2024-05-22 20:06:17] [INFO ] [Real]Added 40200 Read/Feed constraints in 5560 ms returned sat
[2024-05-22 20:06:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 20:06:18] [INFO ] [Nat]Absence check using 90 positive place invariants in 175 ms returned sat
[2024-05-22 20:06:18] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 74 ms returned sat
[2024-05-22 20:06:34] [INFO ] [Nat]Absence check using state equation in 15895 ms returned sat
[2024-05-22 20:06:41] [INFO ] [Nat]Added 40200 Read/Feed constraints in 6354 ms returned sat
[2024-05-22 20:06:44] [INFO ] Computed and/alt/rep : 31873/87549/31866 causal constraints (skipped 8544 transitions) in 2501 ms.
Minimization took 18446 ms.
[2024-05-22 20:07:03] [INFO ] [Real]Absence check using 90 positive place invariants in 173 ms returned sat
[2024-05-22 20:07:04] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 73 ms returned sat
[2024-05-22 20:07:19] [INFO ] [Real]Absence check using state equation in 15010 ms returned sat
[2024-05-22 20:07:25] [INFO ] [Real]Added 40200 Read/Feed constraints in 5454 ms returned sat
[2024-05-22 20:07:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 20:07:27] [INFO ] [Nat]Absence check using 90 positive place invariants in 176 ms returned sat
[2024-05-22 20:07:27] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 78 ms returned sat
[2024-05-22 20:07:44] [INFO ] [Nat]Absence check using state equation in 17324 ms returned sat
[2024-05-22 20:07:50] [INFO ] [Nat]Added 40200 Read/Feed constraints in 6193 ms returned sat
[2024-05-22 20:07:53] [INFO ] Computed and/alt/rep : 31873/87549/31866 causal constraints (skipped 8544 transitions) in 2388 ms.
Minimization took 17156 ms.
[2024-05-22 20:08:12] [INFO ] [Real]Absence check using 90 positive place invariants in 180 ms returned sat
[2024-05-22 20:08:12] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 85 ms returned sat
[2024-05-22 20:08:28] [INFO ] [Real]Absence check using state equation in 16707 ms returned sat
[2024-05-22 20:08:36] [INFO ] [Real]Added 40200 Read/Feed constraints in 6430 ms returned sat
[2024-05-22 20:08:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 20:08:38] [INFO ] [Nat]Absence check using 90 positive place invariants in 179 ms returned sat
[2024-05-22 20:08:38] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 72 ms returned sat
[2024-05-22 20:08:56] [INFO ] [Nat]Absence check using state equation in 17934 ms returned sat
[2024-05-22 20:09:02] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 20:09:03] [INFO ] [Nat]Added 40200 Read/Feed constraints in 6886 ms returned sat
[2024-05-22 20:09:06] [INFO ] Computed and/alt/rep : 31873/87549/31866 causal constraints (skipped 8544 transitions) in 2266 ms.
Minimization took 15980 ms.
[2024-05-22 20:09:23] [INFO ] [Real]Absence check using 90 positive place invariants in 177 ms returned sat
[2024-05-22 20:09:23] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 79 ms returned sat
[2024-05-22 20:09:39] [INFO ] [Real]Absence check using state equation in 16219 ms returned sat
[2024-05-22 20:09:46] [INFO ] [Real]Added 40200 Read/Feed constraints in 6214 ms returned sat
[2024-05-22 20:09:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 20:09:48] [INFO ] [Nat]Absence check using 90 positive place invariants in 182 ms returned sat
[2024-05-22 20:09:48] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 77 ms returned sat
[2024-05-22 20:10:06] [INFO ] [Nat]Absence check using state equation in 17727 ms returned sat
[2024-05-22 20:10:12] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 20:10:13] [INFO ] [Nat]Added 40200 Read/Feed constraints in 7802 ms returned sat
[2024-05-22 20:10:17] [INFO ] Computed and/alt/rep : 31873/87549/31866 causal constraints (skipped 8544 transitions) in 2222 ms.
Minimization took 15329 ms.
[2024-05-22 20:10:33] [INFO ] [Real]Absence check using 90 positive place invariants in 180 ms returned sat
[2024-05-22 20:10:33] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 80 ms returned sat
[2024-05-22 20:10:50] [INFO ] [Real]Absence check using state equation in 16459 ms returned sat
[2024-05-22 20:10:57] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 20:10:57] [INFO ] [Real]Added 40200 Read/Feed constraints in 6731 ms returned sat
[2024-05-22 20:10:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 20:10:59] [INFO ] [Nat]Absence check using 90 positive place invariants in 189 ms returned sat
[2024-05-22 20:10:59] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 80 ms returned sat
[2024-05-22 20:11:19] [INFO ] [Nat]Absence check using state equation in 19307 ms returned sat
[2024-05-22 20:11:25] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 20:11:26] [INFO ] [Nat]Added 40200 Read/Feed constraints in 7810 ms returned sat
[2024-05-22 20:11:29] [INFO ] Computed and/alt/rep : 31873/87549/31866 causal constraints (skipped 8544 transitions) in 2087 ms.
Minimization took 13790 ms.
[2024-05-22 20:11:44] [INFO ] [Real]Absence check using 90 positive place invariants in 184 ms returned sat
[2024-05-22 20:11:44] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 83 ms returned sat
[2024-05-22 20:12:03] [INFO ] [Real]Absence check using state equation in 18782 ms returned sat
[2024-05-22 20:12:10] [INFO ] [Real]Added 40200 Read/Feed constraints in 5850 ms returned sat
[2024-05-22 20:12:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 20:12:12] [INFO ] [Nat]Absence check using 90 positive place invariants in 190 ms returned sat
[2024-05-22 20:12:12] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 78 ms returned sat
[2024-05-22 20:12:30] [INFO ] [Nat]Absence check using state equation in 17973 ms returned sat
[2024-05-22 20:12:36] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 20:12:41] [INFO ] [Nat]Added 40200 Read/Feed constraints in 10988 ms returned unknown
[2024-05-22 20:12:42] [INFO ] [Real]Absence check using 90 positive place invariants in 178 ms returned sat
[2024-05-22 20:12:42] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 77 ms returned sat
[2024-05-22 20:13:00] [INFO ] [Real]Absence check using state equation in 17653 ms returned sat
[2024-05-22 20:13:06] [INFO ] [Real]Added 40200 Read/Feed constraints in 5675 ms returned sat
[2024-05-22 20:13:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 20:13:08] [INFO ] [Nat]Absence check using 90 positive place invariants in 191 ms returned sat
[2024-05-22 20:13:08] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 80 ms returned sat
[2024-05-22 20:13:27] [INFO ] [Nat]Absence check using state equation in 18753 ms returned sat
[2024-05-22 20:13:33] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 20:13:35] [INFO ] [Nat]Added 40200 Read/Feed constraints in 8026 ms returned sat
[2024-05-22 20:13:38] [INFO ] Computed and/alt/rep : 31873/87549/31866 causal constraints (skipped 8544 transitions) in 2311 ms.
Minimization took 13840 ms.
[2024-05-22 20:13:53] [INFO ] [Real]Absence check using 90 positive place invariants in 178 ms returned sat
[2024-05-22 20:13:53] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 80 ms returned sat
[2024-05-22 20:14:10] [INFO ] [Real]Absence check using state equation in 16558 ms returned sat
[2024-05-22 20:14:17] [INFO ] [Real]Added 40200 Read/Feed constraints in 6039 ms returned sat
[2024-05-22 20:14:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 20:14:18] [INFO ] [Nat]Absence check using 90 positive place invariants in 185 ms returned sat
[2024-05-22 20:14:19] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 77 ms returned sat
[2024-05-22 20:14:36] [INFO ] [Nat]Absence check using state equation in 16996 ms returned sat
[2024-05-22 20:14:42] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 20:14:42] [INFO ] [Nat]Added 40200 Read/Feed constraints in 6850 ms returned sat
[2024-05-22 20:14:46] [INFO ] Computed and/alt/rep : 31873/87549/31866 causal constraints (skipped 8544 transitions) in 2301 ms.
Minimization took 16871 ms.
[2024-05-22 20:15:04] [INFO ] [Real]Absence check using 90 positive place invariants in 186 ms returned sat
[2024-05-22 20:15:04] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 85 ms returned sat
[2024-05-22 20:15:22] [INFO ] [Real]Absence check using state equation in 18369 ms returned sat
[2024-05-22 20:15:29] [INFO ] [Real]Added 40200 Read/Feed constraints in 6119 ms returned sat
[2024-05-22 20:15:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 20:15:31] [INFO ] [Nat]Absence check using 90 positive place invariants in 177 ms returned sat
[2024-05-22 20:15:31] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 73 ms returned sat
[2024-05-22 20:15:48] [INFO ] [Nat]Absence check using state equation in 16865 ms returned sat
[2024-05-22 20:15:54] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 20:15:55] [INFO ] [Nat]Added 40200 Read/Feed constraints in 7056 ms returned sat
[2024-05-22 20:15:58] [INFO ] Computed and/alt/rep : 31873/87549/31866 causal constraints (skipped 8544 transitions) in 2350 ms.
Minimization took 16731 ms.
[2024-05-22 20:16:16] [INFO ] [Real]Absence check using 90 positive place invariants in 180 ms returned sat
[2024-05-22 20:16:16] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 80 ms returned sat
[2024-05-22 20:16:32] [INFO ] [Real]Absence check using state equation in 15454 ms returned sat
[2024-05-22 20:16:38] [INFO ] [Real]Added 40200 Read/Feed constraints in 5883 ms returned sat
[2024-05-22 20:16:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 20:16:40] [INFO ] [Nat]Absence check using 90 positive place invariants in 183 ms returned sat
[2024-05-22 20:16:40] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 77 ms returned sat
[2024-05-22 20:16:58] [INFO ] [Nat]Absence check using state equation in 17344 ms returned sat
[2024-05-22 20:17:04] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 20:17:04] [INFO ] [Nat]Added 40200 Read/Feed constraints in 6692 ms returned sat
[2024-05-22 20:17:07] [INFO ] Computed and/alt/rep : 31873/87549/31866 causal constraints (skipped 8544 transitions) in 2192 ms.
Minimization took 16886 ms.
[2024-05-22 20:17:25] [INFO ] [Real]Absence check using 90 positive place invariants in 175 ms returned sat
[2024-05-22 20:17:25] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 77 ms returned sat
[2024-05-22 20:17:44] [INFO ] [Real]Absence check using state equation in 18942 ms returned sat
[2024-05-22 20:17:51] [INFO ] [Real]Added 40200 Read/Feed constraints in 5674 ms returned sat
[2024-05-22 20:17:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 20:17:53] [INFO ] [Nat]Absence check using 90 positive place invariants in 186 ms returned sat
[2024-05-22 20:17:53] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 75 ms returned sat
[2024-05-22 20:18:12] [INFO ] [Nat]Absence check using state equation in 19006 ms returned sat
[2024-05-22 20:18:18] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 20:18:19] [INFO ] [Nat]Added 40200 Read/Feed constraints in 7216 ms returned sat
[2024-05-22 20:18:22] [INFO ] Computed and/alt/rep : 31873/87549/31866 causal constraints (skipped 8544 transitions) in 2388 ms.
Minimization took 14496 ms.
[2024-05-22 20:18:38] [INFO ] [Real]Absence check using 90 positive place invariants in 181 ms returned sat
[2024-05-22 20:18:38] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 81 ms returned sat
[2024-05-22 20:18:56] [INFO ] [Real]Absence check using state equation in 17839 ms returned sat
[2024-05-22 20:19:02] [INFO ] [Real]Added 40200 Read/Feed constraints in 5688 ms returned sat
[2024-05-22 20:19:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 20:19:04] [INFO ] [Nat]Absence check using 90 positive place invariants in 173 ms returned sat
[2024-05-22 20:19:04] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 73 ms returned sat
[2024-05-22 20:19:23] [INFO ] [Nat]Absence check using state equation in 18282 ms returned sat
[2024-05-22 20:19:29] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 20:19:29] [INFO ] [Nat]Added 40200 Read/Feed constraints in 6935 ms returned sat
[2024-05-22 20:19:33] [INFO ] Computed and/alt/rep : 31873/87549/31866 causal constraints (skipped 8544 transitions) in 2315 ms.
Minimization took 15611 ms.
[2024-05-22 20:19:49] [INFO ] [Real]Absence check using 90 positive place invariants in 189 ms returned sat
[2024-05-22 20:19:50] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 86 ms returned sat
[2024-05-22 20:20:10] [INFO ] [Real]Absence check using state equation in 20449 ms returned sat
[2024-05-22 20:20:16] [INFO ] [Real]Added 40200 Read/Feed constraints in 5546 ms returned sat
[2024-05-22 20:20:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 20:20:18] [INFO ] [Nat]Absence check using 90 positive place invariants in 187 ms returned sat
[2024-05-22 20:20:18] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 81 ms returned sat
[2024-05-22 20:20:39] [INFO ] [Nat]Absence check using state equation in 20181 ms returned sat
[2024-05-22 20:20:45] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 20:20:46] [INFO ] [Nat]Added 40200 Read/Feed constraints in 7178 ms returned sat
[2024-05-22 20:20:49] [INFO ] Computed and/alt/rep : 31873/87549/31866 causal constraints (skipped 8544 transitions) in 2456 ms.
Minimization took 13164 ms.
[2024-05-22 20:21:03] [INFO ] [Real]Absence check using 90 positive place invariants in 179 ms returned sat
[2024-05-22 20:21:03] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 84 ms returned sat
[2024-05-22 20:21:22] [INFO ] [Real]Absence check using state equation in 19027 ms returned sat
[2024-05-22 20:21:29] [INFO ] [Real]Added 40200 Read/Feed constraints in 6027 ms returned sat
[2024-05-22 20:21:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 20:21:31] [INFO ] [Nat]Absence check using 90 positive place invariants in 184 ms returned sat
[2024-05-22 20:21:31] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 79 ms returned sat
[2024-05-22 20:21:53] [INFO ] [Nat]Absence check using state equation in 21227 ms returned sat
[2024-05-22 20:21:59] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 20:21:59] [INFO ] [Nat]Added 40200 Read/Feed constraints in 6842 ms returned sat
[2024-05-22 20:22:03] [INFO ] Computed and/alt/rep : 31873/87549/31866 causal constraints (skipped 8544 transitions) in 2168 ms.
Minimization took 12790 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90]
Support contains 15 out of 8650 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8650/8650 places, 40507/40507 transitions.
Applied a total of 0 rules in 3328 ms. Remains 8650 /8650 variables (removed 0) and now considering 40507/40507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3329 ms. Remains : 8650/8650 places, 40507/40507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8650/8650 places, 40507/40507 transitions.
Applied a total of 0 rules in 3360 ms. Remains 8650 /8650 variables (removed 0) and now considering 40507/40507 (removed 0) transitions.
[2024-05-22 20:22:22] [INFO ] Flow matrix only has 40500 transitions (discarded 7 similar events)
[2024-05-22 20:22:22] [INFO ] Invariant cache hit.
[2024-05-22 20:22:48] [INFO ] Implicit Places using invariants in 26145 ms returned []
Implicit Place search using SMT only with invariants took 26150 ms to find 0 implicit places.
Running 40417 sub problems to find dead transitions.
[2024-05-22 20:22:49] [INFO ] Flow matrix only has 40500 transitions (discarded 7 similar events)
[2024-05-22 20:22:49] [INFO ] Invariant cache hit.
[2024-05-22 20:22:49] [INFO ] State equation strengthened by 40200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8649 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 40417 unsolved
SMT process timed out in 225912ms, After SMT, problems are : Problem set: 0 solved, 40417 unsolved
Search for dead transitions found 0 dead transitions in 226374ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 256051 ms. Remains : 8650/8650 places, 40507/40507 transitions.
[2024-05-22 20:26:35] [INFO ] Flow matrix only has 40500 transitions (discarded 7 similar events)
[2024-05-22 20:26:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90]
RANDOM walk for 811843 steps (1500 resets) in 30001 ms. (27 steps per ms)
BEST_FIRST walk for 15000015 steps (222 resets) in 33659 ms. (445 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90]
[2024-05-22 20:27:39] [INFO ] Flow matrix only has 40500 transitions (discarded 7 similar events)
[2024-05-22 20:27:39] [INFO ] Invariant cache hit.
[2024-05-22 20:27:40] [INFO ] [Real]Absence check using 90 positive place invariants in 174 ms returned sat
[2024-05-22 20:27:40] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 73 ms returned sat
[2024-05-22 20:27:55] [INFO ] [Real]Absence check using state equation in 15677 ms returned sat
[2024-05-22 20:27:56] [INFO ] State equation strengthened by 40200 read => feed constraints.
[2024-05-22 20:28:02] [INFO ] [Real]Added 40200 Read/Feed constraints in 5665 ms returned sat
[2024-05-22 20:28:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 20:28:04] [INFO ] [Nat]Absence check using 90 positive place invariants in 176 ms returned sat
[2024-05-22 20:28:04] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 73 ms returned sat
[2024-05-22 20:28:19] [INFO ] [Nat]Absence check using state equation in 15571 ms returned sat
[2024-05-22 20:28:26] [INFO ] [Nat]Added 40200 Read/Feed constraints in 6110 ms returned sat
[2024-05-22 20:28:28] [INFO ] Computed and/alt/rep : 31873/87549/31866 causal constraints (skipped 8544 transitions) in 1977 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running CANInsertWithFailure-PT-090
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 17284
TRANSITIONS: 49140
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 1.225s, Sys 0.123s]
SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.238s, Sys 0.006s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 744
MODEL NAME: /home/mcc/execution/model
17284 places, 49140 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------
BK_STOP 1716410979123
--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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="CANInsertWithFailure-PT-090"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is CANInsertWithFailure-PT-090, 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 r069-tall-171620503900165"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-090.tgz
mv CANInsertWithFailure-PT-090 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 '
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 ;