About the Execution of LTSMin+red for SharedMemory-COL-001000
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r361-smll-167891811800605.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is SharedMemory-COL-001000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r361-smll-167891811800605
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.6K Feb 25 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 25 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 55K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-00
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-01
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-02
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-03
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-04
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-05
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-06
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-07
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-08
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-09
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-10
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-11
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-12
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-13
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-14
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679415063973
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SharedMemory-COL-001000
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 16:11:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-21 16:11:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 16:11:07] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-21 16:11:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-21 16:11:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 732 ms
[2023-03-21 16:11:08] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 1004001 PT places and 3002000.0 transition bindings in 83 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
[2023-03-21 16:11:08] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 16 arcs in 17 ms.
[2023-03-21 16:11:08] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 5 rows 6 cols
[2023-03-21 16:11:08] [INFO ] Computed 3 place invariants in 4 ms
FORMULA SharedMemory-COL-001000-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-001000-UpperBounds-13 1000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-001000-UpperBounds-11 1000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-001000-UpperBounds-04 1000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-001000-UpperBounds-03 1000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-001000-UpperBounds-02 1000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-001000-UpperBounds-01 1000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-21 16:11:08] [INFO ] Invariant cache hit.
[2023-03-21 16:11:08] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-21 16:11:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:11:08] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-21 16:11:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:11:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-21 16:11:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:11:08] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-21 16:11:08] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-21 16:11:08] [INFO ] Added : 1 causal constraints over 1 iterations in 25 ms. Result :sat
Minimization took 10 ms.
[2023-03-21 16:11:08] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-21 16:11:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:11:08] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-21 16:11:08] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-21 16:11:08] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 6 ms.
[2023-03-21 16:11:08] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-21 16:11:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:11:08] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-21 16:11:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:11:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-21 16:11:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:11:09] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-21 16:11:09] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-21 16:11:09] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 3 ms.
[2023-03-21 16:11:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-21 16:11:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:11:09] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-21 16:11:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:11:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-21 16:11:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:11:09] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-21 16:11:09] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-21 16:11:09] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2023-03-21 16:11:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-21 16:11:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:11:09] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-21 16:11:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:11:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-21 16:11:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:11:09] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-21 16:11:09] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-21 16:11:09] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2023-03-21 16:11:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-21 16:11:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:11:09] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-21 16:11:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:11:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-21 16:11:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:11:09] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-21 16:11:09] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-21 16:11:09] [INFO ] Added : 1 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 6 ms.
[2023-03-21 16:11:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-21 16:11:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:11:09] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-21 16:11:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:11:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-21 16:11:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:11:09] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-21 16:11:09] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-21 16:11:09] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2023-03-21 16:11:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-21 16:11:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:11:09] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-21 16:11:09] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-21 16:11:09] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 5 ms.
[2023-03-21 16:11:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-21 16:11:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:11:09] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-21 16:11:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:11:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-21 16:11:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:11:09] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-21 16:11:09] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-21 16:11:09] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [1, 1000, 1, 1000, 1000, 1, 1, 1000, 1000]
Domain [P(1000), P(1000)] of place Ext_Mem_Acc breaks symmetries in sort P
[2023-03-21 16:11:17] [INFO ] Unfolded HLPN to a Petri net with 1004001 places and 2002000 transitions 8004000 arcs in 7486 ms.
[2023-03-21 16:11:17] [INFO ] Unfolded 9 HLPN properties in 391 ms.
Deduced a syphon composed of 1000 places in 1081 ms
Reduce places removed 1000 places and 1000 transitions.
Finished random walk after 240 steps, including 0 resets, run visited all 9 properties in 30009 ms. (steps per millisecond=0 )
FORMULA SharedMemory-COL-001000-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-COL-001000-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-COL-001000-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-COL-001000-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1036 ms. (steps per millisecond=9 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 810 ms. (steps per millisecond=12 ) properties (out of 5) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 783 ms. (steps per millisecond=12 ) properties (out of 5) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 771 ms. (steps per millisecond=12 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 789 ms. (steps per millisecond=12 ) properties (out of 5) seen :6
// Phase 1: matrix 2001000 rows 1003001 cols
[2023-03-21 16:14:21] [WARNING] Invariant computation timed out after 120 seconds.
[2023-03-21 16:14:26] [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 0
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 16:14:31] [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 1
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 16:14:36] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 16:14:41] [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 3
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 16:14:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000, 1000, 1000] Max seen :[102, 123, 123, 102, 123]
Support contains 2000 out of 1003001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003001/1003001 places, 2001000/2001000 transitions.
Performed 429 Post agglomeration using F-continuation condition.
Performed 996 Post agglomeration using F-continuation condition.
Performed 1480 Post agglomeration using F-continuation condition.
Performed 2049 Post agglomeration using F-continuation condition.
Performed 2549 Post agglomeration using F-continuation condition.
Performed 3108 Post agglomeration using F-continuation condition.
Performed 3613 Post agglomeration using F-continuation condition.
Performed 4161 Post agglomeration using F-continuation condition.
Performed 4689 Post agglomeration using F-continuation condition.
Performed 5228 Post agglomeration using F-continuation condition.
Performed 5765 Post agglomeration using F-continuation condition.
Performed 6302 Post agglomeration using F-continuation condition.
Performed 6854 Post agglomeration using F-continuation condition.
Performed 7385 Post agglomeration using F-continuation condition.
Performed 7965 Post agglomeration using F-continuation condition.
Performed 8474 Post agglomeration using F-continuation condition.
Performed 9041 Post agglomeration using F-continuation condition.
Performed 9563 Post agglomeration using F-continuation condition.
Performed 10136 Post agglomeration using F-continuation condition.
Performed 10663 Post agglomeration using F-continuation condition.
Performed 11224 Post agglomeration using F-continuation condition.
Performed 11781 Post agglomeration using F-continuation condition.
Performed 12315 Post agglomeration using F-continuation condition.
Performed 12886 Post agglomeration using F-continuation condition.
Performed 13407 Post agglomeration using F-continuation condition.
Performed 14000 Post agglomeration using F-continuation condition.
Performed 14518 Post agglomeration using F-continuation condition.
Performed 15093 Post agglomeration using F-continuation condition.
Performed 15609 Post agglomeration using F-continuation condition.
Performed 16171 Post agglomeration using F-continuation condition.
Performed 16719 Post agglomeration using F-continuation condition.
Performed 17268 Post agglomeration using F-continuation condition.
Performed 17829 Post agglomeration using F-continuation condition.
Performed 18365 Post agglomeration using F-continuation condition.
Performed 18958 Post agglomeration using F-continuation condition.
Performed 19471 Post agglomeration using F-continuation condition.
Performed 20058 Post agglomeration using F-continuation condition.
Performed 20591 Post agglomeration using F-continuation condition.
Performed 21155 Post agglomeration using F-continuation condition.
Performed 21714 Post agglomeration using F-continuation condition.
Performed 22272 Post agglomeration using F-continuation condition.
Performed 22856 Post agglomeration using F-continuation condition.
Performed 23389 Post agglomeration using F-continuation condition.
Performed 23977 Post agglomeration using F-continuation condition.
Performed 24494 Post agglomeration using F-continuation condition.
Performed 25076 Post agglomeration using F-continuation condition.
Performed 25621 Post agglomeration using F-continuation condition.
Performed 26182 Post agglomeration using F-continuation condition.
Performed 26731 Post agglomeration using F-continuation condition.
Performed 27270 Post agglomeration using F-continuation condition.
Performed 27843 Post agglomeration using F-continuation condition.
Performed 28380 Post agglomeration using F-continuation condition.
Performed 28994 Post agglomeration using F-continuation condition.
Performed 29524 Post agglomeration using F-continuation condition.
Performed 30116 Post agglomeration using F-continuation condition.
Performed 30656 Post agglomeration using F-continuation condition.
Performed 31222 Post agglomeration using F-continuation condition.
Performed 31809 Post agglomeration using F-continuation condition.
Performed 32365 Post agglomeration using F-continuation condition.
Performed 32973 Post agglomeration using F-continuation condition.
Performed 33500 Post agglomeration using F-continuation condition.
Performed 34088 Post agglomeration using F-continuation condition.
Performed 34629 Post agglomeration using F-continuation condition.
Performed 35203 Post agglomeration using F-continuation condition.
Performed 35783 Post agglomeration using F-continuation condition.
Performed 36337 Post agglomeration using F-continuation condition.
Performed 36945 Post agglomeration using F-continuation condition.
Performed 37468 Post agglomeration using F-continuation condition.
Performed 38054 Post agglomeration using F-continuation condition.
Performed 38605 Post agglomeration using F-continuation condition.
Performed 39177 Post agglomeration using F-continuation condition.
Performed 39744 Post agglomeration using F-continuation condition.
Performed 40304 Post agglomeration using F-continuation condition.
Performed 40897 Post agglomeration using F-continuation condition.
Performed 41432 Post agglomeration using F-continuation condition.
Performed 42033 Post agglomeration using F-continuation condition.
Performed 42568 Post agglomeration using F-continuation condition.
Performed 43142 Post agglomeration using F-continuation condition.
Performed 43692 Post agglomeration using F-continuation condition.
Performed 44240 Post agglomeration using F-continuation condition.
Performed 44819 Post agglomeration using F-continuation condition.
Performed 45356 Post agglomeration using F-continuation condition.
Performed 45944 Post agglomeration using F-continuation condition.
Performed 46464 Post agglomeration using F-continuation condition.
Performed 47029 Post agglomeration using F-continuation condition.
Performed 47551 Post agglomeration using F-continuation condition.
Performed 48116 Post agglomeration using F-continuation condition.
Performed 48667 Post agglomeration using F-continuation condition.
Performed 49223 Post agglomeration using F-continuation condition.
Performed 49794 Post agglomeration using F-continuation condition.
Performed 50338 Post agglomeration using F-continuation condition.
Performed 50942 Post agglomeration using F-continuation condition.
Performed 51458 Post agglomeration using F-continuation condition.
Performed 52033 Post agglomeration using F-continuation condition.
Performed 52533 Post agglomeration using F-continuation condition.
Performed 53091 Post agglomeration using F-continuation condition.
Performed 53641 Post agglomeration using F-continuation condition.
Performed 54212 Post agglomeration using F-continuation condition.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 1213536 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16102316 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SharedMemory-COL-001000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is SharedMemory-COL-001000, 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 r361-smll-167891811800605"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SharedMemory-COL-001000.tgz
mv SharedMemory-COL-001000 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 ;