java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/real-life/GuiTestExample.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 13:04:45,365 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 13:04:45,367 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 13:04:45,384 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 13:04:45,384 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 13:04:45,385 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 13:04:45,388 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 13:04:45,390 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 13:04:45,392 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 13:04:45,393 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 13:04:45,400 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 13:04:45,400 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 13:04:45,401 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 13:04:45,405 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 13:04:45,408 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 13:04:45,409 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 13:04:45,410 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 13:04:45,413 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 13:04:45,417 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 13:04:45,422 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 13:04:45,424 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 13:04:45,425 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 13:04:45,427 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 13:04:45,428 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 13:04:45,429 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 13:04:45,430 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 13:04:45,430 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 13:04:45,432 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 13:04:45,433 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 13:04:45,435 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 13:04:45,435 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 13:04:45,436 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 13:04:45,436 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 13:04:45,437 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 13:04:45,438 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 13:04:45,439 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 13:04:45,439 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-28 13:04:45,462 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 13:04:45,463 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 13:04:45,463 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 13:04:45,464 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 13:04:45,464 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 13:04:45,464 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 13:04:45,464 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 13:04:45,464 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 13:04:45,465 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-28 13:04:45,465 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 13:04:45,465 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-28 13:04:45,465 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-28 13:04:45,465 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 13:04:45,466 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 13:04:45,466 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 13:04:45,467 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 13:04:45,467 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 13:04:45,467 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 13:04:45,467 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 13:04:45,467 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 13:04:45,467 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 13:04:45,468 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 13:04:45,468 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 13:04:45,468 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 13:04:45,468 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 13:04:45,468 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 13:04:45,469 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 13:04:45,469 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 13:04:45,469 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 13:04:45,469 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 13:04:45,469 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 13:04:45,470 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:04:45,470 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 13:04:45,470 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 13:04:45,470 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 13:04:45,470 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 13:04:45,471 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 13:04:45,471 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 13:04:45,471 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 13:04:45,471 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 13:04:45,520 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 13:04:45,533 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 13:04:45,536 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 13:04:45,538 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 13:04:45,538 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 13:04:45,539 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GuiTestExample.bpl [2019-02-28 13:04:45,540 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/GuiTestExample.bpl' [2019-02-28 13:04:45,633 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 13:04:45,636 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 13:04:45,636 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 13:04:45,636 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 13:04:45,637 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 13:04:45,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:04:45" (1/1) ... [2019-02-28 13:04:45,681 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:04:45" (1/1) ... [2019-02-28 13:04:45,692 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-28 13:04:45,692 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-28 13:04:45,693 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-28 13:04:45,789 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 13:04:45,792 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 13:04:45,792 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 13:04:45,792 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 13:04:45,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:04:45" (1/1) ... [2019-02-28 13:04:45,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:04:45" (1/1) ... [2019-02-28 13:04:45,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:04:45" (1/1) ... [2019-02-28 13:04:45,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:04:45" (1/1) ... [2019-02-28 13:04:45,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:04:45" (1/1) ... [2019-02-28 13:04:45,865 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:04:45" (1/1) ... [2019-02-28 13:04:45,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:04:45" (1/1) ... [2019-02-28 13:04:45,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 13:04:45,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 13:04:45,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 13:04:45,894 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 13:04:45,896 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:04:45" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:04:45,974 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$3$$la$init$ra$$4885 given in one single declaration [2019-02-28 13:04:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$3$$la$init$ra$$4885 [2019-02-28 13:04:45,975 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$3$$la$init$ra$$4885 [2019-02-28 13:04:45,975 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$2$actionPerformed$4553 given in one single declaration [2019-02-28 13:04:45,976 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$2$actionPerformed$4553 [2019-02-28 13:04:45,976 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$2$actionPerformed$4553 [2019-02-28 13:04:45,976 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$3$actionPerformed$4886 given in one single declaration [2019-02-28 13:04:45,976 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$3$actionPerformed$4886 [2019-02-28 13:04:45,976 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$3$actionPerformed$4886 [2019-02-28 13:04:45,977 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$$la$init$ra$$1805 given in one single declaration [2019-02-28 13:04:45,978 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$$la$init$ra$$1805 [2019-02-28 13:04:45,978 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$$la$init$ra$$1805 [2019-02-28 13:04:45,978 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$1$$la$init$ra$$1802 given in one single declaration [2019-02-28 13:04:45,978 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$1$$la$init$ra$$1802 [2019-02-28 13:04:45,979 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$1$$la$init$ra$$1802 [2019-02-28 13:04:45,979 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.SwingUtilities$invokeLater$4940 [2019-02-28 13:04:45,979 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.JFrame$setLayout$1827 [2019-02-28 13:04:45,979 INFO L124 BoogieDeclarations]: Specification and implementation of procedure javax.swing.JButton$SimpleFrame2Cons$access$0$1806 given in one single declaration [2019-02-28 13:04:45,979 INFO L130 BoogieDeclarations]: Found specification of procedure javax.swing.JButton$SimpleFrame2Cons$access$0$1806 [2019-02-28 13:04:45,982 INFO L138 BoogieDeclarations]: Found implementation of procedure javax.swing.JButton$SimpleFrame2Cons$access$0$1806 [2019-02-28 13:04:45,982 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$2$$la$init$ra$$4552 given in one single declaration [2019-02-28 13:04:45,982 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$2$$la$init$ra$$4552 [2019-02-28 13:04:45,982 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$2$$la$init$ra$$4552 [2019-02-28 13:04:45,984 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Frame$setResizable$1858 [2019-02-28 13:04:45,984 INFO L124 BoogieDeclarations]: Specification and implementation of procedure java.awt.Dimension$java.awt.Toolkit$getScreenSize$3246 given in one single declaration [2019-02-28 13:04:45,984 INFO L130 BoogieDeclarations]: Found specification of procedure java.awt.Dimension$java.awt.Toolkit$getScreenSize$3246 [2019-02-28 13:04:45,984 INFO L138 BoogieDeclarations]: Found implementation of procedure java.awt.Dimension$java.awt.Toolkit$getScreenSize$3246 [2019-02-28 13:04:45,986 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$javax.swing.JFrame$$la$init$ra$$1809 given in one single declaration [2019-02-28 13:04:45,986 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.JFrame$$la$init$ra$$1809 [2019-02-28 13:04:45,986 INFO L138 BoogieDeclarations]: Found implementation of procedure void$javax.swing.JFrame$$la$init$ra$$1809 [2019-02-28 13:04:45,987 INFO L124 BoogieDeclarations]: Specification and implementation of procedure int$SimpleFrame2Cons$access$2$1808 given in one single declaration [2019-02-28 13:04:45,987 INFO L130 BoogieDeclarations]: Found specification of procedure int$SimpleFrame2Cons$access$2$1808 [2019-02-28 13:04:45,987 INFO L138 BoogieDeclarations]: Found implementation of procedure int$SimpleFrame2Cons$access$2$1808 [2019-02-28 13:04:45,987 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.JFrame$setDefaultCloseOperation$1816 [2019-02-28 13:04:45,987 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.AbstractButton$addActionListener$4123 [2019-02-28 13:04:45,988 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Window$setLocation$1913 [2019-02-28 13:04:45,995 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$4$$la$init$ra$$4887 given in one single declaration [2019-02-28 13:04:45,997 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$4$$la$init$ra$$4887 [2019-02-28 13:04:45,997 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$4$$la$init$ra$$4887 [2019-02-28 13:04:45,997 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$4$actionPerformed$4888 given in one single declaration [2019-02-28 13:04:45,998 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$4$actionPerformed$4888 [2019-02-28 13:04:45,998 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$4$actionPerformed$4888 [2019-02-28 13:04:45,998 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.AbstractButton$setEnabled$4131 [2019-02-28 13:04:46,000 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Window$setVisible$1918 [2019-02-28 13:04:46,002 INFO L130 BoogieDeclarations]: Found specification of procedure int$java.awt.Component$getHeight$2305 [2019-02-28 13:04:46,004 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Window$pack$1909 [2019-02-28 13:04:46,005 INFO L130 BoogieDeclarations]: Found specification of procedure java.awt.Toolkit$java.awt.Toolkit$getDefaultToolkit$3255 [2019-02-28 13:04:46,005 INFO L130 BoogieDeclarations]: Found specification of procedure int$java.awt.Component$getWidth$2304 [2019-02-28 13:04:46,005 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.Frame$setTitle$1852 [2019-02-28 13:04:46,006 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$access$1$1807 given in one single declaration [2019-02-28 13:04:46,006 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$access$1$1807 [2019-02-28 13:04:46,006 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$access$1$1807 [2019-02-28 13:04:46,006 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.awt.FlowLayout$$la$init$ra$$4889 [2019-02-28 13:04:46,006 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$1$run$1803 given in one single declaration [2019-02-28 13:04:46,007 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$1$run$1803 [2019-02-28 13:04:46,007 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$1$run$1803 [2019-02-28 13:04:46,008 INFO L124 BoogieDeclarations]: Specification and implementation of procedure void$SimpleFrame2Cons$main$1804 given in one single declaration [2019-02-28 13:04:46,008 INFO L130 BoogieDeclarations]: Found specification of procedure void$SimpleFrame2Cons$main$1804 [2019-02-28 13:04:46,008 INFO L138 BoogieDeclarations]: Found implementation of procedure void$SimpleFrame2Cons$main$1804 [2019-02-28 13:04:46,010 INFO L130 BoogieDeclarations]: Found specification of procedure void$javax.swing.JButton$$la$init$ra$$2558 [2019-02-28 13:04:46,011 INFO L124 BoogieDeclarations]: Specification and implementation of procedure $EFG_Procedure given in one single declaration [2019-02-28 13:04:46,011 INFO L130 BoogieDeclarations]: Found specification of procedure $EFG_Procedure [2019-02-28 13:04:46,011 INFO L138 BoogieDeclarations]: Found implementation of procedure $EFG_Procedure [2019-02-28 13:04:46,011 INFO L130 BoogieDeclarations]: Found specification of procedure java.awt.Component$java.awt.Container$add$2075 [2019-02-28 13:04:46,012 INFO L130 BoogieDeclarations]: Found specification of procedure void$java.lang.Object$$la$init$ra$$38 [2019-02-28 13:04:46,452 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-28 13:04:46,527 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-28 13:04:46,599 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-28 13:04:46,732 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-28 13:04:47,258 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-28 13:04:47,294 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-28 13:04:47,306 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-28 13:04:47,309 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-28 13:04:47,315 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-28 13:04:47,331 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-28 13:04:47,463 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-02-28 13:04:48,626 INFO L278 CfgBuilder]: Using library mode [2019-02-28 13:04:48,626 INFO L286 CfgBuilder]: Removed 206 assue(true) statements. [2019-02-28 13:04:48,628 INFO L202 PluginConnector]: Adding new model GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:04:48 BoogieIcfgContainer [2019-02-28 13:04:48,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 13:04:48,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 13:04:48,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 13:04:48,633 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 13:04:48,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:04:45" (1/2) ... [2019-02-28 13:04:48,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f6715d and model type GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 01:04:48, skipping insertion in model container [2019-02-28 13:04:48,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:04:48" (2/2) ... [2019-02-28 13:04:48,636 INFO L112 eAbstractionObserver]: Analyzing ICFG GuiTestExample.bpl [2019-02-28 13:04:48,644 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 13:04:48,653 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 87 error locations. [2019-02-28 13:04:48,667 INFO L257 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2019-02-28 13:04:48,704 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 13:04:48,704 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 13:04:48,704 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 13:04:48,705 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 13:04:48,705 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 13:04:48,705 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 13:04:48,705 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 13:04:48,705 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 13:04:48,729 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states. [2019-02-28 13:04:48,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-28 13:04:48,744 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:04:48,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-28 13:04:48,750 INFO L423 AbstractCegarLoop]: === Iteration 1 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 13:04:48,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:04:48,757 INFO L82 PathProgramCache]: Analyzing trace with hash 10434, now seen corresponding path program 1 times [2019-02-28 13:04:48,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:04:48,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:48,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:04:48,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:48,810 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:04:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:04:48,982 INFO L273 TraceCheckUtils]: 0: Hoare triple {307#true} r09 := $param_0;$r110 := $fresh2;assume $fresh2 != $null; {309#(not (= void$SimpleFrame2Cons$main$1804_$r110 $null))} is VALID [2019-02-28 13:04:49,002 INFO L273 TraceCheckUtils]: 1: Hoare triple {309#(not (= void$SimpleFrame2Cons$main$1804_$r110 $null))} assume !($r110 != $null); {308#false} is VALID [2019-02-28 13:04:49,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:04:49,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:04:49,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 13:04:49,008 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:04:49,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 13:04:49,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:04:49,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-28 13:04:49,051 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:04:49,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 13:04:49,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 13:04:49,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:04:49,064 INFO L87 Difference]: Start difference. First operand 304 states. Second operand 3 states. [2019-02-28 13:04:50,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:04:50,069 INFO L93 Difference]: Finished difference Result 304 states and 306 transitions. [2019-02-28 13:04:50,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 13:04:50,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 13:04:50,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:04:50,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:04:50,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2019-02-28 13:04:50,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:04:50,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2019-02-28 13:04:50,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 306 transitions. [2019-02-28 13:04:50,461 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 306 edges. 306 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:04:50,491 INFO L225 Difference]: With dead ends: 304 [2019-02-28 13:04:50,491 INFO L226 Difference]: Without dead ends: 252 [2019-02-28 13:04:50,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:04:50,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-02-28 13:04:50,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2019-02-28 13:04:50,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:04:50,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 252 states. Second operand 252 states. [2019-02-28 13:04:50,617 INFO L74 IsIncluded]: Start isIncluded. First operand 252 states. Second operand 252 states. [2019-02-28 13:04:50,617 INFO L87 Difference]: Start difference. First operand 252 states. Second operand 252 states. [2019-02-28 13:04:50,617 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-28 13:04:50,638 INFO L93 Difference]: Finished difference Result 252 states and 257 transitions. [2019-02-28 13:04:50,639 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 257 transitions. [2019-02-28 13:04:50,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:04:50,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:04:50,642 INFO L74 IsIncluded]: Start isIncluded. First operand 252 states. Second operand 252 states. [2019-02-28 13:04:50,642 INFO L87 Difference]: Start difference. First operand 252 states. Second operand 252 states. [2019-02-28 13:04:50,643 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-28 13:04:50,658 INFO L93 Difference]: Finished difference Result 252 states and 257 transitions. [2019-02-28 13:04:50,659 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 257 transitions. [2019-02-28 13:04:50,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:04:50,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:04:50,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:04:50,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:04:50,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-02-28 13:04:50,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 257 transitions. [2019-02-28 13:04:50,675 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 257 transitions. Word has length 2 [2019-02-28 13:04:50,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:04:50,675 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 257 transitions. [2019-02-28 13:04:50,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 13:04:50,675 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 257 transitions. [2019-02-28 13:04:50,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 13:04:50,676 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:04:50,676 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 13:04:50,679 INFO L423 AbstractCegarLoop]: === Iteration 2 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 13:04:50,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:04:50,680 INFO L82 PathProgramCache]: Analyzing trace with hash 168844, now seen corresponding path program 1 times [2019-02-28 13:04:50,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:04:50,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:50,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:04:50,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:50,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:04:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:04:50,766 INFO L273 TraceCheckUtils]: 0: Hoare triple {1934#true} assume void$SimpleFrame2Cons$2$$la$init$ra$$4552$__this != $null; {1936#(not (= $null void$SimpleFrame2Cons$2$$la$init$ra$$4552_void$SimpleFrame2Cons$2$$la$init$ra$$4552$__this))} is VALID [2019-02-28 13:04:50,766 INFO L273 TraceCheckUtils]: 1: Hoare triple {1936#(not (= $null void$SimpleFrame2Cons$2$$la$init$ra$$4552_void$SimpleFrame2Cons$2$$la$init$ra$$4552$__this))} r093 := void$SimpleFrame2Cons$2$$la$init$ra$$4552$__this;r194 := void$SimpleFrame2Cons$2$$la$init$ra$$4552$param_0;SimpleFrame2Cons$SimpleFrame2Cons$2$this$0711 := r194; {1937#(not (= void$SimpleFrame2Cons$2$$la$init$ra$$4552_r093 $null))} is VALID [2019-02-28 13:04:50,767 INFO L273 TraceCheckUtils]: 2: Hoare triple {1937#(not (= void$SimpleFrame2Cons$2$$la$init$ra$$4552_r093 $null))} assume !(r093 != $null); {1935#false} is VALID [2019-02-28 13:04:50,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:04:50,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:04:50,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 13:04:50,769 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:04:50,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-28 13:04:50,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:04:50,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-28 13:04:50,795 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:04:50,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 13:04:50,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 13:04:50,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 13:04:50,796 INFO L87 Difference]: Start difference. First operand 252 states and 257 transitions. Second operand 4 states. [2019-02-28 13:04:51,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:04:51,676 INFO L93 Difference]: Finished difference Result 252 states and 257 transitions. [2019-02-28 13:04:51,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 13:04:51,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-28 13:04:51,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:04:51,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:04:51,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 257 transitions. [2019-02-28 13:04:51,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:04:51,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 257 transitions. [2019-02-28 13:04:51,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 257 transitions. [2019-02-28 13:04:51,954 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:04:51,962 INFO L225 Difference]: With dead ends: 252 [2019-02-28 13:04:51,962 INFO L226 Difference]: Without dead ends: 248 [2019-02-28 13:04:51,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-28 13:04:51,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-02-28 13:04:52,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2019-02-28 13:04:52,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:04:52,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 248 states. Second operand 248 states. [2019-02-28 13:04:52,021 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand 248 states. [2019-02-28 13:04:52,021 INFO L87 Difference]: Start difference. First operand 248 states. Second operand 248 states. [2019-02-28 13:04:52,021 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-28 13:04:52,031 INFO L93 Difference]: Finished difference Result 248 states and 254 transitions. [2019-02-28 13:04:52,031 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 254 transitions. [2019-02-28 13:04:52,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:04:52,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:04:52,033 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand 248 states. [2019-02-28 13:04:52,034 INFO L87 Difference]: Start difference. First operand 248 states. Second operand 248 states. [2019-02-28 13:04:52,034 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-28 13:04:52,044 INFO L93 Difference]: Finished difference Result 248 states and 254 transitions. [2019-02-28 13:04:52,044 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 254 transitions. [2019-02-28 13:04:52,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:04:52,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:04:52,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:04:52,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:04:52,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-02-28 13:04:52,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 254 transitions. [2019-02-28 13:04:52,054 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 254 transitions. Word has length 3 [2019-02-28 13:04:52,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:04:52,055 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 254 transitions. [2019-02-28 13:04:52,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 13:04:52,055 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 254 transitions. [2019-02-28 13:04:52,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 13:04:52,055 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:04:52,056 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 13:04:52,058 INFO L423 AbstractCegarLoop]: === Iteration 3 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 13:04:52,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:04:52,058 INFO L82 PathProgramCache]: Analyzing trace with hash 181753, now seen corresponding path program 1 times [2019-02-28 13:04:52,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:04:52,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:52,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:04:52,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:52,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:04:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:04:52,094 INFO L273 TraceCheckUtils]: 0: Hoare triple {3492#true} assume void$SimpleFrame2Cons$4$$la$init$ra$$4887$__this != $null; {3494#(not (= void$SimpleFrame2Cons$4$$la$init$ra$$4887_void$SimpleFrame2Cons$4$$la$init$ra$$4887$__this $null))} is VALID [2019-02-28 13:04:52,095 INFO L273 TraceCheckUtils]: 1: Hoare triple {3494#(not (= void$SimpleFrame2Cons$4$$la$init$ra$$4887_void$SimpleFrame2Cons$4$$la$init$ra$$4887$__this $null))} r0120 := void$SimpleFrame2Cons$4$$la$init$ra$$4887$__this;r1121 := void$SimpleFrame2Cons$4$$la$init$ra$$4887$param_0;SimpleFrame2Cons$SimpleFrame2Cons$4$this$0763 := r1121; {3495#(not (= $null void$SimpleFrame2Cons$4$$la$init$ra$$4887_r0120))} is VALID [2019-02-28 13:04:52,097 INFO L273 TraceCheckUtils]: 2: Hoare triple {3495#(not (= $null void$SimpleFrame2Cons$4$$la$init$ra$$4887_r0120))} assume !(r0120 != $null); {3493#false} is VALID [2019-02-28 13:04:52,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:04:52,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:04:52,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 13:04:52,097 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:04:52,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-28 13:04:52,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:04:52,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-28 13:04:52,107 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:04:52,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 13:04:52,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 13:04:52,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 13:04:52,108 INFO L87 Difference]: Start difference. First operand 248 states and 254 transitions. Second operand 4 states. [2019-02-28 13:04:52,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:04:52,646 INFO L93 Difference]: Finished difference Result 248 states and 254 transitions. [2019-02-28 13:04:52,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 13:04:52,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-28 13:04:52,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:04:52,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:04:52,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 254 transitions. [2019-02-28 13:04:52,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:04:52,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 254 transitions. [2019-02-28 13:04:52,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 254 transitions. [2019-02-28 13:04:53,005 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:04:53,011 INFO L225 Difference]: With dead ends: 248 [2019-02-28 13:04:53,011 INFO L226 Difference]: Without dead ends: 244 [2019-02-28 13:04:53,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-28 13:04:53,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-02-28 13:04:53,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2019-02-28 13:04:53,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:04:53,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 244 states. Second operand 244 states. [2019-02-28 13:04:53,069 INFO L74 IsIncluded]: Start isIncluded. First operand 244 states. Second operand 244 states. [2019-02-28 13:04:53,069 INFO L87 Difference]: Start difference. First operand 244 states. Second operand 244 states. [2019-02-28 13:04:53,069 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-28 13:04:53,077 INFO L93 Difference]: Finished difference Result 244 states and 251 transitions. [2019-02-28 13:04:53,078 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 251 transitions. [2019-02-28 13:04:53,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:04:53,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:04:53,079 INFO L74 IsIncluded]: Start isIncluded. First operand 244 states. Second operand 244 states. [2019-02-28 13:04:53,079 INFO L87 Difference]: Start difference. First operand 244 states. Second operand 244 states. [2019-02-28 13:04:53,079 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-28 13:04:53,088 INFO L93 Difference]: Finished difference Result 244 states and 251 transitions. [2019-02-28 13:04:53,088 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 251 transitions. [2019-02-28 13:04:53,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:04:53,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:04:53,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:04:53,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:04:53,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-02-28 13:04:53,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 251 transitions. [2019-02-28 13:04:53,097 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 251 transitions. Word has length 3 [2019-02-28 13:04:53,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:04:53,097 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 251 transitions. [2019-02-28 13:04:53,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 13:04:53,098 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 251 transitions. [2019-02-28 13:04:53,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 13:04:53,098 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:04:53,098 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 13:04:53,101 INFO L423 AbstractCegarLoop]: === Iteration 4 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 13:04:53,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:04:53,101 INFO L82 PathProgramCache]: Analyzing trace with hash 323784, now seen corresponding path program 1 times [2019-02-28 13:04:53,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:04:53,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:53,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:04:53,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:53,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:04:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:04:53,173 INFO L273 TraceCheckUtils]: 0: Hoare triple {5028#true} r09 := $param_0;$r110 := $fresh2;assume $fresh2 != $null; {5030#(not (= void$SimpleFrame2Cons$main$1804_$r110 $null))} is VALID [2019-02-28 13:04:53,174 INFO L273 TraceCheckUtils]: 1: Hoare triple {5030#(not (= void$SimpleFrame2Cons$main$1804_$r110 $null))} assume $r110 != $null;void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this := $r110; {5031#(not (= $null void$SimpleFrame2Cons$main$1804_void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this))} is VALID [2019-02-28 13:04:53,174 INFO L273 TraceCheckUtils]: 2: Hoare triple {5031#(not (= $null void$SimpleFrame2Cons$main$1804_void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this))} assume !(void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this != $null); {5029#false} is VALID [2019-02-28 13:04:53,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:04:53,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:04:53,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 13:04:53,175 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:04:53,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-28 13:04:53,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:04:53,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-28 13:04:53,181 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:04:53,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 13:04:53,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 13:04:53,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 13:04:53,181 INFO L87 Difference]: Start difference. First operand 244 states and 251 transitions. Second operand 4 states. [2019-02-28 13:04:53,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:04:53,742 INFO L93 Difference]: Finished difference Result 244 states and 251 transitions. [2019-02-28 13:04:53,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 13:04:53,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-28 13:04:53,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:04:53,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:04:53,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 251 transitions. [2019-02-28 13:04:53,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:04:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 251 transitions. [2019-02-28 13:04:53,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 251 transitions. [2019-02-28 13:04:53,986 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 251 edges. 251 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:04:53,992 INFO L225 Difference]: With dead ends: 244 [2019-02-28 13:04:53,992 INFO L226 Difference]: Without dead ends: 243 [2019-02-28 13:04:53,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-28 13:04:53,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-02-28 13:04:54,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-02-28 13:04:54,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:04:54,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 243 states. Second operand 243 states. [2019-02-28 13:04:54,211 INFO L74 IsIncluded]: Start isIncluded. First operand 243 states. Second operand 243 states. [2019-02-28 13:04:54,211 INFO L87 Difference]: Start difference. First operand 243 states. Second operand 243 states. [2019-02-28 13:04:54,211 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-28 13:04:54,220 INFO L93 Difference]: Finished difference Result 243 states and 250 transitions. [2019-02-28 13:04:54,220 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 250 transitions. [2019-02-28 13:04:54,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:04:54,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:04:54,221 INFO L74 IsIncluded]: Start isIncluded. First operand 243 states. Second operand 243 states. [2019-02-28 13:04:54,221 INFO L87 Difference]: Start difference. First operand 243 states. Second operand 243 states. [2019-02-28 13:04:54,221 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-28 13:04:54,230 INFO L93 Difference]: Finished difference Result 243 states and 250 transitions. [2019-02-28 13:04:54,230 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 250 transitions. [2019-02-28 13:04:54,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:04:54,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:04:54,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:04:54,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:04:54,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-02-28 13:04:54,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 250 transitions. [2019-02-28 13:04:54,239 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 250 transitions. Word has length 3 [2019-02-28 13:04:54,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:04:54,239 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 250 transitions. [2019-02-28 13:04:54,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 13:04:54,239 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 250 transitions. [2019-02-28 13:04:54,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 13:04:54,240 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:04:54,240 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 13:04:54,242 INFO L423 AbstractCegarLoop]: === Iteration 5 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 13:04:54,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:04:54,243 INFO L82 PathProgramCache]: Analyzing trace with hash 161893, now seen corresponding path program 1 times [2019-02-28 13:04:54,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:04:54,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:54,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:04:54,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:54,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:04:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:04:54,350 INFO L273 TraceCheckUtils]: 0: Hoare triple {6555#true} assume void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this != $null; {6557#(not (= $null void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this))} is VALID [2019-02-28 13:04:54,351 INFO L273 TraceCheckUtils]: 1: Hoare triple {6557#(not (= $null void$SimpleFrame2Cons$1$$la$init$ra$$1802_void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this))} r01 := void$SimpleFrame2Cons$1$$la$init$ra$$1802$__this; {6558#(not (= void$SimpleFrame2Cons$1$$la$init$ra$$1802_r01 $null))} is VALID [2019-02-28 13:04:54,351 INFO L273 TraceCheckUtils]: 2: Hoare triple {6558#(not (= void$SimpleFrame2Cons$1$$la$init$ra$$1802_r01 $null))} assume !(r01 != $null); {6556#false} is VALID [2019-02-28 13:04:54,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:04:54,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:04:54,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 13:04:54,352 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:04:54,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-28 13:04:54,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:04:54,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-28 13:04:54,357 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:04:54,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 13:04:54,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 13:04:54,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 13:04:54,357 INFO L87 Difference]: Start difference. First operand 243 states and 250 transitions. Second operand 4 states. [2019-02-28 13:04:55,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:04:55,481 INFO L93 Difference]: Finished difference Result 243 states and 250 transitions. [2019-02-28 13:04:55,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 13:04:55,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-28 13:04:55,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:04:55,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:04:55,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2019-02-28 13:04:55,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:04:55,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2019-02-28 13:04:55,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 250 transitions. [2019-02-28 13:04:55,738 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:04:55,743 INFO L225 Difference]: With dead ends: 243 [2019-02-28 13:04:55,744 INFO L226 Difference]: Without dead ends: 239 [2019-02-28 13:04:55,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-28 13:04:55,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-02-28 13:04:55,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2019-02-28 13:04:55,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:04:55,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand 239 states. [2019-02-28 13:04:55,799 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand 239 states. [2019-02-28 13:04:55,799 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 239 states. [2019-02-28 13:04:55,799 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-28 13:04:55,807 INFO L93 Difference]: Finished difference Result 239 states and 247 transitions. [2019-02-28 13:04:55,808 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 247 transitions. [2019-02-28 13:04:55,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:04:55,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:04:55,809 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand 239 states. [2019-02-28 13:04:55,809 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 239 states. [2019-02-28 13:04:55,809 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-28 13:04:55,817 INFO L93 Difference]: Finished difference Result 239 states and 247 transitions. [2019-02-28 13:04:55,818 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 247 transitions. [2019-02-28 13:04:55,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:04:55,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:04:55,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:04:55,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:04:55,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-02-28 13:04:55,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 247 transitions. [2019-02-28 13:04:55,826 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 247 transitions. Word has length 3 [2019-02-28 13:04:55,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:04:55,827 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 247 transitions. [2019-02-28 13:04:55,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 13:04:55,827 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 247 transitions. [2019-02-28 13:04:55,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 13:04:55,827 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:04:55,827 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 13:04:55,830 INFO L423 AbstractCegarLoop]: === Iteration 6 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 13:04:55,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:04:55,830 INFO L82 PathProgramCache]: Analyzing trace with hash 29824, now seen corresponding path program 1 times [2019-02-28 13:04:55,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:04:55,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:55,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:04:55,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:55,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:04:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:04:55,912 INFO L273 TraceCheckUtils]: 0: Hoare triple {8063#true} assume void$SimpleFrame2Cons$3$$la$init$ra$$4885$__this != $null; {8065#(not (= void$SimpleFrame2Cons$3$$la$init$ra$$4885_void$SimpleFrame2Cons$3$$la$init$ra$$4885$__this $null))} is VALID [2019-02-28 13:04:55,913 INFO L273 TraceCheckUtils]: 1: Hoare triple {8065#(not (= void$SimpleFrame2Cons$3$$la$init$ra$$4885_void$SimpleFrame2Cons$3$$la$init$ra$$4885$__this $null))} r0107 := void$SimpleFrame2Cons$3$$la$init$ra$$4885$__this;r1108 := void$SimpleFrame2Cons$3$$la$init$ra$$4885$param_0;SimpleFrame2Cons$SimpleFrame2Cons$3$this$0762 := r1108; {8066#(not (= $null void$SimpleFrame2Cons$3$$la$init$ra$$4885_r0107))} is VALID [2019-02-28 13:04:55,913 INFO L273 TraceCheckUtils]: 2: Hoare triple {8066#(not (= $null void$SimpleFrame2Cons$3$$la$init$ra$$4885_r0107))} assume !(r0107 != $null); {8064#false} is VALID [2019-02-28 13:04:55,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:04:55,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:04:55,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 13:04:55,914 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:04:55,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-28 13:04:55,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:04:55,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-28 13:04:55,916 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:04:55,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 13:04:55,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 13:04:55,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 13:04:55,917 INFO L87 Difference]: Start difference. First operand 239 states and 247 transitions. Second operand 4 states. [2019-02-28 13:04:56,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:04:56,580 INFO L93 Difference]: Finished difference Result 239 states and 247 transitions. [2019-02-28 13:04:56,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 13:04:56,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-28 13:04:56,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:04:56,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:04:56,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 247 transitions. [2019-02-28 13:04:56,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:04:56,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 247 transitions. [2019-02-28 13:04:56,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 247 transitions. [2019-02-28 13:04:56,839 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:04:56,844 INFO L225 Difference]: With dead ends: 239 [2019-02-28 13:04:56,844 INFO L226 Difference]: Without dead ends: 235 [2019-02-28 13:04:56,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-28 13:04:56,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-02-28 13:04:56,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2019-02-28 13:04:56,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:04:56,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 states. Second operand 235 states. [2019-02-28 13:04:56,859 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand 235 states. [2019-02-28 13:04:56,860 INFO L87 Difference]: Start difference. First operand 235 states. Second operand 235 states. [2019-02-28 13:04:56,860 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-28 13:04:56,866 INFO L93 Difference]: Finished difference Result 235 states and 244 transitions. [2019-02-28 13:04:56,866 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 244 transitions. [2019-02-28 13:04:56,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:04:56,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:04:56,867 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand 235 states. [2019-02-28 13:04:56,867 INFO L87 Difference]: Start difference. First operand 235 states. Second operand 235 states. [2019-02-28 13:04:56,868 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-28 13:04:56,873 INFO L93 Difference]: Finished difference Result 235 states and 244 transitions. [2019-02-28 13:04:56,874 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 244 transitions. [2019-02-28 13:04:56,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:04:56,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:04:56,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:04:56,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:04:56,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-02-28 13:04:56,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 244 transitions. [2019-02-28 13:04:56,880 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 244 transitions. Word has length 3 [2019-02-28 13:04:56,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:04:56,880 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 244 transitions. [2019-02-28 13:04:56,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 13:04:56,880 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 244 transitions. [2019-02-28 13:04:56,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 13:04:56,881 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:04:56,881 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 13:04:56,882 INFO L423 AbstractCegarLoop]: === Iteration 7 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 13:04:56,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:04:56,883 INFO L82 PathProgramCache]: Analyzing trace with hash 6127075, now seen corresponding path program 1 times [2019-02-28 13:04:56,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:04:56,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:56,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:04:56,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:56,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:04:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:04:56,914 INFO L273 TraceCheckUtils]: 0: Hoare triple {9549#true} assume __this != $null; {9549#true} is VALID [2019-02-28 13:04:56,915 INFO L273 TraceCheckUtils]: 1: Hoare triple {9549#true} $caughtEx0 := $null;void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep3 := $null; {9549#true} is VALID [2019-02-28 13:04:56,916 INFO L273 TraceCheckUtils]: 2: Hoare triple {9549#true} r03 := __this;$r14 := $fresh1;assume $fresh1 != $null; {9551#(not (= $null void$SimpleFrame2Cons$1$run$1803_$r14))} is VALID [2019-02-28 13:04:56,917 INFO L273 TraceCheckUtils]: 3: Hoare triple {9551#(not (= $null void$SimpleFrame2Cons$1$run$1803_$r14))} assume !($r14 != $null); {9550#false} is VALID [2019-02-28 13:04:56,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:04:56,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:04:56,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 13:04:56,918 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:04:56,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-28 13:04:56,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:04:56,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-28 13:04:56,923 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:04:56,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 13:04:56,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 13:04:56,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:04:56,924 INFO L87 Difference]: Start difference. First operand 235 states and 244 transitions. Second operand 3 states. [2019-02-28 13:04:57,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:04:57,773 INFO L93 Difference]: Finished difference Result 235 states and 244 transitions. [2019-02-28 13:04:57,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 13:04:57,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-28 13:04:57,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:04:57,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:04:57,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 244 transitions. [2019-02-28 13:04:57,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:04:57,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 244 transitions. [2019-02-28 13:04:57,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 244 transitions. [2019-02-28 13:04:58,098 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:04:58,104 INFO L225 Difference]: With dead ends: 235 [2019-02-28 13:04:58,104 INFO L226 Difference]: Without dead ends: 234 [2019-02-28 13:04:58,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:04:58,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-02-28 13:04:58,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2019-02-28 13:04:58,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:04:58,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand 234 states. [2019-02-28 13:04:58,122 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand 234 states. [2019-02-28 13:04:58,122 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 234 states. [2019-02-28 13:04:58,123 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-28 13:04:58,129 INFO L93 Difference]: Finished difference Result 234 states and 243 transitions. [2019-02-28 13:04:58,129 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 243 transitions. [2019-02-28 13:04:58,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:04:58,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:04:58,130 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand 234 states. [2019-02-28 13:04:58,130 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 234 states. [2019-02-28 13:04:58,131 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-28 13:04:58,136 INFO L93 Difference]: Finished difference Result 234 states and 243 transitions. [2019-02-28 13:04:58,137 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 243 transitions. [2019-02-28 13:04:58,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:04:58,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:04:58,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:04:58,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:04:58,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-02-28 13:04:58,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 243 transitions. [2019-02-28 13:04:58,143 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 243 transitions. Word has length 4 [2019-02-28 13:04:58,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:04:58,143 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 243 transitions. [2019-02-28 13:04:58,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 13:04:58,143 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 243 transitions. [2019-02-28 13:04:58,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 13:04:58,144 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:04:58,144 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 13:04:58,146 INFO L423 AbstractCegarLoop]: === Iteration 8 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 13:04:58,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:04:58,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1755747, now seen corresponding path program 1 times [2019-02-28 13:04:58,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:04:58,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:58,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:04:58,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:58,148 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:04:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:04:58,227 INFO L273 TraceCheckUtils]: 0: Hoare triple {11023#true} assume void$SimpleFrame2Cons$$la$init$ra$$1805$__this != $null; {11025#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} is VALID [2019-02-28 13:04:58,228 INFO L273 TraceCheckUtils]: 1: Hoare triple {11025#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} void$SimpleFrame2Cons$$la$init$ra$$1805$caughtEx0 := $null;void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep1 := $null; {11025#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} is VALID [2019-02-28 13:04:58,228 INFO L273 TraceCheckUtils]: 2: Hoare triple {11025#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} r012 := void$SimpleFrame2Cons$$la$init$ra$$1805$__this; {11026#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_r012))} is VALID [2019-02-28 13:04:58,229 INFO L273 TraceCheckUtils]: 3: Hoare triple {11026#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_r012))} assume !(r012 != $null); {11024#false} is VALID [2019-02-28 13:04:58,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:04:58,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:04:58,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 13:04:58,230 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:04:58,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-28 13:04:58,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:04:58,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-28 13:04:58,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:04:58,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 13:04:58,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 13:04:58,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 13:04:58,235 INFO L87 Difference]: Start difference. First operand 234 states and 243 transitions. Second operand 4 states. [2019-02-28 13:04:59,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:04:59,113 INFO L93 Difference]: Finished difference Result 234 states and 243 transitions. [2019-02-28 13:04:59,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 13:04:59,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-28 13:04:59,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:04:59,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:04:59,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2019-02-28 13:04:59,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:04:59,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2019-02-28 13:04:59,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 243 transitions. [2019-02-28 13:04:59,559 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:04:59,564 INFO L225 Difference]: With dead ends: 234 [2019-02-28 13:04:59,564 INFO L226 Difference]: Without dead ends: 213 [2019-02-28 13:04:59,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-28 13:04:59,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-02-28 13:04:59,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-02-28 13:04:59,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:04:59,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states. Second operand 213 states. [2019-02-28 13:04:59,593 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand 213 states. [2019-02-28 13:04:59,593 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 213 states. [2019-02-28 13:04:59,593 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-28 13:04:59,599 INFO L93 Difference]: Finished difference Result 213 states and 222 transitions. [2019-02-28 13:04:59,600 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 222 transitions. [2019-02-28 13:04:59,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:04:59,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:04:59,600 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand 213 states. [2019-02-28 13:04:59,601 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 213 states. [2019-02-28 13:04:59,601 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-28 13:04:59,606 INFO L93 Difference]: Finished difference Result 213 states and 222 transitions. [2019-02-28 13:04:59,606 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 222 transitions. [2019-02-28 13:04:59,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:04:59,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:04:59,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:04:59,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:04:59,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-02-28 13:04:59,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 222 transitions. [2019-02-28 13:04:59,612 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 222 transitions. Word has length 4 [2019-02-28 13:04:59,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:04:59,612 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 222 transitions. [2019-02-28 13:04:59,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 13:04:59,612 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 222 transitions. [2019-02-28 13:04:59,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 13:04:59,613 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:04:59,613 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 13:04:59,615 INFO L423 AbstractCegarLoop]: === Iteration 9 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 13:04:59,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:04:59,615 INFO L82 PathProgramCache]: Analyzing trace with hash 54428221, now seen corresponding path program 1 times [2019-02-28 13:04:59,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:04:59,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:59,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:04:59,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:04:59,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:04:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:00,077 INFO L273 TraceCheckUtils]: 0: Hoare triple {12392#true} assume void$SimpleFrame2Cons$$la$init$ra$$1805$__this != $null; {12394#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} is VALID [2019-02-28 13:05:00,077 INFO L273 TraceCheckUtils]: 1: Hoare triple {12394#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} void$SimpleFrame2Cons$$la$init$ra$$1805$caughtEx0 := $null;void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep1 := $null; {12394#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} is VALID [2019-02-28 13:05:00,079 INFO L273 TraceCheckUtils]: 2: Hoare triple {12394#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this))} r012 := void$SimpleFrame2Cons$$la$init$ra$$1805$__this; {12395#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_r012))} is VALID [2019-02-28 13:05:00,079 INFO L273 TraceCheckUtils]: 3: Hoare triple {12395#(not (= $null void$SimpleFrame2Cons$$la$init$ra$$1805_r012))} assume r012 != $null;void$javax.swing.JFrame$$la$init$ra$$1809_void$javax.swing.JFrame$$la$init$ra$$1809$__this := r012; {12396#(not (= void$SimpleFrame2Cons$$la$init$ra$$1805_void$javax.swing.JFrame$$la$init$ra$$1809_void$javax.swing.JFrame$$la$init$ra$$1809$__this $null))} is VALID [2019-02-28 13:05:00,082 INFO L273 TraceCheckUtils]: 4: Hoare triple {12396#(not (= void$SimpleFrame2Cons$$la$init$ra$$1805_void$javax.swing.JFrame$$la$init$ra$$1809_void$javax.swing.JFrame$$la$init$ra$$1809$__this $null))} assume !(void$javax.swing.JFrame$$la$init$ra$$1809_void$javax.swing.JFrame$$la$init$ra$$1809$__this != $null); {12393#false} is VALID [2019-02-28 13:05:00,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:05:00,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:05:00,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-28 13:05:00,083 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:05:00,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-02-28 13:05:00,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:05:00,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2019-02-28 13:05:00,101 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:00,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-28 13:05:00,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-28 13:05:00,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-02-28 13:05:00,102 INFO L87 Difference]: Start difference. First operand 213 states and 222 transitions. Second operand 5 states. [2019-02-28 13:05:01,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:01,634 INFO L93 Difference]: Finished difference Result 213 states and 222 transitions. [2019-02-28 13:05:01,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 13:05:01,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-02-28 13:05:01,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:05:01,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-28 13:05:01,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 222 transitions. [2019-02-28 13:05:01,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-28 13:05:01,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 222 transitions. [2019-02-28 13:05:01,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 222 transitions. [2019-02-28 13:05:02,082 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:02,087 INFO L225 Difference]: With dead ends: 213 [2019-02-28 13:05:02,087 INFO L226 Difference]: Without dead ends: 212 [2019-02-28 13:05:02,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-02-28 13:05:02,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-02-28 13:05:02,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2019-02-28 13:05:02,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:05:02,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand 212 states. [2019-02-28 13:05:02,104 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand 212 states. [2019-02-28 13:05:02,104 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 212 states. [2019-02-28 13:05:02,104 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-28 13:05:02,110 INFO L93 Difference]: Finished difference Result 212 states and 221 transitions. [2019-02-28 13:05:02,111 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 221 transitions. [2019-02-28 13:05:02,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:02,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:02,111 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand 212 states. [2019-02-28 13:05:02,112 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 212 states. [2019-02-28 13:05:02,112 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-28 13:05:02,116 INFO L93 Difference]: Finished difference Result 212 states and 221 transitions. [2019-02-28 13:05:02,117 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 221 transitions. [2019-02-28 13:05:02,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:02,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:02,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:05:02,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:05:02,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-02-28 13:05:02,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 221 transitions. [2019-02-28 13:05:02,122 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 221 transitions. Word has length 5 [2019-02-28 13:05:02,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:05:02,122 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 221 transitions. [2019-02-28 13:05:02,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-28 13:05:02,122 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 221 transitions. [2019-02-28 13:05:02,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 13:05:02,123 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:05:02,123 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 13:05:02,124 INFO L423 AbstractCegarLoop]: === Iteration 10 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 13:05:02,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:05:02,124 INFO L82 PathProgramCache]: Analyzing trace with hash 189939531, now seen corresponding path program 1 times [2019-02-28 13:05:02,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:05:02,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:02,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:05:02,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:02,126 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:05:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:05:02,164 INFO L273 TraceCheckUtils]: 0: Hoare triple {13736#true} assume __this != $null; {13736#true} is VALID [2019-02-28 13:05:02,165 INFO L273 TraceCheckUtils]: 1: Hoare triple {13736#true} $caughtEx0 := $null;void$SimpleFrame2Cons$1$$la$init$ra$$1802$Exep3 := $null; {13736#true} is VALID [2019-02-28 13:05:02,166 INFO L273 TraceCheckUtils]: 2: Hoare triple {13736#true} r03 := __this;$r14 := $fresh1;assume $fresh1 != $null; {13738#(not (= $null void$SimpleFrame2Cons$1$run$1803_$r14))} is VALID [2019-02-28 13:05:02,166 INFO L273 TraceCheckUtils]: 3: Hoare triple {13738#(not (= $null void$SimpleFrame2Cons$1$run$1803_$r14))} assume $r14 != $null;void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this := $r14; {13739#(not (= void$SimpleFrame2Cons$1$run$1803_void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this $null))} is VALID [2019-02-28 13:05:02,168 INFO L273 TraceCheckUtils]: 4: Hoare triple {13739#(not (= void$SimpleFrame2Cons$1$run$1803_void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this $null))} assume !(void$SimpleFrame2Cons$$la$init$ra$$1805_void$SimpleFrame2Cons$$la$init$ra$$1805$__this != $null); {13737#false} is VALID [2019-02-28 13:05:02,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:05:02,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:05:02,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-28 13:05:02,169 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:05:02,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-28 13:05:02,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:05:02,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-28 13:05:02,176 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:02,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 13:05:02,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 13:05:02,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 13:05:02,177 INFO L87 Difference]: Start difference. First operand 212 states and 221 transitions. Second operand 4 states. [2019-02-28 13:05:03,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:05:03,069 INFO L93 Difference]: Finished difference Result 212 states and 221 transitions. [2019-02-28 13:05:03,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 13:05:03,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-28 13:05:03,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:05:03,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:05:03,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 221 transitions. [2019-02-28 13:05:03,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:05:03,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 221 transitions. [2019-02-28 13:05:03,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 221 transitions. [2019-02-28 13:05:03,260 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:05:03,265 INFO L225 Difference]: With dead ends: 212 [2019-02-28 13:05:03,265 INFO L226 Difference]: Without dead ends: 211 [2019-02-28 13:05:03,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-28 13:05:03,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-02-28 13:05:03,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-02-28 13:05:03,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:05:03,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 211 states. Second operand 211 states. [2019-02-28 13:05:03,304 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand 211 states. [2019-02-28 13:05:03,304 INFO L87 Difference]: Start difference. First operand 211 states. Second operand 211 states. [2019-02-28 13:05:03,305 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-28 13:05:03,309 INFO L93 Difference]: Finished difference Result 211 states and 220 transitions. [2019-02-28 13:05:03,310 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 220 transitions. [2019-02-28 13:05:03,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:03,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:03,310 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand 211 states. [2019-02-28 13:05:03,311 INFO L87 Difference]: Start difference. First operand 211 states. Second operand 211 states. [2019-02-28 13:05:03,311 INFO L127 Difference]: Subtrahend was not deterministic. Computing result with determinization. [2019-02-28 13:05:03,315 INFO L93 Difference]: Finished difference Result 211 states and 220 transitions. [2019-02-28 13:05:03,315 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 220 transitions. [2019-02-28 13:05:03,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:05:03,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:05:03,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:05:03,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:05:03,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-02-28 13:05:03,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 220 transitions. [2019-02-28 13:05:03,320 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 220 transitions. Word has length 5 [2019-02-28 13:05:03,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:05:03,320 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 220 transitions. [2019-02-28 13:05:03,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 13:05:03,320 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 220 transitions. [2019-02-28 13:05:03,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 13:05:03,320 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:05:03,320 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 13:05:03,321 INFO L423 AbstractCegarLoop]: === Iteration 11 === [void$SimpleFrame2Cons$3$$la$init$ra$$4885Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$actionPerformed$4553Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err6ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err4ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err3ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err16ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err14ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err9ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err11ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err27ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err29ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$$la$init$ra$$1805Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$$la$init$ra$$1802Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err31ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err14ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err13ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err12ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err28ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err18ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err4ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err30ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err27ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err29ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err32ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err10ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err20ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err22ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err25ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err7ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err16ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err26ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err9ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err8ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err21ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err6ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err24ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err33ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err35ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err15ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err34ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err11ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$1$run$1803Err5ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err17ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err19ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$1$run$1803Err23ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$$la$init$ra$$4887Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$4$actionPerformed$4888Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, void$SimpleFrame2Cons$main$1804Err0ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$main$1804Err2ASSERT_VIOLATIONASSERT, void$SimpleFrame2Cons$2$$la$init$ra$$4552Err0ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr2ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr3ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr4ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr5ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr6ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr8ASSERT_VIOLATIONASSERT, $EFG_ProcedureErr7ASSERT_VIOLATIONPRE_CONDITIONandASSERT, $EFG_ProcedureErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 13:05:03,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:05:03,321 INFO L82 PathProgramCache]: Analyzing trace with hash 179442176, now seen corresponding path program 1 times [2019-02-28 13:05:03,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:05:03,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:03,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:05:03,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:05:03,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:05:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-02-28 13:05:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-02-28 13:05:03,340 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-02-28 13:05:03,351 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$3$$la$init$ra$$4885ENTRY has no Hoare annotation [2019-02-28 13:05:03,351 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$2$actionPerformed$4553ENTRY has no Hoare annotation [2019-02-28 13:05:03,351 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$3$actionPerformed$4886ENTRY has no Hoare annotation [2019-02-28 13:05:03,351 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$$la$init$ra$$1805ENTRY has no Hoare annotation [2019-02-28 13:05:03,351 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$1$$la$init$ra$$1802ENTRY has no Hoare annotation [2019-02-28 13:05:03,351 WARN L170 areAnnotationChecker]: javax.swing.JButton$SimpleFrame2Cons$access$0$1806ENTRY has no Hoare annotation [2019-02-28 13:05:03,351 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$2$$la$init$ra$$4552ENTRY has no Hoare annotation [2019-02-28 13:05:03,352 WARN L170 areAnnotationChecker]: java.awt.Dimension$java.awt.Toolkit$getScreenSize$3246ENTRY has no Hoare annotation [2019-02-28 13:05:03,352 WARN L170 areAnnotationChecker]: void$javax.swing.JFrame$$la$init$ra$$1809ENTRY has no Hoare annotation [2019-02-28 13:05:03,352 WARN L170 areAnnotationChecker]: int$SimpleFrame2Cons$access$2$1808ENTRY has no Hoare annotation [2019-02-28 13:05:03,352 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$access$1$1807ENTRY has no Hoare annotation [2019-02-28 13:05:03,352 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$1$run$1803ENTRY has no Hoare annotation [2019-02-28 13:05:03,352 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$4$$la$init$ra$$4887ENTRY has no Hoare annotation [2019-02-28 13:05:03,352 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$4$actionPerformed$4888ENTRY has no Hoare annotation [2019-02-28 13:05:03,352 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$main$1804ENTRY has no Hoare annotation [2019-02-28 13:05:03,352 WARN L170 areAnnotationChecker]: $EFG_ProcedureENTRY has no Hoare annotation [2019-02-28 13:05:03,353 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-28 13:05:03,353 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-28 13:05:03,353 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-28 13:05:03,353 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-28 13:05:03,353 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-28 13:05:03,353 WARN L170 areAnnotationChecker]: javax.swing.JButton$SimpleFrame2Cons$access$0$1806FINAL has no Hoare annotation [2019-02-28 13:05:03,353 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-28 13:05:03,353 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-28 13:05:03,353 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-28 13:05:03,353 WARN L170 areAnnotationChecker]: int$SimpleFrame2Cons$access$2$1808FINAL has no Hoare annotation [2019-02-28 13:05:03,354 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$access$1$1807FINAL has no Hoare annotation [2019-02-28 13:05:03,354 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-28 13:05:03,354 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-28 13:05:03,354 WARN L170 areAnnotationChecker]: $Ultimate##0 has no Hoare annotation [2019-02-28 13:05:03,354 WARN L170 areAnnotationChecker]: L452 has no Hoare annotation [2019-02-28 13:05:03,354 WARN L170 areAnnotationChecker]: L452 has no Hoare annotation [2019-02-28 13:05:03,354 WARN L170 areAnnotationChecker]: L129 has no Hoare annotation [2019-02-28 13:05:03,354 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-02-28 13:05:03,354 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-02-28 13:05:03,354 WARN L170 areAnnotationChecker]: L388 has no Hoare annotation [2019-02-28 13:05:03,355 WARN L170 areAnnotationChecker]: L612 has no Hoare annotation [2019-02-28 13:05:03,355 WARN L170 areAnnotationChecker]: L791 has no Hoare annotation [2019-02-28 13:05:03,355 WARN L170 areAnnotationChecker]: L434 has no Hoare annotation [2019-02-28 13:05:03,355 WARN L170 areAnnotationChecker]: L434 has no Hoare annotation [2019-02-28 13:05:03,355 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-02-28 13:05:03,355 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-02-28 13:05:03,355 WARN L170 areAnnotationChecker]: java.awt.Dimension$java.awt.Toolkit$getScreenSize$3246FINAL has no Hoare annotation [2019-02-28 13:05:03,355 WARN L170 areAnnotationChecker]: void$javax.swing.JFrame$$la$init$ra$$1809FINAL has no Hoare annotation [2019-02-28 13:05:03,355 WARN L170 areAnnotationChecker]: L535 has no Hoare annotation [2019-02-28 13:05:03,355 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-02-28 13:05:03,356 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-02-28 13:05:03,356 WARN L170 areAnnotationChecker]: L388 has no Hoare annotation [2019-02-28 13:05:03,356 WARN L170 areAnnotationChecker]: L420 has no Hoare annotation [2019-02-28 13:05:03,356 WARN L170 areAnnotationChecker]: L420 has no Hoare annotation [2019-02-28 13:05:03,356 WARN L170 areAnnotationChecker]: L141 has no Hoare annotation [2019-02-28 13:05:03,356 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$3$$la$init$ra$$4885FINAL has no Hoare annotation [2019-02-28 13:05:03,356 WARN L170 areAnnotationChecker]: L384 has no Hoare annotation [2019-02-28 13:05:03,356 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2019-02-28 13:05:03,356 WARN L170 areAnnotationChecker]: L796 has no Hoare annotation [2019-02-28 13:05:03,356 WARN L170 areAnnotationChecker]: L796 has no Hoare annotation [2019-02-28 13:05:03,357 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$1$$la$init$ra$$1802FINAL has no Hoare annotation [2019-02-28 13:05:03,357 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$2$$la$init$ra$$4552FINAL has no Hoare annotation [2019-02-28 13:05:03,357 WARN L170 areAnnotationChecker]: L543 has no Hoare annotation [2019-02-28 13:05:03,357 WARN L170 areAnnotationChecker]: L543 has no Hoare annotation [2019-02-28 13:05:03,357 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$4$$la$init$ra$$4887FINAL has no Hoare annotation [2019-02-28 13:05:03,357 WARN L170 areAnnotationChecker]: L384 has no Hoare annotation [2019-02-28 13:05:03,357 WARN L170 areAnnotationChecker]: L431 has no Hoare annotation [2019-02-28 13:05:03,357 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2019-02-28 13:05:03,357 WARN L170 areAnnotationChecker]: L481 has no Hoare annotation [2019-02-28 13:05:03,357 WARN L170 areAnnotationChecker]: L481 has no Hoare annotation [2019-02-28 13:05:03,358 WARN L170 areAnnotationChecker]: L630 has no Hoare annotation [2019-02-28 13:05:03,358 WARN L170 areAnnotationChecker]: L734 has no Hoare annotation [2019-02-28 13:05:03,358 WARN L170 areAnnotationChecker]: L734 has no Hoare annotation [2019-02-28 13:05:03,358 WARN L170 areAnnotationChecker]: L753 has no Hoare annotation [2019-02-28 13:05:03,358 WARN L170 areAnnotationChecker]: L753 has no Hoare annotation [2019-02-28 13:05:03,358 WARN L170 areAnnotationChecker]: L658 has no Hoare annotation [2019-02-28 13:05:03,358 WARN L170 areAnnotationChecker]: L658 has no Hoare annotation [2019-02-28 13:05:03,358 WARN L170 areAnnotationChecker]: L434 has no Hoare annotation [2019-02-28 13:05:03,358 WARN L170 areAnnotationChecker]: L434 has no Hoare annotation [2019-02-28 13:05:03,358 WARN L170 areAnnotationChecker]: L153 has no Hoare annotation [2019-02-28 13:05:03,358 WARN L170 areAnnotationChecker]: L630 has no Hoare annotation [2019-02-28 13:05:03,359 WARN L170 areAnnotationChecker]: L624 has no Hoare annotation [2019-02-28 13:05:03,359 WARN L170 areAnnotationChecker]: L736 has no Hoare annotation [2019-02-28 13:05:03,359 WARN L170 areAnnotationChecker]: L788 has no Hoare annotation [2019-02-28 13:05:03,359 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$4$actionPerformed$4888FINAL has no Hoare annotation [2019-02-28 13:05:03,359 WARN L170 areAnnotationChecker]: L420-1 has no Hoare annotation [2019-02-28 13:05:03,359 WARN L170 areAnnotationChecker]: L158 has no Hoare annotation [2019-02-28 13:05:03,359 WARN L170 areAnnotationChecker]: L624 has no Hoare annotation [2019-02-28 13:05:03,359 WARN L170 areAnnotationChecker]: L734-1 has no Hoare annotation [2019-02-28 13:05:03,359 WARN L170 areAnnotationChecker]: L791 has no Hoare annotation [2019-02-28 13:05:03,359 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$main$1804FINAL has no Hoare annotation [2019-02-28 13:05:03,360 WARN L170 areAnnotationChecker]: L734 has no Hoare annotation [2019-02-28 13:05:03,360 WARN L170 areAnnotationChecker]: L734 has no Hoare annotation [2019-02-28 13:05:03,360 WARN L170 areAnnotationChecker]: L799 has no Hoare annotation [2019-02-28 13:05:03,360 WARN L170 areAnnotationChecker]: L799 has no Hoare annotation [2019-02-28 13:05:03,360 WARN L170 areAnnotationChecker]: L796 has no Hoare annotation [2019-02-28 13:05:03,360 WARN L170 areAnnotationChecker]: L796 has no Hoare annotation [2019-02-28 13:05:03,360 WARN L170 areAnnotationChecker]: L736 has no Hoare annotation [2019-02-28 13:05:03,360 WARN L170 areAnnotationChecker]: L802 has no Hoare annotation [2019-02-28 13:05:03,360 WARN L170 areAnnotationChecker]: L808 has no Hoare annotation [2019-02-28 13:05:03,360 WARN L170 areAnnotationChecker]: L734 has no Hoare annotation [2019-02-28 13:05:03,361 WARN L170 areAnnotationChecker]: L734 has no Hoare annotation [2019-02-28 13:05:03,361 WARN L170 areAnnotationChecker]: L734-1 has no Hoare annotation [2019-02-28 13:05:03,361 WARN L170 areAnnotationChecker]: L814 has no Hoare annotation [2019-02-28 13:05:03,361 WARN L170 areAnnotationChecker]: L814 has no Hoare annotation [2019-02-28 13:05:03,361 WARN L170 areAnnotationChecker]: L736 has no Hoare annotation [2019-02-28 13:05:03,361 WARN L170 areAnnotationChecker]: L165 has no Hoare annotation [2019-02-28 13:05:03,361 WARN L170 areAnnotationChecker]: L165 has no Hoare annotation [2019-02-28 13:05:03,361 WARN L170 areAnnotationChecker]: L824 has no Hoare annotation [2019-02-28 13:05:03,361 WARN L170 areAnnotationChecker]: L824 has no Hoare annotation [2019-02-28 13:05:03,361 WARN L170 areAnnotationChecker]: L734-1 has no Hoare annotation [2019-02-28 13:05:03,362 WARN L170 areAnnotationChecker]: L168 has no Hoare annotation [2019-02-28 13:05:03,362 WARN L170 areAnnotationChecker]: L281 has no Hoare annotation [2019-02-28 13:05:03,362 WARN L170 areAnnotationChecker]: L671 has no Hoare annotation [2019-02-28 13:05:03,362 WARN L170 areAnnotationChecker]: L671 has no Hoare annotation [2019-02-28 13:05:03,362 WARN L170 areAnnotationChecker]: L799 has no Hoare annotation [2019-02-28 13:05:03,362 WARN L170 areAnnotationChecker]: L799 has no Hoare annotation [2019-02-28 13:05:03,362 WARN L170 areAnnotationChecker]: L671 has no Hoare annotation [2019-02-28 13:05:03,362 WARN L170 areAnnotationChecker]: L671 has no Hoare annotation [2019-02-28 13:05:03,362 WARN L170 areAnnotationChecker]: L678 has no Hoare annotation [2019-02-28 13:05:03,362 WARN L170 areAnnotationChecker]: L802 has no Hoare annotation [2019-02-28 13:05:03,363 WARN L170 areAnnotationChecker]: L808 has no Hoare annotation [2019-02-28 13:05:03,363 WARN L170 areAnnotationChecker]: L678 has no Hoare annotation [2019-02-28 13:05:03,363 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-02-28 13:05:03,363 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-02-28 13:05:03,363 WARN L170 areAnnotationChecker]: L814 has no Hoare annotation [2019-02-28 13:05:03,363 WARN L170 areAnnotationChecker]: L814 has no Hoare annotation [2019-02-28 13:05:03,363 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-02-28 13:05:03,363 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-02-28 13:05:03,363 WARN L170 areAnnotationChecker]: L671-1 has no Hoare annotation [2019-02-28 13:05:03,363 WARN L170 areAnnotationChecker]: L671-1 has no Hoare annotation [2019-02-28 13:05:03,364 WARN L170 areAnnotationChecker]: L824 has no Hoare annotation [2019-02-28 13:05:03,364 WARN L170 areAnnotationChecker]: L824 has no Hoare annotation [2019-02-28 13:05:03,364 WARN L170 areAnnotationChecker]: L671-1 has no Hoare annotation [2019-02-28 13:05:03,364 WARN L170 areAnnotationChecker]: L833 has no Hoare annotation [2019-02-28 13:05:03,364 WARN L170 areAnnotationChecker]: L833 has no Hoare annotation [2019-02-28 13:05:03,364 WARN L170 areAnnotationChecker]: L671 has no Hoare annotation [2019-02-28 13:05:03,364 WARN L170 areAnnotationChecker]: L671 has no Hoare annotation [2019-02-28 13:05:03,364 WARN L170 areAnnotationChecker]: L693 has no Hoare annotation [2019-02-28 13:05:03,364 WARN L170 areAnnotationChecker]: L693 has no Hoare annotation [2019-02-28 13:05:03,364 WARN L170 areAnnotationChecker]: L843 has no Hoare annotation [2019-02-28 13:05:03,364 WARN L170 areAnnotationChecker]: L843 has no Hoare annotation [2019-02-28 13:05:03,365 WARN L170 areAnnotationChecker]: L678 has no Hoare annotation [2019-02-28 13:05:03,365 WARN L170 areAnnotationChecker]: L700 has no Hoare annotation [2019-02-28 13:05:03,365 WARN L170 areAnnotationChecker]: L693 has no Hoare annotation [2019-02-28 13:05:03,365 WARN L170 areAnnotationChecker]: L693 has no Hoare annotation [2019-02-28 13:05:03,365 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-02-28 13:05:03,365 WARN L170 areAnnotationChecker]: L685 has no Hoare annotation [2019-02-28 13:05:03,365 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-02-28 13:05:03,365 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-02-28 13:05:03,365 WARN L170 areAnnotationChecker]: L700 has no Hoare annotation [2019-02-28 13:05:03,365 WARN L170 areAnnotationChecker]: L671-1 has no Hoare annotation [2019-02-28 13:05:03,366 WARN L170 areAnnotationChecker]: L671-1 has no Hoare annotation [2019-02-28 13:05:03,366 WARN L170 areAnnotationChecker]: L693-1 has no Hoare annotation [2019-02-28 13:05:03,366 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-02-28 13:05:03,366 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-02-28 13:05:03,366 WARN L170 areAnnotationChecker]: L833 has no Hoare annotation [2019-02-28 13:05:03,366 WARN L170 areAnnotationChecker]: L833 has no Hoare annotation [2019-02-28 13:05:03,366 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2019-02-28 13:05:03,366 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2019-02-28 13:05:03,366 WARN L170 areAnnotationChecker]: L693-1 has no Hoare annotation [2019-02-28 13:05:03,367 WARN L170 areAnnotationChecker]: L693-1 has no Hoare annotation [2019-02-28 13:05:03,367 WARN L170 areAnnotationChecker]: L843 has no Hoare annotation [2019-02-28 13:05:03,367 WARN L170 areAnnotationChecker]: L843 has no Hoare annotation [2019-02-28 13:05:03,367 WARN L170 areAnnotationChecker]: L583 has no Hoare annotation [2019-02-28 13:05:03,367 WARN L170 areAnnotationChecker]: L852 has no Hoare annotation [2019-02-28 13:05:03,367 WARN L170 areAnnotationChecker]: L852 has no Hoare annotation [2019-02-28 13:05:03,367 WARN L170 areAnnotationChecker]: L693 has no Hoare annotation [2019-02-28 13:05:03,367 WARN L170 areAnnotationChecker]: L693 has no Hoare annotation [2019-02-28 13:05:03,367 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-02-28 13:05:03,367 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-02-28 13:05:03,367 WARN L170 areAnnotationChecker]: L862 has no Hoare annotation [2019-02-28 13:05:03,368 WARN L170 areAnnotationChecker]: L862 has no Hoare annotation [2019-02-28 13:05:03,368 WARN L170 areAnnotationChecker]: L700 has no Hoare annotation [2019-02-28 13:05:03,368 WARN L170 areAnnotationChecker]: L576-1 has no Hoare annotation [2019-02-28 13:05:03,368 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2019-02-28 13:05:03,368 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2019-02-28 13:05:03,368 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-02-28 13:05:03,368 WARN L170 areAnnotationChecker]: L707 has no Hoare annotation [2019-02-28 13:05:03,368 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2019-02-28 13:05:03,368 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2019-02-28 13:05:03,368 WARN L170 areAnnotationChecker]: L583 has no Hoare annotation [2019-02-28 13:05:03,369 WARN L170 areAnnotationChecker]: L693-1 has no Hoare annotation [2019-02-28 13:05:03,369 WARN L170 areAnnotationChecker]: L693-1 has no Hoare annotation [2019-02-28 13:05:03,369 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2019-02-28 13:05:03,369 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-02-28 13:05:03,369 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-02-28 13:05:03,369 WARN L170 areAnnotationChecker]: L852 has no Hoare annotation [2019-02-28 13:05:03,369 WARN L170 areAnnotationChecker]: L852 has no Hoare annotation [2019-02-28 13:05:03,369 WARN L170 areAnnotationChecker]: L370-1 has no Hoare annotation [2019-02-28 13:05:03,369 WARN L170 areAnnotationChecker]: L576-1 has no Hoare annotation [2019-02-28 13:05:03,370 WARN L170 areAnnotationChecker]: L576-1 has no Hoare annotation [2019-02-28 13:05:03,370 WARN L170 areAnnotationChecker]: L862 has no Hoare annotation [2019-02-28 13:05:03,370 WARN L170 areAnnotationChecker]: L862 has no Hoare annotation [2019-02-28 13:05:03,370 WARN L170 areAnnotationChecker]: L273 has no Hoare annotation [2019-02-28 13:05:03,370 WARN L170 areAnnotationChecker]: L273 has no Hoare annotation [2019-02-28 13:05:03,370 WARN L170 areAnnotationChecker]: L871 has no Hoare annotation [2019-02-28 13:05:03,370 WARN L170 areAnnotationChecker]: L871 has no Hoare annotation [2019-02-28 13:05:03,370 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2019-02-28 13:05:03,370 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2019-02-28 13:05:03,370 WARN L170 areAnnotationChecker]: L278 has no Hoare annotation [2019-02-28 13:05:03,371 WARN L170 areAnnotationChecker]: L874 has no Hoare annotation [2019-02-28 13:05:03,371 WARN L170 areAnnotationChecker]: L874 has no Hoare annotation [2019-02-28 13:05:03,371 WARN L170 areAnnotationChecker]: L583 has no Hoare annotation [2019-02-28 13:05:03,371 WARN L170 areAnnotationChecker]: L306 has no Hoare annotation [2019-02-28 13:05:03,371 WARN L170 areAnnotationChecker]: L879 has no Hoare annotation [2019-02-28 13:05:03,371 WARN L170 areAnnotationChecker]: L879 has no Hoare annotation [2019-02-28 13:05:03,371 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-02-28 13:05:03,371 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2019-02-28 13:05:03,371 WARN L170 areAnnotationChecker]: L318 has no Hoare annotation [2019-02-28 13:05:03,371 WARN L170 areAnnotationChecker]: L318 has no Hoare annotation [2019-02-28 13:05:03,372 WARN L170 areAnnotationChecker]: L318 has no Hoare annotation [2019-02-28 13:05:03,372 WARN L170 areAnnotationChecker]: L884 has no Hoare annotation [2019-02-28 13:05:03,372 WARN L170 areAnnotationChecker]: L884 has no Hoare annotation [2019-02-28 13:05:03,372 WARN L170 areAnnotationChecker]: L576-1 has no Hoare annotation [2019-02-28 13:05:03,372 WARN L170 areAnnotationChecker]: L576-1 has no Hoare annotation [2019-02-28 13:05:03,372 WARN L170 areAnnotationChecker]: Event2_Block67 has no Hoare annotation [2019-02-28 13:05:03,372 WARN L170 areAnnotationChecker]: Event0_Block65 has no Hoare annotation [2019-02-28 13:05:03,372 WARN L170 areAnnotationChecker]: Event1_Block66 has no Hoare annotation [2019-02-28 13:05:03,372 WARN L170 areAnnotationChecker]: L889 has no Hoare annotation [2019-02-28 13:05:03,372 WARN L170 areAnnotationChecker]: L889 has no Hoare annotation [2019-02-28 13:05:03,372 WARN L170 areAnnotationChecker]: L871 has no Hoare annotation [2019-02-28 13:05:03,373 WARN L170 areAnnotationChecker]: L871 has no Hoare annotation [2019-02-28 13:05:03,373 WARN L170 areAnnotationChecker]: L333 has no Hoare annotation [2019-02-28 13:05:03,373 WARN L170 areAnnotationChecker]: L333 has no Hoare annotation [2019-02-28 13:05:03,373 WARN L170 areAnnotationChecker]: L333 has no Hoare annotation [2019-02-28 13:05:03,373 WARN L170 areAnnotationChecker]: L333 has no Hoare annotation [2019-02-28 13:05:03,373 WARN L170 areAnnotationChecker]: L349 has no Hoare annotation [2019-02-28 13:05:03,373 WARN L170 areAnnotationChecker]: L349 has no Hoare annotation [2019-02-28 13:05:03,373 WARN L170 areAnnotationChecker]: L349 has no Hoare annotation [2019-02-28 13:05:03,373 WARN L170 areAnnotationChecker]: L349 has no Hoare annotation [2019-02-28 13:05:03,373 WARN L170 areAnnotationChecker]: L362 has no Hoare annotation [2019-02-28 13:05:03,374 WARN L170 areAnnotationChecker]: L362 has no Hoare annotation [2019-02-28 13:05:03,374 WARN L170 areAnnotationChecker]: L362 has no Hoare annotation [2019-02-28 13:05:03,374 WARN L170 areAnnotationChecker]: L362 has no Hoare annotation [2019-02-28 13:05:03,374 WARN L170 areAnnotationChecker]: L892 has no Hoare annotation [2019-02-28 13:05:03,374 WARN L170 areAnnotationChecker]: L892 has no Hoare annotation [2019-02-28 13:05:03,374 WARN L170 areAnnotationChecker]: L874 has no Hoare annotation [2019-02-28 13:05:03,374 WARN L170 areAnnotationChecker]: L874 has no Hoare annotation [2019-02-28 13:05:03,374 WARN L170 areAnnotationChecker]: $EFG_EXIT_Block68 has no Hoare annotation [2019-02-28 13:05:03,374 WARN L170 areAnnotationChecker]: $EFG_EXIT_Block68 has no Hoare annotation [2019-02-28 13:05:03,374 WARN L170 areAnnotationChecker]: L895 has no Hoare annotation [2019-02-28 13:05:03,375 WARN L170 areAnnotationChecker]: L895 has no Hoare annotation [2019-02-28 13:05:03,375 WARN L170 areAnnotationChecker]: L879 has no Hoare annotation [2019-02-28 13:05:03,375 WARN L170 areAnnotationChecker]: L879 has no Hoare annotation [2019-02-28 13:05:03,375 WARN L170 areAnnotationChecker]: L898 has no Hoare annotation [2019-02-28 13:05:03,375 WARN L170 areAnnotationChecker]: L898 has no Hoare annotation [2019-02-28 13:05:03,375 WARN L170 areAnnotationChecker]: L884 has no Hoare annotation [2019-02-28 13:05:03,375 WARN L170 areAnnotationChecker]: L884 has no Hoare annotation [2019-02-28 13:05:03,375 WARN L170 areAnnotationChecker]: L901 has no Hoare annotation [2019-02-28 13:05:03,375 WARN L170 areAnnotationChecker]: L901 has no Hoare annotation [2019-02-28 13:05:03,376 WARN L170 areAnnotationChecker]: L889 has no Hoare annotation [2019-02-28 13:05:03,376 WARN L170 areAnnotationChecker]: L889 has no Hoare annotation [2019-02-28 13:05:03,376 WARN L170 areAnnotationChecker]: L906 has no Hoare annotation [2019-02-28 13:05:03,376 WARN L170 areAnnotationChecker]: L906 has no Hoare annotation [2019-02-28 13:05:03,376 WARN L170 areAnnotationChecker]: L892 has no Hoare annotation [2019-02-28 13:05:03,376 WARN L170 areAnnotationChecker]: L892 has no Hoare annotation [2019-02-28 13:05:03,376 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2019-02-28 13:05:03,376 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2019-02-28 13:05:03,376 WARN L170 areAnnotationChecker]: L895 has no Hoare annotation [2019-02-28 13:05:03,377 WARN L170 areAnnotationChecker]: L895 has no Hoare annotation [2019-02-28 13:05:03,377 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2019-02-28 13:05:03,377 WARN L170 areAnnotationChecker]: L898 has no Hoare annotation [2019-02-28 13:05:03,377 WARN L170 areAnnotationChecker]: L898 has no Hoare annotation [2019-02-28 13:05:03,377 WARN L170 areAnnotationChecker]: L370-1 has no Hoare annotation [2019-02-28 13:05:03,377 WARN L170 areAnnotationChecker]: L901 has no Hoare annotation [2019-02-28 13:05:03,377 WARN L170 areAnnotationChecker]: L901 has no Hoare annotation [2019-02-28 13:05:03,377 WARN L170 areAnnotationChecker]: L909 has no Hoare annotation [2019-02-28 13:05:03,377 WARN L170 areAnnotationChecker]: L909 has no Hoare annotation [2019-02-28 13:05:03,378 WARN L170 areAnnotationChecker]: L906 has no Hoare annotation [2019-02-28 13:05:03,378 WARN L170 areAnnotationChecker]: L906 has no Hoare annotation [2019-02-28 13:05:03,378 WARN L170 areAnnotationChecker]: L912 has no Hoare annotation [2019-02-28 13:05:03,378 WARN L170 areAnnotationChecker]: L940 has no Hoare annotation [2019-02-28 13:05:03,378 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2019-02-28 13:05:03,378 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2019-02-28 13:05:03,378 WARN L170 areAnnotationChecker]: L919 has no Hoare annotation [2019-02-28 13:05:03,378 WARN L170 areAnnotationChecker]: L919 has no Hoare annotation [2019-02-28 13:05:03,378 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$$la$init$ra$$1805FINAL has no Hoare annotation [2019-02-28 13:05:03,379 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2019-02-28 13:05:03,379 WARN L170 areAnnotationChecker]: L924 has no Hoare annotation [2019-02-28 13:05:03,379 WARN L170 areAnnotationChecker]: L924 has no Hoare annotation [2019-02-28 13:05:03,379 WARN L170 areAnnotationChecker]: L370-1 has no Hoare annotation [2019-02-28 13:05:03,379 WARN L170 areAnnotationChecker]: L929 has no Hoare annotation [2019-02-28 13:05:03,379 WARN L170 areAnnotationChecker]: L929 has no Hoare annotation [2019-02-28 13:05:03,379 WARN L170 areAnnotationChecker]: L909 has no Hoare annotation [2019-02-28 13:05:03,379 WARN L170 areAnnotationChecker]: L909 has no Hoare annotation [2019-02-28 13:05:03,379 WARN L170 areAnnotationChecker]: L934 has no Hoare annotation [2019-02-28 13:05:03,379 WARN L170 areAnnotationChecker]: L934 has no Hoare annotation [2019-02-28 13:05:03,380 WARN L170 areAnnotationChecker]: L912 has no Hoare annotation [2019-02-28 13:05:03,380 WARN L170 areAnnotationChecker]: L940 has no Hoare annotation [2019-02-28 13:05:03,380 WARN L170 areAnnotationChecker]: L937 has no Hoare annotation [2019-02-28 13:05:03,380 WARN L170 areAnnotationChecker]: L937 has no Hoare annotation [2019-02-28 13:05:03,380 WARN L170 areAnnotationChecker]: L919 has no Hoare annotation [2019-02-28 13:05:03,380 WARN L170 areAnnotationChecker]: L919 has no Hoare annotation [2019-02-28 13:05:03,380 WARN L170 areAnnotationChecker]: L753-1 has no Hoare annotation [2019-02-28 13:05:03,380 WARN L170 areAnnotationChecker]: L924 has no Hoare annotation [2019-02-28 13:05:03,380 WARN L170 areAnnotationChecker]: L924 has no Hoare annotation [2019-02-28 13:05:03,380 WARN L170 areAnnotationChecker]: L546 has no Hoare annotation [2019-02-28 13:05:03,381 WARN L170 areAnnotationChecker]: L546 has no Hoare annotation [2019-02-28 13:05:03,381 WARN L170 areAnnotationChecker]: L929 has no Hoare annotation [2019-02-28 13:05:03,381 WARN L170 areAnnotationChecker]: L929 has no Hoare annotation [2019-02-28 13:05:03,381 WARN L170 areAnnotationChecker]: L549 has no Hoare annotation [2019-02-28 13:05:03,381 WARN L170 areAnnotationChecker]: L555 has no Hoare annotation [2019-02-28 13:05:03,381 WARN L170 areAnnotationChecker]: L934 has no Hoare annotation [2019-02-28 13:05:03,381 WARN L170 areAnnotationChecker]: L934 has no Hoare annotation [2019-02-28 13:05:03,381 WARN L170 areAnnotationChecker]: L558 has no Hoare annotation [2019-02-28 13:05:03,381 WARN L170 areAnnotationChecker]: L558 has no Hoare annotation [2019-02-28 13:05:03,381 WARN L170 areAnnotationChecker]: L937 has no Hoare annotation [2019-02-28 13:05:03,382 WARN L170 areAnnotationChecker]: L937 has no Hoare annotation [2019-02-28 13:05:03,382 WARN L170 areAnnotationChecker]: void$SimpleFrame2Cons$1$run$1803FINAL has no Hoare annotation [2019-02-28 13:05:03,382 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-02-28 13:05:03,388 INFO L202 PluginConnector]: Adding new model GuiTestExample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.02 01:05:03 BoogieIcfgContainer [2019-02-28 13:05:03,388 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-28 13:05:03,390 INFO L168 Benchmark]: Toolchain (without parser) took 17755.59 ms. Allocated memory was 133.7 MB in the beginning and 331.4 MB in the end (delta: 197.7 MB). Free memory was 106.6 MB in the beginning and 114.3 MB in the end (delta: -7.8 MB). Peak memory consumption was 189.9 MB. Max. memory is 7.1 GB. [2019-02-28 13:05:03,391 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 133.7 MB. Free memory is still 110.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-28 13:05:03,392 INFO L168 Benchmark]: Boogie Procedure Inliner took 153.13 ms. Allocated memory is still 133.7 MB. Free memory was 106.4 MB in the beginning and 100.4 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 7.1 GB. [2019-02-28 13:05:03,393 INFO L168 Benchmark]: Boogie Preprocessor took 101.16 ms. Allocated memory is still 133.7 MB. Free memory was 100.4 MB in the beginning and 98.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-02-28 13:05:03,394 INFO L168 Benchmark]: RCFGBuilder took 2734.96 ms. Allocated memory was 133.7 MB in the beginning and 169.9 MB in the end (delta: 36.2 MB). Free memory was 97.9 MB in the beginning and 74.6 MB in the end (delta: 23.3 MB). Peak memory consumption was 59.5 MB. Max. memory is 7.1 GB. [2019-02-28 13:05:03,395 INFO L168 Benchmark]: TraceAbstraction took 14758.95 ms. Allocated memory was 169.9 MB in the beginning and 331.4 MB in the end (delta: 161.5 MB). Free memory was 73.8 MB in the beginning and 114.3 MB in the end (delta: -40.5 MB). Peak memory consumption was 121.0 MB. Max. memory is 7.1 GB. [2019-02-28 13:05:03,400 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 133.7 MB. Free memory is still 110.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 153.13 ms. Allocated memory is still 133.7 MB. Free memory was 106.4 MB in the beginning and 100.4 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 101.16 ms. Allocated memory is still 133.7 MB. Free memory was 100.4 MB in the beginning and 98.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2734.96 ms. Allocated memory was 133.7 MB in the beginning and 169.9 MB in the end (delta: 36.2 MB). Free memory was 97.9 MB in the beginning and 74.6 MB in the end (delta: 23.3 MB). Peak memory consumption was 59.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14758.95 ms. Allocated memory was 169.9 MB in the beginning and 331.4 MB in the end (delta: 161.5 MB). Free memory was 73.8 MB in the beginning and 114.3 MB in the end (delta: -40.5 MB). Peak memory consumption was 121.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 658]: assertion can be violated assertion can be violated We found a FailurePath: [L642] requires void$SimpleFrame2Cons$4$actionPerformed$4888$__this != $null; [L651] r0125 := void$SimpleFrame2Cons$4$actionPerformed$4888$__this; [L653] r1126 := void$SimpleFrame2Cons$4$actionPerformed$4888$param_0; [L655] $r2129 := SimpleFrame2Cons$SimpleFrame2Cons$4$this$0763; [L390] r083 := $param_0; [L392] $r185 := javax.swing.JButton$SimpleFrame2Cons$event2227; [L394] __ret := $r185; [L658] assert $r3130 != $null; - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 304 locations, 87 error locations. UNSAFE Result, 14.6s OverallTime, 11 OverallIterations, 1 TraceHistogramMax, 12.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2426 SDtfs, 577 SDslu, 4018 SDs, 0 SdLazy, 45 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 242 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...