Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690300397.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is BugTracking-PT-q8m004, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690300397
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K Feb 26 07:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 07:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 07:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 07:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 08:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 26 08:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 08:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 08:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 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 BugTracking-PT-q8m004-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678352645978

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m004
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-09 09:04:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 09:04:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 09:04:09] [INFO ] Load time of PNML (sax parser for PT used): 703 ms
[2023-03-09 09:04:09] [INFO ] Transformed 754 places.
[2023-03-09 09:04:09] [INFO ] Transformed 27370 transitions.
[2023-03-09 09:04:09] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 871 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 474 places in 128 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m004-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 3729 out of 3904 initially.
// Phase 1: matrix 3729 rows 280 cols
[2023-03-09 09:04:09] [INFO ] Computed 10 place invariants in 52 ms
Incomplete random walk after 10000 steps, including 96 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 6) seen :4
FORMULA BugTracking-PT-q8m004-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :1
FORMULA BugTracking-PT-q8m004-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
[2023-03-09 09:04:09] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2023-03-09 09:04:09] [INFO ] Computed 10 place invariants in 17 ms
[2023-03-09 09:04:10] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-09 09:04:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:04:11] [INFO ] [Real]Absence check using state equation in 916 ms returned sat
[2023-03-09 09:04:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:04:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-09 09:04:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:04:11] [INFO ] [Nat]Absence check using state equation in 572 ms returned sat
[2023-03-09 09:04:11] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-09 09:04:12] [INFO ] [Nat]Added 303 Read/Feed constraints in 237 ms returned sat
[2023-03-09 09:04:12] [INFO ] Deduced a trap composed of 61 places in 472 ms of which 21 ms to minimize.
[2023-03-09 09:04:13] [INFO ] Deduced a trap composed of 57 places in 475 ms of which 1 ms to minimize.
[2023-03-09 09:04:15] [INFO ] Deduced a trap composed of 58 places in 1767 ms of which 1 ms to minimize.
[2023-03-09 09:04:15] [INFO ] Deduced a trap composed of 47 places in 473 ms of which 2 ms to minimize.
[2023-03-09 09:04:16] [INFO ] Deduced a trap composed of 53 places in 572 ms of which 1 ms to minimize.
[2023-03-09 09:04:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 09:04:16] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-09 09:04:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:04:17] [INFO ] [Real]Absence check using state equation in 586 ms returned sat
[2023-03-09 09:04:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:04:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-09 09:04:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:04:17] [INFO ] [Nat]Absence check using state equation in 567 ms returned sat
[2023-03-09 09:04:18] [INFO ] [Nat]Added 303 Read/Feed constraints in 394 ms returned sat
[2023-03-09 09:04:18] [INFO ] Deduced a trap composed of 23 places in 430 ms of which 1 ms to minimize.
[2023-03-09 09:04:19] [INFO ] Deduced a trap composed of 15 places in 258 ms of which 0 ms to minimize.
[2023-03-09 09:04:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1003 ms
[2023-03-09 09:04:19] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 391 ms.
[2023-03-09 09:04:20] [INFO ] Added : 11 causal constraints over 3 iterations in 1298 ms. Result :sat
[2023-03-09 09:04:20] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-09 09:04:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:04:21] [INFO ] [Real]Absence check using state equation in 1040 ms returned sat
[2023-03-09 09:04:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:04:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 75 ms returned sat
[2023-03-09 09:04:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:04:24] [INFO ] [Nat]Absence check using state equation in 1865 ms returned sat
[2023-03-09 09:04:24] [INFO ] [Nat]Added 303 Read/Feed constraints in 210 ms returned sat
[2023-03-09 09:04:25] [INFO ] Deduced a trap composed of 31 places in 767 ms of which 24 ms to minimize.
[2023-03-09 09:04:25] [INFO ] Deduced a trap composed of 37 places in 435 ms of which 0 ms to minimize.
[2023-03-09 09:04:26] [INFO ] Deduced a trap composed of 19 places in 324 ms of which 1 ms to minimize.
[2023-03-09 09:04:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1897 ms
[2023-03-09 09:04:26] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 319 ms.
[2023-03-09 09:04:27] [INFO ] Added : 6 causal constraints over 2 iterations in 833 ms. Result :sat
[2023-03-09 09:04:27] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-09 09:04:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:04:27] [INFO ] [Real]Absence check using state equation in 722 ms returned sat
[2023-03-09 09:04:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:04:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-09 09:04:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:04:28] [INFO ] [Nat]Absence check using state equation in 923 ms returned sat
[2023-03-09 09:04:29] [INFO ] [Nat]Added 303 Read/Feed constraints in 301 ms returned sat
[2023-03-09 09:04:29] [INFO ] Deduced a trap composed of 31 places in 523 ms of which 0 ms to minimize.
[2023-03-09 09:04:30] [INFO ] Deduced a trap composed of 14 places in 500 ms of which 1 ms to minimize.
[2023-03-09 09:04:31] [INFO ] Deduced a trap composed of 57 places in 547 ms of which 0 ms to minimize.
[2023-03-09 09:04:31] [INFO ] Deduced a trap composed of 95 places in 511 ms of which 1 ms to minimize.
[2023-03-09 09:04:32] [INFO ] Deduced a trap composed of 64 places in 455 ms of which 0 ms to minimize.
[2023-03-09 09:04:32] [INFO ] Deduced a trap composed of 82 places in 504 ms of which 0 ms to minimize.
[2023-03-09 09:04:33] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1, -1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 464 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 465 ms. Remains : 269/280 places, 3871/3904 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:04:33] [INFO ] Computed 8 place invariants in 38 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6222 ms. (steps per millisecond=160 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1947 ms. (steps per millisecond=513 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1942 ms. (steps per millisecond=514 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1869 ms. (steps per millisecond=535 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1846 ms. (steps per millisecond=541 ) properties (out of 4) seen :0
[2023-03-09 09:04:47] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:04:47] [INFO ] Computed 8 place invariants in 62 ms
[2023-03-09 09:04:47] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2023-03-09 09:04:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:04:48] [INFO ] [Real]Absence check using state equation in 631 ms returned sat
[2023-03-09 09:04:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:04:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 09:04:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:04:48] [INFO ] [Nat]Absence check using state equation in 495 ms returned sat
[2023-03-09 09:04:49] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:04:49] [INFO ] [Nat]Added 283 Read/Feed constraints in 200 ms returned sat
[2023-03-09 09:04:49] [INFO ] Deduced a trap composed of 17 places in 425 ms of which 1 ms to minimize.
[2023-03-09 09:04:50] [INFO ] Deduced a trap composed of 26 places in 427 ms of which 1 ms to minimize.
[2023-03-09 09:04:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1147 ms
[2023-03-09 09:04:50] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 316 ms.
[2023-03-09 09:04:51] [INFO ] Added : 2 causal constraints over 1 iterations in 698 ms. Result :sat
[2023-03-09 09:04:51] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 09:04:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:04:51] [INFO ] [Real]Absence check using state equation in 564 ms returned sat
[2023-03-09 09:04:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:04:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 09:04:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:04:52] [INFO ] [Nat]Absence check using state equation in 658 ms returned sat
[2023-03-09 09:04:52] [INFO ] [Nat]Added 283 Read/Feed constraints in 265 ms returned sat
[2023-03-09 09:04:53] [INFO ] Deduced a trap composed of 57 places in 318 ms of which 1 ms to minimize.
[2023-03-09 09:04:53] [INFO ] Deduced a trap composed of 10 places in 302 ms of which 1 ms to minimize.
[2023-03-09 09:04:54] [INFO ] Deduced a trap composed of 54 places in 307 ms of which 0 ms to minimize.
[2023-03-09 09:04:54] [INFO ] Deduced a trap composed of 55 places in 311 ms of which 1 ms to minimize.
[2023-03-09 09:04:54] [INFO ] Deduced a trap composed of 54 places in 286 ms of which 1 ms to minimize.
[2023-03-09 09:04:55] [INFO ] Deduced a trap composed of 68 places in 294 ms of which 0 ms to minimize.
[2023-03-09 09:04:55] [INFO ] Deduced a trap composed of 54 places in 280 ms of which 0 ms to minimize.
[2023-03-09 09:04:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2841 ms
[2023-03-09 09:04:56] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 348 ms.
[2023-03-09 09:04:56] [INFO ] Added : 5 causal constraints over 1 iterations in 781 ms. Result :sat
[2023-03-09 09:04:56] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 09:04:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:04:57] [INFO ] [Real]Absence check using state equation in 647 ms returned sat
[2023-03-09 09:04:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:04:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 09:04:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:04:58] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2023-03-09 09:04:58] [INFO ] [Nat]Added 283 Read/Feed constraints in 281 ms returned sat
[2023-03-09 09:04:58] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 304 ms.
[2023-03-09 09:04:59] [INFO ] Added : 4 causal constraints over 1 iterations in 776 ms. Result :sat
[2023-03-09 09:04:59] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 09:04:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:05:00] [INFO ] [Real]Absence check using state equation in 671 ms returned sat
[2023-03-09 09:05:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:05:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 09:05:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:05:01] [INFO ] [Nat]Absence check using state equation in 592 ms returned sat
[2023-03-09 09:05:01] [INFO ] [Nat]Added 283 Read/Feed constraints in 299 ms returned sat
[2023-03-09 09:05:01] [INFO ] Deduced a trap composed of 31 places in 576 ms of which 1 ms to minimize.
[2023-03-09 09:05:02] [INFO ] Deduced a trap composed of 28 places in 695 ms of which 1 ms to minimize.
[2023-03-09 09:05:03] [INFO ] Deduced a trap composed of 99 places in 449 ms of which 0 ms to minimize.
[2023-03-09 09:05:04] [INFO ] Deduced a trap composed of 39 places in 621 ms of which 1 ms to minimize.
[2023-03-09 09:05:04] [INFO ] Deduced a trap composed of 91 places in 704 ms of which 0 ms to minimize.
[2023-03-09 09:05:05] [INFO ] Deduced a trap composed of 95 places in 604 ms of which 1 ms to minimize.
[2023-03-09 09:05:06] [INFO ] Deduced a trap composed of 76 places in 416 ms of which 0 ms to minimize.
[2023-03-09 09:05:06] [INFO ] Deduced a trap composed of 44 places in 537 ms of which 1 ms to minimize.
[2023-03-09 09:05:07] [INFO ] Deduced a trap composed of 68 places in 403 ms of which 1 ms to minimize.
[2023-03-09 09:05:08] [INFO ] Deduced a trap composed of 23 places in 565 ms of which 5 ms to minimize.
[2023-03-09 09:05:08] [INFO ] Deduced a trap composed of 47 places in 356 ms of which 2 ms to minimize.
[2023-03-09 09:05:09] [INFO ] Deduced a trap composed of 62 places in 354 ms of which 1 ms to minimize.
[2023-03-09 09:05:09] [INFO ] Deduced a trap composed of 90 places in 452 ms of which 0 ms to minimize.
[2023-03-09 09:05:10] [INFO ] Deduced a trap composed of 42 places in 412 ms of which 1 ms to minimize.
[2023-03-09 09:05:10] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 8963 ms
[2023-03-09 09:05:10] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 298 ms.
[2023-03-09 09:05:11] [INFO ] Deduced a trap composed of 54 places in 409 ms of which 1 ms to minimize.
[2023-03-09 09:05:12] [INFO ] Deduced a trap composed of 69 places in 370 ms of which 0 ms to minimize.
[2023-03-09 09:05:12] [INFO ] Deduced a trap composed of 36 places in 427 ms of which 1 ms to minimize.
[2023-03-09 09:05:13] [INFO ] Deduced a trap composed of 57 places in 308 ms of which 0 ms to minimize.
[2023-03-09 09:05:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2211 ms
[2023-03-09 09:05:13] [INFO ] Added : 8 causal constraints over 3 iterations in 3451 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, -1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 85 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 84 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-09 09:05:14] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:05:14] [INFO ] Invariant cache hit.
[2023-03-09 09:05:15] [INFO ] Implicit Places using invariants in 855 ms returned []
[2023-03-09 09:05:15] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:05:15] [INFO ] Invariant cache hit.
[2023-03-09 09:05:15] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:05:18] [INFO ] Implicit Places using invariants and state equation in 3900 ms returned []
Implicit Place search using SMT with State Equation took 4783 ms to find 0 implicit places.
[2023-03-09 09:05:19] [INFO ] Redundant transitions in 423 ms returned []
[2023-03-09 09:05:19] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:05:19] [INFO ] Invariant cache hit.
[2023-03-09 09:05:20] [INFO ] Dead Transitions using invariants and state equation in 1178 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6495 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting property specific reduction for BugTracking-PT-q8m004-UpperBounds-01
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:05:20] [INFO ] Computed 8 place invariants in 29 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
[2023-03-09 09:05:20] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:05:20] [INFO ] Computed 8 place invariants in 17 ms
[2023-03-09 09:05:20] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 09:05:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:05:21] [INFO ] [Real]Absence check using state equation in 552 ms returned sat
[2023-03-09 09:05:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:05:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 09:05:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:05:22] [INFO ] [Nat]Absence check using state equation in 573 ms returned sat
[2023-03-09 09:05:22] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:05:22] [INFO ] [Nat]Added 283 Read/Feed constraints in 303 ms returned sat
[2023-03-09 09:05:22] [INFO ] Deduced a trap composed of 17 places in 376 ms of which 0 ms to minimize.
[2023-03-09 09:05:23] [INFO ] Deduced a trap composed of 26 places in 386 ms of which 0 ms to minimize.
[2023-03-09 09:05:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1108 ms
[2023-03-09 09:05:23] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 338 ms.
[2023-03-09 09:05:24] [INFO ] Added : 2 causal constraints over 1 iterations in 770 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 170 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:05:24] [INFO ] Computed 8 place invariants in 23 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6917 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1881 ms. (steps per millisecond=531 ) properties (out of 1) seen :0
[2023-03-09 09:05:33] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:05:33] [INFO ] Computed 8 place invariants in 41 ms
[2023-03-09 09:05:33] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 09:05:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:05:34] [INFO ] [Real]Absence check using state equation in 497 ms returned sat
[2023-03-09 09:05:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:05:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 09:05:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:05:34] [INFO ] [Nat]Absence check using state equation in 557 ms returned sat
[2023-03-09 09:05:34] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:05:35] [INFO ] [Nat]Added 283 Read/Feed constraints in 203 ms returned sat
[2023-03-09 09:05:35] [INFO ] Deduced a trap composed of 17 places in 694 ms of which 1 ms to minimize.
[2023-03-09 09:05:36] [INFO ] Deduced a trap composed of 26 places in 469 ms of which 1 ms to minimize.
[2023-03-09 09:05:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1459 ms
[2023-03-09 09:05:36] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 311 ms.
[2023-03-09 09:05:37] [INFO ] Added : 2 causal constraints over 1 iterations in 744 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 70 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 71 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-09 09:05:37] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:05:37] [INFO ] Invariant cache hit.
[2023-03-09 09:05:38] [INFO ] Implicit Places using invariants in 660 ms returned []
[2023-03-09 09:05:38] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:05:38] [INFO ] Invariant cache hit.
[2023-03-09 09:05:39] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:05:41] [INFO ] Implicit Places using invariants and state equation in 2681 ms returned []
Implicit Place search using SMT with State Equation took 3347 ms to find 0 implicit places.
[2023-03-09 09:05:41] [INFO ] Redundant transitions in 255 ms returned []
[2023-03-09 09:05:41] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:05:41] [INFO ] Invariant cache hit.
[2023-03-09 09:05:42] [INFO ] Dead Transitions using invariants and state equation in 1292 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4999 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m004-UpperBounds-01 in 22066 ms.
Starting property specific reduction for BugTracking-PT-q8m004-UpperBounds-08
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:05:42] [INFO ] Computed 8 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
[2023-03-09 09:05:42] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:05:42] [INFO ] Computed 8 place invariants in 36 ms
[2023-03-09 09:05:42] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 09:05:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:05:43] [INFO ] [Real]Absence check using state equation in 499 ms returned sat
[2023-03-09 09:05:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:05:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 09:05:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:05:43] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2023-03-09 09:05:44] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:05:44] [INFO ] [Nat]Added 283 Read/Feed constraints in 195 ms returned sat
[2023-03-09 09:05:44] [INFO ] Deduced a trap composed of 57 places in 299 ms of which 2 ms to minimize.
[2023-03-09 09:05:45] [INFO ] Deduced a trap composed of 10 places in 470 ms of which 0 ms to minimize.
[2023-03-09 09:05:45] [INFO ] Deduced a trap composed of 54 places in 382 ms of which 0 ms to minimize.
[2023-03-09 09:05:46] [INFO ] Deduced a trap composed of 55 places in 323 ms of which 1 ms to minimize.
[2023-03-09 09:05:46] [INFO ] Deduced a trap composed of 54 places in 374 ms of which 1 ms to minimize.
[2023-03-09 09:05:47] [INFO ] Deduced a trap composed of 68 places in 465 ms of which 1 ms to minimize.
[2023-03-09 09:05:47] [INFO ] Deduced a trap composed of 54 places in 315 ms of which 1 ms to minimize.
[2023-03-09 09:05:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3433 ms
[2023-03-09 09:05:47] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 347 ms.
[2023-03-09 09:05:48] [INFO ] Added : 5 causal constraints over 1 iterations in 820 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 101 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:05:48] [INFO ] Computed 8 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6654 ms. (steps per millisecond=150 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1987 ms. (steps per millisecond=503 ) properties (out of 1) seen :0
[2023-03-09 09:05:57] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:05:57] [INFO ] Computed 8 place invariants in 22 ms
[2023-03-09 09:05:57] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-09 09:05:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:05:58] [INFO ] [Real]Absence check using state equation in 630 ms returned sat
[2023-03-09 09:05:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:05:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 09:05:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:05:58] [INFO ] [Nat]Absence check using state equation in 586 ms returned sat
[2023-03-09 09:05:58] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:05:59] [INFO ] [Nat]Added 283 Read/Feed constraints in 254 ms returned sat
[2023-03-09 09:05:59] [INFO ] Deduced a trap composed of 57 places in 316 ms of which 1 ms to minimize.
[2023-03-09 09:05:59] [INFO ] Deduced a trap composed of 10 places in 312 ms of which 2 ms to minimize.
[2023-03-09 09:06:00] [INFO ] Deduced a trap composed of 54 places in 311 ms of which 1 ms to minimize.
[2023-03-09 09:06:00] [INFO ] Deduced a trap composed of 55 places in 318 ms of which 0 ms to minimize.
[2023-03-09 09:06:01] [INFO ] Deduced a trap composed of 54 places in 316 ms of which 0 ms to minimize.
[2023-03-09 09:06:01] [INFO ] Deduced a trap composed of 68 places in 303 ms of which 0 ms to minimize.
[2023-03-09 09:06:01] [INFO ] Deduced a trap composed of 54 places in 315 ms of which 0 ms to minimize.
[2023-03-09 09:06:02] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3056 ms
[2023-03-09 09:06:02] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 336 ms.
[2023-03-09 09:06:02] [INFO ] Added : 5 causal constraints over 1 iterations in 755 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 79 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 68 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-09 09:06:03] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:06:03] [INFO ] Invariant cache hit.
[2023-03-09 09:06:03] [INFO ] Implicit Places using invariants in 462 ms returned []
[2023-03-09 09:06:03] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:06:03] [INFO ] Invariant cache hit.
[2023-03-09 09:06:04] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:06:05] [INFO ] Implicit Places using invariants and state equation in 2304 ms returned []
Implicit Place search using SMT with State Equation took 2774 ms to find 0 implicit places.
[2023-03-09 09:06:06] [INFO ] Redundant transitions in 189 ms returned []
[2023-03-09 09:06:06] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:06:06] [INFO ] Invariant cache hit.
[2023-03-09 09:06:07] [INFO ] Dead Transitions using invariants and state equation in 1253 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4299 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m004-UpperBounds-08 in 24675 ms.
Starting property specific reduction for BugTracking-PT-q8m004-UpperBounds-10
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:06:07] [INFO ] Computed 8 place invariants in 8 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
[2023-03-09 09:06:07] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:06:07] [INFO ] Computed 8 place invariants in 20 ms
[2023-03-09 09:06:07] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 09:06:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:06:08] [INFO ] [Real]Absence check using state equation in 517 ms returned sat
[2023-03-09 09:06:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:06:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 09:06:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:06:08] [INFO ] [Nat]Absence check using state equation in 594 ms returned sat
[2023-03-09 09:06:08] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:06:09] [INFO ] [Nat]Added 283 Read/Feed constraints in 294 ms returned sat
[2023-03-09 09:06:09] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 334 ms.
[2023-03-09 09:06:10] [INFO ] Added : 4 causal constraints over 1 iterations in 797 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 91 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:06:10] [INFO ] Computed 8 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 3 resets, run finished after 6252 ms. (steps per millisecond=159 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 1885 ms. (steps per millisecond=530 ) properties (out of 1) seen :0
[2023-03-09 09:06:18] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:06:18] [INFO ] Computed 8 place invariants in 23 ms
[2023-03-09 09:06:18] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 09:06:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:06:19] [INFO ] [Real]Absence check using state equation in 580 ms returned sat
[2023-03-09 09:06:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:06:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 09:06:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:06:19] [INFO ] [Nat]Absence check using state equation in 522 ms returned sat
[2023-03-09 09:06:19] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:06:20] [INFO ] [Nat]Added 283 Read/Feed constraints in 357 ms returned sat
[2023-03-09 09:06:20] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 321 ms.
[2023-03-09 09:06:21] [INFO ] Added : 4 causal constraints over 1 iterations in 802 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 62 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 60 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-09 09:06:21] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:06:21] [INFO ] Invariant cache hit.
[2023-03-09 09:06:21] [INFO ] Implicit Places using invariants in 495 ms returned []
[2023-03-09 09:06:21] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:06:21] [INFO ] Invariant cache hit.
[2023-03-09 09:06:22] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:06:24] [INFO ] Implicit Places using invariants and state equation in 3013 ms returned []
Implicit Place search using SMT with State Equation took 3511 ms to find 0 implicit places.
[2023-03-09 09:06:25] [INFO ] Redundant transitions in 171 ms returned []
[2023-03-09 09:06:25] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:06:25] [INFO ] Invariant cache hit.
[2023-03-09 09:06:26] [INFO ] Dead Transitions using invariants and state equation in 1137 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4888 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m004-UpperBounds-10 in 18902 ms.
Starting property specific reduction for BugTracking-PT-q8m004-UpperBounds-13
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:06:26] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
[2023-03-09 09:06:26] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:06:26] [INFO ] Computed 8 place invariants in 23 ms
[2023-03-09 09:06:26] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 09:06:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:06:26] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2023-03-09 09:06:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:06:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 09:06:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:06:27] [INFO ] [Nat]Absence check using state equation in 582 ms returned sat
[2023-03-09 09:06:27] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:06:27] [INFO ] [Nat]Added 283 Read/Feed constraints in 324 ms returned sat
[2023-03-09 09:06:28] [INFO ] Deduced a trap composed of 31 places in 486 ms of which 1 ms to minimize.
[2023-03-09 09:06:29] [INFO ] Deduced a trap composed of 28 places in 444 ms of which 1 ms to minimize.
[2023-03-09 09:06:29] [INFO ] Deduced a trap composed of 99 places in 455 ms of which 1 ms to minimize.
[2023-03-09 09:06:30] [INFO ] Deduced a trap composed of 39 places in 455 ms of which 3 ms to minimize.
[2023-03-09 09:06:30] [INFO ] Deduced a trap composed of 91 places in 429 ms of which 0 ms to minimize.
[2023-03-09 09:06:31] [INFO ] Deduced a trap composed of 95 places in 447 ms of which 0 ms to minimize.
[2023-03-09 09:06:31] [INFO ] Deduced a trap composed of 76 places in 426 ms of which 0 ms to minimize.
[2023-03-09 09:06:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 67 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:06:32] [INFO ] Computed 8 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 4 resets, run finished after 4771 ms. (steps per millisecond=209 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1690 ms. (steps per millisecond=591 ) properties (out of 1) seen :0
[2023-03-09 09:06:38] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-09 09:06:38] [INFO ] Computed 8 place invariants in 21 ms
[2023-03-09 09:06:38] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-09 09:06:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:06:39] [INFO ] [Real]Absence check using state equation in 579 ms returned sat
[2023-03-09 09:06:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:06:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-09 09:06:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:06:39] [INFO ] [Nat]Absence check using state equation in 507 ms returned sat
[2023-03-09 09:06:39] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:06:40] [INFO ] [Nat]Added 283 Read/Feed constraints in 320 ms returned sat
[2023-03-09 09:06:40] [INFO ] Deduced a trap composed of 31 places in 438 ms of which 1 ms to minimize.
[2023-03-09 09:06:41] [INFO ] Deduced a trap composed of 28 places in 424 ms of which 1 ms to minimize.
[2023-03-09 09:06:41] [INFO ] Deduced a trap composed of 99 places in 405 ms of which 0 ms to minimize.
[2023-03-09 09:06:42] [INFO ] Deduced a trap composed of 39 places in 448 ms of which 1 ms to minimize.
[2023-03-09 09:06:42] [INFO ] Deduced a trap composed of 91 places in 431 ms of which 2 ms to minimize.
[2023-03-09 09:06:43] [INFO ] Deduced a trap composed of 95 places in 403 ms of which 2 ms to minimize.
[2023-03-09 09:06:44] [INFO ] Deduced a trap composed of 76 places in 358 ms of which 0 ms to minimize.
[2023-03-09 09:06:44] [INFO ] Deduced a trap composed of 44 places in 422 ms of which 1 ms to minimize.
[2023-03-09 09:06:45] [INFO ] Deduced a trap composed of 68 places in 377 ms of which 1 ms to minimize.
[2023-03-09 09:06:45] [INFO ] Deduced a trap composed of 23 places in 414 ms of which 1 ms to minimize.
[2023-03-09 09:06:46] [INFO ] Deduced a trap composed of 47 places in 380 ms of which 0 ms to minimize.
[2023-03-09 09:06:46] [INFO ] Deduced a trap composed of 62 places in 344 ms of which 0 ms to minimize.
[2023-03-09 09:06:47] [INFO ] Deduced a trap composed of 90 places in 401 ms of which 1 ms to minimize.
[2023-03-09 09:06:47] [INFO ] Deduced a trap composed of 42 places in 396 ms of which 0 ms to minimize.
[2023-03-09 09:06:47] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 7617 ms
[2023-03-09 09:06:48] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 317 ms.
[2023-03-09 09:06:49] [INFO ] Deduced a trap composed of 54 places in 432 ms of which 1 ms to minimize.
[2023-03-09 09:06:49] [INFO ] Deduced a trap composed of 69 places in 363 ms of which 0 ms to minimize.
[2023-03-09 09:06:50] [INFO ] Deduced a trap composed of 36 places in 476 ms of which 0 ms to minimize.
[2023-03-09 09:06:50] [INFO ] Deduced a trap composed of 57 places in 385 ms of which 0 ms to minimize.
[2023-03-09 09:06:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2402 ms
[2023-03-09 09:06:51] [INFO ] Added : 8 causal constraints over 3 iterations in 3779 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 95 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 64 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-09 09:06:51] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:06:51] [INFO ] Invariant cache hit.
[2023-03-09 09:06:52] [INFO ] Implicit Places using invariants in 478 ms returned []
[2023-03-09 09:06:52] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:06:52] [INFO ] Invariant cache hit.
[2023-03-09 09:06:53] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-09 09:06:54] [INFO ] Implicit Places using invariants and state equation in 2291 ms returned []
Implicit Place search using SMT with State Equation took 2773 ms to find 0 implicit places.
[2023-03-09 09:06:54] [INFO ] Redundant transitions in 197 ms returned []
[2023-03-09 09:06:54] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-09 09:06:54] [INFO ] Invariant cache hit.
[2023-03-09 09:06:56] [INFO ] Dead Transitions using invariants and state equation in 1169 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4212 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m004-UpperBounds-13 in 29853 ms.
[2023-03-09 09:06:57] [INFO ] Flatten gal took : 841 ms
[2023-03-09 09:06:57] [INFO ] Applying decomposition
[2023-03-09 09:06:57] [INFO ] Flatten gal took : 257 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4612136103650005585.txt' '-o' '/tmp/graph4612136103650005585.bin' '-w' '/tmp/graph4612136103650005585.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4612136103650005585.bin' '-l' '-1' '-v' '-w' '/tmp/graph4612136103650005585.weights' '-q' '0' '-e' '0.001'
[2023-03-09 09:06:58] [INFO ] Decomposing Gal with order
[2023-03-09 09:06:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 09:06:59] [INFO ] Removed a total of 424 redundant transitions.
[2023-03-09 09:06:59] [INFO ] Flatten gal took : 482 ms
[2023-03-09 09:06:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 29 ms.
[2023-03-09 09:06:59] [INFO ] Time to serialize gal into /tmp/UpperBounds14326240228305899752.gal : 42 ms
[2023-03-09 09:06:59] [INFO ] Time to serialize properties into /tmp/UpperBounds8633748028547018749.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds14326240228305899752.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8633748028547018749.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds8633748028547018749.prop.
Detected timeout of ITS tools.
[2023-03-09 09:28:01] [INFO ] Flatten gal took : 1386 ms
[2023-03-09 09:28:01] [INFO ] Time to serialize gal into /tmp/UpperBounds4668309866537035440.gal : 174 ms
[2023-03-09 09:28:01] [INFO ] Time to serialize properties into /tmp/UpperBounds2169764863863121529.prop : 38 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4668309866537035440.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2169764863863121529.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds2169764863863121529.prop.
Detected timeout of ITS tools.
[2023-03-09 09:48:59] [INFO ] Flatten gal took : 829 ms
[2023-03-09 09:49:05] [INFO ] Input system was already deterministic with 3871 transitions.
[2023-03-09 09:49:05] [INFO ] Transformed 269 places.
[2023-03-09 09:49:05] [INFO ] Transformed 3871 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-09 09:49:05] [INFO ] Time to serialize gal into /tmp/UpperBounds13268735992628676403.gal : 54 ms
[2023-03-09 09:49:05] [INFO ] Time to serialize properties into /tmp/UpperBounds12486877060293736981.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds13268735992628676403.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12486877060293736981.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...351
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds12486877060293736981.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 4826100 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16177456 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is BugTracking-PT-q8m004, 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 r037-tajo-167813690300397"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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