About the Execution of 2022-gold for Philosophers-COL-050000
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.r319-tall-167873969800022.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 gold2022
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 r319-tall-167873969800022
=====================================================================
--------------------
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 1678866341417
Running Version 202205111006
[2023-03-15 07:45:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 07:45:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 07:45:42] [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-15 07:45:43] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 07:45:43] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1291 ms
[2023-03-15 07:45:44] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 250000 PT places and 250000.0 transition bindings in 44 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-15 07:45:44] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 8 ms.
[2023-03-15 07:45:44] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 5 rows 5 cols
[2023-03-15 07:45:44] [INFO ] Computed 2 place invariants in 5 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
// Phase 1: matrix 5 rows 5 cols
[2023-03-15 07:45:44] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-15 07:45:44] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 07:45:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:44] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-15 07:45:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:44] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-15 07:45:44] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-15 07:45:44] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2023-03-15 07:45:44] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:44] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-15 07:45:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:44] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-15 07:45:44] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-15 07:45:44] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Minimization took 2 ms.
[2023-03-15 07:45:44] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:44] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-15 07:45:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:44] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-15 07:45:44] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-15 07:45:44] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Minimization took 4 ms.
[2023-03-15 07:45:44] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 07:45:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:44] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-15 07:45:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 07:45:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:44] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-15 07:45:44] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-15 07:45:44] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2023-03-15 07:45:44] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:44] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-15 07:45:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:44] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-15 07:45:44] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-15 07:45:44] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 1 ms.
[2023-03-15 07:45:44] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:44] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-15 07:45:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:44] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-15 07:45:44] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-15 07:45:44] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2023-03-15 07:45:44] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:44] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-15 07:45:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-15 07:45:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:44] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-15 07:45:44] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-15 07:45:44] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2023-03-15 07:45:44] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-15 07:45:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:44] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-15 07:45:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-15 07:45:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:44] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-15 07:45:44] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-15 07:45:44] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 4 ms.
[2023-03-15 07:45:44] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:44] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-15 07:45:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 07:45:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:44] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-15 07:45:44] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-15 07:45:44] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 5 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-15 07:45:46] [INFO ] Unfolded HLPN to a Petri net with 250000 places and 250000 transitions 800000 arcs in 1362 ms.
[2023-03-15 07:45:46] [INFO ] Unfolded 9 HLPN properties in 24 ms.
Finished random walk after 831 steps, including 0 resets, run visited all 9 properties in 30001 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6322 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6460 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6976 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8216 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8277 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8113 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8090 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8035 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8218 ms. (steps per millisecond=0 ) properties seen 3
// Phase 1: matrix 250000 rows 250000 cols
[2023-03-15 07:47:27] [INFO ] Computed 100000 place invariants in 1119 ms
[2023-03-15 07:47: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 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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-15 07:47:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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-15 07:47:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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-15 07:47:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 3
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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-15 07:47:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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-15 07:47: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: Broken pipe ... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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-15 07:48:02] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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-15 07:48:07] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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-15 07:48:12] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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 :[371, 371, 371, 455, 455, 2, 455, 2, 455]
Support contains 150000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 2178 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 250000/250000 places, 250000/250000 transitions.
// Phase 1: matrix 250000 rows 250000 cols
[2023-03-15 07:48:16] [INFO ] Computed 100000 place invariants in 1183 ms
Finished random walk after 843 steps, including 0 resets, run visited all 9 properties in 30023 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7961 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8158 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8158 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8246 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8140 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8092 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8110 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8204 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8249 ms. (steps per millisecond=0 ) properties seen 3
// Phase 1: matrix 250000 rows 250000 cols
[2023-03-15 07:50:02] [INFO ] Computed 100000 place invariants in 1093 ms
Current structural bounds on expressions (after SMT) : [50000, 50000, 50000, 50000, 50000, 25000, 50000, 25000, 50000] Max seen :[437, 437, 437, 455, 455, 4, 455, 4, 455]
Support contains 150000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1716 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 250000/250000 places, 250000/250000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1844 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
// Phase 1: matrix 250000 rows 250000 cols
[2023-03-15 07:56:51] [INFO ] Computed 100000 place invariants in 840 ms
[2023-03-15 07:57:12] [INFO ] Implicit Places using invariants in 21301 ms returned []
Implicit Place search using SMT only with invariants took 21305 ms to find 0 implicit places.
// Phase 1: matrix 250000 rows 250000 cols
[2023-03-15 07:57:13] [INFO ] Computed 100000 place invariants in 751 ms
[2023-03-15 07:57:30] [INFO ] Dead Transitions using invariants and state equation in 18585 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250000/250000 places, 250000/250000 transitions.
// Phase 1: matrix 250000 rows 250000 cols
[2023-03-15 07:57:32] [INFO ] Computed 100000 place invariants in 821 ms
Finished random walk after 885 steps, including 0 resets, run visited all 9 properties in 30005 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8093 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8116 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8101 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8125 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8058 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8176 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8039 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8092 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8043 ms. (steps per millisecond=0 ) properties seen 3
// Phase 1: matrix 250000 rows 250000 cols
[2023-03-15 07:59:16] [INFO ] Computed 100000 place invariants in 1190 ms
Current structural bounds on expressions (after SMT) : [50000, 50000, 50000, 50000, 50000, 25000, 50000, 25000, 50000] Max seen :[437, 437, 437, 460, 460, 4, 460, 4, 460]
Support contains 150000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1311 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 250000/250000 places, 250000/250000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1522 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
// Phase 1: matrix 250000 rows 250000 cols
[2023-03-15 08:06:05] [INFO ] Computed 100000 place invariants in 869 ms
[2023-03-15 08:06:26] [INFO ] Implicit Places using invariants in 21350 ms returned []
Implicit Place search using SMT only with invariants took 21352 ms to find 0 implicit places.
// Phase 1: matrix 250000 rows 250000 cols
[2023-03-15 08:06:27] [INFO ] Computed 100000 place invariants in 1248 ms
[2023-03-15 08:06:49] [INFO ] Dead Transitions using invariants and state equation in 23176 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250000/250000 places, 250000/250000 transitions.
// Phase 1: matrix 250000 rows 250000 cols
[2023-03-15 08:06:50] [INFO ] Computed 100000 place invariants in 1036 ms
Finished random walk after 927 steps, including 0 resets, run visited all 9 properties in 30019 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8179 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8132 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8252 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8131 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8179 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8129 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8074 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8044 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8220 ms. (steps per millisecond=0 ) properties seen 3
// Phase 1: matrix 250000 rows 250000 cols
[2023-03-15 08:08:35] [INFO ] Computed 100000 place invariants in 965 ms
Current structural bounds on expressions (after SMT) : [50000, 50000, 50000, 50000, 50000, 25000, 50000, 25000, 50000] Max seen :[438, 438, 438, 472, 472, 8, 472, 8, 472]
Support contains 150000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1592 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 250000/250000 places, 250000/250000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1868 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
// Phase 1: matrix 250000 rows 250000 cols
[2023-03-15 08:15:25] [INFO ] Computed 100000 place invariants in 863 ms
[2023-03-15 08:15:45] [INFO ] Implicit Places using invariants in 21378 ms returned []
Implicit Place search using SMT only with invariants took 21379 ms to find 0 implicit places.
// Phase 1: matrix 250000 rows 250000 cols
[2023-03-15 08:15:46] [INFO ] Computed 100000 place invariants in 735 ms
[2023-03-15 08:16:04] [INFO ] Dead Transitions using invariants and state equation in 18950 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250000/250000 places, 250000/250000 transitions.
// Phase 1: matrix 250000 rows 250000 cols
[2023-03-15 08:16:05] [INFO ] Computed 100000 place invariants in 878 ms
Finished random walk after 956 steps, including 0 resets, run visited all 9 properties in 30014 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8037 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8226 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8184 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8168 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8065 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8120 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8156 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8158 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8121 ms. (steps per millisecond=0 ) properties seen 3
// Phase 1: matrix 250000 rows 250000 cols
[2023-03-15 08:17:50] [INFO ] Computed 100000 place invariants in 1016 ms
Current structural bounds on expressions (after SMT) : [50000, 50000, 50000, 50000, 50000, 25000, 50000, 25000, 50000] Max seen :[452, 452, 452, 493, 493, 8, 493, 8, 493]
Support contains 150000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1395 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 250000/250000 places, 250000/250000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1688 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
// Phase 1: matrix 250000 rows 250000 cols
[2023-03-15 08:24:39] [INFO ] Computed 100000 place invariants in 997 ms
[2023-03-15 08:24:58] [INFO ] Implicit Places using invariants in 19600 ms returned []
Implicit Place search using SMT only with invariants took 19602 ms to find 0 implicit places.
// Phase 1: matrix 250000 rows 250000 cols
[2023-03-15 08:24:59] [INFO ] Computed 100000 place invariants in 950 ms
[2023-03-15 08:25:20] [INFO ] Dead Transitions using invariants and state equation in 21951 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250000/250000 places, 250000/250000 transitions.
// Phase 1: matrix 250000 rows 250000 cols
[2023-03-15 08:25:21] [INFO ] Computed 100000 place invariants in 811 ms
Finished random walk after 925 steps, including 0 resets, run visited all 9 properties in 30011 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8086 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8050 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8179 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8158 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8128 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8060 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 8177 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7068 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7585 ms. (steps per millisecond=0 ) properties seen 3
// Phase 1: matrix 250000 rows 250000 cols
[2023-03-15 08:27:04] [INFO ] Computed 100000 place invariants in 1024 ms
Current structural bounds on expressions (after SMT) : [50000, 50000, 50000, 50000, 50000, 25000, 50000, 25000, 50000] Max seen :[482, 482, 482, 493, 493, 8, 493, 8, 493]
Support contains 150000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1539 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 250000/250000 places, 250000/250000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1693 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
// Phase 1: matrix 250000 rows 250000 cols
[2023-03-15 08:33:54] [INFO ] Computed 100000 place invariants in 1205 ms
[2023-03-15 08:34:16] [INFO ] Implicit Places using invariants in 22995 ms returned []
Implicit Place search using SMT only with invariants took 22997 ms to find 0 implicit places.
// Phase 1: matrix 250000 rows 250000 cols
[2023-03-15 08:34:17] [INFO ] Computed 100000 place invariants in 978 ms
[2023-03-15 08:34:35] [INFO ] Dead Transitions using invariants and state equation in 19025 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250000/250000 places, 250000/250000 transitions.
// Phase 1: matrix 250000 rows 250000 cols
[2023-03-15 08:34:36] [INFO ] Computed 100000 place invariants in 647 ms
Finished random walk after 961 steps, including 0 resets, run visited all 9 properties in 30021 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7537 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7728 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7668 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7605 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7559 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7750 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7789 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7707 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7922 ms. (steps per millisecond=0 ) properties seen 3
// Phase 1: matrix 250000 rows 250000 cols
[2023-03-15 08:36:17] [INFO ] Computed 100000 place invariants in 1001 ms
Current structural bounds on expressions (after SMT) : [50000, 50000, 50000, 50000, 50000, 25000, 50000, 25000, 50000] Max seen :[493, 493, 493, 493, 493, 8, 493, 8, 493]
Support contains 150000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1573 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 250000/250000 places, 250000/250000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1966 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
// Phase 1: matrix 250000 rows 250000 cols
[2023-03-15 08:43:07] [INFO ] Computed 100000 place invariants in 907 ms
[2023-03-15 08:43:25] [INFO ] Implicit Places using invariants in 19457 ms returned []
Implicit Place search using SMT only with invariants took 19469 ms to find 0 implicit places.
// Phase 1: matrix 250000 rows 250000 cols
[2023-03-15 08:43:26] [INFO ] Computed 100000 place invariants in 754 ms
[2023-03-15 08:43:46] [INFO ] Dead Transitions using invariants and state equation in 21074 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250000/250000 places, 250000/250000 transitions.
// Phase 1: matrix 250000 rows 250000 cols
[2023-03-15 08:43:47] [INFO ] Computed 100000 place invariants in 705 ms
Finished random walk after 932 steps, including 0 resets, run visited all 9 properties in 30020 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7584 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7616 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7621 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7542 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7573 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7521 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7580 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7544 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7593 ms. (steps per millisecond=0 ) properties seen 3
// Phase 1: matrix 250000 rows 250000 cols
[2023-03-15 08:45:27] [INFO ] Computed 100000 place invariants in 951 ms
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="gold2022"
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 gold2022"
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 r319-tall-167873969800022"
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 '
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 ;