java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInlineTransformed.xml --icfgtransformation.transformationtype MAP_ELIMINATION_MONNIAUX -i ../../../trunk/examples/programs/real-life/GuiTestExampleUnsafe.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1c58c86 [2019-05-15 10:56:00,214 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-05-15 10:56:00,221 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-05-15 10:56:00,239 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-15 10:56:00,239 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-05-15 10:56:00,240 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-15 10:56:00,245 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-05-15 10:56:00,249 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-05-15 10:56:00,252 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-05-15 10:56:00,254 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-05-15 10:56:00,255 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-05-15 10:56:00,255 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-05-15 10:56:00,257 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-05-15 10:56:00,260 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-05-15 10:56:00,262 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-05-15 10:56:00,262 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-15 10:56:00,263 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-05-15 10:56:00,265 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-15 10:56:00,267 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-05-15 10:56:00,269 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-05-15 10:56:00,270 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-05-15 10:56:00,271 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-05-15 10:56:00,274 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-15 10:56:00,274 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-15 10:56:00,275 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-05-15 10:56:00,276 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-05-15 10:56:00,276 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-05-15 10:56:00,277 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-05-15 10:56:00,277 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-05-15 10:56:00,278 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-05-15 10:56:00,279 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-05-15 10:56:00,280 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-05-15 10:56:00,281 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-15 10:56:00,281 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-05-15 10:56:00,282 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-05-15 10:56:00,282 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-05-15 10:56:00,282 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-05-15 10:56:00,283 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-05-15 10:56:00,284 INFO L181 SettingsManager]: Finished resetting all preferences to default values... Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: TransformationType -> MAP_ELIMINATION_MONNIAUX [2019-05-15 10:56:00,316 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-05-15 10:56:00,329 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-15 10:56:00,332 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-05-15 10:56:00,334 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-05-15 10:56:00,334 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-05-15 10:56:00,335 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GuiTestExampleUnsafe.bpl [2019-05-15 10:56:00,335 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GuiTestExampleUnsafe.bpl' [2019-05-15 10:56:00,439 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-05-15 10:56:00,441 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-05-15 10:56:00,442 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-15 10:56:00,442 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-05-15 10:56:00,442 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-05-15 10:56:00,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,479 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,487 WARN L165 Inliner]: Program contained no entry procedure! [2019-05-15 10:56:00,488 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-05-15 10:56:00,488 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-05-15 10:56:00,539 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-15 10:56:00,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-05-15 10:56:00,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-05-15 10:56:00,540 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-05-15 10:56:00,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,617 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-15 10:56:00,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-05-15 10:56:00,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-05-15 10:56:00,641 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-05-15 10:56:00,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-05-15 10:56:00,713 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$3$$la$init$ra$$4885 given in one single declaration [2019-05-15 10:56:00,714 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$3$$la$init$ra$$4885 [2019-05-15 10:56:00,714 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$3$$la$init$ra$$4885 [2019-05-15 10:56:00,714 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$2$actionPerformed$4553 given in one single declaration [2019-05-15 10:56:00,714 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$2$actionPerformed$4553 [2019-05-15 10:56:00,714 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$2$actionPerformed$4553 [2019-05-15 10:56:00,715 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$3$actionPerformed$4886 given in one single declaration [2019-05-15 10:56:00,715 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$3$actionPerformed$4886 [2019-05-15 10:56:00,715 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$3$actionPerformed$4886 [2019-05-15 10:56:00,715 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$$la$init$ra$$1805 given in one single declaration [2019-05-15 10:56:00,716 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$$la$init$ra$$1805 [2019-05-15 10:56:00,716 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$$la$init$ra$$1805 [2019-05-15 10:56:00,716 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$1$$la$init$ra$$1802 given in one single declaration [2019-05-15 10:56:00,716 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$1$$la$init$ra$$1802 [2019-05-15 10:56:00,716 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$1$$la$init$ra$$1802 [2019-05-15 10:56:00,718 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.SwingUtilities$invokeLater$4940 [2019-05-15 10:56:00,718 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.JFrame$setLayout$1827 [2019-05-15 10:56:00,718 INFO L124 BoogieDeclarations]: Specification and implementation of procedure javax.swing.JButton$SimpleFrame2Cons$access$0$1806 given in one single declaration [2019-05-15 10:56:00,719 INFO L130 BoogieDeclarations]: Found specification of procedure javax.swing.JButton$SimpleFrame2Cons$access$0$1806 [2019-05-15 10:56:00,719 INFO L138 BoogieDeclarations]: Found implementation of procedure javax.swing.JButton$SimpleFrame2Cons$access$0$1806 [2019-05-15 10:56:00,719 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$2$$la$init$ra$$4552 given in one single declaration [2019-05-15 10:56:00,719 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$2$$la$init$ra$$4552 [2019-05-15 10:56:00,720 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$2$$la$init$ra$$4552 [2019-05-15 10:56:00,720 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Frame$setResizable$1858 [2019-05-15 10:56:00,720 INFO L124 BoogieDeclarations]: Specification and implementation of procedure java.awt.Dimension$java.awt.Toolkit$getScreenSize$3246 given in one single declaration [2019-05-15 10:56:00,721 INFO L130 BoogieDeclarations]: Found specification of procedure java.awt.Dimension$java.awt.Toolkit$getScreenSize$3246 [2019-05-15 10:56:00,721 INFO L138 BoogieDeclarations]: Found implementation of procedure java.awt.Dimension$java.awt.Toolkit$getScreenSize$3246 [2019-05-15 10:56:00,721 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$javax.swing.JFrame$$la$init$ra$$1809 given in one single declaration [2019-05-15 10:56:00,721 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.JFrame$$la$init$ra$$1809 [2019-05-15 10:56:00,721 INFO L138 BoogieDeclarations]: Found implementation of procedure void$javax.swing.JFrame$$la$init$ra$$1809 [2019-05-15 10:56:00,722 INFO L124 BoogieDeclarations]: Specification and implementation of procedure int$SimpleFrame2Cons$access$2$1808 given in one single declaration [2019-05-15 10:56:00,723 INFO L130 BoogieDeclarations]: Found specification of procedure int$SimpleFrame2Cons$access$2$1808 [2019-05-15 10:56:00,723 INFO L138 BoogieDeclarations]: Found implementation of procedure int$SimpleFrame2Cons$access$2$1808 [2019-05-15 10:56:00,723 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.JFrame$setDefaultCloseOperation$1816 [2019-05-15 10:56:00,724 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.AbstractButton$addActionListener$4123 [2019-05-15 10:56:00,724 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Window$setLocation$1913 [2019-05-15 10:56:00,724 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$4$$la$init$ra$$4887 given in one single declaration [2019-05-15 10:56:00,724 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$4$$la$init$ra$$4887 [2019-05-15 10:56:00,725 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$4$$la$init$ra$$4887 [2019-05-15 10:56:00,728 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$4$actionPerformed$4888 given in one single declaration [2019-05-15 10:56:00,728 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$4$actionPerformed$4888 [2019-05-15 10:56:00,728 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$4$actionPerformed$4888 [2019-05-15 10:56:00,728 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.AbstractButton$setEnabled$4131 [2019-05-15 10:56:00,729 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Window$setVisible$1918 [2019-05-15 10:56:00,729 INFO L130 BoogieDeclarations]: Found specification of procedure int$java.awt.Component$getHeight$2305 [2019-05-15 10:56:00,729 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Window$pack$1909 [2019-05-15 10:56:00,729 INFO L130 BoogieDeclarations]: Found specification of procedure java.awt.Toolkit$java.awt.Toolkit$getDefaultToolkit$3255 [2019-05-15 10:56:00,729 INFO L130 BoogieDeclarations]: Found specification of procedure int$java.awt.Component$getWidth$2304 [2019-05-15 10:56:00,729 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Frame$setTitle$1852 [2019-05-15 10:56:00,733 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$access$1$1807 given in one single declaration [2019-05-15 10:56:00,734 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$access$1$1807 [2019-05-15 10:56:00,734 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$access$1$1807 [2019-05-15 10:56:00,734 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.FlowLayout$$la$init$ra$$4889 [2019-05-15 10:56:00,734 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$1$run$1803 given in one single declaration [2019-05-15 10:56:00,735 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$1$run$1803 [2019-05-15 10:56:00,736 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$1$run$1803 [2019-05-15 10:56:00,736 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$main$1804 given in one single declaration [2019-05-15 10:56:00,736 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$main$1804 [2019-05-15 10:56:00,737 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$main$1804 [2019-05-15 10:56:00,737 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.JButton$$la$init$ra$$2558 [2019-05-15 10:56:00,737 INFO L124 BoogieDeclarations]: Specification and implementation of procedure $EFG_Procedure given in one single declaration [2019-05-15 10:56:00,737 INFO L130 BoogieDeclarations]: Found specification of procedure $EFG_Procedure [2019-05-15 10:56:00,737 INFO L138 BoogieDeclarations]: Found implementation of procedure $EFG_Procedure [2019-05-15 10:56:00,739 INFO L130 BoogieDeclarations]: Found specification of procedure java.awt.Component$java.awt.Container$add$2075 [2019-05-15 10:56:00,740 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.lang.Object$$la$init$ra$$38 [2019-05-15 10:56:01,082 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-05-15 10:56:01,151 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-05-15 10:56:01,255 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-05-15 10:56:01,315 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-05-15 10:56:01,958 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-05-15 10:56:01,980 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-05-15 10:56:02,030 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-05-15 10:56:02,034 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-05-15 10:56:02,041 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-05-15 10:56:02,079 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-05-15 10:56:02,108 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-05-15 10:56:04,033 INFO L275 CfgBuilder]: Using library mode [2019-05-15 10:56:04,033 INFO L283 CfgBuilder]: Removed 44 assume(true) statements. [2019-05-15 10:56:04,035 INFO L202 PluginConnector]: Adding new model GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:56:04 BoogieIcfgContainer [2019-05-15 10:56:04,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-05-15 10:56:04,035 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2019-05-15 10:56:04,036 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2019-05-15 10:56:04,037 INFO L275 PluginConnector]: IcfgTransformer initialized [2019-05-15 10:56:04,039 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:56:04" (1/1) ... [2019-05-15 10:56:04,553 INFO L202 PluginConnector]: Adding new model GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.05 10:56:04 BasicIcfg [2019-05-15 10:56:04,553 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2019-05-15 10:56:04,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-05-15 10:56:04,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-05-15 10:56:04,558 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-05-15 10:56:04,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/3) ... [2019-05-15 10:56:04,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3484a82c and model type GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.05 10:56:04, skipping insertion in model container [2019-05-15 10:56:04,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:56:04" (2/3) ... [2019-05-15 10:56:04,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3484a82c and model type GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:56:04, skipping insertion in model container [2019-05-15 10:56:04,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.05 10:56:04" (3/3) ... [2019-05-15 10:56:04,562 INFO L109 eAbstractionObserver]: Analyzing ICFG GuiTestExampleUnsafe.bplME [2019-05-15 10:56:04,572 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-15 10:56:04,582 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 87 error locations. [2019-05-15 10:56:04,597 INFO L252 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2019-05-15 10:56:04,621 INFO L127 ementStrategyFactory]: Using default assertion order modulation [2019-05-15 10:56:04,622 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-05-15 10:56:04,622 INFO L378 AbstractCegarLoop]: Hoare is false [2019-05-15 10:56:04,622 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-05-15 10:56:04,623 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-05-15 10:56:04,623 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-05-15 10:56:04,623 INFO L382 AbstractCegarLoop]: Difference is false [2019-05-15 10:56:04,623 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-05-15 10:56:04,623 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-15 10:56:04,646 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states. [2019-05-15 10:56:04,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-05-15 10:56:04,654 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:56:04,655 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-05-15 10:56:04,661 INFO L418 AbstractCegarLoop]: === Iteration 1 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:56:04,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:56:04,667 INFO L82 PathProgramCache]: Analyzing trace with hash 16402, now seen corresponding path program 1 times [2019-05-15 10:56:04,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:56:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:04,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjunts are in the unsatisfiable core [2019-05-15 10:56:04,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:04,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:56:04,922 INFO L273 TraceCheckUtils]: 0: Hoare triple {223#true} [482] void$SimpleFrame2Cons$$la$init$ra$$1805ENTRY-->L796: Formula: (and (= v_void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this_5 v_void$SimpleFrame2Cons$$la$init$ra$$1805_r012_29) (= v_void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep1_8 $null) (not (= $null v_void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this_5)) (= v_void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$caughtEx0_16 $null)) InVars {void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this=v_void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this_5} OutVars{void$SimpleFrame2Cons$$la$init$ra$$1805_r012=v_void$SimpleFrame2Cons$$la$init$ra$$1805_r012_29, void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep1=v_void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep1_8, void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$caughtEx0=v_void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$caughtEx0_16, void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this=v_void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this_5} AuxVars[] AssignedVars[void$SimpleFrame2Cons$$la$init$ra$$1805_r012, void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep1, void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$caughtEx0] {228#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_r012))} is VALID [2019-05-15 10:56:04,936 INFO L273 TraceCheckUtils]: 1: Hoare triple {228#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_r012))} [499] L796-->void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT: Formula: (= $null v_void$SimpleFrame2Cons$$la$init$ra$$1805_r012_4) InVars {void$SimpleFrame2Cons$$la$init$ra$$1805_r012=v_void$SimpleFrame2Cons$$la$init$ra$$1805_r012_4} OutVars{void$SimpleFrame2Cons$$la$init$ra$$1805_r012=v_void$SimpleFrame2Cons$$la$init$ra$$1805_r012_4} AuxVars[] AssignedVars[] {224#false} is VALID [2019-05-15 10:56:04,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:56:04,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:56:04,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-05-15 10:56:04,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-05-15 10:56:04,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:56:04,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-05-15 10:56:04,983 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:04,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-05-15 10:56:04,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-15 10:56:04,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-15 10:56:04,997 INFO L87 Difference]: Start difference. First operand 220 states. Second operand 3 states. [2019-05-15 10:56:06,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:06,059 INFO L93 Difference]: Finished difference Result 204 states and 203 transitions. [2019-05-15 10:56:06,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-15 10:56:06,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-05-15 10:56:06,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:56:06,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:06,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 219 transitions. [2019-05-15 10:56:06,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:06,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 219 transitions. [2019-05-15 10:56:06,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 219 transitions. [2019-05-15 10:56:06,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:06,464 INFO L225 Difference]: With dead ends: 204 [2019-05-15 10:56:06,464 INFO L226 Difference]: Without dead ends: 174 [2019-05-15 10:56:06,468 INFO L628 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-05-15 10:56:06,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-05-15 10:56:06,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2019-05-15 10:56:06,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:56:06,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand 174 states. [2019-05-15 10:56:06,510 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 174 states. [2019-05-15 10:56:06,510 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 174 states. [2019-05-15 10:56:06,511 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:56:06,527 INFO L93 Difference]: Finished difference Result 174 states and 176 transitions. [2019-05-15 10:56:06,528 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 176 transitions. [2019-05-15 10:56:06,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:06,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:06,530 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 174 states. [2019-05-15 10:56:06,530 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 174 states. [2019-05-15 10:56:06,530 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:56:06,544 INFO L93 Difference]: Finished difference Result 174 states and 176 transitions. [2019-05-15 10:56:06,544 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 176 transitions. [2019-05-15 10:56:06,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:06,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:06,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:56:06,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:56:06,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-05-15 10:56:06,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 176 transitions. [2019-05-15 10:56:06,558 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 176 transitions. Word has length 2 [2019-05-15 10:56:06,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:56:06,558 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 176 transitions. [2019-05-15 10:56:06,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-05-15 10:56:06,558 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 176 transitions. [2019-05-15 10:56:06,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-05-15 10:56:06,559 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:56:06,559 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-05-15 10:56:06,562 INFO L418 AbstractCegarLoop]: === Iteration 2 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:56:06,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:56:06,563 INFO L82 PathProgramCache]: Analyzing trace with hash 16499, now seen corresponding path program 1 times [2019-05-15 10:56:06,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:56:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:06,567 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 3 conjunts are in the unsatisfiable core [2019-05-15 10:56:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:06,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:56:06,598 INFO L273 TraceCheckUtils]: 0: Hoare triple {1289#true} [485] void$SimpleFrame2Cons$main$1804ENTRY-->L452: Formula: (and (= v_void$SimpleFrame2Cons$main$1804_r09_1 v_void$SimpleFrame2Cons$main$1804_$param_0_1) (not (= v_$fresh2_1 $null)) (= v_void$SimpleFrame2Cons$main$1804_$r110_2 v_$fresh2_1)) InVars {$fresh2=v_$fresh2_1, void$SimpleFrame2Cons$main$1804_$param_0=v_void$SimpleFrame2Cons$main$1804_$param_0_1} OutVars{void$SimpleFrame2Cons$main$1804_r09=v_void$SimpleFrame2Cons$main$1804_r09_1, void$SimpleFrame2Cons$main$1804_$r110=v_void$SimpleFrame2Cons$main$1804_$r110_2, $fresh2=v_$fresh2_1, void$SimpleFrame2Cons$main$1804_$param_0=v_void$SimpleFrame2Cons$main$1804_$param_0_1} AuxVars[] AssignedVars[void$SimpleFrame2Cons$main$1804_r09, void$SimpleFrame2Cons$main$1804_$r110] {1294#(not (= void$SimpleFrame2Cons$main$1804_$r110 $null))} is VALID [2019-05-15 10:56:06,606 INFO L273 TraceCheckUtils]: 1: Hoare triple {1294#(not (= void$SimpleFrame2Cons$main$1804_$r110 $null))} [503] L452-->void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT: Formula: (= v_void$SimpleFrame2Cons$main$1804_$r110_3 $null) InVars {void$SimpleFrame2Cons$main$1804_$r110=v_void$SimpleFrame2Cons$main$1804_$r110_3} OutVars{void$SimpleFrame2Cons$main$1804_$r110=v_void$SimpleFrame2Cons$main$1804_$r110_3} AuxVars[] AssignedVars[] {1290#false} is VALID [2019-05-15 10:56:06,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:56:06,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:56:06,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-05-15 10:56:06,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-05-15 10:56:06,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:56:06,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-05-15 10:56:06,612 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:06,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-05-15 10:56:06,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-15 10:56:06,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-15 10:56:06,613 INFO L87 Difference]: Start difference. First operand 174 states and 176 transitions. Second operand 3 states. [2019-05-15 10:56:06,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:06,940 INFO L93 Difference]: Finished difference Result 173 states and 175 transitions. [2019-05-15 10:56:06,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-15 10:56:06,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-05-15 10:56:06,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:56:06,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:06,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2019-05-15 10:56:06,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:06,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2019-05-15 10:56:06,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 176 transitions. [2019-05-15 10:56:07,328 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:07,333 INFO L225 Difference]: With dead ends: 173 [2019-05-15 10:56:07,333 INFO L226 Difference]: Without dead ends: 173 [2019-05-15 10:56:07,334 INFO L628 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-05-15 10:56:07,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-05-15 10:56:07,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-05-15 10:56:07,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:56:07,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand 173 states. [2019-05-15 10:56:07,343 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand 173 states. [2019-05-15 10:56:07,343 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 173 states. [2019-05-15 10:56:07,343 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:56:07,357 INFO L93 Difference]: Finished difference Result 173 states and 175 transitions. [2019-05-15 10:56:07,357 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 175 transitions. [2019-05-15 10:56:07,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:07,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:07,359 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand 173 states. [2019-05-15 10:56:07,360 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 173 states. [2019-05-15 10:56:07,360 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:56:07,374 INFO L93 Difference]: Finished difference Result 173 states and 175 transitions. [2019-05-15 10:56:07,374 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 175 transitions. [2019-05-15 10:56:07,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:07,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:07,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:56:07,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:56:07,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-05-15 10:56:07,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 175 transitions. [2019-05-15 10:56:07,387 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 175 transitions. Word has length 2 [2019-05-15 10:56:07,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:56:07,388 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 175 transitions. [2019-05-15 10:56:07,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-05-15 10:56:07,388 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 175 transitions. [2019-05-15 10:56:07,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-05-15 10:56:07,388 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:56:07,388 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-05-15 10:56:07,392 INFO L418 AbstractCegarLoop]: === Iteration 3 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:56:07,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:56:07,393 INFO L82 PathProgramCache]: Analyzing trace with hash 16369, now seen corresponding path program 1 times [2019-05-15 10:56:07,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:56:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:07,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 3 conjunts are in the unsatisfiable core [2019-05-15 10:56:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:07,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:56:07,422 INFO L273 TraceCheckUtils]: 0: Hoare triple {2319#true} [481] void$SimpleFrame2Cons$1$run$1803ENTRY-->L543: Formula: (and (= $null v_void$SimpleFrame2Cons$1$run$1803_void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep3_7) (not (= v_$fresh1_4 $null)) (= v_$fresh1_4 v_void$SimpleFrame2Cons$1$run$1803_$r14_7) (= v_void$SimpleFrame2Cons$1$run$1803_r03_4 v_void$SimpleFrame2Cons$1$run$1803___this_5) (not (= $null v_void$SimpleFrame2Cons$1$run$1803___this_5)) (= v_void$SimpleFrame2Cons$1$run$1803_$caughtEx0_12 $null)) InVars {void$SimpleFrame2Cons$1$run$1803___this=v_void$SimpleFrame2Cons$1$run$1803___this_5, $fresh1=v_$fresh1_4} OutVars{void$SimpleFrame2Cons$1$run$1803_void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep3=v_void$SimpleFrame2Cons$1$run$1803_void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep3_7, void$SimpleFrame2Cons$1$run$1803_r03=v_void$SimpleFrame2Cons$1$run$1803_r03_4, void$SimpleFrame2Cons$1$run$1803___this=v_void$SimpleFrame2Cons$1$run$1803___this_5, $fresh1=v_$fresh1_4, void$SimpleFrame2Cons$1$run$1803_$caughtEx0=v_void$SimpleFrame2Cons$1$run$1803_$caughtEx0_12, void$SimpleFrame2Cons$1$run$1803_$r14=v_void$SimpleFrame2Cons$1$run$1803_$r14_7} AuxVars[] AssignedVars[void$SimpleFrame2Cons$1$run$1803_void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep3, void$SimpleFrame2Cons$1$run$1803_r03, void$SimpleFrame2Cons$1$run$1803_$caughtEx0, void$SimpleFrame2Cons$1$run$1803_$r14] {2324#(not (= $null void$SimpleFrame2Cons$1$run$1803_$r14))} is VALID [2019-05-15 10:56:07,423 INFO L273 TraceCheckUtils]: 1: Hoare triple {2324#(not (= $null void$SimpleFrame2Cons$1$run$1803_$r14))} [497] L543-->void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT: Formula: (= v_void$SimpleFrame2Cons$1$run$1803_$r14_3 $null) InVars {void$SimpleFrame2Cons$1$run$1803_$r14=v_void$SimpleFrame2Cons$1$run$1803_$r14_3} OutVars{void$SimpleFrame2Cons$1$run$1803_$r14=v_void$SimpleFrame2Cons$1$run$1803_$r14_3} AuxVars[] AssignedVars[] {2320#false} is VALID [2019-05-15 10:56:07,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:56:07,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:56:07,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-05-15 10:56:07,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-05-15 10:56:07,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:56:07,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-05-15 10:56:07,431 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:07,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-05-15 10:56:07,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-15 10:56:07,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-15 10:56:07,432 INFO L87 Difference]: Start difference. First operand 173 states and 175 transitions. Second operand 3 states. [2019-05-15 10:56:07,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:07,737 INFO L93 Difference]: Finished difference Result 172 states and 174 transitions. [2019-05-15 10:56:07,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-15 10:56:07,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-05-15 10:56:07,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:56:07,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:07,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2019-05-15 10:56:07,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:07,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2019-05-15 10:56:07,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 175 transitions. [2019-05-15 10:56:07,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:07,997 INFO L225 Difference]: With dead ends: 172 [2019-05-15 10:56:07,997 INFO L226 Difference]: Without dead ends: 172 [2019-05-15 10:56:07,998 INFO L628 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-05-15 10:56:07,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-05-15 10:56:08,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2019-05-15 10:56:08,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:56:08,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand 172 states. [2019-05-15 10:56:08,006 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 172 states. [2019-05-15 10:56:08,006 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 172 states. [2019-05-15 10:56:08,006 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:56:08,013 INFO L93 Difference]: Finished difference Result 172 states and 174 transitions. [2019-05-15 10:56:08,014 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 174 transitions. [2019-05-15 10:56:08,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:08,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:08,015 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 172 states. [2019-05-15 10:56:08,015 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 172 states. [2019-05-15 10:56:08,015 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:56:08,022 INFO L93 Difference]: Finished difference Result 172 states and 174 transitions. [2019-05-15 10:56:08,022 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 174 transitions. [2019-05-15 10:56:08,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:08,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:08,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:56:08,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:56:08,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-05-15 10:56:08,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 174 transitions. [2019-05-15 10:56:08,029 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 174 transitions. Word has length 2 [2019-05-15 10:56:08,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:56:08,030 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 174 transitions. [2019-05-15 10:56:08,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-05-15 10:56:08,030 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 174 transitions. [2019-05-15 10:56:08,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-05-15 10:56:08,030 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:56:08,031 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-05-15 10:56:08,033 INFO L418 AbstractCegarLoop]: === Iteration 4 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:56:08,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:56:08,033 INFO L82 PathProgramCache]: Analyzing trace with hash 16629, now seen corresponding path program 1 times [2019-05-15 10:56:08,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:56:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:08,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjunts are in the unsatisfiable core [2019-05-15 10:56:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:08,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:56:08,088 INFO L273 TraceCheckUtils]: 0: Hoare triple {3343#true} [489] void$SimpleFrame2Cons$4$$la$init$ra$$4887ENTRY-->L590: Formula: (and (= v_void$SimpleFrame2Cons$4$$la$init$ra$$4887_void$SimpleFrame2Cons$4$$la$init$ra$$4887$param_0_2 v_void$SimpleFrame2Cons$4$$la$init$ra$$4887_r1121_2) (not (= $null v_void$SimpleFrame2Cons$4$$la$init$ra$$4887_void$SimpleFrame2Cons$4$$la$init$ra$$4887$__this_3)) (= v_SimpleFrame2Cons$SimpleFrame2Cons$4$this$0763_8 v_void$SimpleFrame2Cons$4$$la$init$ra$$4887_r1121_2) (= v_void$SimpleFrame2Cons$4$$la$init$ra$$4887_void$SimpleFrame2Cons$4$$la$init$ra$$4887$__this_3 v_void$SimpleFrame2Cons$4$$la$init$ra$$4887_r0120_4)) InVars {void$SimpleFrame2Cons$4$$la$init$ra$$4887_void$SimpleFrame2Cons$4$$la$init$ra$$4887$param_0=v_void$SimpleFrame2Cons$4$$la$init$ra$$4887_void$SimpleFrame2Cons$4$$la$init$ra$$4887$param_0_2, void$SimpleFrame2Cons$4$$la$init$ra$$4887_void$SimpleFrame2Cons$4$$la$init$ra$$4887$__this=v_void$SimpleFrame2Cons$4$$la$init$ra$$4887_void$SimpleFrame2Cons$4$$la$init$ra$$4887$__this_3} OutVars{SimpleFrame2Cons$SimpleFrame2Cons$4$this$0763=v_SimpleFrame2Cons$SimpleFrame2Cons$4$this$0763_8, void$SimpleFrame2Cons$4$$la$init$ra$$4887_void$SimpleFrame2Cons$4$$la$init$ra$$4887$param_0=v_void$SimpleFrame2Cons$4$$la$init$ra$$4887_void$SimpleFrame2Cons$4$$la$init$ra$$4887$param_0_2, void$SimpleFrame2Cons$4$$la$init$ra$$4887_r0120=v_void$SimpleFrame2Cons$4$$la$init$ra$$4887_r0120_4, void$SimpleFrame2Cons$4$$la$init$ra$$4887_r1121=v_void$SimpleFrame2Cons$4$$la$init$ra$$4887_r1121_2, void$SimpleFrame2Cons$4$$la$init$ra$$4887_void$SimpleFrame2Cons$4$$la$init$ra$$4887$__this=v_void$SimpleFrame2Cons$4$$la$init$ra$$4887_void$SimpleFrame2Cons$4$$la$init$ra$$4887$__this_3} AuxVars[] AssignedVars[SimpleFrame2Cons$SimpleFrame2Cons$4$this$0763, void$SimpleFrame2Cons$4$$la$init$ra$$4887_r0120, void$SimpleFrame2Cons$4$$la$init$ra$$4887_r1121] {3348#(not (= $null void$SimpleFrame2Cons$4$$la$init$ra$$4887_r0120))} is VALID [2019-05-15 10:56:08,089 INFO L273 TraceCheckUtils]: 1: Hoare triple {3348#(not (= $null void$SimpleFrame2Cons$4$$la$init$ra$$4887_r0120))} [509] L590-->void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT: Formula: (= $null v_void$SimpleFrame2Cons$4$$la$init$ra$$4887_r0120_2) InVars {void$SimpleFrame2Cons$4$$la$init$ra$$4887_r0120=v_void$SimpleFrame2Cons$4$$la$init$ra$$4887_r0120_2} OutVars{void$SimpleFrame2Cons$4$$la$init$ra$$4887_r0120=v_void$SimpleFrame2Cons$4$$la$init$ra$$4887_r0120_2} AuxVars[] AssignedVars[] {3344#false} is VALID [2019-05-15 10:56:08,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:56:08,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:56:08,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-05-15 10:56:08,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-05-15 10:56:08,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:56:08,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-05-15 10:56:08,095 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:08,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-05-15 10:56:08,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-15 10:56:08,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-15 10:56:08,096 INFO L87 Difference]: Start difference. First operand 172 states and 174 transitions. Second operand 3 states. [2019-05-15 10:56:08,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:08,380 INFO L93 Difference]: Finished difference Result 171 states and 173 transitions. [2019-05-15 10:56:08,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-15 10:56:08,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-05-15 10:56:08,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:56:08,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:08,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2019-05-15 10:56:08,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:08,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2019-05-15 10:56:08,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 174 transitions. [2019-05-15 10:56:08,619 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:08,623 INFO L225 Difference]: With dead ends: 171 [2019-05-15 10:56:08,623 INFO L226 Difference]: Without dead ends: 169 [2019-05-15 10:56:08,624 INFO L628 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-05-15 10:56:08,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-05-15 10:56:08,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-05-15 10:56:08,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:56:08,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand 169 states. [2019-05-15 10:56:08,631 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand 169 states. [2019-05-15 10:56:08,631 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 169 states. [2019-05-15 10:56:08,631 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:56:08,637 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2019-05-15 10:56:08,637 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 172 transitions. [2019-05-15 10:56:08,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:08,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:08,638 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand 169 states. [2019-05-15 10:56:08,638 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 169 states. [2019-05-15 10:56:08,638 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:56:08,644 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2019-05-15 10:56:08,644 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 172 transitions. [2019-05-15 10:56:08,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:08,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:08,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:56:08,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:56:08,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-05-15 10:56:08,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 172 transitions. [2019-05-15 10:56:08,650 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 172 transitions. Word has length 2 [2019-05-15 10:56:08,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:56:08,650 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 172 transitions. [2019-05-15 10:56:08,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-05-15 10:56:08,650 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 172 transitions. [2019-05-15 10:56:08,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-05-15 10:56:08,651 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:56:08,651 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-05-15 10:56:08,653 INFO L418 AbstractCegarLoop]: === Iteration 5 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:56:08,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:56:08,654 INFO L82 PathProgramCache]: Analyzing trace with hash 16662, now seen corresponding path program 1 times [2019-05-15 10:56:08,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:56:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:08,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2019-05-15 10:56:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:08,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:56:08,698 INFO L273 TraceCheckUtils]: 0: Hoare triple {4353#true} [490] $EFG_ProcedureENTRY-->L734: Formula: (and (= v_SimpleFrame2Cons$SimpleFrame2Cons$4$this$0763_24 v_$EFG_Procedure_r1121_4) (= v_$EFG_Procedure_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this_8 v_$EFG_Procedure_r01_8) (= v_SimpleFrame2Cons$SimpleFrame2Cons$2$this$0711_29 v_$EFG_Procedure_r194_8) (not (= v_$EFG_Procedure_void$SimpleFrame2Cons$$la$init$ra$$1805$__this_9 $null)) (= v_$EFG_Procedure_void$javax.swing.JFrame$$la$init$ra$$1809_void$javax.swing.JFrame$$la$init$ra$$1809$__this_4 v_$EFG_Procedure_r012_19) (= v_$EFG_Procedure_void$SimpleFrame2Cons$4$$la$init$ra$$4887$__this_4 v_$EFG_Procedure_r0120_4) (not (= v_$EFG_Procedure_void$SimpleFrame2Cons$4$$la$init$ra$$4887$__this_4 $null)) (not (= v_$EFG_Procedure_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this_8 $null)) (= v_$EFG_Procedure_r093_8 v_$EFG_Procedure_void$SimpleFrame2Cons$2$$la$init$ra$$4552$__this_8) (not (= $null v_$EFG_Procedure_r01_8)) (= v_$EFG_Procedure_void$SimpleFrame2Cons$4$$la$init$ra$$4887$param_0_4 v_$EFG_Procedure_r1121_4) (not (= $null v_$EFG_Procedure_void$javax.swing.JFrame$$la$init$ra$$1809$__this_8)) (not (= $null v_$EFG_Procedure_r0120_4)) (= v_$EFG_Procedure_void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep1_8 $null) (= v_$EFG_Procedure_r194_8 v_$EFG_Procedure_void$SimpleFrame2Cons$2$$la$init$ra$$4552$param_0_8) (= v_$EFG_Procedure_void$SimpleFrame2Cons$$la$init$ra$$1805$__this_9 v_$EFG_Procedure_r012_19) (not (= v_$EFG_Procedure_r093_8 $null)) (not (= $null v_$EFG_Procedure_r012_19)) (not (= $null v_$EFG_Procedure_void$SimpleFrame2Cons$2$$la$init$ra$$4552$__this_8)) (= v_$EFG_Procedure_void$SimpleFrame2Cons$$la$init$ra$$1805$caughtEx0_20 $null) (= v_$EFG_Procedure_void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep0_8 $null)) InVars {$EFG_Procedure_void$SimpleFrame2Cons$4$$la$init$ra$$4887$param_0=v_$EFG_Procedure_void$SimpleFrame2Cons$4$$la$init$ra$$4887$param_0_4, $EFG_Procedure_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this=v_$EFG_Procedure_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this_8, $EFG_Procedure_void$javax.swing.JFrame$$la$init$ra$$1809$__this=v_$EFG_Procedure_void$javax.swing.JFrame$$la$init$ra$$1809$__this_8, $EFG_Procedure_void$SimpleFrame2Cons$$la$init$ra$$1805$__this=v_$EFG_Procedure_void$SimpleFrame2Cons$$la$init$ra$$1805$__this_9, $EFG_Procedure_void$SimpleFrame2Cons$4$$la$init$ra$$4887$__this=v_$EFG_Procedure_void$SimpleFrame2Cons$4$$la$init$ra$$4887$__this_4, $EFG_Procedure_void$SimpleFrame2Cons$2$$la$init$ra$$4552$param_0=v_$EFG_Procedure_void$SimpleFrame2Cons$2$$la$init$ra$$4552$param_0_8, $EFG_Procedure_void$SimpleFrame2Cons$2$$la$init$ra$$4552$__this=v_$EFG_Procedure_void$SimpleFrame2Cons$2$$la$init$ra$$4552$__this_8} OutVars{$EFG_Procedure_void$javax.swing.JFrame$$la$init$ra$$1809_void$javax.swing.JFrame$$la$init$ra$$1809$__this=v_$EFG_Procedure_void$javax.swing.JFrame$$la$init$ra$$1809_void$javax.swing.JFrame$$la$init$ra$$1809$__this_4, $EFG_Procedure_void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep1=v_$EFG_Procedure_void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep1_8, $EFG_Procedure_void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep0=v_$EFG_Procedure_void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep0_8, $EFG_Procedure_void$SimpleFrame2Cons$4$$la$init$ra$$4887$param_0=v_$EFG_Procedure_void$SimpleFrame2Cons$4$$la$init$ra$$4887$param_0_4, $EFG_Procedure_void$SimpleFrame2Cons$$la$init$ra$$1805$caughtEx0=v_$EFG_Procedure_void$SimpleFrame2Cons$$la$init$ra$$1805$caughtEx0_20, $EFG_Procedure_void$SimpleFrame2Cons$4$$la$init$ra$$4887$__this=v_$EFG_Procedure_void$SimpleFrame2Cons$4$$la$init$ra$$4887$__this_4, $EFG_Procedure_r012=v_$EFG_Procedure_r012_19, $EFG_Procedure_r1121=v_$EFG_Procedure_r1121_4, $EFG_Procedure_r093=v_$EFG_Procedure_r093_8, SimpleFrame2Cons$SimpleFrame2Cons$4$this$0763=v_SimpleFrame2Cons$SimpleFrame2Cons$4$this$0763_24, SimpleFrame2Cons$SimpleFrame2Cons$2$this$0711=v_SimpleFrame2Cons$SimpleFrame2Cons$2$this$0711_29, $EFG_Procedure_r0120=v_$EFG_Procedure_r0120_4, $EFG_Procedure_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this=v_$EFG_Procedure_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this_8, $EFG_Procedure_r01=v_$EFG_Procedure_r01_8, $EFG_Procedure_void$javax.swing.JFrame$$la$init$ra$$1809$__this=v_$EFG_Procedure_void$javax.swing.JFrame$$la$init$ra$$1809$__this_8, $EFG_Procedure_void$SimpleFrame2Cons$$la$init$ra$$1805$__this=v_$EFG_Procedure_void$SimpleFrame2Cons$$la$init$ra$$1805$__this_9, $EFG_Procedure_void$SimpleFrame2Cons$2$$la$init$ra$$4552$param_0=v_$EFG_Procedure_void$SimpleFrame2Cons$2$$la$init$ra$$4552$param_0_8, $EFG_Procedure_r194=v_$EFG_Procedure_r194_8, $EFG_Procedure_void$SimpleFrame2Cons$2$$la$init$ra$$4552$__this=v_$EFG_Procedure_void$SimpleFrame2Cons$2$$la$init$ra$$4552$__this_8} AuxVars[] AssignedVars[SimpleFrame2Cons$SimpleFrame2Cons$4$this$0763, $EFG_Procedure_void$javax.swing.JFrame$$la$init$ra$$1809_void$javax.swing.JFrame$$la$init$ra$$1809$__this, $EFG_Procedure_void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep1, SimpleFrame2Cons$SimpleFrame2Cons$2$this$0711, $EFG_Procedure_r0120, $EFG_Procedure_void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep0, $EFG_Procedure_r01, $EFG_Procedure_void$SimpleFrame2Cons$$la$init$ra$$1805$caughtEx0, $EFG_Procedure_r012, $EFG_Procedure_r1121, $EFG_Procedure_r093, $EFG_Procedure_r194] {4358#(not (= $EFG_Procedure_void$javax.swing.JFrame$$la$init$ra$$1809_void$javax.swing.JFrame$$la$init$ra$$1809$__this $null))} is VALID [2019-05-15 10:56:08,700 INFO L273 TraceCheckUtils]: 1: Hoare triple {4358#(not (= $EFG_Procedure_void$javax.swing.JFrame$$la$init$ra$$1809_void$javax.swing.JFrame$$la$init$ra$$1809$__this $null))} [511] L734-->$EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT: Formula: (= v_$EFG_Procedure_void$javax.swing.JFrame$$la$init$ra$$1809_void$javax.swing.JFrame$$la$init$ra$$1809$__this_2 $null) InVars {$EFG_Procedure_void$javax.swing.JFrame$$la$init$ra$$1809_void$javax.swing.JFrame$$la$init$ra$$1809$__this=v_$EFG_Procedure_void$javax.swing.JFrame$$la$init$ra$$1809_void$javax.swing.JFrame$$la$init$ra$$1809$__this_2} OutVars{$EFG_Procedure_void$javax.swing.JFrame$$la$init$ra$$1809_void$javax.swing.JFrame$$la$init$ra$$1809$__this=v_$EFG_Procedure_void$javax.swing.JFrame$$la$init$ra$$1809_void$javax.swing.JFrame$$la$init$ra$$1809$__this_2} AuxVars[] AssignedVars[] {4354#false} is VALID [2019-05-15 10:56:08,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:56:08,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:56:08,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-05-15 10:56:08,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-05-15 10:56:08,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:56:08,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-05-15 10:56:08,704 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:08,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-05-15 10:56:08,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-15 10:56:08,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-15 10:56:08,704 INFO L87 Difference]: Start difference. First operand 169 states and 172 transitions. Second operand 3 states. [2019-05-15 10:56:08,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:08,908 INFO L93 Difference]: Finished difference Result 168 states and 171 transitions. [2019-05-15 10:56:08,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-15 10:56:08,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-05-15 10:56:08,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:56:08,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:08,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2019-05-15 10:56:08,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:08,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2019-05-15 10:56:08,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 172 transitions. [2019-05-15 10:56:09,384 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:09,387 INFO L225 Difference]: With dead ends: 168 [2019-05-15 10:56:09,387 INFO L226 Difference]: Without dead ends: 168 [2019-05-15 10:56:09,387 INFO L628 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-05-15 10:56:09,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-05-15 10:56:09,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-05-15 10:56:09,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:56:09,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand 168 states. [2019-05-15 10:56:09,393 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 168 states. [2019-05-15 10:56:09,394 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 168 states. [2019-05-15 10:56:09,394 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:56:09,399 INFO L93 Difference]: Finished difference Result 168 states and 171 transitions. [2019-05-15 10:56:09,400 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 171 transitions. [2019-05-15 10:56:09,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:09,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:09,401 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 168 states. [2019-05-15 10:56:09,401 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 168 states. [2019-05-15 10:56:09,401 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:56:09,406 INFO L93 Difference]: Finished difference Result 168 states and 171 transitions. [2019-05-15 10:56:09,406 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 171 transitions. [2019-05-15 10:56:09,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:09,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:09,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:56:09,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:56:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-05-15 10:56:09,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 171 transitions. [2019-05-15 10:56:09,410 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 171 transitions. Word has length 2 [2019-05-15 10:56:09,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:56:09,411 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 171 transitions. [2019-05-15 10:56:09,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-05-15 10:56:09,411 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 171 transitions. [2019-05-15 10:56:09,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-05-15 10:56:09,411 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:56:09,412 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-05-15 10:56:09,414 INFO L418 AbstractCegarLoop]: === Iteration 6 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:56:09,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:56:09,415 INFO L82 PathProgramCache]: Analyzing trace with hash 16695, now seen corresponding path program 1 times [2019-05-15 10:56:09,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:56:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:09,418 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 3 conjunts are in the unsatisfiable core [2019-05-15 10:56:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:09,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:56:09,552 INFO L273 TraceCheckUtils]: 0: Hoare triple {5355#true} [491] void$SimpleFrame2Cons$1$$la$init$ra$$1802ENTRY-->L434: Formula: (and (not (= v_void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this_3 $null)) (= v_void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this_3 v_void$SimpleFrame2Cons$1$$la$init$ra$$1802_r01_4)) InVars {void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this=v_void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this_3} OutVars{void$SimpleFrame2Cons$1$$la$init$ra$$1802_r01=v_void$SimpleFrame2Cons$1$$la$init$ra$$1802_r01_4, void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this=v_void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this_3} AuxVars[] AssignedVars[void$SimpleFrame2Cons$1$$la$init$ra$$1802_r01] {5360#(not (= void$SimpleFrame2Cons$1$$la$init$ra$$1802_r01 $null))} is VALID [2019-05-15 10:56:09,567 INFO L273 TraceCheckUtils]: 1: Hoare triple {5360#(not (= void$SimpleFrame2Cons$1$$la$init$ra$$1802_r01 $null))} [513] L434-->void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT: Formula: (= v_void$SimpleFrame2Cons$1$$la$init$ra$$1802_r01_2 $null) InVars {void$SimpleFrame2Cons$1$$la$init$ra$$1802_r01=v_void$SimpleFrame2Cons$1$$la$init$ra$$1802_r01_2} OutVars{void$SimpleFrame2Cons$1$$la$init$ra$$1802_r01=v_void$SimpleFrame2Cons$1$$la$init$ra$$1802_r01_2} AuxVars[] AssignedVars[] {5356#false} is VALID [2019-05-15 10:56:09,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:56:09,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:56:09,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-05-15 10:56:09,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-05-15 10:56:09,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:56:09,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-05-15 10:56:09,603 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:09,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-05-15 10:56:09,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-15 10:56:09,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-15 10:56:09,604 INFO L87 Difference]: Start difference. First operand 168 states and 171 transitions. Second operand 3 states. [2019-05-15 10:56:09,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:09,880 INFO L93 Difference]: Finished difference Result 167 states and 170 transitions. [2019-05-15 10:56:09,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-15 10:56:09,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-05-15 10:56:09,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:56:09,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:09,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2019-05-15 10:56:09,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:09,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2019-05-15 10:56:09,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 171 transitions. [2019-05-15 10:56:10,072 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:10,076 INFO L225 Difference]: With dead ends: 167 [2019-05-15 10:56:10,076 INFO L226 Difference]: Without dead ends: 165 [2019-05-15 10:56:10,077 INFO L628 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-05-15 10:56:10,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-05-15 10:56:10,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-05-15 10:56:10,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:56:10,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand 165 states. [2019-05-15 10:56:10,082 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 165 states. [2019-05-15 10:56:10,082 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 165 states. [2019-05-15 10:56:10,082 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:56:10,088 INFO L93 Difference]: Finished difference Result 165 states and 169 transitions. [2019-05-15 10:56:10,088 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2019-05-15 10:56:10,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:10,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:10,089 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 165 states. [2019-05-15 10:56:10,089 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 165 states. [2019-05-15 10:56:10,089 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-05-15 10:56:10,094 INFO L93 Difference]: Finished difference Result 165 states and 169 transitions. [2019-05-15 10:56:10,095 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2019-05-15 10:56:10,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:10,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:10,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:56:10,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:56:10,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-05-15 10:56:10,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 169 transitions. [2019-05-15 10:56:10,100 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 169 transitions. Word has length 2 [2019-05-15 10:56:10,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:56:10,100 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 169 transitions. [2019-05-15 10:56:10,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-05-15 10:56:10,100 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2019-05-15 10:56:10,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-05-15 10:56:10,101 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:56:10,101 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-05-15 10:56:10,102 INFO L418 AbstractCegarLoop]: === Iteration 7 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:56:10,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:56:10,103 INFO L82 PathProgramCache]: Analyzing trace with hash 16852, now seen corresponding path program 1 times [2019-05-15 10:56:10,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:56:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-05-15 10:56:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-05-15 10:56:10,122 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-05-15 10:56:10,134 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-05-15 10:56:10,136 INFO L202 PluginConnector]: Adding new model GuiTestExampleUnsafe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:56:10 BasicIcfg [2019-05-15 10:56:10,136 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-05-15 10:56:10,138 INFO L168 Benchmark]: Toolchain (without parser) took 9698.20 ms. Allocated memory was 142.1 MB in the beginning and 275.8 MB in the end (delta: 133.7 MB). Free memory was 109.4 MB in the beginning and 143.9 MB in the end (delta: -34.5 MB). Peak memory consumption was 99.2 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:10,139 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 142.1 MB. Free memory is still 112.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-05-15 10:56:10,140 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.90 ms. Allocated memory is still 142.1 MB. Free memory was 109.4 MB in the beginning and 104.3 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:10,141 INFO L168 Benchmark]: Boogie Preprocessor took 100.62 ms. Allocated memory is still 142.1 MB. Free memory was 104.3 MB in the beginning and 102.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:10,142 INFO L168 Benchmark]: RCFGBuilder took 3394.13 ms. Allocated memory was 142.1 MB in the beginning and 205.0 MB in the end (delta: 62.9 MB). Free memory was 102.1 MB in the beginning and 173.0 MB in the end (delta: -71.0 MB). Peak memory consumption was 80.6 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:10,143 INFO L168 Benchmark]: IcfgTransformer took 517.53 ms. Allocated memory is still 205.0 MB. Free memory was 173.0 MB in the beginning and 142.3 MB in the end (delta: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:10,143 INFO L168 Benchmark]: TraceAbstraction took 5582.26 ms. Allocated memory was 205.0 MB in the beginning and 275.8 MB in the end (delta: 70.8 MB). Free memory was 140.6 MB in the beginning and 143.9 MB in the end (delta: -3.4 MB). Peak memory consumption was 67.4 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:10,149 INFO L337 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.20 ms. Allocated memory is still 142.1 MB. Free memory is still 112.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 97.90 ms. Allocated memory is still 142.1 MB. Free memory was 109.4 MB in the beginning and 104.3 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 100.62 ms. Allocated memory is still 142.1 MB. Free memory was 104.3 MB in the beginning and 102.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3394.13 ms. Allocated memory was 142.1 MB in the beginning and 205.0 MB in the end (delta: 62.9 MB). Free memory was 102.1 MB in the beginning and 173.0 MB in the end (delta: -71.0 MB). Peak memory consumption was 80.6 MB. Max. memory is 7.1 GB. * IcfgTransformer took 517.53 ms. Allocated memory is still 205.0 MB. Free memory was 173.0 MB in the beginning and 142.3 MB in the end (delta: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5582.26 ms. Allocated memory was 205.0 MB in the beginning and 275.8 MB in the end (delta: 70.8 MB). Free memory was 140.6 MB in the beginning and 143.9 MB in the end (delta: -3.4 MB). Peak memory consumption was 67.4 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, 220 locations, 87 error locations. UNSAFE Result, 5.5s OverallTime, 7 OverallIterations, 1 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1047 SDtfs, 166 SDslu, 894 SDs, 0 SdLazy, 19 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred 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: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 24 SizeOfPredicates, 7 NumberOfNonLiveVariables, 58 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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...