fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r293-tall-167873945100181
Last Updated
May 14, 2023

About the Execution of ITS-Tools for Philosophers-COL-100000

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13995.191 3600000.00 6814456.00 8200.30 100000 ? ? ? ? ? ? ? 100000 100000 100000 100000 ? 100000 ? 100000 normal

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.r293-tall-167873945100181.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 itstools
Input is Philosophers-COL-100000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945100181
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.8M
-rw-r--r-- 1 mcc users 4.6K Feb 25 13:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Feb 25 13:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 13:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 13:07 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 25K 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 17K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 13:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 13:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 13:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 13:07 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 4.5M 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-100000-UpperBounds-00
FORMULA_NAME Philosophers-COL-100000-UpperBounds-01
FORMULA_NAME Philosophers-COL-100000-UpperBounds-02
FORMULA_NAME Philosophers-COL-100000-UpperBounds-03
FORMULA_NAME Philosophers-COL-100000-UpperBounds-04
FORMULA_NAME Philosophers-COL-100000-UpperBounds-05
FORMULA_NAME Philosophers-COL-100000-UpperBounds-06
FORMULA_NAME Philosophers-COL-100000-UpperBounds-07
FORMULA_NAME Philosophers-COL-100000-UpperBounds-08
FORMULA_NAME Philosophers-COL-100000-UpperBounds-09
FORMULA_NAME Philosophers-COL-100000-UpperBounds-10
FORMULA_NAME Philosophers-COL-100000-UpperBounds-11
FORMULA_NAME Philosophers-COL-100000-UpperBounds-12
FORMULA_NAME Philosophers-COL-100000-UpperBounds-13
FORMULA_NAME Philosophers-COL-100000-UpperBounds-14
FORMULA_NAME Philosophers-COL-100000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678804464077

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-100000
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202303021504
[2023-03-14 14:34:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-14 14:34:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 14:34:25] [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 14:34:26] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 14:34:26] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1182 ms
[2023-03-14 14:34:26] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 500000 PT places and 500000.0 transition bindings in 38 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-14 14:34:26] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 5 ms.
[2023-03-14 14:34:26] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 5 rows 5 cols
[2023-03-14 14:34:26] [INFO ] Computed 2 place invariants in 5 ms
FORMULA Philosophers-COL-100000-UpperBounds-15 100000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-100000-UpperBounds-13 100000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-100000-UpperBounds-11 100000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-100000-UpperBounds-10 100000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-100000-UpperBounds-09 100000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-100000-UpperBounds-08 100000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-100000-UpperBounds-00 100000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-14 14:34:26] [INFO ] Invariant cache hit.
[2023-03-14 14:34:27] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-14 14:34:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 14:34:27] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-14 14:34:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 14:34:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-14 14:34:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 14:34:27] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-14 14:34:27] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-14 14:34:27] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2023-03-14 14:34:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 14:34:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 14:34:27] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-14 14:34:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 14:34:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 14:34:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 14:34:27] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-14 14:34:27] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-14 14:34:27] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2023-03-14 14:34:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 14:34:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 14:34:27] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-14 14:34:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 14:34:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 14:34:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 14:34:27] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-14 14:34:27] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 14:34:27] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2023-03-14 14:34:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 14:34:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 14:34:27] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-14 14:34:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 14:34:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 14:34:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 14:34:27] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-14 14:34:27] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-14 14:34:27] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2023-03-14 14:34:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 14:34:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 14:34:27] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-14 14:34:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 14:34:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 14:34:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 14:34:27] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-14 14:34:27] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-14 14:34:27] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2023-03-14 14:34:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 14:34:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 14:34:27] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-14 14:34:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 14:34:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 14:34:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 14:34:27] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-14 14:34:27] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-14 14:34:27] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 2 ms.
[2023-03-14 14:34:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 14:34:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 14:34:27] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-14 14:34:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 14:34:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-14 14:34:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 14:34:27] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-14 14:34:27] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-14 14:34:27] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2023-03-14 14:34:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 14:34:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 14:34:27] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-14 14:34:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 14:34:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 14:34:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 14:34:27] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-14 14:34:27] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 14:34:27] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2023-03-14 14:34:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 14:34:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 14:34:27] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-14 14:34:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 14:34:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 14:34:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 14:34:27] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-14 14:34:27] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-14 14:34:27] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [100000, 100000, 100000, 100000, 50000, 100000, 100000, 100000, 100000]
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 100000) 100000) 100000)]] contains successor/predecessor on variables of sort Philo
[2023-03-14 14:34:29] [INFO ] Unfolded HLPN to a Petri net with 500000 places and 500000 transitions 1600000 arcs in 1706 ms.
[2023-03-14 14:34:29] [INFO ] Unfolded 9 HLPN properties in 36 ms.
Interrupted random walk after 369 steps, including 0 resets, run timeout after 30007 ms. (steps per millisecond=0 ) properties seen 1472
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7985 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7928 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 8193 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7881 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 8013 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7668 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7500 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7346 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7560 ms. (steps per millisecond=0 ) properties seen 4
// Phase 1: matrix 500000 rows 500000 cols
[2023-03-14 14:36:15] [INFO ] Computed 200000 place invariants in 2728 ms
[2023-03-14 14:36:20] [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 0
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 14:36:25] [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 14:36:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-14 14:36:35] [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: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 14:36:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-14 14:36:45] [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: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 14:36:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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 14:36:55] [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 7
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 14:37:00] [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 8
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)
Current structural bounds on expressions (after SMT) : [100000, 100000, 100000, 100000, 50000, 100000, 100000, 100000, 100000] Max seen :[210, 158, 158, 210, 0, 210, 158, 158, 210]
Support contains 300000 out of 500000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500000/500000 places, 500000/500000 transitions.
Applied a total of 0 rules in 4479 ms. Remains 500000 /500000 variables (removed 0) and now considering 500000/500000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4503 ms. Remains : 500000/500000 places, 500000/500000 transitions.
[2023-03-14 14:37:06] [INFO ] Invariant cache hit.
Interrupted random walk after 370 steps, including 0 resets, run timeout after 30016 ms. (steps per millisecond=0 ) properties seen 1476
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7728 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7796 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7827 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7524 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7404 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7469 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7483 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7606 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7487 ms. (steps per millisecond=0 ) properties seen 4
[2023-03-14 14:38:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [100000, 100000, 100000, 100000, 50000, 100000, 100000, 100000, 100000] Max seen :[210, 181, 181, 210, 0, 210, 181, 181, 210]
Support contains 300000 out of 500000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500000/500000 places, 500000/500000 transitions.
Applied a total of 0 rules in 3331 ms. Remains 500000 /500000 variables (removed 0) and now considering 500000/500000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3331 ms. Remains : 500000/500000 places, 500000/500000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500000/500000 places, 500000/500000 transitions.
Applied a total of 0 rules in 3196 ms. Remains 500000 /500000 variables (removed 0) and now considering 500000/500000 (removed 0) transitions.
[2023-03-14 14:44:40] [INFO ] Invariant cache hit.
[2023-03-14 14:45:15] [INFO ] Implicit Places using invariants in 35467 ms returned []
Implicit Place search using SMT only with invariants took 35469 ms to find 0 implicit places.
[2023-03-14 14:45:15] [INFO ] Invariant cache hit.
[2023-03-14 14:45:51] [INFO ] Dead Transitions using invariants and state equation in 35856 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74528 ms. Remains : 500000/500000 places, 500000/500000 transitions.
[2023-03-14 14:45:52] [INFO ] Invariant cache hit.
Interrupted random walk after 376 steps, including 0 resets, run timeout after 30068 ms. (steps per millisecond=0 ) properties seen 1500
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7291 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7569 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7326 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7312 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7303 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7255 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7339 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7292 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7326 ms. (steps per millisecond=0 ) properties seen 4
[2023-03-14 14:47:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [100000, 100000, 100000, 100000, 50000, 100000, 100000, 100000, 100000] Max seen :[210, 200, 200, 210, 0, 210, 200, 200, 210]
Support contains 300000 out of 500000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500000/500000 places, 500000/500000 transitions.
Applied a total of 0 rules in 3257 ms. Remains 500000 /500000 variables (removed 0) and now considering 500000/500000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3258 ms. Remains : 500000/500000 places, 500000/500000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500000/500000 places, 500000/500000 transitions.
Applied a total of 0 rules in 3095 ms. Remains 500000 /500000 variables (removed 0) and now considering 500000/500000 (removed 0) transitions.
[2023-03-14 14:53:31] [INFO ] Invariant cache hit.
[2023-03-14 14:54:12] [INFO ] Implicit Places using invariants in 41174 ms returned []
Implicit Place search using SMT only with invariants took 41175 ms to find 0 implicit places.
[2023-03-14 14:54:12] [INFO ] Invariant cache hit.
[2023-03-14 14:54:48] [INFO ] Dead Transitions using invariants and state equation in 36015 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80290 ms. Remains : 500000/500000 places, 500000/500000 transitions.
[2023-03-14 14:54:49] [INFO ] Invariant cache hit.
Finished random walk after 374 steps, including 0 resets, run visited all 9 properties in 30077 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7262 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7598 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7484 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7603 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7536 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7289 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7304 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7320 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7252 ms. (steps per millisecond=0 ) properties seen 4
[2023-03-14 14:56:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [100000, 100000, 100000, 100000, 50000, 100000, 100000, 100000, 100000] Max seen :[210, 200, 200, 210, 1, 210, 200, 200, 210]
Support contains 300000 out of 500000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500000/500000 places, 500000/500000 transitions.
Applied a total of 0 rules in 2805 ms. Remains 500000 /500000 variables (removed 0) and now considering 500000/500000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2805 ms. Remains : 500000/500000 places, 500000/500000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500000/500000 places, 500000/500000 transitions.
Applied a total of 0 rules in 2982 ms. Remains 500000 /500000 variables (removed 0) and now considering 500000/500000 (removed 0) transitions.
[2023-03-14 15:02:21] [INFO ] Invariant cache hit.
[2023-03-14 15:02:56] [INFO ] Implicit Places using invariants in 34980 ms returned []
Implicit Place search using SMT only with invariants took 34983 ms to find 0 implicit places.
[2023-03-14 15:02:56] [INFO ] Invariant cache hit.
[2023-03-14 15:03:30] [INFO ] Dead Transitions using invariants and state equation in 34336 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72308 ms. Remains : 500000/500000 places, 500000/500000 transitions.
[2023-03-14 15:03:31] [INFO ] Invariant cache hit.
Interrupted random walk after 376 steps, including 0 resets, run timeout after 30020 ms. (steps per millisecond=0 ) properties seen 1500
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7163 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7265 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7105 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7125 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7252 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7110 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7064 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7196 ms. (steps per millisecond=0 ) properties seen 4
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7055 ms. (steps per millisecond=0 ) properties seen 4
[2023-03-14 15:05:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [100000, 100000, 100000, 100000, 50000, 100000, 100000, 100000, 100000] Max seen :[210, 200, 200, 210, 1, 210, 200, 200, 210]
Support contains 300000 out of 500000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500000/500000 places, 500000/500000 transitions.
Applied a total of 0 rules in 3060 ms. Remains 500000 /500000 variables (removed 0) and now considering 500000/500000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3060 ms. Remains : 500000/500000 places, 500000/500000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500000/500000 places, 500000/500000 transitions.
Applied a total of 0 rules in 3138 ms. Remains 500000 /500000 variables (removed 0) and now considering 500000/500000 (removed 0) transitions.
[2023-03-14 15:11:05] [INFO ] Invariant cache hit.
[2023-03-14 15:11:41] [INFO ] Implicit Places using invariants in 35565 ms returned []
Implicit Place search using SMT only with invariants took 35568 ms to find 0 implicit places.
[2023-03-14 15:11:41] [INFO ] Invariant cache hit.
[2023-03-14 15:12:21] [INFO ] Dead Transitions using invariants and state equation in 39951 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78668 ms. Remains : 500000/500000 places, 500000/500000 transitions.
Starting property specific reduction for Philosophers-COL-100000-UpperBounds-01
[2023-03-14 15:12:22] [INFO ] Invariant cache hit.
Finished random walk after 762 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 7086 ms. (steps per millisecond=0 ) properties seen 0
[2023-03-14 15:13:00] [INFO ] Invariant cache hit.
[2023-03-14 15:13:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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) : [100000] Max seen :[381]
Support contains 100000 out of 500000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500000/500000 places, 500000/500000 transitions.
Performed 3421 Post agglomeration using F-continuation condition.
Performed 6881 Post agglomeration using F-continuation condition.
Performed 10340 Post agglomeration using F-continuation condition.
Performed 13814 Post agglomeration using F-continuation condition.
Performed 17297 Post agglomeration using F-continuation condition.
Performed 20793 Post agglomeration using F-continuation condition.
Performed 24194 Post agglomeration using F-continuation condition.
Performed 26601 Post agglomeration using F-continuation condition.
Performed 29020 Post agglomeration using F-continuation condition.
Performed 31332 Post agglomeration using F-continuation condition.
Performed 33772 Post agglomeration using F-continuation condition.
Performed 36216 Post agglomeration using F-continuation condition.
Performed 38663 Post agglomeration using F-continuation condition.
Performed 41125 Post agglomeration using F-continuation condition.
Performed 43596 Post agglomeration using F-continuation condition.
Performed 46015 Post agglomeration using F-continuation condition.
Performed 48521 Post agglomeration using F-continuation condition.
Performed 51035 Post agglomeration using F-continuation condition.
Performed 53580 Post agglomeration using F-continuation condition.
Performed 56119 Post agglomeration using F-continuation condition.
Performed 58652 Post agglomeration using F-continuation condition.
Performed 60985 Post agglomeration using F-continuation condition.
Performed 63168 Post agglomeration using F-continuation condition.
Performed 65357 Post agglomeration using F-continuation condition.
Performed 67554 Post agglomeration using F-continuation condition.
Performed 69961 Post agglomeration using F-continuation condition.
Performed 72468 Post agglomeration using F-continuation condition.
Performed 75009 Post agglomeration using F-continuation condition.
Performed 77541 Post agglomeration using F-continuation condition.
Performed 80083 Post agglomeration using F-continuation condition.
Performed 82631 Post agglomeration using F-continuation condition.
Performed 85154 Post agglomeration using F-continuation condition.
Performed 87697 Post agglomeration using F-continuation condition.
Performed 90267 Post agglomeration using F-continuation condition.
Performed 92825 Post agglomeration using F-continuation condition.
Performed 95385 Post agglomeration using F-continuation condition.
Performed 97935 Post agglomeration using F-continuation condition.
Performed 100000 Post agglomeration using F-continuation condition.Transition count delta: 100000
Deduced a syphon composed of 100000 places in 68 ms
Reduce places removed 100000 places and 0 transitions.
Iterating global reduction 0 with 200000 rules applied. Total rules applied 200000 place count 400000 transition count 400000
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6404364 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16098208 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//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//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-100000.tgz
mv Philosophers-COL-100000 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 ;