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.r295-tall-167873947500173.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Philosophers-COL-050000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873947500173
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 5.8K Feb 25 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 13:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 13:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 13:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 13:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 13:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 13:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:33 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 2.3M 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 Philosophers-COL-050000-UpperBounds-00
FORMULA_NAME Philosophers-COL-050000-UpperBounds-01
FORMULA_NAME Philosophers-COL-050000-UpperBounds-02
FORMULA_NAME Philosophers-COL-050000-UpperBounds-03
FORMULA_NAME Philosophers-COL-050000-UpperBounds-04
FORMULA_NAME Philosophers-COL-050000-UpperBounds-05
FORMULA_NAME Philosophers-COL-050000-UpperBounds-06
FORMULA_NAME Philosophers-COL-050000-UpperBounds-07
FORMULA_NAME Philosophers-COL-050000-UpperBounds-08
FORMULA_NAME Philosophers-COL-050000-UpperBounds-09
FORMULA_NAME Philosophers-COL-050000-UpperBounds-10
FORMULA_NAME Philosophers-COL-050000-UpperBounds-11
FORMULA_NAME Philosophers-COL-050000-UpperBounds-12
FORMULA_NAME Philosophers-COL-050000-UpperBounds-13
FORMULA_NAME Philosophers-COL-050000-UpperBounds-14
FORMULA_NAME Philosophers-COL-050000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678797730055

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-050000
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 12:42:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-14 12:42:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 12:42:11] [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-14 12:42:12] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 12:42:12] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 926 ms
[2023-03-14 12:42:12] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 250000 PT places and 250000.0 transition bindings in 34 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
[2023-03-14 12:42:12] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 4 ms.
[2023-03-14 12:42:12] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 5 rows 5 cols
[2023-03-14 12:42:12] [INFO ] Computed 2 place invariants in 4 ms
FORMULA Philosophers-COL-050000-UpperBounds-15 50000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-050000-UpperBounds-13 50000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-050000-UpperBounds-10 50000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-050000-UpperBounds-09 50000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-050000-UpperBounds-08 50000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-050000-UpperBounds-06 50000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-050000-UpperBounds-00 50000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-14 12:42:12] [INFO ] Invariant cache hit.
[2023-03-14 12:42:12] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-14 12:42:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:42:12] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-14 12:42:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 12:42:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-14 12:42:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 12:42:12] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-14 12:42:12] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-14 12:42:12] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2023-03-14 12:42:12] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 12:42:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:42:12] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-14 12:42:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 12:42:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-14 12:42:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 12:42:12] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-14 12:42:12] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-14 12:42:12] [INFO ] Added : 0 causal constraints over 0 iterations in 18 ms. Result :sat
Minimization took 2 ms.
[2023-03-14 12:42:12] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 12:42:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:42:12] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-14 12:42:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 12:42:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 12:42:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 12:42:12] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-14 12:42:12] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 12:42:12] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2023-03-14 12:42:12] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 12:42:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:42:12] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-14 12:42:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 12:42:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 12:42:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 12:42:13] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-14 12:42:13] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 12:42:13] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2023-03-14 12:42:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 12:42:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:42:13] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-14 12:42:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 12:42:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-14 12:42:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 12:42:13] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-14 12:42:13] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-14 12:42:13] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 2 ms.
[2023-03-14 12:42:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 12:42:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:42:13] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-14 12:42:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 12:42:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 12:42:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 12:42:13] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-14 12:42:13] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-14 12:42:13] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2023-03-14 12:42:13] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-14 12:42:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:42:13] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-14 12:42:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 12:42:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 12:42:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 12:42:13] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-14 12:42:13] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-14 12:42:13] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 7 ms.
[2023-03-14 12:42:13] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-14 12:42:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:42:13] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-14 12:42:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 12:42:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 12:42:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 12:42:13] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-14 12:42:13] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 12:42:13] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2023-03-14 12:42:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 12:42:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:42:13] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-14 12:42:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 12:42:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 12:42:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 12:42:13] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-14 12:42:13] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 12:42:13] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [50000, 50000, 50000, 50000, 50000, 25000, 50000, 25000, 50000]
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 50000) 50000) 50000)]] contains successor/predecessor on variables of sort Philo
[2023-03-14 12:42:14] [INFO ] Unfolded HLPN to a Petri net with 250000 places and 250000 transitions 800000 arcs in 1271 ms.
[2023-03-14 12:42:14] [INFO ] Unfolded 9 HLPN properties in 30 ms.
Finished random walk after 786 steps, including 0 resets, run visited all 9 properties in 30039 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7893 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7727 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7337 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7161 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6889 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6993 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6925 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7013 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6915 ms. (steps per millisecond=0 ) properties seen 3
// Phase 1: matrix 250000 rows 250000 cols
[2023-03-14 12:43:52] [INFO ] Computed 100000 place invariants in 1138 ms
[2023-03-14 12:43: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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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-14 12:44:02] [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-14 12:44:07] [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 2
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: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-14 12:44:12] [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: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-14 12:44:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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-14 12:44: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 5
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: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-14 12:44:27] [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 6
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: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-14 12:44:32] [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 7
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-14 12:44: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 8
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) : [50000, 50000, 50000, 50000, 50000, 25000, 50000, 25000, 50000] Max seen :[381, 381, 381, 400, 400, 2, 400, 2, 400]
Support contains 150000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 2249 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2271 ms. Remains : 250000/250000 places, 250000/250000 transitions.
[2023-03-14 12:44:40] [INFO ] Invariant cache hit.
Finished random walk after 794 steps, including 0 resets, run visited all 9 properties in 30034 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7044 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6953 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6988 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6948 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6977 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7004 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6970 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6934 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6958 ms. (steps per millisecond=0 ) properties seen 3
[2023-03-14 12:46:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [50000, 50000, 50000, 50000, 50000, 25000, 50000, 25000, 50000] Max seen :[402, 402, 402, 400, 400, 2, 400, 2, 400]
Support contains 150000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1216 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1217 ms. Remains : 250000/250000 places, 250000/250000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1190 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
[2023-03-14 12:53:01] [INFO ] Invariant cache hit.
[2023-03-14 12:53:19] [INFO ] Implicit Places using invariants in 18048 ms returned []
Implicit Place search using SMT only with invariants took 18049 ms to find 0 implicit places.
[2023-03-14 12:53:19] [INFO ] Invariant cache hit.
[2023-03-14 12:53:37] [INFO ] Dead Transitions using invariants and state equation in 17712 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36956 ms. Remains : 250000/250000 places, 250000/250000 transitions.
[2023-03-14 12:53:37] [INFO ] Invariant cache hit.
Finished random walk after 863 steps, including 0 resets, run visited all 9 properties in 30007 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6905 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7053 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7155 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6773 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6782 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6928 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6777 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6786 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6904 ms. (steps per millisecond=0 ) properties seen 3
[2023-03-14 12:55:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [50000, 50000, 50000, 50000, 50000, 25000, 50000, 25000, 50000] Max seen :[427, 427, 427, 427, 427, 4, 427, 4, 427]
Support contains 150000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1211 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1211 ms. Remains : 250000/250000 places, 250000/250000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1073 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
[2023-03-14 13:01:58] [INFO ] Invariant cache hit.
[2023-03-14 13:02:15] [INFO ] Implicit Places using invariants in 17001 ms returned []
Implicit Place search using SMT only with invariants took 17008 ms to find 0 implicit places.
[2023-03-14 13:02:15] [INFO ] Invariant cache hit.
[2023-03-14 13:02:32] [INFO ] Dead Transitions using invariants and state equation in 17216 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35301 ms. Remains : 250000/250000 places, 250000/250000 transitions.
[2023-03-14 13:02:32] [INFO ] Invariant cache hit.
Finished random walk after 993 steps, including 0 resets, run visited all 9 properties in 30029 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6869 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6936 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6931 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6892 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6912 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6913 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6920 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6917 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6947 ms. (steps per millisecond=0 ) properties seen 3
[2023-03-14 13:04:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [50000, 50000, 50000, 50000, 50000, 25000, 50000, 25000, 50000] Max seen :[499, 499, 499, 485, 485, 4, 485, 4, 485]
Support contains 150000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1296 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1296 ms. Remains : 250000/250000 places, 250000/250000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1359 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
[2023-03-14 13:10:53] [INFO ] Invariant cache hit.
[2023-03-14 13:11:10] [INFO ] Implicit Places using invariants in 17589 ms returned []
Implicit Place search using SMT only with invariants took 17590 ms to find 0 implicit places.
[2023-03-14 13:11:11] [INFO ] Invariant cache hit.
[2023-03-14 13:11:29] [INFO ] Dead Transitions using invariants and state equation in 18424 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37378 ms. Remains : 250000/250000 places, 250000/250000 transitions.
[2023-03-14 13:11:29] [INFO ] Invariant cache hit.
Finished random walk after 969 steps, including 0 resets, run visited all 9 properties in 30002 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7187 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7256 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7124 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7121 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7188 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7101 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7090 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7163 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7112 ms. (steps per millisecond=0 ) properties seen 3
[2023-03-14 13:13:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [50000, 50000, 50000, 50000, 50000, 25000, 50000, 25000, 50000] Max seen :[499, 499, 499, 486, 486, 4, 486, 4, 486]
Support contains 150000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1323 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1326 ms. Remains : 250000/250000 places, 250000/250000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1247 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
[2023-03-14 13:19:52] [INFO ] Invariant cache hit.
[2023-03-14 13:20:10] [INFO ] Implicit Places using invariants in 18572 ms returned []
Implicit Place search using SMT only with invariants took 18583 ms to find 0 implicit places.
[2023-03-14 13:20:11] [INFO ] Invariant cache hit.
[2023-03-14 13:20:31] [INFO ] Dead Transitions using invariants and state equation in 20087 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39923 ms. Remains : 250000/250000 places, 250000/250000 transitions.
[2023-03-14 13:20:31] [INFO ] Invariant cache hit.
Finished random walk after 905 steps, including 0 resets, run visited all 9 properties in 30022 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7215 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7310 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7196 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7187 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7227 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7127 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7348 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7030 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7298 ms. (steps per millisecond=0 ) properties seen 3
[2023-03-14 13:22:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [50000, 50000, 50000, 50000, 50000, 25000, 50000, 25000, 50000] Max seen :[499, 499, 499, 486, 486, 4, 486, 4, 486]
Support contains 150000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1365 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1365 ms. Remains : 250000/250000 places, 250000/250000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1337 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
[2023-03-14 13:28:55] [INFO ] Invariant cache hit.
[2023-03-14 13:29:13] [INFO ] Implicit Places using invariants in 18850 ms returned []
Implicit Place search using SMT only with invariants took 18851 ms to find 0 implicit places.
[2023-03-14 13:29:13] [INFO ] Invariant cache hit.
[2023-03-14 13:29:32] [INFO ] Dead Transitions using invariants and state equation in 18259 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38452 ms. Remains : 250000/250000 places, 250000/250000 transitions.
Starting property specific reduction for Philosophers-COL-050000-UpperBounds-01
[2023-03-14 13:29:32] [INFO ] Invariant cache hit.
Finished random walk after 1377 steps, including 0 resets, run visited all 1 properties in 30009 ms. (steps per millisecond=0 )
Finished Best-First random walk after 2001 steps, including 0 resets, run visited all 1 properties in 7228 ms. (steps per millisecond=0 )
[2023-03-14 13:30:10] [INFO ] Invariant cache hit.
[2023-03-14 13:30:15] [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 0
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:733)
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) : [50000] Max seen :[652]
Support contains 50000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Performed 6513 Post agglomeration using F-continuation condition.
Performed 13517 Post agglomeration using F-continuation condition.
Performed 20647 Post agglomeration using F-continuation condition.
Performed 27957 Post agglomeration using F-continuation condition.
Performed 35386 Post agglomeration using F-continuation condition.
Performed 42902 Post agglomeration using F-continuation condition.
Performed 50000 Post agglomeration using F-continuation condition.Transition count delta: 50000
Deduced a syphon composed of 50000 places in 55 ms
Reduce places removed 50000 places and 0 transitions.
Iterating global reduction 0 with 100000 rules applied. Total rules applied 100000 place count 200000 transition count 200000
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 6965160 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16103900 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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="Philosophers-COL-050000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is Philosophers-COL-050000, 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 r295-tall-167873947500173"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-050000.tgz
mv Philosophers-COL-050000 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;