About the Execution of 2021-gold for Philosophers-PT-005000
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r179-tall-165277026800133.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is Philosophers-PT-005000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277026800133
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 113M
-rw-r--r-- 1 mcc users 7.8M Apr 29 20:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 40M Apr 29 20:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0M Apr 29 14:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 24M Apr 29 14:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7M May 9 08:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13M May 9 08:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7M May 9 08:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.4M May 9 08:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 501K May 9 08:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 1.3M May 9 08:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 11M May 10 09:34 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-PT-005000-UpperBounds-00
FORMULA_NAME Philosophers-PT-005000-UpperBounds-01
FORMULA_NAME Philosophers-PT-005000-UpperBounds-02
FORMULA_NAME Philosophers-PT-005000-UpperBounds-03
FORMULA_NAME Philosophers-PT-005000-UpperBounds-04
FORMULA_NAME Philosophers-PT-005000-UpperBounds-05
FORMULA_NAME Philosophers-PT-005000-UpperBounds-06
FORMULA_NAME Philosophers-PT-005000-UpperBounds-07
FORMULA_NAME Philosophers-PT-005000-UpperBounds-08
FORMULA_NAME Philosophers-PT-005000-UpperBounds-09
FORMULA_NAME Philosophers-PT-005000-UpperBounds-10
FORMULA_NAME Philosophers-PT-005000-UpperBounds-11
FORMULA_NAME Philosophers-PT-005000-UpperBounds-12
FORMULA_NAME Philosophers-PT-005000-UpperBounds-13
FORMULA_NAME Philosophers-PT-005000-UpperBounds-14
FORMULA_NAME Philosophers-PT-005000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652828849369
Running Version 0
[2022-05-17 23:07:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 23:07:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 23:07:31] [INFO ] Load time of PNML (sax parser for PT used): 674 ms
[2022-05-17 23:07:31] [INFO ] Transformed 25000 places.
[2022-05-17 23:07:31] [INFO ] Transformed 25000 transitions.
[2022-05-17 23:07:31] [INFO ] Parsed PT model containing 25000 places and 25000 transitions in 830 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 2898 ms.
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 23:07:35] [INFO ] Computed 10000 place invariants in 173 ms
FORMULA Philosophers-PT-005000-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-UpperBounds-07 5000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-UpperBounds-06 5000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-UpperBounds-05 5000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-UpperBounds-03 5000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-UpperBounds-01 5000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21587 ms. (steps per millisecond=0 ) properties (out of 7) seen :3455
FORMULA Philosophers-PT-005000-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-005000-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2864 ms. (steps per millisecond=3 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3024 ms. (steps per millisecond=3 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2971 ms. (steps per millisecond=3 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 1650 ms. (steps per millisecond=6 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 1602 ms. (steps per millisecond=6 ) properties (out of 5) seen :0
// Phase 1: matrix 25000 rows 25000 cols
[2022-05-17 23:08:09] [INFO ] Computed 10000 place invariants in 84 ms
[2022-05-17 23:08:14] [INFO ] [Real]Absence check using 10000 positive place invariants in 1802 ms returned unknown
[2022-05-17 23:08:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.assertInvariants(DeadlockTester.java:1970)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:558)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 23:08:24] [INFO ] [Real]Absence check using 10000 positive place invariants in 1991 ms returned unknown
[2022-05-17 23:08:29] [INFO ] [Real]Absence check using 10000 positive place invariants in 2070 ms returned unknown
[2022-05-17 23:08:34] [INFO ] [Real]Absence check using 10000 positive place invariants in 2046 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 5000, 5000, 1, 1] Max seen :[1139, 1139, 1175, 0, 0]
Support contains 10002 out of 25000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Performed 4998 Post agglomeration using F-continuation condition.Transition count delta: 4998
Deduced a syphon composed of 4998 places in 15 ms
Reduce places removed 4998 places and 0 transitions.
Iterating global reduction 0 with 9996 rules applied. Total rules applied 9996 place count 20002 transition count 20002
Applied a total of 9996 rules in 7389 ms. Remains 20002 /25000 variables (removed 4998) and now considering 20002/25000 (removed 4998) transitions.
Finished structural reductions, in 1 iterations. Remains : 20002/25000 places, 20002/25000 transitions.
// Phase 1: matrix 20002 rows 20002 cols
[2022-05-17 23:08:41] [INFO ] Computed 10000 place invariants in 53 ms
Interrupted random walk after 17516 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen :{0=1994, 1=1994, 2=2033}
Interrupted Best-First random walk after 19002 steps, including 0 resets, run timeout after 5250 ms. (steps per millisecond=3 ) properties seen :{0=1, 1=1}
Interrupted Best-First random walk after 20000 steps, including 0 resets, run timeout after 5179 ms. (steps per millisecond=3 ) properties seen :{0=1, 1=1}
Interrupted Best-First random walk after 23001 steps, including 0 resets, run timeout after 5054 ms. (steps per millisecond=4 ) properties seen :{2=2}
Interrupted Best-First random walk after 37998 steps, including 0 resets, run timeout after 5012 ms. (steps per millisecond=7 ) properties seen :{0=3, 1=3}
Interrupted Best-First random walk after 37998 steps, including 0 resets, run timeout after 5012 ms. (steps per millisecond=7 ) properties seen :{2=3}
// Phase 1: matrix 20002 rows 20002 cols
[2022-05-17 23:09:37] [INFO ] Computed 10000 place invariants in 41 ms
[2022-05-17 23:09:49] [INFO ] [Real]Absence check using 10000 positive place invariants in 10090 ms returned sat
[2022-05-17 23:09:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:10:22] [INFO ] [Real]Absence check using state equation in 32803 ms returned unknown
[2022-05-17 23:10:34] [INFO ] [Real]Absence check using 10000 positive place invariants in 10095 ms returned sat
[2022-05-17 23:10:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:11:07] [INFO ] [Real]Absence check using state equation in 33070 ms returned unknown
[2022-05-17 23:11:19] [INFO ] [Real]Absence check using 10000 positive place invariants in 10350 ms returned sat
[2022-05-17 23:11:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:11:52] [INFO ] [Real]Absence check using state equation in 32788 ms returned unknown
[2022-05-17 23:12:01] [INFO ] [Real]Absence check using 10000 positive place invariants in 7163 ms returned sat
[2022-05-17 23:12:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:12:33] [INFO ] [Real]Absence check using state equation in 32078 ms returned sat
[2022-05-17 23:12:37] [INFO ] Computed and/alt/rep : 10002/10004/10002 causal constraints (skipped 0 transitions) in 816 ms.
[2022-05-17 23:14:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... 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: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testTrapWithSMT(DeadlockTester.java:1429)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:895)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 23:14:48] [INFO ] [Real]Absence check using 10000 positive place invariants in 8506 ms returned sat
[2022-05-17 23:14:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:15:15] [INFO ] [Real]Absence check using state equation in 27121 ms returned sat
[2022-05-17 23:15:18] [INFO ] Computed and/alt/rep : 10002/10004/10002 causal constraints (skipped 0 transitions) in 754 ms.
[2022-05-17 23:15:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 23:15:29] [INFO ] [Nat]Absence check using 10000 positive place invariants in 6167 ms returned sat
[2022-05-17 23:15:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 23:16:04] [INFO ] [Nat]Absence check using state equation in 35686 ms returned sat
[2022-05-17 23:16:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 4
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:671)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [5000, 5000, 5000, 1, 1] Max seen :[1994, 1994, 2033, 0, 0]
Support contains 10002 out of 20002 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20002/20002 places, 20002/20002 transitions.
Applied a total of 0 rules in 1823 ms. Remains 20002 /20002 variables (removed 0) and now considering 20002/20002 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 20002/20002 places, 20002/20002 transitions.
Starting structural reductions, iteration 0 : 20002/20002 places, 20002/20002 transitions.
Applied a total of 0 rules in 1779 ms. Remains 20002 /20002 variables (removed 0) and now considering 20002/20002 (removed 0) transitions.
// Phase 1: matrix 20002 rows 20002 cols
[2022-05-17 23:16:10] [INFO ] Computed 10000 place invariants in 32 ms
[2022-05-17 23:16:12] [INFO ] Implicit Places using invariants in 1712 ms returned []
Implicit Place search using SMT only with invariants took 1714 ms to find 0 implicit places.
// Phase 1: matrix 20002 rows 20002 cols
[2022-05-17 23:16:12] [INFO ] Computed 10000 place invariants in 46 ms
[2022-05-17 23:16:13] [INFO ] Dead Transitions using invariants and state equation in 1501 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20002/20002 places, 20002/20002 transitions.
// Phase 1: matrix 20002 rows 20002 cols
[2022-05-17 23:16:13] [INFO ] Computed 10000 place invariants in 39 ms
Interrupted random walk after 17683 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen :{0=2078, 1=2078, 2=1913, 3=1}
FORMULA Philosophers-PT-005000-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 20000 steps, including 0 resets, run timeout after 5171 ms. (steps per millisecond=3 ) properties seen :{0=1, 1=1}
Interrupted Best-First random walk after 20000 steps, including 0 resets, run timeout after 5136 ms. (steps per millisecond=3 ) properties seen :{0=1, 1=1}
Interrupted Best-First random walk after 20000 steps, including 0 resets, run timeout after 5187 ms. (steps per millisecond=3 ) properties seen :{2=1}
Interrupted Best-First random walk after 39992 steps, including 0 resets, run timeout after 5124 ms. (steps per millisecond=7 ) properties seen :{0=3, 1=3}
// Phase 1: matrix 20002 rows 20002 cols
[2022-05-17 23:17:04] [INFO ] Computed 10000 place invariants in 41 ms
[2022-05-17 23:17:17] [INFO ] [Real]Absence check using 10000 positive place invariants in 10777 ms returned sat
[2022-05-17 23:17:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:17:49] [INFO ] [Real]Absence check using state equation in 32066 ms returned unknown
[2022-05-17 23:18:02] [INFO ] [Real]Absence check using 10000 positive place invariants in 11154 ms returned sat
[2022-05-17 23:18:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:18:34] [INFO ] [Real]Absence check using state equation in 31969 ms returned unknown
[2022-05-17 23:18:46] [INFO ] [Real]Absence check using 10000 positive place invariants in 10585 ms returned sat
[2022-05-17 23:18:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:19:19] [INFO ] [Real]Absence check using state equation in 32555 ms returned unknown
[2022-05-17 23:19:28] [INFO ] [Real]Absence check using 10000 positive place invariants in 6652 ms returned sat
[2022-05-17 23:19:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:20:04] [INFO ] [Real]Absence check using state equation in 36560 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 5000, 5000, 1] Max seen :[2078, 2078, 2033, 0]
Support contains 10001 out of 20002 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20002/20002 places, 20002/20002 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 20001 transition count 20001
Applied a total of 2 rules in 3238 ms. Remains 20001 /20002 variables (removed 1) and now considering 20001/20002 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 20001/20002 places, 20001/20002 transitions.
// Phase 1: matrix 20001 rows 20001 cols
[2022-05-17 23:20:07] [INFO ] Computed 10000 place invariants in 31 ms
Interrupted random walk after 17741 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen :{0=2021, 1=2021, 2=1970, 3=1}
FORMULA Philosophers-PT-005000-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 20000 steps, including 0 resets, run timeout after 5192 ms. (steps per millisecond=3 ) properties seen :{0=1, 1=1}
Interrupted Best-First random walk after 20000 steps, including 0 resets, run timeout after 5211 ms. (steps per millisecond=3 ) properties seen :{0=1, 1=1}
Interrupted Best-First random walk after 20000 steps, including 0 resets, run timeout after 5151 ms. (steps per millisecond=3 ) properties seen :{2=1}
// Phase 1: matrix 20001 rows 20001 cols
[2022-05-17 23:20:53] [INFO ] Computed 10000 place invariants in 34 ms
[2022-05-17 23:21:06] [INFO ] [Real]Absence check using 10000 positive place invariants in 10908 ms returned sat
[2022-05-17 23:21:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:21:38] [INFO ] [Real]Absence check using state equation in 32228 ms returned unknown
[2022-05-17 23:21:50] [INFO ] [Real]Absence check using 10000 positive place invariants in 10203 ms returned sat
[2022-05-17 23:21:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:22:23] [INFO ] [Real]Absence check using state equation in 32887 ms returned unknown
[2022-05-17 23:22:35] [INFO ] [Real]Absence check using 10000 positive place invariants in 10148 ms returned sat
[2022-05-17 23:22:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:23:08] [INFO ] [Real]Absence check using state equation in 32963 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 5000, 5000] Max seen :[2078, 2078, 2033]
Support contains 10000 out of 20001 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20001/20001 places, 20001/20001 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 20000 transition count 20000
Applied a total of 2 rules in 3428 ms. Remains 20000 /20001 variables (removed 1) and now considering 20000/20001 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 20000/20001 places, 20000/20001 transitions.
// Phase 1: matrix 20000 rows 20000 cols
[2022-05-17 23:23:12] [INFO ] Computed 10000 place invariants in 28 ms
Interrupted random walk after 17873 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen :{0=1994, 1=1994, 2=1972}
Interrupted Best-First random walk after 20000 steps, including 0 resets, run timeout after 5224 ms. (steps per millisecond=3 ) properties seen :{0=1, 1=1}
Interrupted Best-First random walk after 20000 steps, including 0 resets, run timeout after 5203 ms. (steps per millisecond=3 ) properties seen :{0=1, 1=1}
Interrupted Best-First random walk after 20000 steps, including 0 resets, run timeout after 5242 ms. (steps per millisecond=3 ) properties seen :{2=1}
// Phase 1: matrix 20000 rows 20000 cols
[2022-05-17 23:23:57] [INFO ] Computed 10000 place invariants in 33 ms
[2022-05-17 23:24:10] [INFO ] [Real]Absence check using 10000 positive place invariants in 10210 ms returned sat
[2022-05-17 23:24:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:24:43] [INFO ] [Real]Absence check using state equation in 32958 ms returned unknown
[2022-05-17 23:24:55] [INFO ] [Real]Absence check using 10000 positive place invariants in 10470 ms returned sat
[2022-05-17 23:24:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:25:28] [INFO ] [Real]Absence check using state equation in 32680 ms returned unknown
[2022-05-17 23:25:40] [INFO ] [Real]Absence check using 10000 positive place invariants in 10206 ms returned sat
[2022-05-17 23:25:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 23:26:13] [INFO ] [Real]Absence check using state equation in 32926 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000, 5000, 5000] Max seen :[2078, 2078, 2033]
Support contains 10000 out of 20000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Applied a total of 0 rules in 1792 ms. Remains 20000 /20000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 20000/20000 places, 20000/20000 transitions.
Starting structural reductions, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Applied a total of 0 rules in 1779 ms. Remains 20000 /20000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
// Phase 1: matrix 20000 rows 20000 cols
[2022-05-17 23:26:16] [INFO ] Computed 10000 place invariants in 34 ms
[2022-05-17 23:26:18] [INFO ] Implicit Places using invariants in 1494 ms returned []
Implicit Place search using SMT only with invariants took 1497 ms to find 0 implicit places.
// Phase 1: matrix 20000 rows 20000 cols
[2022-05-17 23:26:18] [INFO ] Computed 10000 place invariants in 37 ms
[2022-05-17 23:26:19] [INFO ] Dead Transitions using invariants and state equation in 1477 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20000/20000 places, 20000/20000 transitions.
Starting property specific reduction for Philosophers-PT-005000-UpperBounds-00
// Phase 1: matrix 20000 rows 20000 cols
[2022-05-17 23:26:19] [INFO ] Computed 10000 place invariants in 36 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17987 ms. (steps per millisecond=0 ) properties (out of 1) seen :1129
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2458 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
// Phase 1: matrix 20000 rows 20000 cols
[2022-05-17 23:26:40] [INFO ] Computed 10000 place invariants in 32 ms
[2022-05-17 23:26:45] [INFO ] [Real]Absence check using 10000 positive place invariants in 3085 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1129]
Support contains 5000 out of 20000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Free-agglomeration rule (complex) applied 5000 times.
Iterating global reduction 0 with 5000 rules applied. Total rules applied 5000 place count 20000 transition count 15000
Reduce places removed 5000 places and 0 transitions.
Drop transitions removed 5000 transitions
Reduce isomorphic transitions removed 5000 transitions.
Iterating post reduction 0 with 10000 rules applied. Total rules applied 15000 place count 15000 transition count 10000
Applied a total of 15000 rules in 6274 ms. Remains 15000 /20000 variables (removed 5000) and now considering 10000/20000 (removed 10000) transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/20000 places, 10000/20000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:26:51] [INFO ] Computed 10000 place invariants in 15 ms
Interrupted random walk after 30890 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :{0=5000}
FORMULA Philosophers-PT-005000-UpperBounds-00 5000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Philosophers-PT-005000-UpperBounds-00 in 61881 ms.
Starting property specific reduction for Philosophers-PT-005000-UpperBounds-02
// Phase 1: matrix 20000 rows 20000 cols
[2022-05-17 23:27:21] [INFO ] Computed 10000 place invariants in 37 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18026 ms. (steps per millisecond=0 ) properties (out of 1) seen :1150
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2640 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
// Phase 1: matrix 20000 rows 20000 cols
[2022-05-17 23:27:42] [INFO ] Computed 10000 place invariants in 36 ms
[2022-05-17 23:27:47] [INFO ] [Real]Absence check using 10000 positive place invariants in 3075 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1150]
Support contains 5000 out of 20000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Free-agglomeration rule (complex) applied 5000 times.
Iterating global reduction 0 with 5000 rules applied. Total rules applied 5000 place count 20000 transition count 15000
Reduce places removed 5000 places and 0 transitions.
Drop transitions removed 5000 transitions
Reduce isomorphic transitions removed 5000 transitions.
Iterating post reduction 0 with 10000 rules applied. Total rules applied 15000 place count 15000 transition count 10000
Applied a total of 15000 rules in 6338 ms. Remains 15000 /20000 variables (removed 5000) and now considering 10000/20000 (removed 10000) transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/20000 places, 10000/20000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:27:53] [INFO ] Computed 10000 place invariants in 19 ms
Interrupted random walk after 30753 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :{0=5000}
FORMULA Philosophers-PT-005000-UpperBounds-02 5000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Philosophers-PT-005000-UpperBounds-02 in 62178 ms.
Starting property specific reduction for Philosophers-PT-005000-UpperBounds-04
// Phase 1: matrix 20000 rows 20000 cols
[2022-05-17 23:28:23] [INFO ] Computed 10000 place invariants in 30 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17926 ms. (steps per millisecond=0 ) properties (out of 1) seen :1165
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2695 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
// Phase 1: matrix 20000 rows 20000 cols
[2022-05-17 23:28:44] [INFO ] Computed 10000 place invariants in 32 ms
[2022-05-17 23:28:49] [INFO ] [Real]Absence check using 10000 positive place invariants in 3089 ms returned unknown
Current structural bounds on expressions (after SMT) : [5000] Max seen :[1165]
Support contains 5000 out of 20000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Free-agglomeration rule (complex) applied 5000 times.
Iterating global reduction 0 with 5000 rules applied. Total rules applied 5000 place count 20000 transition count 15000
Reduce places removed 5000 places and 0 transitions.
Drop transitions removed 5000 transitions
Reduce isomorphic transitions removed 5000 transitions.
Iterating post reduction 0 with 10000 rules applied. Total rules applied 15000 place count 15000 transition count 10000
Applied a total of 15000 rules in 6154 ms. Remains 15000 /20000 variables (removed 5000) and now considering 10000/20000 (removed 10000) transitions.
Finished structural reductions, in 1 iterations. Remains : 15000/20000 places, 10000/20000 transitions.
// Phase 1: matrix 10000 rows 15000 cols
[2022-05-17 23:28:55] [INFO ] Computed 10000 place invariants in 20 ms
Interrupted random walk after 30458 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen :{0=5000}
FORMULA Philosophers-PT-005000-UpperBounds-04 5000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Philosophers-PT-005000-UpperBounds-04 in 61934 ms.
[2022-05-17 23:29:27] [INFO ] Flatten gal took : 960 ms
[2022-05-17 23:29:27] [INFO ] Applying decomposition
[2022-05-17 23:29:28] [INFO ] Flatten gal took : 753 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17798115093015117842.txt, -o, /tmp/graph17798115093015117842.bin, -w, /tmp/graph17798115093015117842.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17798115093015117842.bin, -l, -1, -v, -w, /tmp/graph17798115093015117842.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-17 23:29:30] [INFO ] Decomposing Gal with order
[2022-05-17 23:29:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 23:30:26] [INFO ] Removed a total of 118 redundant transitions.
[2022-05-17 23:30:26] [INFO ] Flatten gal took : 1233 ms
[2022-05-17 23:30:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 89 ms.
[2022-05-17 23:30:26] [INFO ] Time to serialize gal into /tmp/UpperBounds3397435641645605644.gal : 155 ms
[2022-05-17 23:30:26] [INFO ] Time to serialize properties into /tmp/UpperBounds5769427569720222684.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds3397435641645605644.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds5769427569720222684.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds3397435641645605644.gal -t CGAL -reachable-file /tmp/UpperBounds5769427569720222684.prop --nowitness
Loading property file /tmp/UpperBounds5769427569720222684.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,24,132.488,220608,4749,30,4929,2889,13136,17,123,3032,0
Total reachable state count : 24
BK_STOP 1652830360469
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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-PT-005000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is Philosophers-PT-005000, 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 r179-tall-165277026800133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-005000.tgz
mv Philosophers-PT-005000 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;