java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label39_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 18:46:46,748 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 18:46:46,751 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 18:46:46,767 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 18:46:46,767 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 18:46:46,770 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 18:46:46,772 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 18:46:46,774 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 18:46:46,776 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 18:46:46,778 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 18:46:46,779 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 18:46:46,779 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 18:46:46,782 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 18:46:46,783 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 18:46:46,792 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 18:46:46,793 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 18:46:46,794 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 18:46:46,797 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 18:46:46,799 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 18:46:46,802 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 18:46:46,803 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 18:46:46,804 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 18:46:46,806 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 18:46:46,806 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 18:46:46,808 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 18:46:46,808 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 18:46:46,809 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 18:46:46,810 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 18:46:46,811 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 18:46:46,814 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 18:46:46,814 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 18:46:46,815 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 18:46:46,815 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 18:46:46,815 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 18:46:46,816 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 18:46:46,817 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 18:46:46,817 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 18:46:46,835 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 18:46:46,836 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 18:46:46,837 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 18:46:46,837 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 18:46:46,837 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 18:46:46,837 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 18:46:46,837 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 18:46:46,838 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 18:46:46,838 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 18:46:46,838 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 18:46:46,838 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 18:46:46,838 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 18:46:46,839 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 18:46:46,839 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 18:46:46,839 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 18:46:46,840 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 18:46:46,840 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 18:46:46,840 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 18:46:46,840 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 18:46:46,840 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 18:46:46,841 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 18:46:46,841 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 18:46:46,841 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 18:46:46,841 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 18:46:46,841 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 18:46:46,841 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 18:46:46,842 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 18:46:46,842 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 18:46:46,842 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 18:46:46,842 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 18:46:46,842 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 18:46:46,843 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 18:46:46,843 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 18:46:46,843 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 18:46:46,843 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 18:46:46,899 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 18:46:46,917 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 18:46:46,921 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 18:46:46,923 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 18:46:46,924 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 18:46:46,924 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label39_true-unreach-call_false-termination.c [2018-11-07 18:46:46,992 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40d317dd2/dddc3c7da17c462c908270a716f69f83/FLAG195146dac [2018-11-07 18:46:47,532 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 18:46:47,533 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label39_true-unreach-call_false-termination.c [2018-11-07 18:46:47,549 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40d317dd2/dddc3c7da17c462c908270a716f69f83/FLAG195146dac [2018-11-07 18:46:47,565 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40d317dd2/dddc3c7da17c462c908270a716f69f83 [2018-11-07 18:46:47,576 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 18:46:47,578 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 18:46:47,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 18:46:47,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 18:46:47,588 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 18:46:47,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:46:47" (1/1) ... [2018-11-07 18:46:47,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d73b804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:46:47, skipping insertion in model container [2018-11-07 18:46:47,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:46:47" (1/1) ... [2018-11-07 18:46:47,613 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 18:46:47,691 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 18:46:48,220 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 18:46:48,231 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 18:46:48,361 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 18:46:48,382 INFO L193 MainTranslator]: Completed translation [2018-11-07 18:46:48,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:46:48 WrapperNode [2018-11-07 18:46:48,383 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 18:46:48,384 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 18:46:48,384 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 18:46:48,384 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 18:46:48,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:46:48" (1/1) ... [2018-11-07 18:46:48,526 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:46:48" (1/1) ... [2018-11-07 18:46:48,538 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 18:46:48,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 18:46:48,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 18:46:48,539 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 18:46:48,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:46:48" (1/1) ... [2018-11-07 18:46:48,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:46:48" (1/1) ... [2018-11-07 18:46:48,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:46:48" (1/1) ... [2018-11-07 18:46:48,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:46:48" (1/1) ... [2018-11-07 18:46:48,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:46:48" (1/1) ... [2018-11-07 18:46:48,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:46:48" (1/1) ... [2018-11-07 18:46:48,639 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:46:48" (1/1) ... [2018-11-07 18:46:48,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 18:46:48,648 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 18:46:48,648 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 18:46:48,649 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 18:46:48,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:46:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 18:46:48,726 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 18:46:48,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 18:46:48,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 18:46:48,727 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 18:46:48,727 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 18:46:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 18:46:48,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 18:46:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 18:46:48,730 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 18:46:51,926 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 18:46:51,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:46:51 BoogieIcfgContainer [2018-11-07 18:46:51,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 18:46:51,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 18:46:51,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 18:46:51,934 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 18:46:51,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:46:47" (1/3) ... [2018-11-07 18:46:51,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24bc7820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:46:51, skipping insertion in model container [2018-11-07 18:46:51,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:46:48" (2/3) ... [2018-11-07 18:46:51,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24bc7820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:46:51, skipping insertion in model container [2018-11-07 18:46:51,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:46:51" (3/3) ... [2018-11-07 18:46:51,938 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label39_true-unreach-call_false-termination.c [2018-11-07 18:46:51,949 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 18:46:51,958 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 18:46:51,976 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 18:46:52,022 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 18:46:52,022 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 18:46:52,022 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 18:46:52,022 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 18:46:52,022 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 18:46:52,023 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 18:46:52,023 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 18:46:52,023 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 18:46:52,054 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-07 18:46:52,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-07 18:46:52,069 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:46:52,070 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:46:52,073 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:46:52,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:46:52,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1592268880, now seen corresponding path program 1 times [2018-11-07 18:46:52,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:46:52,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:46:52,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:46:52,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:46:52,132 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:46:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:46:52,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:46:52,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:46:52,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 18:46:52,778 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:46:52,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 18:46:52,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 18:46:52,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:46:52,808 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-07 18:46:54,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:46:54,726 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-11-07 18:46:54,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 18:46:54,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2018-11-07 18:46:54,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:46:54,748 INFO L225 Difference]: With dead ends: 621 [2018-11-07 18:46:54,749 INFO L226 Difference]: Without dead ends: 382 [2018-11-07 18:46:54,756 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:46:54,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-07 18:46:54,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-11-07 18:46:54,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-07 18:46:54,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-11-07 18:46:54,839 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 118 [2018-11-07 18:46:54,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:46:54,840 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-11-07 18:46:54,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 18:46:54,840 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-11-07 18:46:54,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-07 18:46:54,848 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:46:54,849 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:46:54,849 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:46:54,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:46:54,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1462652163, now seen corresponding path program 1 times [2018-11-07 18:46:54,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:46:54,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:46:54,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:46:54,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:46:54,852 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:46:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:46:55,247 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:46:55,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:46:55,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 18:46:55,248 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:46:55,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 18:46:55,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 18:46:55,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:46:55,251 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-11-07 18:46:56,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:46:56,889 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-11-07 18:46:56,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 18:46:56,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2018-11-07 18:46:56,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:46:56,895 INFO L225 Difference]: With dead ends: 903 [2018-11-07 18:46:56,895 INFO L226 Difference]: Without dead ends: 381 [2018-11-07 18:46:56,902 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:46:56,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-11-07 18:46:56,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-11-07 18:46:56,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-11-07 18:46:56,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-11-07 18:46:56,944 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 127 [2018-11-07 18:46:56,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:46:56,945 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-11-07 18:46:56,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 18:46:56,945 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-11-07 18:46:56,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-07 18:46:56,948 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:46:56,950 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:46:56,950 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:46:56,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:46:56,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1825296655, now seen corresponding path program 1 times [2018-11-07 18:46:56,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:46:56,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:46:56,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:46:56,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:46:56,953 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:46:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:46:57,368 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2018-11-07 18:46:57,513 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:46:57,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:46:57,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 18:46:57,514 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:46:57,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 18:46:57,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 18:46:57,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:46:57,515 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-11-07 18:46:59,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:46:59,318 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-11-07 18:46:59,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 18:46:59,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2018-11-07 18:46:59,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:46:59,324 INFO L225 Difference]: With dead ends: 901 [2018-11-07 18:46:59,324 INFO L226 Difference]: Without dead ends: 380 [2018-11-07 18:46:59,326 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:46:59,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-11-07 18:46:59,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-11-07 18:46:59,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-07 18:46:59,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-11-07 18:46:59,340 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 133 [2018-11-07 18:46:59,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:46:59,341 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-11-07 18:46:59,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 18:46:59,341 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-11-07 18:46:59,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-07 18:46:59,343 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:46:59,344 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:46:59,344 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:46:59,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:46:59,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1056401542, now seen corresponding path program 1 times [2018-11-07 18:46:59,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:46:59,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:46:59,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:46:59,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:46:59,346 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:46:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:46:59,486 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:46:59,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:46:59,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 18:46:59,487 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:46:59,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 18:46:59,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 18:46:59,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 18:46:59,489 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-11-07 18:47:02,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:47:02,615 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-11-07 18:47:02,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 18:47:02,616 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2018-11-07 18:47:02,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:47:02,622 INFO L225 Difference]: With dead ends: 1193 [2018-11-07 18:47:02,622 INFO L226 Difference]: Without dead ends: 819 [2018-11-07 18:47:02,624 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 18:47:02,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-11-07 18:47:02,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-11-07 18:47:02,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-11-07 18:47:02,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-11-07 18:47:02,657 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 141 [2018-11-07 18:47:02,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:47:02,657 INFO L480 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-11-07 18:47:02,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 18:47:02,658 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-11-07 18:47:02,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-07 18:47:02,661 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:47:02,661 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:47:02,662 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:47:02,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:47:02,662 INFO L82 PathProgramCache]: Analyzing trace with hash 2142875510, now seen corresponding path program 1 times [2018-11-07 18:47:02,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:47:02,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:02,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:47:02,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:02,664 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:47:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:47:02,947 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:47:02,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:47:02,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 18:47:02,948 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:47:02,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 18:47:02,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 18:47:02,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:47:02,949 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-11-07 18:47:04,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:47:04,140 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-11-07 18:47:04,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 18:47:04,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2018-11-07 18:47:04,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:47:04,147 INFO L225 Difference]: With dead ends: 1753 [2018-11-07 18:47:04,147 INFO L226 Difference]: Without dead ends: 804 [2018-11-07 18:47:04,151 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:47:04,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-11-07 18:47:04,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-11-07 18:47:04,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-11-07 18:47:04,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-11-07 18:47:04,176 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 143 [2018-11-07 18:47:04,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:47:04,177 INFO L480 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-11-07 18:47:04,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 18:47:04,177 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-11-07 18:47:04,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-07 18:47:04,180 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:47:04,181 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:47:04,181 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:47:04,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:47:04,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1822889842, now seen corresponding path program 1 times [2018-11-07 18:47:04,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:47:04,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:04,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:47:04,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:04,183 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:47:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:47:04,439 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:47:04,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:47:04,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 18:47:04,439 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:47:04,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 18:47:04,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 18:47:04,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:47:04,440 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-11-07 18:47:05,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:47:05,292 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-11-07 18:47:05,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 18:47:05,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2018-11-07 18:47:05,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:47:05,298 INFO L225 Difference]: With dead ends: 1747 [2018-11-07 18:47:05,298 INFO L226 Difference]: Without dead ends: 801 [2018-11-07 18:47:05,302 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:47:05,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-11-07 18:47:05,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-11-07 18:47:05,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-11-07 18:47:05,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-11-07 18:47:05,328 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 145 [2018-11-07 18:47:05,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:47:05,329 INFO L480 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-11-07 18:47:05,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 18:47:05,329 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-11-07 18:47:05,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-07 18:47:05,333 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:47:05,333 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:47:05,333 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:47:05,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:47:05,334 INFO L82 PathProgramCache]: Analyzing trace with hash 2129057642, now seen corresponding path program 1 times [2018-11-07 18:47:05,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:47:05,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:05,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:47:05,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:05,336 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:47:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:47:05,522 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:47:05,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:47:05,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 18:47:05,523 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:47:05,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 18:47:05,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 18:47:05,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 18:47:05,524 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-11-07 18:47:07,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:47:07,059 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-11-07 18:47:07,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 18:47:07,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2018-11-07 18:47:07,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:47:07,077 INFO L225 Difference]: With dead ends: 2381 [2018-11-07 18:47:07,077 INFO L226 Difference]: Without dead ends: 1586 [2018-11-07 18:47:07,082 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 18:47:07,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-11-07 18:47:07,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-11-07 18:47:07,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-11-07 18:47:07,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-11-07 18:47:07,143 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 149 [2018-11-07 18:47:07,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:47:07,143 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-11-07 18:47:07,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 18:47:07,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-11-07 18:47:07,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-07 18:47:07,150 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:47:07,151 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:47:07,151 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:47:07,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:47:07,151 INFO L82 PathProgramCache]: Analyzing trace with hash -702189192, now seen corresponding path program 1 times [2018-11-07 18:47:07,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:47:07,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:07,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:47:07,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:07,153 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:47:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:47:07,370 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:47:07,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:47:07,371 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:47:07,372 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2018-11-07 18:47:07,374 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [615], [617], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 18:47:07,425 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:47:07,425 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:47:08,680 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:47:08,682 INFO L272 AbstractInterpreter]: Visited 122 different actions 240 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-07 18:47:08,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:47:08,732 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:47:09,535 INFO L227 lantSequenceWeakener]: Weakened 95 states. On average, predicates are now at 81.01% of their original sizes. [2018-11-07 18:47:09,536 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:47:11,388 INFO L415 sIntCurrentIteration]: We unified 183 AI predicates to 183 [2018-11-07 18:47:11,389 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:47:11,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:47:11,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-07 18:47:11,390 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:47:11,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 18:47:11,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 18:47:11,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-07 18:47:11,392 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 18 states. [2018-11-07 18:47:37,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:47:37,972 INFO L93 Difference]: Finished difference Result 3716 states and 5313 transitions. [2018-11-07 18:47:37,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 18:47:37,972 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 184 [2018-11-07 18:47:37,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:47:37,983 INFO L225 Difference]: With dead ends: 3716 [2018-11-07 18:47:37,984 INFO L226 Difference]: Without dead ends: 2164 [2018-11-07 18:47:37,990 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 197 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=182, Invalid=810, Unknown=0, NotChecked=0, Total=992 [2018-11-07 18:47:37,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2018-11-07 18:47:38,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 2152. [2018-11-07 18:47:38,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2152 states. [2018-11-07 18:47:38,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 2889 transitions. [2018-11-07 18:47:38,049 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 2889 transitions. Word has length 184 [2018-11-07 18:47:38,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:47:38,050 INFO L480 AbstractCegarLoop]: Abstraction has 2152 states and 2889 transitions. [2018-11-07 18:47:38,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 18:47:38,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 2889 transitions. [2018-11-07 18:47:38,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-07 18:47:38,058 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:47:38,058 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:47:38,059 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:47:38,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:47:38,059 INFO L82 PathProgramCache]: Analyzing trace with hash -150054918, now seen corresponding path program 1 times [2018-11-07 18:47:38,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:47:38,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:38,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:47:38,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:38,061 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:47:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:47:38,222 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 73 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:47:38,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:47:38,223 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:47:38,223 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 188 with the following transitions: [2018-11-07 18:47:38,224 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [615], [617], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 18:47:38,229 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:47:38,230 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:47:38,563 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:47:38,563 INFO L272 AbstractInterpreter]: Visited 122 different actions 240 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-07 18:47:38,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:47:38,570 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:47:39,005 INFO L227 lantSequenceWeakener]: Weakened 96 states. On average, predicates are now at 81.01% of their original sizes. [2018-11-07 18:47:39,005 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:47:39,682 INFO L415 sIntCurrentIteration]: We unified 186 AI predicates to 186 [2018-11-07 18:47:39,682 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:47:39,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:47:39,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-07 18:47:39,683 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:47:39,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 18:47:39,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 18:47:39,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-07 18:47:39,684 INFO L87 Difference]: Start difference. First operand 2152 states and 2889 transitions. Second operand 18 states. [2018-11-07 18:47:52,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:47:52,268 INFO L93 Difference]: Finished difference Result 5055 states and 6869 transitions. [2018-11-07 18:47:52,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 18:47:52,269 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 187 [2018-11-07 18:47:52,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:47:52,283 INFO L225 Difference]: With dead ends: 5055 [2018-11-07 18:47:52,283 INFO L226 Difference]: Without dead ends: 2909 [2018-11-07 18:47:52,290 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 201 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 18:47:52,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2018-11-07 18:47:52,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 2899. [2018-11-07 18:47:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2899 states. [2018-11-07 18:47:52,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2899 states to 2899 states and 3786 transitions. [2018-11-07 18:47:52,366 INFO L78 Accepts]: Start accepts. Automaton has 2899 states and 3786 transitions. Word has length 187 [2018-11-07 18:47:52,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:47:52,366 INFO L480 AbstractCegarLoop]: Abstraction has 2899 states and 3786 transitions. [2018-11-07 18:47:52,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 18:47:52,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2899 states and 3786 transitions. [2018-11-07 18:47:52,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-07 18:47:52,376 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:47:52,376 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:47:52,377 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:47:52,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:47:52,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1613721515, now seen corresponding path program 1 times [2018-11-07 18:47:52,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:47:52,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:52,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:47:52,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:52,378 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:47:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:47:52,617 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 18:47:52,918 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 85 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:47:52,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:47:52,918 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:47:52,918 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2018-11-07 18:47:52,919 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [119], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [615], [617], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 18:47:52,924 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:47:52,924 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:47:54,013 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:47:54,013 INFO L272 AbstractInterpreter]: Visited 124 different actions 368 times. Merged at 7 different actions 20 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 18:47:54,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:47:54,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:47:54,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:47:54,053 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 18:47:54,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:47:54,069 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:47:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:47:54,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:47:54,540 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 18:47:54,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:47:54,766 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 18:47:54,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:47:54,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2018-11-07 18:47:54,789 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:47:54,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 18:47:54,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 18:47:54,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-11-07 18:47:54,792 INFO L87 Difference]: Start difference. First operand 2899 states and 3786 transitions. Second operand 14 states. [2018-11-07 18:47:55,511 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-11-07 18:48:00,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:48:00,041 INFO L93 Difference]: Finished difference Result 8791 states and 12022 transitions. [2018-11-07 18:48:00,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 18:48:00,047 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 189 [2018-11-07 18:48:00,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:48:00,063 INFO L225 Difference]: With dead ends: 8791 [2018-11-07 18:48:00,063 INFO L226 Difference]: Without dead ends: 3517 [2018-11-07 18:48:00,082 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 390 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 18:48:00,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3517 states. [2018-11-07 18:48:00,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3517 to 3491. [2018-11-07 18:48:00,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3491 states. [2018-11-07 18:48:00,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3491 states to 3491 states and 4107 transitions. [2018-11-07 18:48:00,181 INFO L78 Accepts]: Start accepts. Automaton has 3491 states and 4107 transitions. Word has length 189 [2018-11-07 18:48:00,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:48:00,181 INFO L480 AbstractCegarLoop]: Abstraction has 3491 states and 4107 transitions. [2018-11-07 18:48:00,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 18:48:00,182 INFO L276 IsEmpty]: Start isEmpty. Operand 3491 states and 4107 transitions. [2018-11-07 18:48:00,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-11-07 18:48:00,194 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:48:00,195 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:48:00,195 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:48:00,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:48:00,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1703504543, now seen corresponding path program 1 times [2018-11-07 18:48:00,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:48:00,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:48:00,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:48:00,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:48:00,197 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:48:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:48:00,600 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-07 18:48:01,101 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 232 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:48:01,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:48:01,102 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:48:01,102 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 269 with the following transitions: [2018-11-07 18:48:01,102 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [236], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [615], [617], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 18:48:01,109 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:48:01,109 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:48:02,184 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:48:02,185 INFO L272 AbstractInterpreter]: Visited 124 different actions 364 times. Merged at 7 different actions 16 times. Never widened. Found 3 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-07 18:48:02,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:48:02,221 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:48:03,321 INFO L227 lantSequenceWeakener]: Weakened 264 states. On average, predicates are now at 80.83% of their original sizes. [2018-11-07 18:48:03,322 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:48:04,273 INFO L415 sIntCurrentIteration]: We unified 267 AI predicates to 267 [2018-11-07 18:48:04,273 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:48:04,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:48:04,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 25 [2018-11-07 18:48:04,274 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:48:04,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 18:48:04,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 18:48:04,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-07 18:48:04,275 INFO L87 Difference]: Start difference. First operand 3491 states and 4107 transitions. Second operand 11 states. [2018-11-07 18:48:13,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:48:13,118 INFO L93 Difference]: Finished difference Result 7809 states and 9417 transitions. [2018-11-07 18:48:13,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 18:48:13,119 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 268 [2018-11-07 18:48:13,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:48:13,140 INFO L225 Difference]: With dead ends: 7809 [2018-11-07 18:48:13,141 INFO L226 Difference]: Without dead ends: 5659 [2018-11-07 18:48:13,147 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 278 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2018-11-07 18:48:13,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5659 states. [2018-11-07 18:48:13,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5659 to 5646. [2018-11-07 18:48:13,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5646 states. [2018-11-07 18:48:13,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5646 states to 5646 states and 6710 transitions. [2018-11-07 18:48:13,282 INFO L78 Accepts]: Start accepts. Automaton has 5646 states and 6710 transitions. Word has length 268 [2018-11-07 18:48:13,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:48:13,282 INFO L480 AbstractCegarLoop]: Abstraction has 5646 states and 6710 transitions. [2018-11-07 18:48:13,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 18:48:13,283 INFO L276 IsEmpty]: Start isEmpty. Operand 5646 states and 6710 transitions. [2018-11-07 18:48:13,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-11-07 18:48:13,299 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:48:13,299 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:48:13,300 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:48:13,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:48:13,300 INFO L82 PathProgramCache]: Analyzing trace with hash -936896460, now seen corresponding path program 1 times [2018-11-07 18:48:13,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:48:13,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:48:13,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:48:13,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:48:13,302 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:48:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:48:13,802 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 178 proven. 13 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-07 18:48:13,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:48:13,803 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:48:13,803 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 272 with the following transitions: [2018-11-07 18:48:13,804 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [312], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [615], [617], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 18:48:13,807 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:48:13,807 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:48:14,564 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:48:14,564 INFO L272 AbstractInterpreter]: Visited 124 different actions 368 times. Merged at 7 different actions 20 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 18:48:14,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:48:14,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:48:14,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:48:14,603 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 18:48:14,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:48:14,623 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:48:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:48:14,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:48:15,163 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 198 proven. 2 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-07 18:48:15,164 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:48:15,335 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 178 proven. 13 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-07 18:48:15,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:48:15,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-07 18:48:15,357 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:48:15,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 18:48:15,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 18:48:15,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-07 18:48:15,358 INFO L87 Difference]: Start difference. First operand 5646 states and 6710 transitions. Second operand 9 states. [2018-11-07 18:48:18,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:48:18,222 INFO L93 Difference]: Finished difference Result 11443 states and 13813 transitions. [2018-11-07 18:48:18,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 18:48:18,223 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 271 [2018-11-07 18:48:18,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:48:18,240 INFO L225 Difference]: With dead ends: 11443 [2018-11-07 18:48:18,240 INFO L226 Difference]: Without dead ends: 4203 [2018-11-07 18:48:18,257 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 549 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2018-11-07 18:48:18,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4203 states. [2018-11-07 18:48:18,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4203 to 4180. [2018-11-07 18:48:18,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4180 states. [2018-11-07 18:48:18,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4180 states to 4180 states and 4942 transitions. [2018-11-07 18:48:18,361 INFO L78 Accepts]: Start accepts. Automaton has 4180 states and 4942 transitions. Word has length 271 [2018-11-07 18:48:18,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:48:18,362 INFO L480 AbstractCegarLoop]: Abstraction has 4180 states and 4942 transitions. [2018-11-07 18:48:18,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 18:48:18,362 INFO L276 IsEmpty]: Start isEmpty. Operand 4180 states and 4942 transitions. [2018-11-07 18:48:18,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-11-07 18:48:18,376 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:48:18,376 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:48:18,376 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:48:18,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:48:18,377 INFO L82 PathProgramCache]: Analyzing trace with hash -994345417, now seen corresponding path program 1 times [2018-11-07 18:48:18,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:48:18,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:48:18,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:48:18,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:48:18,378 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:48:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:48:18,918 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 245 proven. 77 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 18:48:18,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:48:18,919 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:48:18,919 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 304 with the following transitions: [2018-11-07 18:48:18,920 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [45], [50], [52], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [236], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [615], [617], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 18:48:18,923 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:48:18,923 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:48:20,067 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:48:20,067 INFO L272 AbstractInterpreter]: Visited 130 different actions 653 times. Merged at 10 different actions 59 times. Widened at 1 different actions 2 times. Found 16 fixpoints after 4 different actions. Largest state had 38 variables. [2018-11-07 18:48:20,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:48:20,077 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:48:20,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:48:20,077 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 18:48:20,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:48:20,087 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:48:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:48:20,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:48:20,527 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 284 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-07 18:48:20,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:48:20,863 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 227 proven. 13 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-11-07 18:48:20,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:48:20,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-11-07 18:48:20,899 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:48:20,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 18:48:20,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 18:48:20,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-07 18:48:20,901 INFO L87 Difference]: Start difference. First operand 4180 states and 4942 transitions. Second operand 9 states. [2018-11-07 18:48:24,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:48:24,049 INFO L93 Difference]: Finished difference Result 8287 states and 9810 transitions. [2018-11-07 18:48:24,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-07 18:48:24,050 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 303 [2018-11-07 18:48:24,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:48:24,066 INFO L225 Difference]: With dead ends: 8287 [2018-11-07 18:48:24,066 INFO L226 Difference]: Without dead ends: 4257 [2018-11-07 18:48:24,076 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 627 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=279, Invalid=981, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 18:48:24,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4257 states. [2018-11-07 18:48:24,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4257 to 3952. [2018-11-07 18:48:24,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3952 states. [2018-11-07 18:48:24,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 4537 transitions. [2018-11-07 18:48:24,167 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 4537 transitions. Word has length 303 [2018-11-07 18:48:24,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:48:24,168 INFO L480 AbstractCegarLoop]: Abstraction has 3952 states and 4537 transitions. [2018-11-07 18:48:24,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 18:48:24,168 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 4537 transitions. [2018-11-07 18:48:24,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-11-07 18:48:24,180 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:48:24,181 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:48:24,181 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:48:24,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:48:24,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1348455113, now seen corresponding path program 1 times [2018-11-07 18:48:24,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:48:24,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:48:24,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:48:24,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:48:24,183 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:48:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:48:24,732 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 318 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 18:48:24,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:48:24,733 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:48:24,733 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 313 with the following transitions: [2018-11-07 18:48:24,733 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [159], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [236], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [615], [617], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 18:48:24,738 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:48:24,738 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:48:25,818 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:48:25,819 INFO L272 AbstractInterpreter]: Visited 127 different actions 753 times. Merged at 9 different actions 56 times. Widened at 1 different actions 2 times. Found 13 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 18:48:25,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:48:25,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:48:25,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:48:25,828 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 18:48:25,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:48:25,837 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:48:25,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:48:25,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:48:26,047 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 318 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 18:48:26,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:48:26,441 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 318 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 18:48:26,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:48:26,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2018-11-07 18:48:26,464 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:48:26,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 18:48:26,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 18:48:26,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 18:48:26,465 INFO L87 Difference]: Start difference. First operand 3952 states and 4537 transitions. Second operand 6 states. [2018-11-07 18:48:27,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:48:27,236 INFO L93 Difference]: Finished difference Result 6389 states and 7363 transitions. [2018-11-07 18:48:27,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 18:48:27,244 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 312 [2018-11-07 18:48:27,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:48:27,245 INFO L225 Difference]: With dead ends: 6389 [2018-11-07 18:48:27,245 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 18:48:27,256 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 625 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-07 18:48:27,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 18:48:27,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 18:48:27,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 18:48:27,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 18:48:27,257 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 312 [2018-11-07 18:48:27,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:48:27,258 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 18:48:27,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 18:48:27,258 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 18:48:27,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 18:48:27,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 18:48:27,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:48:27,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:48:27,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:48:27,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:48:27,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:48:27,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:48:27,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:48:27,627 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 118 [2018-11-07 18:48:27,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:48:27,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:48:27,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:48:27,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:48:27,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:48:27,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:48:27,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:48:27,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:48:27,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:48:27,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:48:27,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:48:27,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:48:27,814 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 132 [2018-11-07 18:48:28,254 WARN L179 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2018-11-07 18:48:28,371 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2018-11-07 18:48:33,116 WARN L179 SmtUtils]: Spent 4.73 s on a formula simplification. DAG size of input: 240 DAG size of output: 107 [2018-11-07 18:48:34,181 WARN L179 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 129 DAG size of output: 72 [2018-11-07 18:48:35,367 WARN L179 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 144 DAG size of output: 75 [2018-11-07 18:48:35,371 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 18:48:35,372 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a11~0 |old(~a11~0)|) (= |old(~a17~0)| ~a17~0) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-11-07 18:48:35,372 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 18:48:35,372 INFO L425 ceAbstractionStarter]: For program point L564(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,372 INFO L425 ceAbstractionStarter]: For program point L531(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,372 INFO L425 ceAbstractionStarter]: For program point L498(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,373 INFO L425 ceAbstractionStarter]: For program point L465(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,373 INFO L425 ceAbstractionStarter]: For program point L432(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,373 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-07 18:48:35,373 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-07 18:48:35,373 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-07 18:48:35,373 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-07 18:48:35,373 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-07 18:48:35,373 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-07 18:48:35,373 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-07 18:48:35,374 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-07 18:48:35,374 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-07 18:48:35,374 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-07 18:48:35,374 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-07 18:48:35,374 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-07 18:48:35,374 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-07 18:48:35,374 INFO L425 ceAbstractionStarter]: For program point L567(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,374 INFO L425 ceAbstractionStarter]: For program point L534(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,374 INFO L425 ceAbstractionStarter]: For program point L501(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,374 INFO L425 ceAbstractionStarter]: For program point L468(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,375 INFO L425 ceAbstractionStarter]: For program point L435(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,375 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-07 18:48:35,375 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-07 18:48:35,375 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-07 18:48:35,375 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-07 18:48:35,375 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-07 18:48:35,375 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-07 18:48:35,375 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-07 18:48:35,376 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-07 18:48:35,376 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-07 18:48:35,376 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-07 18:48:35,376 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-07 18:48:35,376 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-07 18:48:35,376 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-07 18:48:35,376 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-07 18:48:35,376 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-07 18:48:35,376 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-07 18:48:35,376 INFO L425 ceAbstractionStarter]: For program point L570(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,377 INFO L425 ceAbstractionStarter]: For program point L537(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,377 INFO L425 ceAbstractionStarter]: For program point L471(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,377 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,377 INFO L425 ceAbstractionStarter]: For program point L438(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,377 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-07 18:48:35,377 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-07 18:48:35,377 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-07 18:48:35,377 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-07 18:48:35,377 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-07 18:48:35,377 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-07 18:48:35,378 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-07 18:48:35,378 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-07 18:48:35,378 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-07 18:48:35,378 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-07 18:48:35,378 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-07 18:48:35,378 INFO L425 ceAbstractionStarter]: For program point L573(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,378 INFO L425 ceAbstractionStarter]: For program point L540(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,378 INFO L425 ceAbstractionStarter]: For program point L507(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,379 INFO L425 ceAbstractionStarter]: For program point L474(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,379 INFO L425 ceAbstractionStarter]: For program point L441(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,379 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-07 18:48:35,379 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-07 18:48:35,379 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-07 18:48:35,379 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-07 18:48:35,379 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-07 18:48:35,379 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-07 18:48:35,379 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-07 18:48:35,379 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-07 18:48:35,380 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-07 18:48:35,380 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-07 18:48:35,380 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-07 18:48:35,380 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-07 18:48:35,380 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-07 18:48:35,380 INFO L425 ceAbstractionStarter]: For program point L576(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,380 INFO L425 ceAbstractionStarter]: For program point L543(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,380 INFO L425 ceAbstractionStarter]: For program point L510(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,381 INFO L425 ceAbstractionStarter]: For program point L477(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,381 INFO L425 ceAbstractionStarter]: For program point L444(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,381 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-07 18:48:35,381 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-07 18:48:35,381 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-07 18:48:35,381 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-07 18:48:35,381 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-07 18:48:35,381 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-07 18:48:35,381 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-07 18:48:35,382 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 505) no Hoare annotation was computed. [2018-11-07 18:48:35,382 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-07 18:48:35,382 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-07 18:48:35,382 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-07 18:48:35,382 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-07 18:48:35,382 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-07 18:48:35,382 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-07 18:48:35,382 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-07 18:48:35,383 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-07 18:48:35,383 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-07 18:48:35,383 INFO L425 ceAbstractionStarter]: For program point L579(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,383 INFO L425 ceAbstractionStarter]: For program point L546(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,383 INFO L425 ceAbstractionStarter]: For program point L513(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,383 INFO L425 ceAbstractionStarter]: For program point L480(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,383 INFO L425 ceAbstractionStarter]: For program point L447(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,383 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-07 18:48:35,383 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-07 18:48:35,383 INFO L425 ceAbstractionStarter]: For program point L414-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,383 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-07 18:48:35,383 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-07 18:48:35,383 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-07 18:48:35,384 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,384 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,384 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-07 18:48:35,384 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-07 18:48:35,384 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-07 18:48:35,384 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-07 18:48:35,384 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-07 18:48:35,384 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-07 18:48:35,384 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-07 18:48:35,384 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-07 18:48:35,384 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-07 18:48:35,384 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-07 18:48:35,385 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-07 18:48:35,385 INFO L425 ceAbstractionStarter]: For program point L582(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,385 INFO L425 ceAbstractionStarter]: For program point L549(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,385 INFO L425 ceAbstractionStarter]: For program point L516(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,385 INFO L425 ceAbstractionStarter]: For program point L483(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,385 INFO L425 ceAbstractionStarter]: For program point L450(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,385 INFO L425 ceAbstractionStarter]: For program point L417(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,385 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-07 18:48:35,385 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-07 18:48:35,385 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-07 18:48:35,386 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-07 18:48:35,386 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-07 18:48:35,386 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-07 18:48:35,386 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-07 18:48:35,386 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-07 18:48:35,386 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-07 18:48:35,386 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-07 18:48:35,386 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-07 18:48:35,386 INFO L425 ceAbstractionStarter]: For program point L585(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,386 INFO L425 ceAbstractionStarter]: For program point L552(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,387 INFO L425 ceAbstractionStarter]: For program point L519(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,387 INFO L425 ceAbstractionStarter]: For program point L486(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,387 INFO L425 ceAbstractionStarter]: For program point L453(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,387 INFO L425 ceAbstractionStarter]: For program point L420(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,387 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-07 18:48:35,387 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-07 18:48:35,387 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-07 18:48:35,387 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-07 18:48:35,387 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-07 18:48:35,387 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-07 18:48:35,388 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-07 18:48:35,388 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-07 18:48:35,388 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-07 18:48:35,388 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-07 18:48:35,388 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-07 18:48:35,388 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-07 18:48:35,388 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-07 18:48:35,388 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-07 18:48:35,388 INFO L425 ceAbstractionStarter]: For program point L588(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,388 INFO L425 ceAbstractionStarter]: For program point L555(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,388 INFO L425 ceAbstractionStarter]: For program point L522(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,389 INFO L425 ceAbstractionStarter]: For program point L489(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,389 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse21 (= 1 |old(~a11~0)|)) (.cse26 (= 1 ~a11~0)) (.cse28 (= |old(~a17~0)| ~a17~0)) (.cse33 (= |old(~a25~0)| ~a25~0)) (.cse30 (= ~a28~0 |old(~a28~0)|)) (.cse23 (= 1 |old(~a19~0)|)) (.cse25 (= 1 |old(~a25~0)|)) (.cse31 (= ~a25~0 |old(~a25~0)|)) (.cse27 (= ~a11~0 |old(~a11~0)|)) (.cse32 (= ~a17~0 8)) (.cse29 (= ~a19~0 |old(~a19~0)|))) (let ((.cse16 (< 1 |old(~a19~0)|)) (.cse6 (< 6 |calculate_output_#in~input|)) (.cse8 (not (= 0 |old(~a11~0)|))) (.cse9 (and .cse31 .cse27 (= |old(~a28~0)| ~a28~0) .cse32 .cse29)) (.cse17 (< |old(~a28~0)| 7)) (.cse18 (< |old(~a19~0)| 0)) (.cse19 (< 10 |old(~a28~0)|)) (.cse11 (< |calculate_output_#in~input| 1)) (.cse24 (not (= 7 |old(~a28~0)|))) (.cse12 (= 1 ~a19~0)) (.cse7 (not .cse25)) (.cse2 (< |old(~a28~0)| 9)) (.cse13 (not (= 10 |old(~a28~0)|))) (.cse10 (not .cse23)) (.cse22 (< 7 |old(~a17~0)|)) (.cse1 (and .cse26 .cse28 .cse33 .cse30)) (.cse3 (= 9 |old(~a28~0)|)) (.cse4 (not (= |old(~a17~0)| 8))) (.cse0 (not (= 1 ~a21~0))) (.cse20 (= 8 |old(~a28~0)|)) (.cse14 (not (= 8 |old(~a17~0)|))) (.cse5 (not .cse21)) (.cse15 (not (= 0 |old(~a25~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse0 .cse7 .cse8 (< |old(~a28~0)| 8) .cse9 .cse10 .cse4 .cse11) (or .cse12 .cse0 .cse13 .cse7 .cse10 .cse14) (or .cse15 .cse11 .cse6 (or .cse0 .cse8) (< 9 |old(~a28~0)|) .cse10 .cse2 .cse9 .cse14) (or .cse16 .cse6 .cse0 .cse7 .cse8 .cse3 .cse17 .cse18 .cse9 .cse19 .cse20 .cse4 .cse11) (or .cse0 .cse21 .cse20 (not (= ~a11~0 1)) .cse22) (or .cse16 .cse6 .cse0 .cse8 .cse3 .cse9 .cse17 .cse18 .cse19 .cse4 .cse15 .cse11) (or .cse23 .cse0 .cse24 .cse14 (not .cse12) .cse5 .cse25) (or .cse0 .cse24 .cse7 .cse10 .cse5 (and .cse26 .cse12) (not (= 7 |old(~a17~0)|))) (or .cse0 .cse7 .cse10 .cse14 (and .cse26 (= 1 ~a25~0) (= 9 ~a28~0) (= 8 ~a17~0) .cse12) (not .cse3) .cse5) (or (and .cse27 .cse28 .cse29 .cse30 .cse31) (or .cse0 .cse21 .cse7 .cse2 .cse4) .cse10) (or .cse0 .cse21 .cse13 .cse10 .cse14 (and .cse27 .cse32 .cse29 .cse30 .cse31) .cse15) (or (and .cse28 .cse33 .cse30) .cse0 .cse20 .cse22) (or .cse0 .cse1 .cse20 .cse3 .cse4 .cse5 .cse25) (or .cse0 (and (= ~a25~0 0) .cse26 .cse32 .cse30) .cse20 .cse14 .cse5 .cse15)))) [2018-11-07 18:48:35,389 INFO L425 ceAbstractionStarter]: For program point L456(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,390 INFO L425 ceAbstractionStarter]: For program point L423(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,390 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-07 18:48:35,390 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-07 18:48:35,390 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-07 18:48:35,390 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-07 18:48:35,390 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-07 18:48:35,390 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-07 18:48:35,390 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-07 18:48:35,390 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-07 18:48:35,390 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-07 18:48:35,390 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-07 18:48:35,391 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-07 18:48:35,391 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-07 18:48:35,391 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-07 18:48:35,391 INFO L425 ceAbstractionStarter]: For program point L591(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,391 INFO L425 ceAbstractionStarter]: For program point L558(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,391 INFO L425 ceAbstractionStarter]: For program point L525(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,391 INFO L425 ceAbstractionStarter]: For program point L492(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,391 INFO L425 ceAbstractionStarter]: For program point L459(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,391 INFO L425 ceAbstractionStarter]: For program point L426(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,391 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-07 18:48:35,392 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-07 18:48:35,392 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-07 18:48:35,392 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-07 18:48:35,392 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-07 18:48:35,392 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-07 18:48:35,392 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-07 18:48:35,392 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-07 18:48:35,392 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-07 18:48:35,392 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-07 18:48:35,392 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-07 18:48:35,393 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-07 18:48:35,393 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-07 18:48:35,393 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-07 18:48:35,393 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-07 18:48:35,393 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 596) no Hoare annotation was computed. [2018-11-07 18:48:35,393 INFO L425 ceAbstractionStarter]: For program point L561(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,393 INFO L425 ceAbstractionStarter]: For program point L528(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,393 INFO L425 ceAbstractionStarter]: For program point L495(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,393 INFO L425 ceAbstractionStarter]: For program point L462(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,393 INFO L425 ceAbstractionStarter]: For program point L429(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:48:35,393 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-07 18:48:35,394 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-07 18:48:35,394 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-07 18:48:35,394 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-07 18:48:35,394 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-07 18:48:35,394 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-07 18:48:35,394 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-07 18:48:35,394 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-07 18:48:35,394 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-07 18:48:35,394 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-07 18:48:35,394 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-07 18:48:35,395 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-07 18:48:35,395 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-07 18:48:35,395 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-07 18:48:35,395 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-07 18:48:35,395 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-07 18:48:35,395 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-07 18:48:35,395 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-07 18:48:35,395 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-07 18:48:35,395 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 18:48:35,396 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 7) (= ~a21~0 1)) [2018-11-07 18:48:35,396 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 18:48:35,396 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 18:48:35,396 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (and (= ~a11~0 0) (= ~a17~0 8) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) (not (= 1 |old(~a19~0)|)) (not (= 0 |old(~a11~0)|)) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|))) [2018-11-07 18:48:35,396 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-07 18:48:35,396 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse8 (<= ~a25~0 1)) (.cse9 (<= 0 ~a25~0)) (.cse4 (not (= ~a28~0 8))) (.cse5 (<= 1 main_~input~0)) (.cse6 (<= main_~input~0 6)) (.cse7 (<= ~a28~0 10)) (.cse14 (<= 8 ~a28~0)) (.cse10 (= ~a11~0 0)) (.cse11 (<= 0 ~a19~0)) (.cse1 (= ~a25~0 0)) (.cse12 (<= ~a19~0 1)) (.cse3 (= ~a17~0 8)) (.cse0 (= ~a11~0 |old(~a11~0)|)) (.cse16 (= 1 ~a25~0)) (.cse2 (= 1 ~a19~0)) (.cse15 (= 1 ~a11~0)) (.cse17 (= |old(~a17~0)| ~a17~0)) (.cse18 (<= 9 ~a28~0)) (.cse13 (not (= ~a28~0 9)))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (and .cse0 (= 10 ~a28~0) .cse1 .cse2 .cse3) (and (<= ~a17~0 7) .cse4) (not (= 0 |old(~a11~0)|)) (and .cse5 .cse6 .cse7 .cse4 (<= 7 ~a28~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse3 .cse13) (and .cse5 .cse6 .cse7 .cse8 .cse14 .cse9 .cse10 .cse2 .cse3) (and .cse15 .cse16 (= 9 ~a28~0) (= 8 ~a17~0) .cse2) (not (= 0 |old(~a25~0)|)) (and .cse10 .cse3 (= ~a28~0 |old(~a28~0)|) (= ~a19~0 |old(~a19~0)|) (= ~a25~0 |old(~a25~0)|)) (and (not (= ~a25~0 1)) .cse15 .cse17 .cse4 .cse13) (and .cse1 .cse15 .cse3 .cse18) (and .cse5 .cse6 .cse7 .cse14 .cse10 .cse11 .cse1 .cse12 .cse3 .cse13) (and (and .cse0 .cse17 .cse16 .cse18) .cse2) (not (= 1 |old(~a19~0)|)) (not (= 8 |old(~a17~0)|)) (and .cse15 .cse17 .cse18 .cse13))) [2018-11-07 18:48:35,396 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-07 18:48:35,396 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-07 18:48:35,397 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse6 (= 1 ~a25~0)) (.cse2 (= 1 ~a19~0)) (.cse1 (= ~a25~0 0)) (.cse12 (<= ~a28~0 10)) (.cse4 (not (= ~a28~0 8))) (.cse13 (<= 7 ~a28~0)) (.cse14 (= ~a11~0 0)) (.cse15 (<= 0 ~a19~0)) (.cse16 (<= ~a19~0 1)) (.cse10 (<= 1 main_~input~0)) (.cse18 (<= 0 ~a25~0)) (.cse0 (= ~a11~0 |old(~a11~0)|)) (.cse11 (<= main_~input~0 6)) (.cse17 (<= ~a25~0 1)) (.cse3 (= ~a17~0 8)) (.cse8 (= 1 ~a11~0)) (.cse5 (= |old(~a17~0)| ~a17~0)) (.cse7 (<= 9 ~a28~0)) (.cse9 (not (= ~a28~0 9)))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (and .cse0 (= 10 ~a28~0) .cse1 .cse2 .cse3) (and (<= ~a17~0 7) .cse4) (and .cse0 .cse5 .cse6 .cse2 .cse7) (not (= 0 |old(~a11~0)|)) (and .cse8 .cse6 (= 9 ~a28~0) (= 8 ~a17~0) .cse2) (not (= 0 |old(~a25~0)|)) (and (not (= ~a25~0 1)) .cse8 .cse5 .cse4 .cse9) (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse1 .cse16 .cse3 .cse9) (and .cse1 .cse8 .cse3 .cse7) (and .cse10 .cse11 .cse12 .cse4 .cse13 .cse17 .cse18 .cse14 .cse15 .cse16 .cse3 .cse9) (and .cse10 .cse18 (<= ~a28~0 9) (<= |old(~a28~0)| ~a28~0) .cse0 .cse11 .cse17 .cse3 (= ~a19~0 |old(~a19~0)|)) (not (= 1 |old(~a19~0)|)) (not (= 8 |old(~a17~0)|)) (and .cse8 .cse5 .cse7 .cse9))) [2018-11-07 18:48:35,397 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-07 18:48:35,397 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-07 18:48:35,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:48:35 BoogieIcfgContainer [2018-11-07 18:48:35,411 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 18:48:35,412 INFO L168 Benchmark]: Toolchain (without parser) took 107835.30 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.2 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-11-07 18:48:35,414 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 18:48:35,414 INFO L168 Benchmark]: CACSL2BoogieTranslator took 802.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-07 18:48:35,415 INFO L168 Benchmark]: Boogie Procedure Inliner took 154.44 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -821.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. [2018-11-07 18:48:35,416 INFO L168 Benchmark]: Boogie Preprocessor took 109.75 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 18:48:35,417 INFO L168 Benchmark]: RCFGBuilder took 3279.01 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 103.0 MB). Peak memory consumption was 103.0 MB. Max. memory is 7.1 GB. [2018-11-07 18:48:35,417 INFO L168 Benchmark]: TraceAbstraction took 103481.25 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-11-07 18:48:35,422 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 802.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 154.44 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -821.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 109.75 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3279.01 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 103.0 MB). Peak memory consumption was 103.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 103481.25 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 505]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((((((((!(1 == a21) || !(7 == \old(a28))) || ((((a11 == \old(a11) && 10 == a28) && a25 == 0) && 1 == a19) && a17 == 8)) || (a17 <= 7 && !(a28 == 8))) || !(0 == \old(a11))) || (((((((((((1 <= input && input <= 6) && a28 <= 10) && !(a28 == 8)) && 7 <= a28) && a25 <= 1) && 0 <= a25) && a11 == 0) && 0 <= a19) && a19 <= 1) && a17 == 8) && !(a28 == 9))) || ((((((((1 <= input && input <= 6) && a28 <= 10) && a25 <= 1) && 8 <= a28) && 0 <= a25) && a11 == 0) && 1 == a19) && a17 == 8)) || ((((1 == a11 && 1 == a25) && 9 == a28) && 8 == a17) && 1 == a19)) || !(0 == \old(a25))) || ((((a11 == 0 && a17 == 8) && a28 == \old(a28)) && a19 == \old(a19)) && a25 == \old(a25))) || ((((!(a25 == 1) && 1 == a11) && \old(a17) == a17) && !(a28 == 8)) && !(a28 == 9))) || (((a25 == 0 && 1 == a11) && a17 == 8) && 9 <= a28)) || (((((((((1 <= input && input <= 6) && a28 <= 10) && 8 <= a28) && a11 == 0) && 0 <= a19) && a25 == 0) && a19 <= 1) && a17 == 8) && !(a28 == 9))) || ((((a11 == \old(a11) && \old(a17) == a17) && 1 == a25) && 9 <= a28) && 1 == a19)) || !(1 == \old(a19))) || !(8 == \old(a17))) || (((1 == a11 && \old(a17) == a17) && 9 <= a28) && !(a28 == 9)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 103.3s OverallTime, 14 OverallIterations, 6 TraceHistogramMax, 72.4s AutomataDifference, 0.0s DeadEndRemovalTime, 8.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1588 SDtfs, 13995 SDslu, 2538 SDs, 0 SdLazy, 18595 SolverSat, 3058 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.1s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 3028 GetRequests, 2808 SyntacticMatches, 13 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1188 ImplicationChecksByTransitivity, 10.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5646occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 7.0s AbstIntTime, 7 AbstIntIterations, 3 AbstIntStrong, 0.9975891818566623 AbsIntWeakeningRatio, 0.17452830188679244 AbsIntAvgWeakeningVarsNumRemoved, 29.30188679245283 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 429 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 206 PreInvPairs, 300 NumberOfFragments, 1120 HoareAnnotationTreeSize, 206 FomulaSimplifications, 7124 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 7 FomulaSimplificationsInter, 8238 FormulaSimplificationTreeSizeReductionInter, 7.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 3745 NumberOfCodeBlocks, 3745 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 4798 ConstructedInterpolants, 0 QuantifiedInterpolants, 3525799 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2470 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 22 InterpolantComputations, 7 PerfectInterpolantSequences, 3987/4183 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...