Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r292-tall-162124157000787.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S32C11, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124157000787
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 68M
-rw-r--r-- 1 mcc users 43K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 146K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 35K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 118K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K May 12 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 12 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 12 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 12 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 5.2K May 11 19:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 11 19:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 11 16:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 11 16:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 12 04:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 12 04:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 7 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 67M May 12 08:13 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 gen-UpperBounds-00
FORMULA_NAME gen-UpperBounds-01
FORMULA_NAME gen-UpperBounds-02
FORMULA_NAME gen-UpperBounds-03
FORMULA_NAME gen-UpperBounds-04
FORMULA_NAME gen-UpperBounds-05
FORMULA_NAME gen-UpperBounds-06
FORMULA_NAME gen-UpperBounds-07
FORMULA_NAME gen-UpperBounds-08
FORMULA_NAME gen-UpperBounds-09
FORMULA_NAME gen-UpperBounds-10
FORMULA_NAME gen-UpperBounds-11
FORMULA_NAME gen-UpperBounds-12
FORMULA_NAME gen-UpperBounds-13
FORMULA_NAME gen-UpperBounds-14
FORMULA_NAME gen-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621409390390

Running Version 0
[2021-05-19 07:29:52] [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]
[2021-05-19 07:29:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 07:29:54] [INFO ] Load time of PNML (sax parser for PT used): 1518 ms
[2021-05-19 07:29:54] [INFO ] Transformed 34406 places.
[2021-05-19 07:29:54] [INFO ] Transformed 51525 transitions.
[2021-05-19 07:29:54] [INFO ] Parsed PT model containing 34406 places and 51525 transitions in 1745 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Normalized transition count is 50469 out of 51525 initially.
// Phase 1: matrix 50469 rows 34406 cols
[2021-05-19 07:30:10] [INFO ] Computed 1963 place invariants in 15546 ms
Incomplete random walk after 10000 steps, including 89 resets, run finished after 520 ms. (steps per millisecond=19 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 16) seen :2
[2021-05-19 07:30:12] [INFO ] Flow matrix only has 50469 transitions (discarded 1056 similar events)
// Phase 1: matrix 50469 rows 34406 cols
[2021-05-19 07:30:27] [INFO ] Computed 1963 place invariants in 14933 ms
[2021-05-19 07:30:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... 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: 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)
[2021-05-19 07:30:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
[2021-05-19 07:31:02] [INFO ] [Real]Absence check using 92 positive place invariants in 12 ms returned unknown
[2021-05-19 07:31:07] [INFO ] [Real]Absence check using 92 positive place invariants in 90 ms returned unknown
[2021-05-19 07:31:17] [INFO ] [Real]Absence check using 92 positive place invariants in 13 ms returned unknown
Current structural bounds on expressions (after SMT) : [33, 33, 33, 99, 99, 33, 33, 33, 99, 99, 33, 33, 1, 99, 33, 33] Max seen :[0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1]
Support contains 16 out of 34406 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 34406/34406 places, 51525/51525 transitions.
Graph (complete) has 112391 edges and 34406 vertex of which 34348 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.76 ms
Discarding 58 places :
Also discarding 0 output transitions
Drop transitions removed 11031 transitions
Trivial Post-agglo rules discarded 11031 transitions
Performed 11031 trivial Post agglomeration. Transition count delta: 11031
Iterating post reduction 0 with 11031 rules applied. Total rules applied 11032 place count 34348 transition count 40494
Reduce places removed 11031 places and 0 transitions.
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Iterating post reduction 1 with 11084 rules applied. Total rules applied 22116 place count 23317 transition count 40441
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 2 with 53 rules applied. Total rules applied 22169 place count 23264 transition count 40441
Performed 722 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 722 Pre rules applied. Total rules applied 22169 place count 23264 transition count 39719
Deduced a syphon composed of 722 places in 95 ms
Reduce places removed 722 places and 0 transitions.
Iterating global reduction 3 with 1444 rules applied. Total rules applied 23613 place count 22542 transition count 39719
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 68 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 23679 place count 22509 transition count 39686
Free-agglomeration rule (complex) applied 2103 times.
Iterating global reduction 3 with 2103 rules applied. Total rules applied 25782 place count 22509 transition count 37583
Reduce places removed 2103 places and 0 transitions.
Iterating post reduction 3 with 2103 rules applied. Total rules applied 27885 place count 20406 transition count 37583
Partial Free-agglomeration rule applied 5751 times.
Drop transitions removed 5751 transitions
Iterating global reduction 4 with 5751 rules applied. Total rules applied 33636 place count 20406 transition count 37583
Applied a total of 33636 rules in 15564 ms. Remains 20406 /34406 variables (removed 14000) and now considering 37583/51525 (removed 13942) transitions.
Finished structural reductions, in 1 iterations. Remains : 20406/34406 places, 37583/51525 transitions.
Normalized transition count is 36017 out of 37583 initially.
// Phase 1: matrix 36017 rows 20406 cols
[2021-05-19 07:32:21] [INFO ] Computed 1905 place invariants in 18461 ms
FORMULA gen-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA gen-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA gen-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA gen-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA gen-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA gen-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA gen-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Interrupted random walk after 240885 steps, including 3543 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen :{0=1, 2=1, 3=1, 5=1, 8=1}
FORMULA gen-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA gen-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 355515 steps, including 528 resets, run timeout after 5001 ms. (steps per millisecond=71 ) properties seen :{3=1, 6=1}
Interrupted Best-First random walk after 353965 steps, including 525 resets, run timeout after 5001 ms. (steps per millisecond=70 ) properties seen :{3=1}
Interrupted Best-First random walk after 357801 steps, including 531 resets, run timeout after 5001 ms. (steps per millisecond=71 ) properties seen :{1=1, 3=1}
Interrupted Best-First random walk after 361627 steps, including 537 resets, run timeout after 5001 ms. (steps per millisecond=72 ) properties seen :{3=1}
Interrupted Best-First random walk after 362010 steps, including 537 resets, run timeout after 5001 ms. (steps per millisecond=72 ) properties seen :{3=1}
Interrupted Best-First random walk after 362670 steps, including 538 resets, run timeout after 5001 ms. (steps per millisecond=72 ) properties seen :{3=1}
Interrupted Best-First random walk after 359591 steps, including 534 resets, run timeout after 5001 ms. (steps per millisecond=71 ) properties seen :{6=1}
[2021-05-19 07:33:26] [INFO ] Flow matrix only has 36017 transitions (discarded 1566 similar events)
// Phase 1: matrix 36017 rows 20406 cols
[2021-05-19 07:33:43] [INFO ] Computed 1905 place invariants in 16227 ms
[2021-05-19 07:33:46] [INFO ] [Real]Absence check using 63 positive place invariants in 740 ms returned sat
[2021-05-19 07:33:47] [INFO ] [Real]Absence check using 63 positive and 1842 generalized place invariants in 1090 ms returned sat
[2021-05-19 07:33:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:34:28] [INFO ] [Real]Absence check using state equation in 40870 ms returned unknown
[2021-05-19 07:34:31] [INFO ] [Real]Absence check using 63 positive place invariants in 729 ms returned sat
[2021-05-19 07:34:32] [INFO ] [Real]Absence check using 63 positive and 1842 generalized place invariants in 952 ms returned unsat
[2021-05-19 07:34:35] [INFO ] [Real]Absence check using 63 positive place invariants in 711 ms returned sat
[2021-05-19 07:34:36] [INFO ] [Real]Absence check using 63 positive and 1842 generalized place invariants in 1044 ms returned sat
[2021-05-19 07:34:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:35:17] [INFO ] [Real]Absence check using state equation in 40900 ms returned unknown
[2021-05-19 07:35:20] [INFO ] [Real]Absence check using 63 positive place invariants in 753 ms returned sat
[2021-05-19 07:35:20] [INFO ] [Real]Absence check using 63 positive and 1842 generalized place invariants in 382 ms returned unsat
[2021-05-19 07:35:23] [INFO ] [Real]Absence check using 63 positive place invariants in 712 ms returned sat
[2021-05-19 07:35:24] [INFO ] [Real]Absence check using 63 positive and 1842 generalized place invariants in 1003 ms returned sat
[2021-05-19 07:35:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:36:05] [INFO ] [Real]Absence check using state equation in 41014 ms returned unknown
[2021-05-19 07:36:08] [INFO ] [Real]Absence check using 63 positive place invariants in 726 ms returned sat
[2021-05-19 07:36:09] [INFO ] [Real]Absence check using 63 positive and 1842 generalized place invariants in 1026 ms returned sat
[2021-05-19 07:36:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:36:50] [INFO ] [Real]Absence check using state equation in 40973 ms returned unknown
[2021-05-19 07:36:53] [INFO ] [Real]Absence check using 63 positive place invariants in 729 ms returned sat
[2021-05-19 07:36:53] [INFO ] [Real]Absence check using 63 positive and 1842 generalized place invariants in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, 1, 1, 1, 2, 1, 1] Max seen :[0, 1, 0, 1, 0, 0, 1]
FORMULA gen-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 20406 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20406/20406 places, 37583/37583 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20406 transition count 37580
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 20403 transition count 37580
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 20403 transition count 37576
Deduced a syphon composed of 4 places in 58 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 20399 transition count 37576
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 20399 transition count 37566
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 34 place count 20389 transition count 37566
Applied a total of 34 rules in 3329 ms. Remains 20389 /20406 variables (removed 17) and now considering 37566/37583 (removed 17) transitions.
Finished structural reductions, in 1 iterations. Remains : 20389/20406 places, 37566/37583 transitions.
Normalized transition count is 36000 out of 37566 initially.
// Phase 1: matrix 36000 rows 20389 cols
[2021-05-19 07:37:13] [INFO ] Computed 1905 place invariants in 16557 ms
Interrupted random walk after 236246 steps, including 3500 resets, run timeout after 30001 ms. (steps per millisecond=7 ) properties seen :{2=1}
Interrupted Best-First random walk after 356769 steps, including 530 resets, run timeout after 5001 ms. (steps per millisecond=71 ) properties seen :{}
Interrupted Best-First random walk after 367981 steps, including 547 resets, run timeout after 5001 ms. (steps per millisecond=73 ) properties seen :{1=1}
FORMULA gen-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 338503 steps, including 503 resets, run timeout after 5001 ms. (steps per millisecond=67 ) properties seen :{}
[2021-05-19 07:37:58] [INFO ] Flow matrix only has 36000 transitions (discarded 1566 similar events)
// Phase 1: matrix 36000 rows 20389 cols
[2021-05-19 07:38:17] [INFO ] Computed 1905 place invariants in 18916 ms
[2021-05-19 07:38:20] [INFO ] [Real]Absence check using 65 positive place invariants in 705 ms returned sat
[2021-05-19 07:38:21] [INFO ] [Real]Absence check using 65 positive and 1840 generalized place invariants in 974 ms returned sat
[2021-05-19 07:38:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:39:02] [INFO ] [Real]Absence check using state equation in 41046 ms returned unknown
[2021-05-19 07:39:05] [INFO ] [Real]Absence check using 65 positive place invariants in 760 ms returned sat
[2021-05-19 07:39:06] [INFO ] [Real]Absence check using 65 positive and 1840 generalized place invariants in 932 ms returned unsat
[2021-05-19 07:39:09] [INFO ] [Real]Absence check using 65 positive place invariants in 743 ms returned sat
[2021-05-19 07:39:11] [INFO ] [Real]Absence check using 65 positive and 1840 generalized place invariants in 1325 ms returned sat
[2021-05-19 07:39:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:39:51] [INFO ] [Real]Absence check using state equation in 40617 ms returned unknown
Current structural bounds on expressions (after SMT) : [2, 1, 1] Max seen :[0, 1, 0]
FORMULA gen-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 20389 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20389/20389 places, 37566/37566 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20389 transition count 37565
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 20388 transition count 37565
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 20388 transition count 37563
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 20386 transition count 37563
Applied a total of 6 rules in 3028 ms. Remains 20386 /20389 variables (removed 3) and now considering 37563/37566 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 20386/20389 places, 37563/37566 transitions.
Normalized transition count is 35997 out of 37563 initially.
// Phase 1: matrix 35997 rows 20386 cols
[2021-05-19 07:40:11] [INFO ] Computed 1905 place invariants in 16936 ms
Interrupted random walk after 242967 steps, including 3599 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen :{}
Interrupted Best-First random walk after 362791 steps, including 539 resets, run timeout after 5001 ms. (steps per millisecond=72 ) properties seen :{}
Interrupted Best-First random walk after 359644 steps, including 534 resets, run timeout after 5001 ms. (steps per millisecond=71 ) properties seen :{}
[2021-05-19 07:40:51] [INFO ] Flow matrix only has 35997 transitions (discarded 1566 similar events)
// Phase 1: matrix 35997 rows 20386 cols
[2021-05-19 07:41:10] [INFO ] Computed 1905 place invariants in 18933 ms
[2021-05-19 07:41:13] [INFO ] [Real]Absence check using 65 positive place invariants in 740 ms returned sat
[2021-05-19 07:41:14] [INFO ] [Real]Absence check using 65 positive and 1840 generalized place invariants in 1014 ms returned sat
[2021-05-19 07:41:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:41:55] [INFO ] [Real]Absence check using state equation in 40961 ms returned unknown
[2021-05-19 07:41:58] [INFO ] [Real]Absence check using 65 positive place invariants in 773 ms returned sat
[2021-05-19 07:42:00] [INFO ] [Real]Absence check using 65 positive and 1840 generalized place invariants in 1295 ms returned sat
[2021-05-19 07:42:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:42:40] [INFO ] [Real]Absence check using state equation in 40573 ms returned unknown
Current structural bounds on expressions (after SMT) : [2, 1] Max seen :[0, 0]
Support contains 2 out of 20386 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20386/20386 places, 37563/37563 transitions.
Applied a total of 0 rules in 1418 ms. Remains 20386 /20386 variables (removed 0) and now considering 37563/37563 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 20386/20386 places, 37563/37563 transitions.
Starting structural reductions, iteration 0 : 20386/20386 places, 37563/37563 transitions.
Applied a total of 0 rules in 1411 ms. Remains 20386 /20386 variables (removed 0) and now considering 37563/37563 (removed 0) transitions.
[2021-05-19 07:42:43] [INFO ] Flow matrix only has 35997 transitions (discarded 1566 similar events)
// Phase 1: matrix 35997 rows 20386 cols
[2021-05-19 07:42:59] [INFO ] Computed 1905 place invariants in 16256 ms
[2021-05-19 07:43:01] [INFO ] Implicit Places using invariants in 18130 ms returned []
Implicit Place search using SMT only with invariants took 18131 ms to find 0 implicit places.
[2021-05-19 07:43:01] [INFO ] Flow matrix only has 35997 transitions (discarded 1566 similar events)
// Phase 1: matrix 35997 rows 20386 cols
[2021-05-19 07:43:17] [INFO ] Computed 1905 place invariants in 15977 ms
[2021-05-19 07:43:19] [INFO ] Dead Transitions using invariants and state equation in 17850 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20386/20386 places, 37563/37563 transitions.
Starting property specific reduction for gen-UpperBounds-03
Normalized transition count is 35997 out of 37563 initially.
// Phase 1: matrix 35997 rows 20386 cols
[2021-05-19 07:43:38] [INFO ] Computed 1905 place invariants in 18642 ms
Incomplete random walk after 10000 steps, including 148 resets, run finished after 1279 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
[2021-05-19 07:43:39] [INFO ] Flow matrix only has 35997 transitions (discarded 1566 similar events)
// Phase 1: matrix 35997 rows 20386 cols
[2021-05-19 07:43:57] [INFO ] Computed 1905 place invariants in 17318 ms
[2021-05-19 07:44:00] [INFO ] [Real]Absence check using 65 positive place invariants in 724 ms returned sat
[2021-05-19 07:44:01] [INFO ] [Real]Absence check using 65 positive and 1840 generalized place invariants in 987 ms returned sat
[2021-05-19 07:44:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:44:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
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:446)
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) : [2] Max seen :[0]
Support contains 1 out of 20386 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20386/20386 places, 37563/37563 transitions.
Applied a total of 0 rules in 1391 ms. Remains 20386 /20386 variables (removed 0) and now considering 37563/37563 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 20386/20386 places, 37563/37563 transitions.
Normalized transition count is 35997 out of 37563 initially.
// Phase 1: matrix 35997 rows 20386 cols
[2021-05-19 07:44:19] [INFO ] Computed 1905 place invariants in 16335 ms
Interrupted random walk after 233245 steps, including 3456 resets, run timeout after 30001 ms. (steps per millisecond=7 ) properties seen :{}
Interrupted Best-First random walk after 355277 steps, including 528 resets, run timeout after 5001 ms. (steps per millisecond=71 ) properties seen :{}
[2021-05-19 07:44:54] [INFO ] Flow matrix only has 35997 transitions (discarded 1566 similar events)
// Phase 1: matrix 35997 rows 20386 cols
[2021-05-19 07:45:11] [INFO ] Computed 1905 place invariants in 16732 ms
[2021-05-19 07:45:14] [INFO ] [Real]Absence check using 65 positive place invariants in 731 ms returned sat
[2021-05-19 07:45:15] [INFO ] [Real]Absence check using 65 positive and 1840 generalized place invariants in 1036 ms returned sat
[2021-05-19 07:45:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:45:56] [INFO ] [Real]Absence check using state equation in 40926 ms returned unknown
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 20386 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20386/20386 places, 37563/37563 transitions.
Applied a total of 0 rules in 1368 ms. Remains 20386 /20386 variables (removed 0) and now considering 37563/37563 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 20386/20386 places, 37563/37563 transitions.
Starting structural reductions, iteration 0 : 20386/20386 places, 37563/37563 transitions.
Applied a total of 0 rules in 1434 ms. Remains 20386 /20386 variables (removed 0) and now considering 37563/37563 (removed 0) transitions.
[2021-05-19 07:45:59] [INFO ] Flow matrix only has 35997 transitions (discarded 1566 similar events)
// Phase 1: matrix 35997 rows 20386 cols
[2021-05-19 07:46:16] [INFO ] Computed 1905 place invariants in 17312 ms
[2021-05-19 07:46:18] [INFO ] Implicit Places using invariants in 19484 ms returned []
Implicit Place search using SMT only with invariants took 19485 ms to find 0 implicit places.
[2021-05-19 07:46:18] [INFO ] Flow matrix only has 35997 transitions (discarded 1566 similar events)
// Phase 1: matrix 35997 rows 20386 cols
[2021-05-19 07:46:38] [INFO ] Computed 1905 place invariants in 19962 ms
[2021-05-19 07:46:40] [INFO ] Dead Transitions using invariants and state equation in 21706 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20386/20386 places, 37563/37563 transitions.
Ending property specific reduction for gen-UpperBounds-03 in 201063 ms.
Starting property specific reduction for gen-UpperBounds-12
Normalized transition count is 35997 out of 37563 initially.
// Phase 1: matrix 35997 rows 20386 cols
[2021-05-19 07:46:56] [INFO ] Computed 1905 place invariants in 16003 ms
Incomplete random walk after 10000 steps, including 148 resets, run finished after 1257 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
[2021-05-19 07:46:58] [INFO ] Flow matrix only has 35997 transitions (discarded 1566 similar events)
// Phase 1: matrix 35997 rows 20386 cols
[2021-05-19 07:47:15] [INFO ] Computed 1905 place invariants in 17171 ms
[2021-05-19 07:47:18] [INFO ] [Real]Absence check using 65 positive place invariants in 741 ms returned sat
[2021-05-19 07:47:19] [INFO ] [Real]Absence check using 65 positive and 1840 generalized place invariants in 1040 ms returned sat
[2021-05-19 07:47:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:47: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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
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:446)
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) : [1] Max seen :[0]
Support contains 1 out of 20386 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20386/20386 places, 37563/37563 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 20386 transition count 37562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 20385 transition count 37562
Applied a total of 2 rules in 2827 ms. Remains 20385 /20386 variables (removed 1) and now considering 37562/37563 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 20385/20386 places, 37562/37563 transitions.
Normalized transition count is 35996 out of 37562 initially.
// Phase 1: matrix 35996 rows 20385 cols
[2021-05-19 07:47:39] [INFO ] Computed 1905 place invariants in 16310 ms
Interrupted random walk after 232283 steps, including 3440 resets, run timeout after 30001 ms. (steps per millisecond=7 ) properties seen :{}
Interrupted Best-First random walk after 330184 steps, including 490 resets, run timeout after 5001 ms. (steps per millisecond=66 ) properties seen :{}
[2021-05-19 07:48:14] [INFO ] Flow matrix only has 35996 transitions (discarded 1566 similar events)
// Phase 1: matrix 35996 rows 20385 cols
[2021-05-19 07:48:34] [INFO ] Computed 1905 place invariants in 20090 ms
[2021-05-19 07:48:37] [INFO ] [Real]Absence check using 65 positive place invariants in 750 ms returned sat
[2021-05-19 07:48:38] [INFO ] [Real]Absence check using 65 positive and 1840 generalized place invariants in 1121 ms returned sat
[2021-05-19 07:48:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:49:19] [INFO ] [Real]Absence check using state equation in 40741 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 20385 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20385/20385 places, 37562/37562 transitions.
Applied a total of 0 rules in 1477 ms. Remains 20385 /20385 variables (removed 0) and now considering 37562/37562 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 20385/20385 places, 37562/37562 transitions.
Starting structural reductions, iteration 0 : 20385/20385 places, 37562/37562 transitions.
Applied a total of 0 rules in 1469 ms. Remains 20385 /20385 variables (removed 0) and now considering 37562/37562 (removed 0) transitions.
[2021-05-19 07:49:22] [INFO ] Flow matrix only has 35996 transitions (discarded 1566 similar events)
// Phase 1: matrix 35996 rows 20385 cols
[2021-05-19 07:49:39] [INFO ] Computed 1905 place invariants in 17057 ms
[2021-05-19 07:49:41] [INFO ] Implicit Places using invariants in 18940 ms returned []
Implicit Place search using SMT only with invariants took 18942 ms to find 0 implicit places.
[2021-05-19 07:49:41] [INFO ] Flow matrix only has 35996 transitions (discarded 1566 similar events)
// Phase 1: matrix 35996 rows 20385 cols
[2021-05-19 07:50:02] [INFO ] Computed 1905 place invariants in 20563 ms
[2021-05-19 07:50:03] [INFO ] Dead Transitions using invariants and state equation in 22382 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20385/20385 places, 37562/37562 transitions.
Ending property specific reduction for gen-UpperBounds-12 in 203347 ms.
[2021-05-19 07:50:06] [INFO ] Flatten gal took : 2414 ms
[2021-05-19 07:50:08] [INFO ] Applying decomposition
[2021-05-19 07:50:10] [INFO ] Flatten gal took : 2097 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/graph15290208804405592417.txt, -o, /tmp/graph15290208804405592417.bin, -w, /tmp/graph15290208804405592417.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/graph15290208804405592417.bin, -l, -1, -v, -w, /tmp/graph15290208804405592417.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 07:50:14] [INFO ] Decomposing Gal with order
[2021-05-19 07:50:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 07:51:17] [INFO ] Removed a total of 65622 redundant transitions.
[2021-05-19 07:51:25] [INFO ] Flatten gal took : 60688 ms
[2021-05-19 07:51:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 41004 labels/synchronizations in 15108 ms.
[2021-05-19 07:51:54] [INFO ] Time to serialize gal into /tmp/UpperBounds10984599343467101206.gal : 430 ms
[2021-05-19 07:51:54] [INFO ] Time to serialize properties into /tmp/UpperBounds14961351407252761728.prop : 2 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/UpperBounds10984599343467101206.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds14961351407252761728.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/UpperBounds10984599343467101206.gal -t CGAL -reachable-file /tmp/UpperBounds14961351407252761728.prop --nowitness
Loading property file /tmp/UpperBounds14961351407252761728.prop.
ITS-tools command line returned an error code 137
[2021-05-19 08:08:31] [INFO ] Flatten gal took : 4195 ms
[2021-05-19 08:08:31] [INFO ] Time to serialize gal into /tmp/UpperBounds13670172515097051868.gal : 192 ms
[2021-05-19 08:08:31] [INFO ] Time to serialize properties into /tmp/UpperBounds4532484994749146406.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/UpperBounds13670172515097051868.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds4532484994749146406.prop, --nowitness, --gen-order, FOLLOW], 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/UpperBounds13670172515097051868.gal -t CGAL -reachable-file /tmp/UpperBounds4532484994749146406.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds4532484994749146406.prop.

BK_TIME_CONFINEMENT_REACHED

--------------------
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="MultiCrashLeafsetExtension-PT-S32C11"
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-4028"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S32C11, 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 r292-tall-162124157000787"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S32C11.tgz
mv MultiCrashLeafsetExtension-PT-S32C11 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 ;