java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/real-life/GuiTestExample.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-27 12:54:53,067 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-27 12:54:53,069 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-27 12:54:53,083 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-27 12:54:53,083 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-27 12:54:53,084 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-27 12:54:53,089 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-27 12:54:53,092 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-27 12:54:53,094 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-27 12:54:53,095 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-27 12:54:53,097 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-27 12:54:53,098 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-27 12:54:53,100 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-27 12:54:53,101 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-27 12:54:53,104 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-27 12:54:53,105 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-27 12:54:53,107 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-27 12:54:53,115 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-27 12:54:53,120 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-27 12:54:53,124 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-27 12:54:53,125 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-27 12:54:53,127 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-27 12:54:53,133 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-27 12:54:53,134 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-27 12:54:53,134 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-27 12:54:53,135 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-27 12:54:53,136 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-27 12:54:53,140 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-27 12:54:53,141 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-27 12:54:53,142 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-27 12:54:53,142 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-27 12:54:53,145 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-27 12:54:53,145 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-27 12:54:53,145 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-27 12:54:53,147 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-27 12:54:53,147 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-27 12:54:53,148 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-27 12:54:53,175 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-27 12:54:53,176 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-27 12:54:53,176 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-27 12:54:53,177 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-27 12:54:53,177 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-27 12:54:53,177 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-27 12:54:53,177 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-27 12:54:53,177 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-27 12:54:53,178 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-27 12:54:53,178 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-27 12:54:53,179 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-27 12:54:53,179 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-27 12:54:53,179 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-27 12:54:53,179 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-27 12:54:53,180 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-27 12:54:53,180 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-27 12:54:53,180 INFO L133 SettingsManager]: * Use SBE=true [2019-02-27 12:54:53,181 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-27 12:54:53,181 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-27 12:54:53,181 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-27 12:54:53,181 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-27 12:54:53,181 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-27 12:54:53,182 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-27 12:54:53,182 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-27 12:54:53,182 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-27 12:54:53,182 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-27 12:54:53,182 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-27 12:54:53,183 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-27 12:54:53,183 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-27 12:54:53,183 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-27 12:54:53,183 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-27 12:54:53,183 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-27 12:54:53,184 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-27 12:54:53,185 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-27 12:54:53,186 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-27 12:54:53,186 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-27 12:54:53,186 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-27 12:54:53,186 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-27 12:54:53,186 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-27 12:54:53,187 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-27 12:54:53,232 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-27 12:54:53,247 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-27 12:54:53,253 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-27 12:54:53,254 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-27 12:54:53,255 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-27 12:54:53,256 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GuiTestExample.bpl [2019-02-27 12:54:53,256 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GuiTestExample.bpl' [2019-02-27 12:54:53,355 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-27 12:54:53,357 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-27 12:54:53,358 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-27 12:54:53,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-27 12:54:53,358 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-27 12:54:53,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,393 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,410 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-27 12:54:53,411 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-27 12:54:53,411 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-27 12:54:53,506 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-27 12:54:53,507 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-27 12:54:53,507 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-27 12:54:53,507 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-27 12:54:53,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,561 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-27 12:54:53,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-27 12:54:53,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-27 12:54:53,571 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-27 12:54:53,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:54:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-27 12:54:53,652 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$3$$la$init$ra$$4885 given in one single declaration [2019-02-27 12:54:53,652 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$3$$la$init$ra$$4885 [2019-02-27 12:54:53,653 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$3$$la$init$ra$$4885 [2019-02-27 12:54:53,653 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$2$actionPerformed$4553 given in one single declaration [2019-02-27 12:54:53,653 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$2$actionPerformed$4553 [2019-02-27 12:54:53,653 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$2$actionPerformed$4553 [2019-02-27 12:54:53,654 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$3$actionPerformed$4886 given in one single declaration [2019-02-27 12:54:53,654 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$3$actionPerformed$4886 [2019-02-27 12:54:53,654 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$3$actionPerformed$4886 [2019-02-27 12:54:53,654 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$$la$init$ra$$1805 given in one single declaration [2019-02-27 12:54:53,655 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$$la$init$ra$$1805 [2019-02-27 12:54:53,656 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$$la$init$ra$$1805 [2019-02-27 12:54:53,656 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$1$$la$init$ra$$1802 given in one single declaration [2019-02-27 12:54:53,657 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$1$$la$init$ra$$1802 [2019-02-27 12:54:53,657 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$1$$la$init$ra$$1802 [2019-02-27 12:54:53,657 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.SwingUtilities$invokeLater$4940 [2019-02-27 12:54:53,657 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.JFrame$setLayout$1827 [2019-02-27 12:54:53,658 INFO L124 BoogieDeclarations]: Specification and implementation of procedure javax.swing.JButton$SimpleFrame2Cons$access$0$1806 given in one single declaration [2019-02-27 12:54:53,658 INFO L130 BoogieDeclarations]: Found specification of procedure javax.swing.JButton$SimpleFrame2Cons$access$0$1806 [2019-02-27 12:54:53,658 INFO L138 BoogieDeclarations]: Found implementation of procedure javax.swing.JButton$SimpleFrame2Cons$access$0$1806 [2019-02-27 12:54:53,659 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$2$$la$init$ra$$4552 given in one single declaration [2019-02-27 12:54:53,664 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$2$$la$init$ra$$4552 [2019-02-27 12:54:53,664 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$2$$la$init$ra$$4552 [2019-02-27 12:54:53,664 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Frame$setResizable$1858 [2019-02-27 12:54:53,664 INFO L124 BoogieDeclarations]: Specification and implementation of procedure java.awt.Dimension$java.awt.Toolkit$getScreenSize$3246 given in one single declaration [2019-02-27 12:54:53,665 INFO L130 BoogieDeclarations]: Found specification of procedure java.awt.Dimension$java.awt.Toolkit$getScreenSize$3246 [2019-02-27 12:54:53,665 INFO L138 BoogieDeclarations]: Found implementation of procedure java.awt.Dimension$java.awt.Toolkit$getScreenSize$3246 [2019-02-27 12:54:53,665 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$javax.swing.JFrame$$la$init$ra$$1809 given in one single declaration [2019-02-27 12:54:53,665 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.JFrame$$la$init$ra$$1809 [2019-02-27 12:54:53,665 INFO L138 BoogieDeclarations]: Found implementation of procedure void$javax.swing.JFrame$$la$init$ra$$1809 [2019-02-27 12:54:53,666 INFO L124 BoogieDeclarations]: Specification and implementation of procedure int$SimpleFrame2Cons$access$2$1808 given in one single declaration [2019-02-27 12:54:53,666 INFO L130 BoogieDeclarations]: Found specification of procedure int$SimpleFrame2Cons$access$2$1808 [2019-02-27 12:54:53,667 INFO L138 BoogieDeclarations]: Found implementation of procedure int$SimpleFrame2Cons$access$2$1808 [2019-02-27 12:54:53,667 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.JFrame$setDefaultCloseOperation$1816 [2019-02-27 12:54:53,667 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.AbstractButton$addActionListener$4123 [2019-02-27 12:54:53,667 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Window$setLocation$1913 [2019-02-27 12:54:53,667 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$4$$la$init$ra$$4887 given in one single declaration [2019-02-27 12:54:53,668 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$4$$la$init$ra$$4887 [2019-02-27 12:54:53,668 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$4$$la$init$ra$$4887 [2019-02-27 12:54:53,668 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$4$actionPerformed$4888 given in one single declaration [2019-02-27 12:54:53,668 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$4$actionPerformed$4888 [2019-02-27 12:54:53,668 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$4$actionPerformed$4888 [2019-02-27 12:54:53,669 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.AbstractButton$setEnabled$4131 [2019-02-27 12:54:53,670 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Window$setVisible$1918 [2019-02-27 12:54:53,671 INFO L130 BoogieDeclarations]: Found specification of procedure int$java.awt.Component$getHeight$2305 [2019-02-27 12:54:53,671 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Window$pack$1909 [2019-02-27 12:54:53,671 INFO L130 BoogieDeclarations]: Found specification of procedure java.awt.Toolkit$java.awt.Toolkit$getDefaultToolkit$3255 [2019-02-27 12:54:53,671 INFO L130 BoogieDeclarations]: Found specification of procedure int$java.awt.Component$getWidth$2304 [2019-02-27 12:54:53,671 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Frame$setTitle$1852 [2019-02-27 12:54:53,672 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$access$1$1807 given in one single declaration [2019-02-27 12:54:53,672 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$access$1$1807 [2019-02-27 12:54:53,673 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$access$1$1807 [2019-02-27 12:54:53,673 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.FlowLayout$$la$init$ra$$4889 [2019-02-27 12:54:53,673 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$1$run$1803 given in one single declaration [2019-02-27 12:54:53,673 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$1$run$1803 [2019-02-27 12:54:53,673 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$1$run$1803 [2019-02-27 12:54:53,674 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$main$1804 given in one single declaration [2019-02-27 12:54:53,675 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$main$1804 [2019-02-27 12:54:53,675 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$main$1804 [2019-02-27 12:54:53,675 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.JButton$$la$init$ra$$2558 [2019-02-27 12:54:53,675 INFO L124 BoogieDeclarations]: Specification and implementation of procedure $EFG_Procedure given in one single declaration [2019-02-27 12:54:53,676 INFO L130 BoogieDeclarations]: Found specification of procedure $EFG_Procedure [2019-02-27 12:54:53,676 INFO L138 BoogieDeclarations]: Found implementation of procedure $EFG_Procedure [2019-02-27 12:54:53,676 INFO L130 BoogieDeclarations]: Found specification of procedure java.awt.Component$java.awt.Container$add$2075 [2019-02-27 12:54:53,676 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.lang.Object$$la$init$ra$$38 [2019-02-27 12:54:54,087 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-27 12:54:54,262 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-27 12:54:54,357 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-27 12:54:54,462 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-27 12:54:55,095 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-27 12:54:55,111 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-27 12:54:55,124 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-27 12:54:55,138 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-27 12:54:55,143 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-27 12:54:55,168 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-27 12:54:55,205 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-27 12:54:56,096 INFO L278 CfgBuilder]: Using library mode [2019-02-27 12:54:56,097 INFO L286 CfgBuilder]: Removed 206 assue(true) statements. [2019-02-27 12:54:56,099 INFO L202 PluginConnector]: Adding new model GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.02 12:54:56 BoogieIcfgContainer [2019-02-27 12:54:56,099 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-27 12:54:56,100 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-27 12:54:56,100 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-27 12:54:56,103 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-27 12:54:56,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:54:53" (1/2) ... [2019-02-27 12:54:56,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d00434 and model type GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.02 12:54:56, skipping insertion in model container [2019-02-27 12:54:56,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.02 12:54:56" (2/2) ... [2019-02-27 12:54:56,107 INFO L112 eAbstractionObserver]: Analyzing ICFG GuiTestExample.bpl [2019-02-27 12:54:56,117 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-27 12:54:56,130 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 87 error locations. [2019-02-27 12:54:56,149 INFO L257 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2019-02-27 12:54:56,206 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-27 12:54:56,206 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-27 12:54:56,206 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-27 12:54:56,207 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-27 12:54:56,207 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-27 12:54:56,207 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-27 12:54:56,207 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-27 12:54:56,208 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-27 12:54:56,252 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states. [2019-02-27 12:54:56,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-27 12:54:56,260 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:54:56,261 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-27 12:54:56,266 INFO L423 AbstractCegarLoop]: === Iteration 1 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:54:56,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:54:56,273 INFO L82 PathProgramCache]: Analyzing trace with hash 10434, now seen corresponding path program 1 times [2019-02-27 12:54:56,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:54:56,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:54:56,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:54:56,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:54:56,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:54:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:54:56,455 INFO L273 TraceCheckUtils]: 0: Hoare triple {307#true} r09 := $param_0;$r110 := $fresh2;assume $fresh2 != $null; {309#(not (= void$SimpleFrame2Cons$main$1804_$r110 $null))} is VALID [2019-02-27 12:54:56,469 INFO L273 TraceCheckUtils]: 1: Hoare triple {309#(not (= void$SimpleFrame2Cons$main$1804_$r110 $null))} assume !($r110 != $null); {308#false} is VALID [2019-02-27 12:54:56,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:54:56,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-27 12:54:56,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-27 12:54:56,473 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-27 12:54:56,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-27 12:54:56,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:54:56,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-27 12:54:56,517 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:54:56,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-27 12:54:56,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-27 12:54:56,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-27 12:54:56,530 INFO L87 Difference]: Start difference. First operand 304 states. Second operand 3 states. [2019-02-27 12:54:57,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:54:57,787 INFO L93 Difference]: Finished difference Result 304 states and 306 transitions. [2019-02-27 12:54:57,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-27 12:54:57,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-27 12:54:57,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:54:57,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-27 12:54:57,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2019-02-27 12:54:57,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-27 12:54:57,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2019-02-27 12:54:57,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 306 transitions. [2019-02-27 12:54:58,264 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 306 edges. 306 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:54:58,296 INFO L225 Difference]: With dead ends: 304 [2019-02-27 12:54:58,296 INFO L226 Difference]: Without dead ends: 252 [2019-02-27 12:54:58,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-27 12:54:58,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-02-27 12:54:58,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2019-02-27 12:54:58,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:54:58,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 252 states. Second operand 252 states. [2019-02-27 12:54:58,653 INFO L74 IsIncluded]: Start isIncluded. First operand 252 states. Second operand 252 states. [2019-02-27 12:54:58,653 INFO L87 Difference]: Start difference. First operand 252 states. Second operand 252 states. [2019-02-27 12:54:58,653 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-27 12:54:58,675 INFO L93 Difference]: Finished difference Result 252 states and 257 transitions. [2019-02-27 12:54:58,675 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 257 transitions. [2019-02-27 12:54:58,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:54:58,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:54:58,679 INFO L74 IsIncluded]: Start isIncluded. First operand 252 states. Second operand 252 states. [2019-02-27 12:54:58,679 INFO L87 Difference]: Start difference. First operand 252 states. Second operand 252 states. [2019-02-27 12:54:58,679 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-27 12:54:58,696 INFO L93 Difference]: Finished difference Result 252 states and 257 transitions. [2019-02-27 12:54:58,697 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 257 transitions. [2019-02-27 12:54:58,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:54:58,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:54:58,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:54:58,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:54:58,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-02-27 12:54:58,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 257 transitions. [2019-02-27 12:54:58,713 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 257 transitions. Word has length 2 [2019-02-27 12:54:58,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:54:58,714 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 257 transitions. [2019-02-27 12:54:58,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-27 12:54:58,714 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 257 transitions. [2019-02-27 12:54:58,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-27 12:54:58,715 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:54:58,715 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-27 12:54:58,717 INFO L423 AbstractCegarLoop]: === Iteration 2 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:54:58,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:54:58,718 INFO L82 PathProgramCache]: Analyzing trace with hash 181753, now seen corresponding path program 1 times [2019-02-27 12:54:58,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:54:58,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:54:58,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:54:58,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:54:58,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:54:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:54:58,810 INFO L273 TraceCheckUtils]: 0: Hoare triple {1934#true} assume void$SimpleFrame2Cons$4$$la$init$ra$$4887$__this != $null; {1936#(not (= void$SimpleFrame2Cons$4$$la$init$ra$$4887_void$SimpleFrame2Cons$4$$la$init$ra$$4887$__this $null))} is VALID [2019-02-27 12:54:58,811 INFO L273 TraceCheckUtils]: 1: Hoare triple {1936#(not (= void$SimpleFrame2Cons$4$$la$init$ra$$4887_void$SimpleFrame2Cons$4$$la$init$ra$$4887$__this $null))} r0120 := void$SimpleFrame2Cons$4$$la$init$ra$$4887$__this;r1121 := void$SimpleFrame2Cons$4$$la$init$ra$$4887$param_0;SimpleFrame2Cons$SimpleFrame2Cons$4$this$0763 := r1121; {1937#(not (= $null void$SimpleFrame2Cons$4$$la$init$ra$$4887_r0120))} is VALID [2019-02-27 12:54:58,813 INFO L273 TraceCheckUtils]: 2: Hoare triple {1937#(not (= $null void$SimpleFrame2Cons$4$$la$init$ra$$4887_r0120))} assume !(r0120 != $null); {1935#false} is VALID [2019-02-27 12:54:58,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:54:58,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-27 12:54:58,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-27 12:54:58,814 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-27 12:54:58,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-27 12:54:58,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:54:58,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-27 12:54:58,842 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:54:58,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-27 12:54:58,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-27 12:54:58,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-27 12:54:58,843 INFO L87 Difference]: Start difference. First operand 252 states and 257 transitions. Second operand 4 states. [2019-02-27 12:54:59,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:54:59,689 INFO L93 Difference]: Finished difference Result 252 states and 257 transitions. [2019-02-27 12:54:59,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-27 12:54:59,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-27 12:54:59,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:54:59,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:54:59,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 257 transitions. [2019-02-27 12:54:59,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:54:59,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 257 transitions. [2019-02-27 12:54:59,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 257 transitions. [2019-02-27 12:54:59,984 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:54:59,991 INFO L225 Difference]: With dead ends: 252 [2019-02-27 12:54:59,991 INFO L226 Difference]: Without dead ends: 248 [2019-02-27 12:54:59,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-27 12:54:59,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-02-27 12:55:00,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2019-02-27 12:55:00,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:55:00,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 248 states. Second operand 248 states. [2019-02-27 12:55:00,071 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand 248 states. [2019-02-27 12:55:00,072 INFO L87 Difference]: Start difference. First operand 248 states. Second operand 248 states. [2019-02-27 12:55:00,072 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-27 12:55:00,083 INFO L93 Difference]: Finished difference Result 248 states and 254 transitions. [2019-02-27 12:55:00,084 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 254 transitions. [2019-02-27 12:55:00,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:00,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:00,086 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand 248 states. [2019-02-27 12:55:00,086 INFO L87 Difference]: Start difference. First operand 248 states. Second operand 248 states. [2019-02-27 12:55:00,086 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-27 12:55:00,098 INFO L93 Difference]: Finished difference Result 248 states and 254 transitions. [2019-02-27 12:55:00,098 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 254 transitions. [2019-02-27 12:55:00,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:00,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:00,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:55:00,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:55:00,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-02-27 12:55:00,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 254 transitions. [2019-02-27 12:55:00,109 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 254 transitions. Word has length 3 [2019-02-27 12:55:00,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:55:00,109 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 254 transitions. [2019-02-27 12:55:00,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-27 12:55:00,109 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 254 transitions. [2019-02-27 12:55:00,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-27 12:55:00,110 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:55:00,110 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-27 12:55:00,113 INFO L423 AbstractCegarLoop]: === Iteration 3 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:55:00,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:55:00,113 INFO L82 PathProgramCache]: Analyzing trace with hash 323784, now seen corresponding path program 1 times [2019-02-27 12:55:00,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:55:00,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:55:00,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:55:00,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:55:00,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:55:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:55:00,157 INFO L273 TraceCheckUtils]: 0: Hoare triple {3492#true} r09 := $param_0;$r110 := $fresh2;assume $fresh2 != $null; {3494#(not (= void$SimpleFrame2Cons$main$1804_$r110 $null))} is VALID [2019-02-27 12:55:00,157 INFO L273 TraceCheckUtils]: 1: Hoare triple {3494#(not (= void$SimpleFrame2Cons$main$1804_$r110 $null))} assume $r110 != $null;void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this := $r110; {3495#(not (= $null void$SimpleFrame2Cons$main$1804_void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this))} is VALID [2019-02-27 12:55:00,160 INFO L273 TraceCheckUtils]: 2: Hoare triple {3495#(not (= $null void$SimpleFrame2Cons$main$1804_void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this))} assume !(void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this != $null); {3493#false} is VALID [2019-02-27 12:55:00,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:55:00,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-27 12:55:00,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-27 12:55:00,161 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-27 12:55:00,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-27 12:55:00,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:55:00,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-27 12:55:00,166 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:55:00,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-27 12:55:00,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-27 12:55:00,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-27 12:55:00,167 INFO L87 Difference]: Start difference. First operand 248 states and 254 transitions. Second operand 4 states. [2019-02-27 12:55:00,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:00,695 INFO L93 Difference]: Finished difference Result 248 states and 254 transitions. [2019-02-27 12:55:00,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-27 12:55:00,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-27 12:55:00,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:55:00,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:55:00,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 254 transitions. [2019-02-27 12:55:00,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:55:00,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 254 transitions. [2019-02-27 12:55:00,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 254 transitions. [2019-02-27 12:55:01,121 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:55:01,127 INFO L225 Difference]: With dead ends: 248 [2019-02-27 12:55:01,127 INFO L226 Difference]: Without dead ends: 247 [2019-02-27 12:55:01,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-27 12:55:01,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-02-27 12:55:01,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-02-27 12:55:01,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:55:01,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 247 states. Second operand 247 states. [2019-02-27 12:55:01,170 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand 247 states. [2019-02-27 12:55:01,171 INFO L87 Difference]: Start difference. First operand 247 states. Second operand 247 states. [2019-02-27 12:55:01,171 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-27 12:55:01,179 INFO L93 Difference]: Finished difference Result 247 states and 253 transitions. [2019-02-27 12:55:01,180 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 253 transitions. [2019-02-27 12:55:01,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:01,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:01,181 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand 247 states. [2019-02-27 12:55:01,181 INFO L87 Difference]: Start difference. First operand 247 states. Second operand 247 states. [2019-02-27 12:55:01,181 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-27 12:55:01,190 INFO L93 Difference]: Finished difference Result 247 states and 253 transitions. [2019-02-27 12:55:01,190 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 253 transitions. [2019-02-27 12:55:01,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:01,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:01,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:55:01,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:55:01,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-02-27 12:55:01,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 253 transitions. [2019-02-27 12:55:01,199 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 253 transitions. Word has length 3 [2019-02-27 12:55:01,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:55:01,199 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 253 transitions. [2019-02-27 12:55:01,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-27 12:55:01,200 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 253 transitions. [2019-02-27 12:55:01,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-27 12:55:01,200 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:55:01,200 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-27 12:55:01,203 INFO L423 AbstractCegarLoop]: === Iteration 4 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:55:01,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:55:01,203 INFO L82 PathProgramCache]: Analyzing trace with hash 29824, now seen corresponding path program 1 times [2019-02-27 12:55:01,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:55:01,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:55:01,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:55:01,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:55:01,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:55:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:55:01,273 INFO L273 TraceCheckUtils]: 0: Hoare triple {5041#true} assume void$SimpleFrame2Cons$3$$la$init$ra$$4885$__this != $null; {5043#(not (= void$SimpleFrame2Cons$3$$la$init$ra$$4885_void$SimpleFrame2Cons$3$$la$init$ra$$4885$__this $null))} is VALID [2019-02-27 12:55:01,274 INFO L273 TraceCheckUtils]: 1: Hoare triple {5043#(not (= void$SimpleFrame2Cons$3$$la$init$ra$$4885_void$SimpleFrame2Cons$3$$la$init$ra$$4885$__this $null))} r0107 := void$SimpleFrame2Cons$3$$la$init$ra$$4885$__this;r1108 := void$SimpleFrame2Cons$3$$la$init$ra$$4885$param_0;SimpleFrame2Cons$SimpleFrame2Cons$3$this$0762 := r1108; {5044#(not (= $null void$SimpleFrame2Cons$3$$la$init$ra$$4885_r0107))} is VALID [2019-02-27 12:55:01,275 INFO L273 TraceCheckUtils]: 2: Hoare triple {5044#(not (= $null void$SimpleFrame2Cons$3$$la$init$ra$$4885_r0107))} assume !(r0107 != $null); {5042#false} is VALID [2019-02-27 12:55:01,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:55:01,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-27 12:55:01,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-27 12:55:01,276 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-27 12:55:01,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-27 12:55:01,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:55:01,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-27 12:55:01,280 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:55:01,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-27 12:55:01,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-27 12:55:01,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-27 12:55:01,280 INFO L87 Difference]: Start difference. First operand 247 states and 253 transitions. Second operand 4 states. [2019-02-27 12:55:02,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:02,005 INFO L93 Difference]: Finished difference Result 247 states and 253 transitions. [2019-02-27 12:55:02,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-27 12:55:02,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-27 12:55:02,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:55:02,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:55:02,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2019-02-27 12:55:02,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:55:02,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2019-02-27 12:55:02,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 253 transitions. [2019-02-27 12:55:02,257 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:55:02,263 INFO L225 Difference]: With dead ends: 247 [2019-02-27 12:55:02,264 INFO L226 Difference]: Without dead ends: 243 [2019-02-27 12:55:02,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-27 12:55:02,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-02-27 12:55:02,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-02-27 12:55:02,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:55:02,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 243 states. Second operand 243 states. [2019-02-27 12:55:02,496 INFO L74 IsIncluded]: Start isIncluded. First operand 243 states. Second operand 243 states. [2019-02-27 12:55:02,496 INFO L87 Difference]: Start difference. First operand 243 states. Second operand 243 states. [2019-02-27 12:55:02,496 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-27 12:55:02,505 INFO L93 Difference]: Finished difference Result 243 states and 250 transitions. [2019-02-27 12:55:02,506 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 250 transitions. [2019-02-27 12:55:02,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:02,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:02,507 INFO L74 IsIncluded]: Start isIncluded. First operand 243 states. Second operand 243 states. [2019-02-27 12:55:02,507 INFO L87 Difference]: Start difference. First operand 243 states. Second operand 243 states. [2019-02-27 12:55:02,507 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-27 12:55:02,516 INFO L93 Difference]: Finished difference Result 243 states and 250 transitions. [2019-02-27 12:55:02,517 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 250 transitions. [2019-02-27 12:55:02,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:02,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:02,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:55:02,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:55:02,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-02-27 12:55:02,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 250 transitions. [2019-02-27 12:55:02,526 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 250 transitions. Word has length 3 [2019-02-27 12:55:02,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:55:02,526 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 250 transitions. [2019-02-27 12:55:02,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-27 12:55:02,526 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 250 transitions. [2019-02-27 12:55:02,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-27 12:55:02,527 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:55:02,527 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-27 12:55:02,529 INFO L423 AbstractCegarLoop]: === Iteration 5 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:55:02,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:55:02,530 INFO L82 PathProgramCache]: Analyzing trace with hash 168844, now seen corresponding path program 1 times [2019-02-27 12:55:02,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:55:02,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:55:02,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:55:02,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:55:02,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:55:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:55:02,654 INFO L273 TraceCheckUtils]: 0: Hoare triple {6571#true} assume void$SimpleFrame2Cons$2$$la$init$ra$$4552$__this != $null; {6573#(not (= $null void$SimpleFrame2Cons$2$$la$init$ra$$4552_void$SimpleFrame2Cons$2$$la$init$ra$$4552$__this))} is VALID [2019-02-27 12:55:02,655 INFO L273 TraceCheckUtils]: 1: Hoare triple {6573#(not (= $null void$SimpleFrame2Cons$2$$la$init$ra$$4552_void$SimpleFrame2Cons$2$$la$init$ra$$4552$__this))} r093 := void$SimpleFrame2Cons$2$$la$init$ra$$4552$__this;r194 := void$SimpleFrame2Cons$2$$la$init$ra$$4552$param_0;SimpleFrame2Cons$SimpleFrame2Cons$2$this$0711 := r194; {6574#(not (= void$SimpleFrame2Cons$2$$la$init$ra$$4552_r093 $null))} is VALID [2019-02-27 12:55:02,655 INFO L273 TraceCheckUtils]: 2: Hoare triple {6574#(not (= void$SimpleFrame2Cons$2$$la$init$ra$$4552_r093 $null))} assume !(r093 != $null); {6572#false} is VALID [2019-02-27 12:55:02,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:55:02,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-27 12:55:02,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-27 12:55:02,656 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-27 12:55:02,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-27 12:55:02,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:55:02,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-27 12:55:02,660 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:55:02,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-27 12:55:02,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-27 12:55:02,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-27 12:55:02,661 INFO L87 Difference]: Start difference. First operand 243 states and 250 transitions. Second operand 4 states. [2019-02-27 12:55:03,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:03,763 INFO L93 Difference]: Finished difference Result 243 states and 250 transitions. [2019-02-27 12:55:03,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-27 12:55:03,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-27 12:55:03,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:55:03,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:55:03,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2019-02-27 12:55:03,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:55:03,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2019-02-27 12:55:03,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 250 transitions. [2019-02-27 12:55:04,026 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:55:04,032 INFO L225 Difference]: With dead ends: 243 [2019-02-27 12:55:04,032 INFO L226 Difference]: Without dead ends: 239 [2019-02-27 12:55:04,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-27 12:55:04,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-02-27 12:55:04,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2019-02-27 12:55:04,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:55:04,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand 239 states. [2019-02-27 12:55:04,080 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand 239 states. [2019-02-27 12:55:04,080 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 239 states. [2019-02-27 12:55:04,080 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-27 12:55:04,089 INFO L93 Difference]: Finished difference Result 239 states and 247 transitions. [2019-02-27 12:55:04,090 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 247 transitions. [2019-02-27 12:55:04,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:04,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:04,091 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand 239 states. [2019-02-27 12:55:04,091 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 239 states. [2019-02-27 12:55:04,091 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-27 12:55:04,099 INFO L93 Difference]: Finished difference Result 239 states and 247 transitions. [2019-02-27 12:55:04,100 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 247 transitions. [2019-02-27 12:55:04,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:04,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:04,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:55:04,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:55:04,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-02-27 12:55:04,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 247 transitions. [2019-02-27 12:55:04,108 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 247 transitions. Word has length 3 [2019-02-27 12:55:04,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:55:04,109 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 247 transitions. [2019-02-27 12:55:04,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-27 12:55:04,109 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 247 transitions. [2019-02-27 12:55:04,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-27 12:55:04,109 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:55:04,110 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-27 12:55:04,112 INFO L423 AbstractCegarLoop]: === Iteration 6 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:55:04,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:55:04,112 INFO L82 PathProgramCache]: Analyzing trace with hash 161893, now seen corresponding path program 1 times [2019-02-27 12:55:04,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:55:04,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:55:04,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:55:04,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:55:04,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:55:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:55:04,371 INFO L273 TraceCheckUtils]: 0: Hoare triple {8079#true} assume void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this != $null; {8081#(not (= $null void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this))} is VALID [2019-02-27 12:55:04,384 INFO L273 TraceCheckUtils]: 1: Hoare triple {8081#(not (= $null void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this))} r01 := void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this; {8082#(not (= void$SimpleFrame2Cons$1$$la$init$ra$$1802_r01 $null))} is VALID [2019-02-27 12:55:04,397 INFO L273 TraceCheckUtils]: 2: Hoare triple {8082#(not (= void$SimpleFrame2Cons$1$$la$init$ra$$1802_r01 $null))} assume !(r01 != $null); {8080#false} is VALID [2019-02-27 12:55:04,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:55:04,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-27 12:55:04,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-27 12:55:04,399 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-27 12:55:04,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-27 12:55:04,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:55:04,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-27 12:55:04,441 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:55:04,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-27 12:55:04,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-27 12:55:04,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-27 12:55:04,442 INFO L87 Difference]: Start difference. First operand 239 states and 247 transitions. Second operand 4 states. [2019-02-27 12:55:05,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:05,273 INFO L93 Difference]: Finished difference Result 239 states and 247 transitions. [2019-02-27 12:55:05,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-27 12:55:05,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-27 12:55:05,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:55:05,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:55:05,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 247 transitions. [2019-02-27 12:55:05,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:55:05,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 247 transitions. [2019-02-27 12:55:05,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 247 transitions. [2019-02-27 12:55:05,519 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:55:05,525 INFO L225 Difference]: With dead ends: 239 [2019-02-27 12:55:05,525 INFO L226 Difference]: Without dead ends: 235 [2019-02-27 12:55:05,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-27 12:55:05,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-02-27 12:55:05,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2019-02-27 12:55:05,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:55:05,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 states. Second operand 235 states. [2019-02-27 12:55:05,571 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand 235 states. [2019-02-27 12:55:05,571 INFO L87 Difference]: Start difference. First operand 235 states. Second operand 235 states. [2019-02-27 12:55:05,572 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-27 12:55:05,578 INFO L93 Difference]: Finished difference Result 235 states and 244 transitions. [2019-02-27 12:55:05,579 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 244 transitions. [2019-02-27 12:55:05,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:05,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:05,580 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand 235 states. [2019-02-27 12:55:05,580 INFO L87 Difference]: Start difference. First operand 235 states. Second operand 235 states. [2019-02-27 12:55:05,580 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-27 12:55:05,586 INFO L93 Difference]: Finished difference Result 235 states and 244 transitions. [2019-02-27 12:55:05,586 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 244 transitions. [2019-02-27 12:55:05,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:05,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:05,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:55:05,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:55:05,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-02-27 12:55:05,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 244 transitions. [2019-02-27 12:55:05,592 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 244 transitions. Word has length 3 [2019-02-27 12:55:05,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:55:05,593 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 244 transitions. [2019-02-27 12:55:05,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-27 12:55:05,593 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 244 transitions. [2019-02-27 12:55:05,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-27 12:55:05,593 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:55:05,593 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-27 12:55:05,595 INFO L423 AbstractCegarLoop]: === Iteration 7 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:55:05,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:55:05,595 INFO L82 PathProgramCache]: Analyzing trace with hash 6127075, now seen corresponding path program 1 times [2019-02-27 12:55:05,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:55:05,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:55:05,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:55:05,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:55:05,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:55:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:55:05,632 INFO L273 TraceCheckUtils]: 0: Hoare triple {9565#true} assume __this != $null; {9565#true} is VALID [2019-02-27 12:55:05,633 INFO L273 TraceCheckUtils]: 1: Hoare triple {9565#true} $caughtEx0 := $null;void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep3 := $null; {9565#true} is VALID [2019-02-27 12:55:05,636 INFO L273 TraceCheckUtils]: 2: Hoare triple {9565#true} r03 := __this;$r14 := $fresh1;assume $fresh1 != $null; {9567#(not (= $null void$SimpleFrame2Cons$1$run$1803_$r14))} is VALID [2019-02-27 12:55:05,637 INFO L273 TraceCheckUtils]: 3: Hoare triple {9567#(not (= $null void$SimpleFrame2Cons$1$run$1803_$r14))} assume !($r14 != $null); {9566#false} is VALID [2019-02-27 12:55:05,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:55:05,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-27 12:55:05,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-27 12:55:05,637 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-27 12:55:05,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-27 12:55:05,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:55:05,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-27 12:55:05,642 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:55:05,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-27 12:55:05,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-27 12:55:05,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-27 12:55:05,643 INFO L87 Difference]: Start difference. First operand 235 states and 244 transitions. Second operand 3 states. [2019-02-27 12:55:05,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:05,951 INFO L93 Difference]: Finished difference Result 235 states and 244 transitions. [2019-02-27 12:55:05,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-27 12:55:05,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-27 12:55:05,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:55:05,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-27 12:55:05,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 244 transitions. [2019-02-27 12:55:05,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-27 12:55:05,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 244 transitions. [2019-02-27 12:55:05,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 244 transitions. [2019-02-27 12:55:06,556 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:55:06,560 INFO L225 Difference]: With dead ends: 235 [2019-02-27 12:55:06,560 INFO L226 Difference]: Without dead ends: 234 [2019-02-27 12:55:06,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-27 12:55:06,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-02-27 12:55:06,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2019-02-27 12:55:06,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:55:06,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand 234 states. [2019-02-27 12:55:06,604 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand 234 states. [2019-02-27 12:55:06,604 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 234 states. [2019-02-27 12:55:06,604 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-27 12:55:06,610 INFO L93 Difference]: Finished difference Result 234 states and 243 transitions. [2019-02-27 12:55:06,610 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 243 transitions. [2019-02-27 12:55:06,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:06,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:06,611 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand 234 states. [2019-02-27 12:55:06,611 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 234 states. [2019-02-27 12:55:06,611 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-27 12:55:06,617 INFO L93 Difference]: Finished difference Result 234 states and 243 transitions. [2019-02-27 12:55:06,617 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 243 transitions. [2019-02-27 12:55:06,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:06,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:06,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:55:06,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:55:06,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-02-27 12:55:06,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 243 transitions. [2019-02-27 12:55:06,623 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 243 transitions. Word has length 4 [2019-02-27 12:55:06,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:55:06,623 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 243 transitions. [2019-02-27 12:55:06,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-27 12:55:06,624 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 243 transitions. [2019-02-27 12:55:06,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-27 12:55:06,624 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:55:06,624 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-27 12:55:06,626 INFO L423 AbstractCegarLoop]: === Iteration 8 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:55:06,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:55:06,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1755747, now seen corresponding path program 1 times [2019-02-27 12:55:06,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:55:06,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:55:06,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:55:06,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:55:06,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:55:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:55:06,925 INFO L273 TraceCheckUtils]: 0: Hoare triple {11039#true} assume void$SimpleFrame2Cons$$la$init$ra$$1805$__this != $null; {11041#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} is VALID [2019-02-27 12:55:06,940 INFO L273 TraceCheckUtils]: 1: Hoare triple {11041#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} void$SimpleFrame2Cons$$la$init$ra$$1805$caughtEx0 := $null;void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep1 := $null; {11041#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} is VALID [2019-02-27 12:55:06,949 INFO L273 TraceCheckUtils]: 2: Hoare triple {11041#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} r012 := void$SimpleFrame2Cons$$la$init$ra$$1805$__this; {11042#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_r012))} is VALID [2019-02-27 12:55:06,962 INFO L273 TraceCheckUtils]: 3: Hoare triple {11042#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_r012))} assume !(r012 != $null); {11040#false} is VALID [2019-02-27 12:55:06,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:55:06,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-27 12:55:06,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-27 12:55:06,963 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-27 12:55:06,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-27 12:55:06,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:55:06,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-27 12:55:07,015 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:55:07,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-27 12:55:07,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-27 12:55:07,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-27 12:55:07,016 INFO L87 Difference]: Start difference. First operand 234 states and 243 transitions. Second operand 4 states. [2019-02-27 12:55:08,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:08,301 INFO L93 Difference]: Finished difference Result 234 states and 243 transitions. [2019-02-27 12:55:08,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-27 12:55:08,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-27 12:55:08,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:55:08,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:55:08,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2019-02-27 12:55:08,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:55:08,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2019-02-27 12:55:08,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 243 transitions. [2019-02-27 12:55:08,504 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:55:08,510 INFO L225 Difference]: With dead ends: 234 [2019-02-27 12:55:08,510 INFO L226 Difference]: Without dead ends: 213 [2019-02-27 12:55:08,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-27 12:55:08,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-02-27 12:55:08,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-02-27 12:55:08,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:55:08,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states. Second operand 213 states. [2019-02-27 12:55:08,564 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand 213 states. [2019-02-27 12:55:08,564 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 213 states. [2019-02-27 12:55:08,565 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-27 12:55:08,570 INFO L93 Difference]: Finished difference Result 213 states and 222 transitions. [2019-02-27 12:55:08,571 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 222 transitions. [2019-02-27 12:55:08,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:08,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:08,572 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand 213 states. [2019-02-27 12:55:08,572 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 213 states. [2019-02-27 12:55:08,572 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-27 12:55:08,578 INFO L93 Difference]: Finished difference Result 213 states and 222 transitions. [2019-02-27 12:55:08,578 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 222 transitions. [2019-02-27 12:55:08,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:08,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:08,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:55:08,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:55:08,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-02-27 12:55:08,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 222 transitions. [2019-02-27 12:55:08,584 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 222 transitions. Word has length 4 [2019-02-27 12:55:08,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:55:08,584 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 222 transitions. [2019-02-27 12:55:08,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-27 12:55:08,584 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 222 transitions. [2019-02-27 12:55:08,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-27 12:55:08,584 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:55:08,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-27 12:55:08,586 INFO L423 AbstractCegarLoop]: === Iteration 9 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:55:08,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:55:08,587 INFO L82 PathProgramCache]: Analyzing trace with hash 189939531, now seen corresponding path program 1 times [2019-02-27 12:55:08,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:55:08,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:55:08,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:55:08,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:55:08,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:55:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:55:08,859 INFO L273 TraceCheckUtils]: 0: Hoare triple {12408#true} assume __this != $null; {12408#true} is VALID [2019-02-27 12:55:08,859 INFO L273 TraceCheckUtils]: 1: Hoare triple {12408#true} $caughtEx0 := $null;void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep3 := $null; {12408#true} is VALID [2019-02-27 12:55:08,860 INFO L273 TraceCheckUtils]: 2: Hoare triple {12408#true} r03 := __this;$r14 := $fresh1;assume $fresh1 != $null; {12410#(not (= $null void$SimpleFrame2Cons$1$run$1803_$r14))} is VALID [2019-02-27 12:55:08,860 INFO L273 TraceCheckUtils]: 3: Hoare triple {12410#(not (= $null void$SimpleFrame2Cons$1$run$1803_$r14))} assume $r14 != $null;void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this := $r14; {12411#(not (= void$SimpleFrame2Cons$1$run$1803_void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this $null))} is VALID [2019-02-27 12:55:08,861 INFO L273 TraceCheckUtils]: 4: Hoare triple {12411#(not (= void$SimpleFrame2Cons$1$run$1803_void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this $null))} assume !(void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this != $null); {12409#false} is VALID [2019-02-27 12:55:08,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:55:08,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-27 12:55:08,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-27 12:55:08,861 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-27 12:55:08,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-27 12:55:08,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:55:08,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-27 12:55:08,874 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:55:08,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-27 12:55:08,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-27 12:55:08,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-27 12:55:08,875 INFO L87 Difference]: Start difference. First operand 213 states and 222 transitions. Second operand 4 states. [2019-02-27 12:55:09,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:55:09,305 INFO L93 Difference]: Finished difference Result 213 states and 222 transitions. [2019-02-27 12:55:09,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-27 12:55:09,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-27 12:55:09,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:55:09,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:55:09,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2019-02-27 12:55:09,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:55:09,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2019-02-27 12:55:09,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 222 transitions. [2019-02-27 12:55:09,516 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:55:09,520 INFO L225 Difference]: With dead ends: 213 [2019-02-27 12:55:09,520 INFO L226 Difference]: Without dead ends: 212 [2019-02-27 12:55:09,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-27 12:55:09,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-02-27 12:55:09,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2019-02-27 12:55:09,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:55:09,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand 212 states. [2019-02-27 12:55:09,545 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand 212 states. [2019-02-27 12:55:09,545 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 212 states. [2019-02-27 12:55:09,545 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-27 12:55:09,550 INFO L93 Difference]: Finished difference Result 212 states and 221 transitions. [2019-02-27 12:55:09,550 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 221 transitions. [2019-02-27 12:55:09,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:09,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:09,551 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand 212 states. [2019-02-27 12:55:09,551 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 212 states. [2019-02-27 12:55:09,552 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-27 12:55:09,556 INFO L93 Difference]: Finished difference Result 212 states and 221 transitions. [2019-02-27 12:55:09,557 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 221 transitions. [2019-02-27 12:55:09,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:55:09,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:55:09,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:55:09,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:55:09,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-02-27 12:55:09,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 221 transitions. [2019-02-27 12:55:09,562 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 221 transitions. Word has length 5 [2019-02-27 12:55:09,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:55:09,562 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 221 transitions. [2019-02-27 12:55:09,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-27 12:55:09,563 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 221 transitions. [2019-02-27 12:55:09,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-27 12:55:09,563 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:55:09,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-27 12:55:09,564 INFO L423 AbstractCegarLoop]: === Iteration 10 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:55:09,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:55:09,565 INFO L82 PathProgramCache]: Analyzing trace with hash 179442176, now seen corresponding path program 1 times [2019-02-27 12:55:09,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:55:09,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:55:09,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:55:09,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:55:09,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:55:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-02-27 12:55:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-02-27 12:55:09,596 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-02-27 12:55:09,613 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$3$$la$init$ra$$4885ENTRY has no Hoare annotation [2019-02-27 12:55:09,613 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$2$actionPerformed$4553ENTRY has no Hoare annotation [2019-02-27 12:55:09,613 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$3$actionPerformed$4886ENTRY has no Hoare annotation [2019-02-27 12:55:09,613 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$$la$init$ra$$1805ENTRY has no Hoare annotation [2019-02-27 12:55:09,613 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$1$$la$init$ra$$1802ENTRY has no Hoare annotation [2019-02-27 12:55:09,613 WARN L170 areAnnotationChecker]: javax.swing.JButton$SimpleFrame2Cons$access$0$1806ENTRY has no Hoare annotation [2019-02-27 12:55:09,614 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$2$$la$init$ra$$4552ENTRY has no Hoare annotation [2019-02-27 12:55:09,614 WARN L170 areAnnotationChecker]: java.awt.Dimension$java.awt.Toolkit$getScreenSize$3246ENTRY has no Hoare annotation [2019-02-27 12:55:09,614 WARN L170 areAnnotationChecker]: void$javax.swing.JFrame$$la$init$ra$$1809ENTRY has no Hoare annotation [2019-02-27 12:55:09,614 WARN L170 areAnnotationChecker]: int$SimpleFrame2Cons$access$2$1808ENTRY has no Hoare annotation [2019-02-27 12:55:09,614 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$access$1$1807ENTRY has no Hoare annotation [2019-02-27 12:55:09,614 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$1$run$1803ENTRY has no Hoare annotation [2019-02-27 12:55:09,614 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$4$$la$init$ra$$4887ENTRY has no Hoare annotation [2019-02-27 12:55:09,614 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$4$actionPerformed$4888ENTRY has no Hoare annotation [2019-02-27 12:55:09,614 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$main$1804ENTRY has no Hoare annotation [2019-02-27 12:55:09,614 WARN L170 areAnnotationChecker]: $EFG_ProcedureENTRY has no Hoare annotation [2019-02-27 12:55:09,614 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-27 12:55:09,615 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-27 12:55:09,615 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-27 12:55:09,615 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-27 12:55:09,615 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-27 12:55:09,615 WARN L170 areAnnotationChecker]: javax.swing.JButton$SimpleFrame2Cons$access$0$1806FINAL has no Hoare annotation [2019-02-27 12:55:09,615 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-27 12:55:09,615 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-27 12:55:09,615 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-27 12:55:09,615 WARN L170 areAnnotationChecker]: int$SimpleFrame2Cons$access$2$1808FINAL has no Hoare annotation [2019-02-27 12:55:09,616 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$access$1$1807FINAL has no Hoare annotation [2019-02-27 12:55:09,616 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-27 12:55:09,616 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-27 12:55:09,616 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-27 12:55:09,616 WARN L170 areAnnotationChecker]: L452 has no Hoare annotation [2019-02-27 12:55:09,616 WARN L170 areAnnotationChecker]: L452 has no Hoare annotation [2019-02-27 12:55:09,616 WARN L170 areAnnotationChecker]: L129 has no Hoare annotation [2019-02-27 12:55:09,616 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-02-27 12:55:09,616 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-02-27 12:55:09,616 WARN L170 areAnnotationChecker]: L388 has no Hoare annotation [2019-02-27 12:55:09,617 WARN L170 areAnnotationChecker]: L612 has no Hoare annotation [2019-02-27 12:55:09,617 WARN L170 areAnnotationChecker]: L791 has no Hoare annotation [2019-02-27 12:55:09,617 WARN L170 areAnnotationChecker]: L434 has no Hoare annotation [2019-02-27 12:55:09,617 WARN L170 areAnnotationChecker]: L434 has no Hoare annotation [2019-02-27 12:55:09,617 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-02-27 12:55:09,617 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-02-27 12:55:09,617 WARN L170 areAnnotationChecker]: java.awt.Dimension$java.awt.Toolkit$getScreenSize$3246FINAL has no Hoare annotation [2019-02-27 12:55:09,617 WARN L170 areAnnotationChecker]: void$javax.swing.JFrame$$la$init$ra$$1809FINAL has no Hoare annotation [2019-02-27 12:55:09,617 WARN L170 areAnnotationChecker]: L535 has no Hoare annotation [2019-02-27 12:55:09,617 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-02-27 12:55:09,618 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-02-27 12:55:09,618 WARN L170 areAnnotationChecker]: L388 has no Hoare annotation [2019-02-27 12:55:09,618 WARN L170 areAnnotationChecker]: L420 has no Hoare annotation [2019-02-27 12:55:09,618 WARN L170 areAnnotationChecker]: L420 has no Hoare annotation [2019-02-27 12:55:09,618 WARN L170 areAnnotationChecker]: L141 has no Hoare annotation [2019-02-27 12:55:09,618 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$3$$la$init$ra$$4885FINAL has no Hoare annotation [2019-02-27 12:55:09,618 WARN L170 areAnnotationChecker]: L384 has no Hoare annotation [2019-02-27 12:55:09,618 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2019-02-27 12:55:09,618 WARN L170 areAnnotationChecker]: L796 has no Hoare annotation [2019-02-27 12:55:09,618 WARN L170 areAnnotationChecker]: L796 has no Hoare annotation [2019-02-27 12:55:09,619 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$1$$la$init$ra$$1802FINAL has no Hoare annotation [2019-02-27 12:55:09,619 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$2$$la$init$ra$$4552FINAL has no Hoare annotation [2019-02-27 12:55:09,619 WARN L170 areAnnotationChecker]: L543 has no Hoare annotation [2019-02-27 12:55:09,619 WARN L170 areAnnotationChecker]: L543 has no Hoare annotation [2019-02-27 12:55:09,619 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$4$$la$init$ra$$4887FINAL has no Hoare annotation [2019-02-27 12:55:09,619 WARN L170 areAnnotationChecker]: L384 has no Hoare annotation [2019-02-27 12:55:09,619 WARN L170 areAnnotationChecker]: L431 has no Hoare annotation [2019-02-27 12:55:09,619 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2019-02-27 12:55:09,619 WARN L170 areAnnotationChecker]: L481 has no Hoare annotation [2019-02-27 12:55:09,619 WARN L170 areAnnotationChecker]: L481 has no Hoare annotation [2019-02-27 12:55:09,619 WARN L170 areAnnotationChecker]: L630 has no Hoare annotation [2019-02-27 12:55:09,620 WARN L170 areAnnotationChecker]: L734 has no Hoare annotation [2019-02-27 12:55:09,620 WARN L170 areAnnotationChecker]: L734 has no Hoare annotation [2019-02-27 12:55:09,620 WARN L170 areAnnotationChecker]: L753 has no Hoare annotation [2019-02-27 12:55:09,620 WARN L170 areAnnotationChecker]: L753 has no Hoare annotation [2019-02-27 12:55:09,620 WARN L170 areAnnotationChecker]: L658 has no Hoare annotation [2019-02-27 12:55:09,620 WARN L170 areAnnotationChecker]: L658 has no Hoare annotation [2019-02-27 12:55:09,620 WARN L170 areAnnotationChecker]: L434 has no Hoare annotation [2019-02-27 12:55:09,620 WARN L170 areAnnotationChecker]: L434 has no Hoare annotation [2019-02-27 12:55:09,620 WARN L170 areAnnotationChecker]: L153 has no Hoare annotation [2019-02-27 12:55:09,620 WARN L170 areAnnotationChecker]: L630 has no Hoare annotation [2019-02-27 12:55:09,621 WARN L170 areAnnotationChecker]: L624 has no Hoare annotation [2019-02-27 12:55:09,621 WARN L170 areAnnotationChecker]: L736 has no Hoare annotation [2019-02-27 12:55:09,621 WARN L170 areAnnotationChecker]: L788 has no Hoare annotation [2019-02-27 12:55:09,621 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$4$actionPerformed$4888FINAL has no Hoare annotation [2019-02-27 12:55:09,621 WARN L170 areAnnotationChecker]: L420-1 has no Hoare annotation [2019-02-27 12:55:09,621 WARN L170 areAnnotationChecker]: L158 has no Hoare annotation [2019-02-27 12:55:09,621 WARN L170 areAnnotationChecker]: L624 has no Hoare annotation [2019-02-27 12:55:09,621 WARN L170 areAnnotationChecker]: L734-1 has no Hoare annotation [2019-02-27 12:55:09,621 WARN L170 areAnnotationChecker]: L791 has no Hoare annotation [2019-02-27 12:55:09,621 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$main$1804FINAL has no Hoare annotation [2019-02-27 12:55:09,622 WARN L170 areAnnotationChecker]: L734 has no Hoare annotation [2019-02-27 12:55:09,622 WARN L170 areAnnotationChecker]: L734 has no Hoare annotation [2019-02-27 12:55:09,622 WARN L170 areAnnotationChecker]: L799 has no Hoare annotation [2019-02-27 12:55:09,622 WARN L170 areAnnotationChecker]: L799 has no Hoare annotation [2019-02-27 12:55:09,622 WARN L170 areAnnotationChecker]: L796 has no Hoare annotation [2019-02-27 12:55:09,622 WARN L170 areAnnotationChecker]: L796 has no Hoare annotation [2019-02-27 12:55:09,622 WARN L170 areAnnotationChecker]: L736 has no Hoare annotation [2019-02-27 12:55:09,622 WARN L170 areAnnotationChecker]: L802 has no Hoare annotation [2019-02-27 12:55:09,622 WARN L170 areAnnotationChecker]: L808 has no Hoare annotation [2019-02-27 12:55:09,622 WARN L170 areAnnotationChecker]: L734 has no Hoare annotation [2019-02-27 12:55:09,623 WARN L170 areAnnotationChecker]: L734 has no Hoare annotation [2019-02-27 12:55:09,623 WARN L170 areAnnotationChecker]: L734-1 has no Hoare annotation [2019-02-27 12:55:09,623 WARN L170 areAnnotationChecker]: L814 has no Hoare annotation [2019-02-27 12:55:09,623 WARN L170 areAnnotationChecker]: L814 has no Hoare annotation [2019-02-27 12:55:09,623 WARN L170 areAnnotationChecker]: L736 has no Hoare annotation [2019-02-27 12:55:09,623 WARN L170 areAnnotationChecker]: L165 has no Hoare annotation [2019-02-27 12:55:09,623 WARN L170 areAnnotationChecker]: L165 has no Hoare annotation [2019-02-27 12:55:09,623 WARN L170 areAnnotationChecker]: L824 has no Hoare annotation [2019-02-27 12:55:09,623 WARN L170 areAnnotationChecker]: L824 has no Hoare annotation [2019-02-27 12:55:09,623 WARN L170 areAnnotationChecker]: L734-1 has no Hoare annotation [2019-02-27 12:55:09,624 WARN L170 areAnnotationChecker]: L168 has no Hoare annotation [2019-02-27 12:55:09,624 WARN L170 areAnnotationChecker]: L281 has no Hoare annotation [2019-02-27 12:55:09,624 WARN L170 areAnnotationChecker]: L671 has no Hoare annotation [2019-02-27 12:55:09,624 WARN L170 areAnnotationChecker]: L671 has no Hoare annotation [2019-02-27 12:55:09,624 WARN L170 areAnnotationChecker]: L799 has no Hoare annotation [2019-02-27 12:55:09,624 WARN L170 areAnnotationChecker]: L799 has no Hoare annotation [2019-02-27 12:55:09,624 WARN L170 areAnnotationChecker]: L671 has no Hoare annotation [2019-02-27 12:55:09,624 WARN L170 areAnnotationChecker]: L671 has no Hoare annotation [2019-02-27 12:55:09,624 WARN L170 areAnnotationChecker]: L678 has no Hoare annotation [2019-02-27 12:55:09,624 WARN L170 areAnnotationChecker]: L802 has no Hoare annotation [2019-02-27 12:55:09,625 WARN L170 areAnnotationChecker]: L808 has no Hoare annotation [2019-02-27 12:55:09,625 WARN L170 areAnnotationChecker]: L678 has no Hoare annotation [2019-02-27 12:55:09,625 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-02-27 12:55:09,625 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-02-27 12:55:09,625 WARN L170 areAnnotationChecker]: L814 has no Hoare annotation [2019-02-27 12:55:09,625 WARN L170 areAnnotationChecker]: L814 has no Hoare annotation [2019-02-27 12:55:09,625 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-02-27 12:55:09,625 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-02-27 12:55:09,625 WARN L170 areAnnotationChecker]: L671-1 has no Hoare annotation [2019-02-27 12:55:09,625 WARN L170 areAnnotationChecker]: L671-1 has no Hoare annotation [2019-02-27 12:55:09,626 WARN L170 areAnnotationChecker]: L824 has no Hoare annotation [2019-02-27 12:55:09,626 WARN L170 areAnnotationChecker]: L824 has no Hoare annotation [2019-02-27 12:55:09,626 WARN L170 areAnnotationChecker]: L671-1 has no Hoare annotation [2019-02-27 12:55:09,626 WARN L170 areAnnotationChecker]: L833 has no Hoare annotation [2019-02-27 12:55:09,626 WARN L170 areAnnotationChecker]: L833 has no Hoare annotation [2019-02-27 12:55:09,626 WARN L170 areAnnotationChecker]: L671 has no Hoare annotation [2019-02-27 12:55:09,626 WARN L170 areAnnotationChecker]: L671 has no Hoare annotation [2019-02-27 12:55:09,626 WARN L170 areAnnotationChecker]: L693 has no Hoare annotation [2019-02-27 12:55:09,626 WARN L170 areAnnotationChecker]: L693 has no Hoare annotation [2019-02-27 12:55:09,626 WARN L170 areAnnotationChecker]: L843 has no Hoare annotation [2019-02-27 12:55:09,626 WARN L170 areAnnotationChecker]: L843 has no Hoare annotation [2019-02-27 12:55:09,627 WARN L170 areAnnotationChecker]: L678 has no Hoare annotation [2019-02-27 12:55:09,628 WARN L170 areAnnotationChecker]: L700 has no Hoare annotation [2019-02-27 12:55:09,628 WARN L170 areAnnotationChecker]: L693 has no Hoare annotation [2019-02-27 12:55:09,628 WARN L170 areAnnotationChecker]: L693 has no Hoare annotation [2019-02-27 12:55:09,628 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-02-27 12:55:09,629 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-02-27 12:55:09,629 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-02-27 12:55:09,629 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-02-27 12:55:09,629 WARN L170 areAnnotationChecker]: L700 has no Hoare annotation [2019-02-27 12:55:09,629 WARN L170 areAnnotationChecker]: L671-1 has no Hoare annotation [2019-02-27 12:55:09,629 WARN L170 areAnnotationChecker]: L671-1 has no Hoare annotation [2019-02-27 12:55:09,629 WARN L170 areAnnotationChecker]: L693-1 has no Hoare annotation [2019-02-27 12:55:09,629 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-02-27 12:55:09,629 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-02-27 12:55:09,629 WARN L170 areAnnotationChecker]: L833 has no Hoare annotation [2019-02-27 12:55:09,630 WARN L170 areAnnotationChecker]: L833 has no Hoare annotation [2019-02-27 12:55:09,630 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2019-02-27 12:55:09,630 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2019-02-27 12:55:09,630 WARN L170 areAnnotationChecker]: L693-1 has no Hoare annotation [2019-02-27 12:55:09,630 WARN L170 areAnnotationChecker]: L693-1 has no Hoare annotation [2019-02-27 12:55:09,630 WARN L170 areAnnotationChecker]: L843 has no Hoare annotation [2019-02-27 12:55:09,630 WARN L170 areAnnotationChecker]: L843 has no Hoare annotation [2019-02-27 12:55:09,630 WARN L170 areAnnotationChecker]: L583 has no Hoare annotation [2019-02-27 12:55:09,630 WARN L170 areAnnotationChecker]: L852 has no Hoare annotation [2019-02-27 12:55:09,630 WARN L170 areAnnotationChecker]: L852 has no Hoare annotation [2019-02-27 12:55:09,631 WARN L170 areAnnotationChecker]: L693 has no Hoare annotation [2019-02-27 12:55:09,631 WARN L170 areAnnotationChecker]: L693 has no Hoare annotation [2019-02-27 12:55:09,631 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-02-27 12:55:09,631 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-02-27 12:55:09,631 WARN L170 areAnnotationChecker]: L862 has no Hoare annotation [2019-02-27 12:55:09,631 WARN L170 areAnnotationChecker]: L862 has no Hoare annotation [2019-02-27 12:55:09,631 WARN L170 areAnnotationChecker]: L700 has no Hoare annotation [2019-02-27 12:55:09,631 WARN L170 areAnnotationChecker]: L576-1 has no Hoare annotation [2019-02-27 12:55:09,631 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2019-02-27 12:55:09,631 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2019-02-27 12:55:09,632 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-02-27 12:55:09,632 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-02-27 12:55:09,632 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2019-02-27 12:55:09,632 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2019-02-27 12:55:09,632 WARN L170 areAnnotationChecker]: L583 has no Hoare annotation [2019-02-27 12:55:09,632 WARN L170 areAnnotationChecker]: L693-1 has no Hoare annotation [2019-02-27 12:55:09,632 WARN L170 areAnnotationChecker]: L693-1 has no Hoare annotation [2019-02-27 12:55:09,632 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2019-02-27 12:55:09,632 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-02-27 12:55:09,633 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-02-27 12:55:09,633 WARN L170 areAnnotationChecker]: L852 has no Hoare annotation [2019-02-27 12:55:09,633 WARN L170 areAnnotationChecker]: L852 has no Hoare annotation [2019-02-27 12:55:09,633 WARN L170 areAnnotationChecker]: L370-1 has no Hoare annotation [2019-02-27 12:55:09,633 WARN L170 areAnnotationChecker]: L576-1 has no Hoare annotation [2019-02-27 12:55:09,633 WARN L170 areAnnotationChecker]: L576-1 has no Hoare annotation [2019-02-27 12:55:09,633 WARN L170 areAnnotationChecker]: L862 has no Hoare annotation [2019-02-27 12:55:09,633 WARN L170 areAnnotationChecker]: L862 has no Hoare annotation [2019-02-27 12:55:09,633 WARN L170 areAnnotationChecker]: L273 has no Hoare annotation [2019-02-27 12:55:09,634 WARN L170 areAnnotationChecker]: L273 has no Hoare annotation [2019-02-27 12:55:09,634 WARN L170 areAnnotationChecker]: L871 has no Hoare annotation [2019-02-27 12:55:09,634 WARN L170 areAnnotationChecker]: L871 has no Hoare annotation [2019-02-27 12:55:09,634 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2019-02-27 12:55:09,634 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2019-02-27 12:55:09,634 WARN L170 areAnnotationChecker]: L278 has no Hoare annotation [2019-02-27 12:55:09,634 WARN L170 areAnnotationChecker]: L874 has no Hoare annotation [2019-02-27 12:55:09,634 WARN L170 areAnnotationChecker]: L874 has no Hoare annotation [2019-02-27 12:55:09,634 WARN L170 areAnnotationChecker]: L583 has no Hoare annotation [2019-02-27 12:55:09,634 WARN L170 areAnnotationChecker]: L306 has no Hoare annotation [2019-02-27 12:55:09,635 WARN L170 areAnnotationChecker]: L879 has no Hoare annotation [2019-02-27 12:55:09,635 WARN L170 areAnnotationChecker]: L879 has no Hoare annotation [2019-02-27 12:55:09,635 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-02-27 12:55:09,635 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-02-27 12:55:09,635 WARN L170 areAnnotationChecker]: L318 has no Hoare annotation [2019-02-27 12:55:09,635 WARN L170 areAnnotationChecker]: L318 has no Hoare annotation [2019-02-27 12:55:09,635 WARN L170 areAnnotationChecker]: L318 has no Hoare annotation [2019-02-27 12:55:09,635 WARN L170 areAnnotationChecker]: L884 has no Hoare annotation [2019-02-27 12:55:09,635 WARN L170 areAnnotationChecker]: L884 has no Hoare annotation [2019-02-27 12:55:09,636 WARN L170 areAnnotationChecker]: L576-1 has no Hoare annotation [2019-02-27 12:55:09,636 WARN L170 areAnnotationChecker]: L576-1 has no Hoare annotation [2019-02-27 12:55:09,636 WARN L170 areAnnotationChecker]: Event2_Block67 has no Hoare annotation [2019-02-27 12:55:09,636 WARN L170 areAnnotationChecker]: Event0_Block65 has no Hoare annotation [2019-02-27 12:55:09,636 WARN L170 areAnnotationChecker]: Event1_Block66 has no Hoare annotation [2019-02-27 12:55:09,636 WARN L170 areAnnotationChecker]: L889 has no Hoare annotation [2019-02-27 12:55:09,636 WARN L170 areAnnotationChecker]: L889 has no Hoare annotation [2019-02-27 12:55:09,636 WARN L170 areAnnotationChecker]: L871 has no Hoare annotation [2019-02-27 12:55:09,636 WARN L170 areAnnotationChecker]: L871 has no Hoare annotation [2019-02-27 12:55:09,637 WARN L170 areAnnotationChecker]: L333 has no Hoare annotation [2019-02-27 12:55:09,637 WARN L170 areAnnotationChecker]: L333 has no Hoare annotation [2019-02-27 12:55:09,637 WARN L170 areAnnotationChecker]: L333 has no Hoare annotation [2019-02-27 12:55:09,637 WARN L170 areAnnotationChecker]: L333 has no Hoare annotation [2019-02-27 12:55:09,637 WARN L170 areAnnotationChecker]: L349 has no Hoare annotation [2019-02-27 12:55:09,637 WARN L170 areAnnotationChecker]: L349 has no Hoare annotation [2019-02-27 12:55:09,637 WARN L170 areAnnotationChecker]: L349 has no Hoare annotation [2019-02-27 12:55:09,637 WARN L170 areAnnotationChecker]: L349 has no Hoare annotation [2019-02-27 12:55:09,637 WARN L170 areAnnotationChecker]: L362 has no Hoare annotation [2019-02-27 12:55:09,637 WARN L170 areAnnotationChecker]: L362 has no Hoare annotation [2019-02-27 12:55:09,637 WARN L170 areAnnotationChecker]: L362 has no Hoare annotation [2019-02-27 12:55:09,637 WARN L170 areAnnotationChecker]: L362 has no Hoare annotation [2019-02-27 12:55:09,637 WARN L170 areAnnotationChecker]: L892 has no Hoare annotation [2019-02-27 12:55:09,637 WARN L170 areAnnotationChecker]: L892 has no Hoare annotation [2019-02-27 12:55:09,638 WARN L170 areAnnotationChecker]: L874 has no Hoare annotation [2019-02-27 12:55:09,638 WARN L170 areAnnotationChecker]: L874 has no Hoare annotation [2019-02-27 12:55:09,638 WARN L170 areAnnotationChecker]: $EFG_EXIT_Block68 has no Hoare annotation [2019-02-27 12:55:09,638 WARN L170 areAnnotationChecker]: $EFG_EXIT_Block68 has no Hoare annotation [2019-02-27 12:55:09,638 WARN L170 areAnnotationChecker]: L895 has no Hoare annotation [2019-02-27 12:55:09,638 WARN L170 areAnnotationChecker]: L895 has no Hoare annotation [2019-02-27 12:55:09,638 WARN L170 areAnnotationChecker]: L879 has no Hoare annotation [2019-02-27 12:55:09,638 WARN L170 areAnnotationChecker]: L879 has no Hoare annotation [2019-02-27 12:55:09,638 WARN L170 areAnnotationChecker]: L898 has no Hoare annotation [2019-02-27 12:55:09,638 WARN L170 areAnnotationChecker]: L898 has no Hoare annotation [2019-02-27 12:55:09,638 WARN L170 areAnnotationChecker]: L884 has no Hoare annotation [2019-02-27 12:55:09,638 WARN L170 areAnnotationChecker]: L884 has no Hoare annotation [2019-02-27 12:55:09,638 WARN L170 areAnnotationChecker]: L901 has no Hoare annotation [2019-02-27 12:55:09,638 WARN L170 areAnnotationChecker]: L901 has no Hoare annotation [2019-02-27 12:55:09,638 WARN L170 areAnnotationChecker]: L889 has no Hoare annotation [2019-02-27 12:55:09,639 WARN L170 areAnnotationChecker]: L889 has no Hoare annotation [2019-02-27 12:55:09,639 WARN L170 areAnnotationChecker]: L906 has no Hoare annotation [2019-02-27 12:55:09,639 WARN L170 areAnnotationChecker]: L906 has no Hoare annotation [2019-02-27 12:55:09,639 WARN L170 areAnnotationChecker]: L892 has no Hoare annotation [2019-02-27 12:55:09,639 WARN L170 areAnnotationChecker]: L892 has no Hoare annotation [2019-02-27 12:55:09,639 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2019-02-27 12:55:09,639 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2019-02-27 12:55:09,639 WARN L170 areAnnotationChecker]: L895 has no Hoare annotation [2019-02-27 12:55:09,639 WARN L170 areAnnotationChecker]: L895 has no Hoare annotation [2019-02-27 12:55:09,639 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2019-02-27 12:55:09,639 WARN L170 areAnnotationChecker]: L898 has no Hoare annotation [2019-02-27 12:55:09,639 WARN L170 areAnnotationChecker]: L898 has no Hoare annotation [2019-02-27 12:55:09,640 WARN L170 areAnnotationChecker]: L370-1 has no Hoare annotation [2019-02-27 12:55:09,640 WARN L170 areAnnotationChecker]: L901 has no Hoare annotation [2019-02-27 12:55:09,640 WARN L170 areAnnotationChecker]: L901 has no Hoare annotation [2019-02-27 12:55:09,640 WARN L170 areAnnotationChecker]: L909 has no Hoare annotation [2019-02-27 12:55:09,640 WARN L170 areAnnotationChecker]: L909 has no Hoare annotation [2019-02-27 12:55:09,640 WARN L170 areAnnotationChecker]: L906 has no Hoare annotation [2019-02-27 12:55:09,640 WARN L170 areAnnotationChecker]: L906 has no Hoare annotation [2019-02-27 12:55:09,640 WARN L170 areAnnotationChecker]: L912 has no Hoare annotation [2019-02-27 12:55:09,640 WARN L170 areAnnotationChecker]: L940 has no Hoare annotation [2019-02-27 12:55:09,641 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2019-02-27 12:55:09,641 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2019-02-27 12:55:09,641 WARN L170 areAnnotationChecker]: L919 has no Hoare annotation [2019-02-27 12:55:09,641 WARN L170 areAnnotationChecker]: L919 has no Hoare annotation [2019-02-27 12:55:09,641 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$$la$init$ra$$1805FINAL has no Hoare annotation [2019-02-27 12:55:09,641 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2019-02-27 12:55:09,641 WARN L170 areAnnotationChecker]: L924 has no Hoare annotation [2019-02-27 12:55:09,641 WARN L170 areAnnotationChecker]: L924 has no Hoare annotation [2019-02-27 12:55:09,642 WARN L170 areAnnotationChecker]: L370-1 has no Hoare annotation [2019-02-27 12:55:09,642 WARN L170 areAnnotationChecker]: L929 has no Hoare annotation [2019-02-27 12:55:09,642 WARN L170 areAnnotationChecker]: L929 has no Hoare annotation [2019-02-27 12:55:09,642 WARN L170 areAnnotationChecker]: L909 has no Hoare annotation [2019-02-27 12:55:09,642 WARN L170 areAnnotationChecker]: L909 has no Hoare annotation [2019-02-27 12:55:09,642 WARN L170 areAnnotationChecker]: L934 has no Hoare annotation [2019-02-27 12:55:09,642 WARN L170 areAnnotationChecker]: L934 has no Hoare annotation [2019-02-27 12:55:09,642 WARN L170 areAnnotationChecker]: L912 has no Hoare annotation [2019-02-27 12:55:09,642 WARN L170 areAnnotationChecker]: L940 has no Hoare annotation [2019-02-27 12:55:09,642 WARN L170 areAnnotationChecker]: L937 has no Hoare annotation [2019-02-27 12:55:09,643 WARN L170 areAnnotationChecker]: L937 has no Hoare annotation [2019-02-27 12:55:09,643 WARN L170 areAnnotationChecker]: L919 has no Hoare annotation [2019-02-27 12:55:09,643 WARN L170 areAnnotationChecker]: L919 has no Hoare annotation [2019-02-27 12:55:09,643 WARN L170 areAnnotationChecker]: L753-1 has no Hoare annotation [2019-02-27 12:55:09,643 WARN L170 areAnnotationChecker]: L924 has no Hoare annotation [2019-02-27 12:55:09,643 WARN L170 areAnnotationChecker]: L924 has no Hoare annotation [2019-02-27 12:55:09,643 WARN L170 areAnnotationChecker]: L546 has no Hoare annotation [2019-02-27 12:55:09,643 WARN L170 areAnnotationChecker]: L546 has no Hoare annotation [2019-02-27 12:55:09,643 WARN L170 areAnnotationChecker]: L929 has no Hoare annotation [2019-02-27 12:55:09,643 WARN L170 areAnnotationChecker]: L929 has no Hoare annotation [2019-02-27 12:55:09,644 WARN L170 areAnnotationChecker]: L549 has no Hoare annotation [2019-02-27 12:55:09,644 WARN L170 areAnnotationChecker]: L555 has no Hoare annotation [2019-02-27 12:55:09,644 WARN L170 areAnnotationChecker]: L934 has no Hoare annotation [2019-02-27 12:55:09,644 WARN L170 areAnnotationChecker]: L934 has no Hoare annotation [2019-02-27 12:55:09,644 WARN L170 areAnnotationChecker]: L558 has no Hoare annotation [2019-02-27 12:55:09,644 WARN L170 areAnnotationChecker]: L558 has no Hoare annotation [2019-02-27 12:55:09,644 WARN L170 areAnnotationChecker]: L937 has no Hoare annotation [2019-02-27 12:55:09,644 WARN L170 areAnnotationChecker]: L937 has no Hoare annotation [2019-02-27 12:55:09,644 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$1$run$1803FINAL has no Hoare annotation [2019-02-27 12:55:09,644 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-02-27 12:55:09,648 INFO L202 PluginConnector]: Adding new model GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.02 12:55:09 BoogieIcfgContainer [2019-02-27 12:55:09,648 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-27 12:55:09,650 INFO L168 Benchmark]: Toolchain (without parser) took 16293.75 ms. Allocated memory was 133.7 MB in the beginning and 316.7 MB in the end (delta: 183.0 MB). Free memory was 104.2 MB in the beginning and 206.7 MB in the end (delta: -102.5 MB). Peak memory consumption was 80.5 MB. Max. memory is 7.1 GB. [2019-02-27 12:55:09,652 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 133.7 MB. Free memory is still 107.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-27 12:55:09,652 INFO L168 Benchmark]: Boogie Procedure Inliner took 148.65 ms. Allocated memory is still 133.7 MB. Free memory was 104.0 MB in the beginning and 98.0 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 7.1 GB. [2019-02-27 12:55:09,653 INFO L168 Benchmark]: Boogie Preprocessor took 63.88 ms. Allocated memory is still 133.7 MB. Free memory was 98.0 MB in the beginning and 95.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-02-27 12:55:09,654 INFO L168 Benchmark]: RCFGBuilder took 2527.83 ms. Allocated memory was 133.7 MB in the beginning and 169.3 MB in the end (delta: 35.7 MB). Free memory was 95.5 MB in the beginning and 71.5 MB in the end (delta: 24.0 MB). Peak memory consumption was 59.7 MB. Max. memory is 7.1 GB. [2019-02-27 12:55:09,655 INFO L168 Benchmark]: TraceAbstraction took 13548.80 ms. Allocated memory was 169.3 MB in the beginning and 316.7 MB in the end (delta: 147.3 MB). Free memory was 71.5 MB in the beginning and 206.7 MB in the end (delta: -135.2 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. [2019-02-27 12:55:09,659 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 133.7 MB. Free memory is still 107.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 148.65 ms. Allocated memory is still 133.7 MB. Free memory was 104.0 MB in the beginning and 98.0 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 63.88 ms. Allocated memory is still 133.7 MB. Free memory was 98.0 MB in the beginning and 95.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2527.83 ms. Allocated memory was 133.7 MB in the beginning and 169.3 MB in the end (delta: 35.7 MB). Free memory was 95.5 MB in the beginning and 71.5 MB in the end (delta: 24.0 MB). Peak memory consumption was 59.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13548.80 ms. Allocated memory was 169.3 MB in the beginning and 316.7 MB in the end (delta: 147.3 MB). Free memory was 71.5 MB in the beginning and 206.7 MB in the end (delta: -135.2 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 658]: assertion can be violated assertion can be violated We found a FailurePath: [L642] requires void$SimpleFrame2Cons$4$actionPerformed$4888$__this != $null; [L651] r0125 := void$SimpleFrame2Cons$4$actionPerformed$4888$__this; [L653] r1126 := void$SimpleFrame2Cons$4$actionPerformed$4888$param_0; [L655] $r2129 := SimpleFrame2Cons$SimpleFrame2Cons$4$this$0763; [L390] r083 := $param_0; [L392] $r185 := javax.swing.JButton$SimpleFrame2Cons$event2227; [L394] __ret := $r185; [L658] assert $r3130 != $null; - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 304 locations, 87 error locations. UNSAFE Result, 13.4s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 10.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2222 SDtfs, 415 SDslu, 3528 SDs, 0 SdLazy, 30 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 178 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...