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.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label56_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 12:57:02,519 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 12:57:02,521 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 12:57:02,536 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 12:57:02,536 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 12:57:02,537 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 12:57:02,539 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 12:57:02,540 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 12:57:02,542 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 12:57:02,543 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 12:57:02,544 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 12:57:02,544 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 12:57:02,545 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 12:57:02,546 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 12:57:02,547 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 12:57:02,548 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 12:57:02,549 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 12:57:02,551 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 12:57:02,553 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 12:57:02,554 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 12:57:02,556 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 12:57:02,557 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 12:57:02,559 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 12:57:02,560 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 12:57:02,560 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 12:57:02,561 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 12:57:02,562 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 12:57:02,562 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 12:57:02,563 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 12:57:02,565 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 12:57:02,565 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 12:57:02,566 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 12:57:02,566 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 12:57:02,566 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 12:57:02,567 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 12:57:02,568 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 12:57:02,568 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.epf [2018-11-07 12:57:02,596 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 12:57:02,596 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 12:57:02,600 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 12:57:02,601 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 12:57:02,601 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 12:57:02,601 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 12:57:02,601 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 12:57:02,601 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 12:57:02,602 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 12:57:02,602 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 12:57:02,602 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 12:57:02,602 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 12:57:02,603 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 12:57:02,604 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 12:57:02,604 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 12:57:02,604 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 12:57:02,604 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 12:57:02,604 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 12:57:02,606 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 12:57:02,607 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 12:57:02,607 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 12:57:02,607 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 12:57:02,607 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 12:57:02,607 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 12:57:02,608 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:57:02,608 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 12:57:02,608 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 12:57:02,608 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 12:57:02,609 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 12:57:02,609 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 12:57:02,609 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 12:57:02,609 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 12:57:02,609 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 12:57:02,610 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 12:57:02,683 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 12:57:02,700 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 12:57:02,705 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 12:57:02,707 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 12:57:02,707 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 12:57:02,708 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label56_true-unreach-call_false-termination.c [2018-11-07 12:57:02,778 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2860fd181/cfc238dcec264af3bed95e2fd2085a86/FLAG1ca8fda86 [2018-11-07 12:57:03,318 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 12:57:03,319 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label56_true-unreach-call_false-termination.c [2018-11-07 12:57:03,331 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2860fd181/cfc238dcec264af3bed95e2fd2085a86/FLAG1ca8fda86 [2018-11-07 12:57:03,347 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2860fd181/cfc238dcec264af3bed95e2fd2085a86 [2018-11-07 12:57:03,359 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 12:57:03,360 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 12:57:03,361 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 12:57:03,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 12:57:03,366 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 12:57:03,367 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:57:03" (1/1) ... [2018-11-07 12:57:03,370 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6507d5c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:03, skipping insertion in model container [2018-11-07 12:57:03,370 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:57:03" (1/1) ... [2018-11-07 12:57:03,381 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 12:57:03,434 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 12:57:03,916 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:57:03,927 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 12:57:04,084 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:57:04,102 INFO L193 MainTranslator]: Completed translation [2018-11-07 12:57:04,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:04 WrapperNode [2018-11-07 12:57:04,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 12:57:04,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 12:57:04,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 12:57:04,105 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 12:57:04,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:04" (1/1) ... [2018-11-07 12:57:04,148 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:04" (1/1) ... [2018-11-07 12:57:04,160 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 12:57:04,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 12:57:04,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 12:57:04,161 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 12:57:04,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:04" (1/1) ... [2018-11-07 12:57:04,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:04" (1/1) ... [2018-11-07 12:57:04,335 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:04" (1/1) ... [2018-11-07 12:57:04,336 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:04" (1/1) ... [2018-11-07 12:57:04,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:04" (1/1) ... [2018-11-07 12:57:04,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:04" (1/1) ... [2018-11-07 12:57:04,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:04" (1/1) ... [2018-11-07 12:57:04,426 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 12:57:04,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 12:57:04,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 12:57:04,426 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 12:57:04,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:04" (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 12:57:04,494 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 12:57:04,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 12:57:04,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 12:57:04,495 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 12:57:04,495 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 12:57:04,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 12:57:04,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 12:57:04,495 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 12:57:04,496 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 12:57:07,747 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 12:57:07,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:57:07 BoogieIcfgContainer [2018-11-07 12:57:07,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 12:57:07,749 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 12:57:07,749 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 12:57:07,753 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 12:57:07,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:57:03" (1/3) ... [2018-11-07 12:57:07,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d0a4bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:57:07, skipping insertion in model container [2018-11-07 12:57:07,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:04" (2/3) ... [2018-11-07 12:57:07,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d0a4bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:57:07, skipping insertion in model container [2018-11-07 12:57:07,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:57:07" (3/3) ... [2018-11-07 12:57:07,766 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label56_true-unreach-call_false-termination.c [2018-11-07 12:57:07,778 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 12:57:07,790 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 12:57:07,809 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 12:57:07,859 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 12:57:07,860 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 12:57:07,860 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 12:57:07,860 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 12:57:07,860 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 12:57:07,860 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 12:57:07,861 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 12:57:07,861 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 12:57:07,891 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-07 12:57:07,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-07 12:57:07,907 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:57:07,908 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:57:07,911 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:57:07,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:57:07,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1901339872, now seen corresponding path program 1 times [2018-11-07 12:57:07,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:57:07,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:07,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:57:07,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:07,982 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:57:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:57:08,525 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:57:08,676 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 12:57:08,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:57:08,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 12:57:08,679 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:57:08,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:57:08,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:57:08,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:57:08,709 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-07 12:57:10,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:57:10,427 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-11-07 12:57:10,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:57:10,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2018-11-07 12:57:10,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:57:10,447 INFO L225 Difference]: With dead ends: 621 [2018-11-07 12:57:10,447 INFO L226 Difference]: Without dead ends: 382 [2018-11-07 12:57:10,454 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:57:10,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-07 12:57:10,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-11-07 12:57:10,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-07 12:57:10,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-11-07 12:57:10,541 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 130 [2018-11-07 12:57:10,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:57:10,542 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-11-07 12:57:10,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:57:10,543 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-11-07 12:57:10,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-07 12:57:10,549 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:57:10,549 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:57:10,550 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:57:10,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:57:10,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1819679469, now seen corresponding path program 1 times [2018-11-07 12:57:10,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:57:10,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:10,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:57:10,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:10,553 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:57:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:57:11,024 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 12:57:11,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:57:11,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 12:57:11,025 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:57:11,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 12:57:11,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 12:57:11,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:57:11,028 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-11-07 12:57:12,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:57:12,651 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-11-07 12:57:12,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 12:57:12,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2018-11-07 12:57:12,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:57:12,657 INFO L225 Difference]: With dead ends: 903 [2018-11-07 12:57:12,658 INFO L226 Difference]: Without dead ends: 381 [2018-11-07 12:57:12,661 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 12:57:12,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-11-07 12:57:12,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-11-07 12:57:12,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-11-07 12:57:12,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-11-07 12:57:12,689 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 139 [2018-11-07 12:57:12,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:57:12,689 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-11-07 12:57:12,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 12:57:12,689 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-11-07 12:57:12,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-07 12:57:12,693 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:57:12,693 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:57:12,694 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:57:12,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:57:12,694 INFO L82 PathProgramCache]: Analyzing trace with hash 484067553, now seen corresponding path program 1 times [2018-11-07 12:57:12,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:57:12,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:12,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:57:12,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:12,696 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:57:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:57:13,132 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 12:57:13,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:57:13,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 12:57:13,133 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:57:13,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 12:57:13,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 12:57:13,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:57:13,135 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-11-07 12:57:15,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:57:15,067 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-11-07 12:57:15,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 12:57:15,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2018-11-07 12:57:15,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:57:15,071 INFO L225 Difference]: With dead ends: 901 [2018-11-07 12:57:15,071 INFO L226 Difference]: Without dead ends: 380 [2018-11-07 12:57:15,076 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 12:57:15,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-11-07 12:57:15,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-11-07 12:57:15,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-07 12:57:15,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-11-07 12:57:15,096 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 145 [2018-11-07 12:57:15,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:57:15,096 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-11-07 12:57:15,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 12:57:15,097 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-11-07 12:57:15,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-07 12:57:15,100 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:57:15,100 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:57:15,101 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:57:15,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:57:15,101 INFO L82 PathProgramCache]: Analyzing trace with hash 191966186, now seen corresponding path program 1 times [2018-11-07 12:57:15,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:57:15,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:15,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:57:15,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:15,108 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:57:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:57:15,342 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:57:15,471 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 12:57:15,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:57:15,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 12:57:15,472 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:57:15,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 12:57:15,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 12:57:15,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 12:57:15,473 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-11-07 12:57:18,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:57:18,069 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-11-07 12:57:18,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 12:57:18,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2018-11-07 12:57:18,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:57:18,075 INFO L225 Difference]: With dead ends: 1193 [2018-11-07 12:57:18,075 INFO L226 Difference]: Without dead ends: 819 [2018-11-07 12:57:18,077 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 12:57:18,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-11-07 12:57:18,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-11-07 12:57:18,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-11-07 12:57:18,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-11-07 12:57:18,120 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 153 [2018-11-07 12:57:18,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:57:18,121 INFO L480 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-11-07 12:57:18,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 12:57:18,121 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-11-07 12:57:18,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-07 12:57:18,125 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:57:18,125 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:57:18,125 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:57:18,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:57:18,126 INFO L82 PathProgramCache]: Analyzing trace with hash -684578330, now seen corresponding path program 1 times [2018-11-07 12:57:18,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:57:18,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:18,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:57:18,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:18,127 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:57:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:57:18,549 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-07 12:57:18,768 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-07 12:57:18,827 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 12:57:18,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:57:18,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 12:57:18,828 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:57:18,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 12:57:18,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 12:57:18,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:57:18,829 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-11-07 12:57:19,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:57:19,847 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-11-07 12:57:19,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 12:57:19,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2018-11-07 12:57:19,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:57:19,856 INFO L225 Difference]: With dead ends: 1753 [2018-11-07 12:57:19,856 INFO L226 Difference]: Without dead ends: 804 [2018-11-07 12:57:19,860 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:57:19,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-11-07 12:57:19,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-11-07 12:57:19,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-11-07 12:57:19,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-11-07 12:57:19,894 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 155 [2018-11-07 12:57:19,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:57:19,895 INFO L480 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-11-07 12:57:19,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 12:57:19,895 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-11-07 12:57:19,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-07 12:57:19,899 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:57:19,899 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:57:19,899 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:57:19,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:57:19,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1228371938, now seen corresponding path program 1 times [2018-11-07 12:57:19,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:57:19,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:19,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:57:19,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:19,901 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:57:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:57:20,198 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 12:57:20,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:57:20,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 12:57:20,199 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:57:20,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 12:57:20,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 12:57:20,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:57:20,200 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-11-07 12:57:21,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:57:21,183 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-11-07 12:57:21,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 12:57:21,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2018-11-07 12:57:21,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:57:21,189 INFO L225 Difference]: With dead ends: 1747 [2018-11-07 12:57:21,190 INFO L226 Difference]: Without dead ends: 801 [2018-11-07 12:57:21,193 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 12:57:21,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-11-07 12:57:21,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-11-07 12:57:21,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-11-07 12:57:21,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-11-07 12:57:21,220 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 157 [2018-11-07 12:57:21,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:57:21,220 INFO L480 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-11-07 12:57:21,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 12:57:21,221 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-11-07 12:57:21,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-07 12:57:21,225 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:57:21,225 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:57:21,225 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:57:21,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:57:21,226 INFO L82 PathProgramCache]: Analyzing trace with hash -977337382, now seen corresponding path program 1 times [2018-11-07 12:57:21,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:57:21,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:21,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:57:21,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:21,228 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:57:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:57:21,404 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:57:21,446 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 12:57:21,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:57:21,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 12:57:21,446 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:57:21,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 12:57:21,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 12:57:21,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 12:57:21,448 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-11-07 12:57:23,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:57:23,784 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-11-07 12:57:23,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 12:57:23,793 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2018-11-07 12:57:23,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:57:23,804 INFO L225 Difference]: With dead ends: 2381 [2018-11-07 12:57:23,804 INFO L226 Difference]: Without dead ends: 1586 [2018-11-07 12:57:23,809 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 12:57:23,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-11-07 12:57:23,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-11-07 12:57:23,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-11-07 12:57:23,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-11-07 12:57:23,856 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 161 [2018-11-07 12:57:23,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:57:23,857 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-11-07 12:57:23,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 12:57:23,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-11-07 12:57:23,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-07 12:57:23,861 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:57:23,862 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:23,862 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:57:23,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:57:23,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1994030385, now seen corresponding path program 1 times [2018-11-07 12:57:23,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:57:23,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:23,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:57:23,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:23,864 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:57:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:57:24,150 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:57:24,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:57:24,150 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:57:24,151 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 168 with the following transitions: [2018-11-07 12:57:24,154 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], [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], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [711], [713], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:57:24,216 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:57:24,217 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:57:26,183 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:57:26,185 INFO L272 AbstractInterpreter]: Visited 135 different actions 401 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 12:57:26,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:57:26,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:57:26,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:57:26,236 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 12:57:26,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:57:26,250 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:57:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:57:26,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:57:26,668 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 12:57:26,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:57:27,224 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 12:57:27,257 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:57:27,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-11-07 12:57:27,258 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:57:27,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:57:27,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:57:27,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-07 12:57:27,260 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 3 states. [2018-11-07 12:57:29,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:57:29,105 INFO L93 Difference]: Finished difference Result 4406 states and 6474 transitions. [2018-11-07 12:57:29,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:57:29,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2018-11-07 12:57:29,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:57:29,113 INFO L225 Difference]: With dead ends: 4406 [2018-11-07 12:57:29,114 INFO L226 Difference]: Without dead ends: 1398 [2018-11-07 12:57:29,127 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 334 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-07 12:57:29,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2018-11-07 12:57:29,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1396. [2018-11-07 12:57:29,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1396 states. [2018-11-07 12:57:29,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 1807 transitions. [2018-11-07 12:57:29,169 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 1807 transitions. Word has length 167 [2018-11-07 12:57:29,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:57:29,169 INFO L480 AbstractCegarLoop]: Abstraction has 1396 states and 1807 transitions. [2018-11-07 12:57:29,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:57:29,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1807 transitions. [2018-11-07 12:57:29,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-07 12:57:29,175 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:57:29,176 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:57:29,176 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:57:29,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:57:29,176 INFO L82 PathProgramCache]: Analyzing trace with hash -396743574, now seen corresponding path program 1 times [2018-11-07 12:57:29,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:57:29,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:29,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:57:29,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:29,178 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:57:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:57:29,435 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 12:57:29,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:57:29,436 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:57:29,436 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 200 with the following transitions: [2018-11-07 12:57:29,436 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], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [711], [713], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:57:29,444 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:57:29,445 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:57:30,089 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:57:30,089 INFO L272 AbstractInterpreter]: Visited 134 different actions 262 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-07 12:57:30,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:57:30,132 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:57:30,971 INFO L227 lantSequenceWeakener]: Weakened 108 states. On average, predicates are now at 81.27% of their original sizes. [2018-11-07 12:57:30,972 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:57:33,575 INFO L415 sIntCurrentIteration]: We unified 198 AI predicates to 198 [2018-11-07 12:57:33,575 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:57:33,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:57:33,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-07 12:57:33,577 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:57:33,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 12:57:33,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 12:57:33,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-07 12:57:33,578 INFO L87 Difference]: Start difference. First operand 1396 states and 1807 transitions. Second operand 18 states. [2018-11-07 12:57:51,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:57:51,785 INFO L93 Difference]: Finished difference Result 3692 states and 4786 transitions. [2018-11-07 12:57:51,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 12:57:51,785 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 199 [2018-11-07 12:57:51,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:57:51,795 INFO L225 Difference]: With dead ends: 3692 [2018-11-07 12:57:51,795 INFO L226 Difference]: Without dead ends: 2302 [2018-11-07 12:57:51,800 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 213 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 12:57:51,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2018-11-07 12:57:51,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 2292. [2018-11-07 12:57:51,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2292 states. [2018-11-07 12:57:51,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2292 states to 2292 states and 2851 transitions. [2018-11-07 12:57:51,858 INFO L78 Accepts]: Start accepts. Automaton has 2292 states and 2851 transitions. Word has length 199 [2018-11-07 12:57:51,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:57:51,858 INFO L480 AbstractCegarLoop]: Abstraction has 2292 states and 2851 transitions. [2018-11-07 12:57:51,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 12:57:51,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2292 states and 2851 transitions. [2018-11-07 12:57:51,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-07 12:57:51,866 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:57:51,866 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, 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] [2018-11-07 12:57:51,867 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:57:51,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:57:51,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1370846630, now seen corresponding path program 1 times [2018-11-07 12:57:51,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:57:51,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:51,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:57:51,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:51,868 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:57:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:57:52,097 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 12:57:52,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:57:52,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 12:57:52,098 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:57:52,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 12:57:52,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 12:57:52,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 12:57:52,099 INFO L87 Difference]: Start difference. First operand 2292 states and 2851 transitions. Second operand 4 states. [2018-11-07 12:57:53,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:57:53,108 INFO L93 Difference]: Finished difference Result 5168 states and 6472 transitions. [2018-11-07 12:57:53,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 12:57:53,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 214 [2018-11-07 12:57:53,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:57:53,111 INFO L225 Difference]: With dead ends: 5168 [2018-11-07 12:57:53,111 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 12:57:53,122 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 12:57:53,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 12:57:53,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 12:57:53,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 12:57:53,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 12:57:53,123 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 214 [2018-11-07 12:57:53,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:57:53,123 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 12:57:53,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 12:57:53,123 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 12:57:53,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 12:57:53,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 12:57:53,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:57:53,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:57:53,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:57:53,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:57:53,612 WARN L179 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 17 [2018-11-07 12:57:54,773 WARN L179 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 167 DAG size of output: 92 [2018-11-07 12:57:55,073 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 38 [2018-11-07 12:57:55,076 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:57:55,077 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a28~0)| ~a28~0) (= |old(~a25~0)| ~a25~0)) [2018-11-07 12:57:55,077 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:57:55,077 INFO L425 ceAbstractionStarter]: For program point L564(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,077 INFO L425 ceAbstractionStarter]: For program point L531(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,077 INFO L425 ceAbstractionStarter]: For program point L498(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,077 INFO L425 ceAbstractionStarter]: For program point L465(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,077 INFO L425 ceAbstractionStarter]: For program point L432(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,077 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-07 12:57:55,077 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-07 12:57:55,077 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-07 12:57:55,077 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-07 12:57:55,078 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-07 12:57:55,078 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-07 12:57:55,078 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-07 12:57:55,078 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-07 12:57:55,078 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-07 12:57:55,078 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-07 12:57:55,078 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-07 12:57:55,078 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-07 12:57:55,078 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-07 12:57:55,078 INFO L425 ceAbstractionStarter]: For program point L567(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,079 INFO L425 ceAbstractionStarter]: For program point L534(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,079 INFO L425 ceAbstractionStarter]: For program point L501(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,079 INFO L425 ceAbstractionStarter]: For program point L468(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,079 INFO L425 ceAbstractionStarter]: For program point L435(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,079 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-07 12:57:55,079 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-07 12:57:55,079 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-07 12:57:55,079 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-07 12:57:55,079 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-07 12:57:55,079 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-07 12:57:55,080 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-07 12:57:55,080 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-07 12:57:55,080 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-07 12:57:55,080 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-07 12:57:55,080 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-07 12:57:55,080 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-07 12:57:55,080 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-07 12:57:55,080 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-07 12:57:55,080 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-07 12:57:55,080 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-07 12:57:55,081 INFO L425 ceAbstractionStarter]: For program point L570(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,081 INFO L425 ceAbstractionStarter]: For program point L537(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,081 INFO L425 ceAbstractionStarter]: For program point L504(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,081 INFO L425 ceAbstractionStarter]: For program point L471(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,081 INFO L425 ceAbstractionStarter]: For program point L438(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,081 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-07 12:57:55,081 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-07 12:57:55,081 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-07 12:57:55,081 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-07 12:57:55,081 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-07 12:57:55,082 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-07 12:57:55,082 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-07 12:57:55,082 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-07 12:57:55,082 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-07 12:57:55,082 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-07 12:57:55,082 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-07 12:57:55,082 INFO L425 ceAbstractionStarter]: For program point L573(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,082 INFO L425 ceAbstractionStarter]: For program point L507(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,083 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,083 INFO L425 ceAbstractionStarter]: For program point L474(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,083 INFO L425 ceAbstractionStarter]: For program point L441(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,083 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-07 12:57:55,083 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-07 12:57:55,083 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-07 12:57:55,083 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-07 12:57:55,083 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-07 12:57:55,083 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-07 12:57:55,084 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-07 12:57:55,084 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-07 12:57:55,084 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-07 12:57:55,084 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-07 12:57:55,084 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-07 12:57:55,084 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-07 12:57:55,084 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-07 12:57:55,084 INFO L425 ceAbstractionStarter]: For program point L576(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,084 INFO L425 ceAbstractionStarter]: For program point L543(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,085 INFO L425 ceAbstractionStarter]: For program point L510(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,085 INFO L425 ceAbstractionStarter]: For program point L477(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,085 INFO L425 ceAbstractionStarter]: For program point L444(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,085 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-07 12:57:55,085 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-07 12:57:55,085 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-07 12:57:55,085 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-07 12:57:55,085 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-07 12:57:55,086 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-07 12:57:55,086 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-07 12:57:55,086 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-07 12:57:55,086 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-07 12:57:55,086 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-07 12:57:55,086 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-07 12:57:55,086 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-07 12:57:55,086 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-07 12:57:55,086 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-07 12:57:55,086 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-07 12:57:55,087 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-07 12:57:55,087 INFO L425 ceAbstractionStarter]: For program point L579(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,087 INFO L425 ceAbstractionStarter]: For program point L546(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,087 INFO L425 ceAbstractionStarter]: For program point L513(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,087 INFO L425 ceAbstractionStarter]: For program point L480(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,087 INFO L425 ceAbstractionStarter]: For program point L447(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,087 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-07 12:57:55,087 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-07 12:57:55,087 INFO L425 ceAbstractionStarter]: For program point L414-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,087 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-07 12:57:55,087 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-07 12:57:55,087 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-07 12:57:55,088 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,088 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,088 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-07 12:57:55,088 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-07 12:57:55,088 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-07 12:57:55,088 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-07 12:57:55,088 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-07 12:57:55,088 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-07 12:57:55,088 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-07 12:57:55,089 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-07 12:57:55,089 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-07 12:57:55,089 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-07 12:57:55,089 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-07 12:57:55,089 INFO L425 ceAbstractionStarter]: For program point L582(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,089 INFO L425 ceAbstractionStarter]: For program point L549(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,089 INFO L425 ceAbstractionStarter]: For program point L516(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,089 INFO L425 ceAbstractionStarter]: For program point L483(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,089 INFO L425 ceAbstractionStarter]: For program point L450(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,089 INFO L425 ceAbstractionStarter]: For program point L417(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,089 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-07 12:57:55,089 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-07 12:57:55,090 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-07 12:57:55,090 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-07 12:57:55,090 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-07 12:57:55,090 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-07 12:57:55,090 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-07 12:57:55,090 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-07 12:57:55,090 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-07 12:57:55,090 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-07 12:57:55,090 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-07 12:57:55,090 INFO L425 ceAbstractionStarter]: For program point L585(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,090 INFO L425 ceAbstractionStarter]: For program point L552(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,090 INFO L425 ceAbstractionStarter]: For program point L519(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,090 INFO L425 ceAbstractionStarter]: For program point L486(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,090 INFO L425 ceAbstractionStarter]: For program point L453(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,091 INFO L425 ceAbstractionStarter]: For program point L420(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,091 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-07 12:57:55,091 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-07 12:57:55,091 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-07 12:57:55,091 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-07 12:57:55,091 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-07 12:57:55,091 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-07 12:57:55,091 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-07 12:57:55,091 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-07 12:57:55,091 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-07 12:57:55,091 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-07 12:57:55,091 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-07 12:57:55,091 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-07 12:57:55,091 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-07 12:57:55,092 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 541) no Hoare annotation was computed. [2018-11-07 12:57:55,092 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-07 12:57:55,092 INFO L425 ceAbstractionStarter]: For program point L588(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,092 INFO L425 ceAbstractionStarter]: For program point L555(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,092 INFO L425 ceAbstractionStarter]: For program point L522(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,092 INFO L425 ceAbstractionStarter]: For program point L489(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,093 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse16 (= |old(~a28~0)| ~a28~0)) (.cse12 (= |old(~a25~0)| ~a25~0)) (.cse13 (= 1 |old(~a11~0)|)) (.cse14 (= 1 |old(~a19~0)|)) (.cse15 (= 1 |old(~a25~0)|))) (let ((.cse8 (= 10 |old(~a28~0)|)) (.cse1 (not (= 7 |old(~a28~0)|))) (.cse2 (not .cse15)) (.cse3 (not .cse14)) (.cse10 (not (= 8 |old(~a17~0)|))) (.cse5 (= 1 ~a11~0)) (.cse11 (= 8 ~a17~0)) (.cse6 (= 1 ~a19~0)) (.cse4 (not .cse13)) (.cse7 (and .cse16 .cse12)) (.cse0 (not (= 1 ~a21~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 (= 7 ~a17~0) .cse6) (not (= 7 |old(~a17~0)|))) (or .cse0 .cse7 .cse8) (or (< 6 |calculate_output_#in~input|) (let ((.cse9 (not (= 0 |old(~a11~0)|)))) (and (or .cse0 .cse9 (not (= 0 |old(~a25~0)|))) (or .cse0 (< |old(~a28~0)| 8) .cse9))) (< |old(~a25~0)| 0) (< |old(~a28~0)| 7) .cse3 (< 1 |old(~a25~0)|) (< 11 |old(~a28~0)|) .cse10 (and (= ~a11~0 0) (= ~a17~0 8) (= ~a19~0 1)) (< |calculate_output_#in~input| 1)) (or (and .cse5 .cse11 .cse6 .cse12 (= 10 ~a28~0)) .cse0 (not .cse8) .cse2 .cse3 .cse10 .cse4) (or .cse0 .cse13 (not (= ~a11~0 1))) (or .cse14 .cse0 .cse1 .cse10 (and .cse5 .cse11 (not .cse6)) .cse4 .cse15) (or .cse0 .cse2 .cse3 .cse10 (and .cse5 .cse11 .cse6) (not (= 9 |old(~a28~0)|)) .cse4) (or .cse0 .cse13 .cse7) (or .cse0 (and .cse16 (<= ~a17~0 7) .cse12) (< 7 |old(~a17~0)|))))) [2018-11-07 12:57:55,093 INFO L425 ceAbstractionStarter]: For program point L456(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,093 INFO L425 ceAbstractionStarter]: For program point L423(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,093 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-07 12:57:55,093 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-07 12:57:55,093 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-07 12:57:55,093 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-07 12:57:55,093 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-07 12:57:55,094 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-07 12:57:55,094 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-07 12:57:55,094 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-07 12:57:55,094 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-07 12:57:55,094 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-07 12:57:55,094 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-07 12:57:55,094 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-07 12:57:55,094 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-07 12:57:55,094 INFO L425 ceAbstractionStarter]: For program point L591(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,094 INFO L425 ceAbstractionStarter]: For program point L558(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,094 INFO L425 ceAbstractionStarter]: For program point L525(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,094 INFO L425 ceAbstractionStarter]: For program point L492(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,094 INFO L425 ceAbstractionStarter]: For program point L459(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,095 INFO L425 ceAbstractionStarter]: For program point L426(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,095 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-07 12:57:55,095 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-07 12:57:55,095 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-07 12:57:55,095 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-07 12:57:55,095 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-07 12:57:55,095 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-07 12:57:55,095 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-07 12:57:55,095 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-07 12:57:55,095 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-07 12:57:55,095 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-07 12:57:55,095 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-07 12:57:55,095 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-07 12:57:55,095 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-07 12:57:55,096 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-07 12:57:55,096 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-07 12:57:55,096 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 596) no Hoare annotation was computed. [2018-11-07 12:57:55,096 INFO L425 ceAbstractionStarter]: For program point L561(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,096 INFO L425 ceAbstractionStarter]: For program point L528(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,096 INFO L425 ceAbstractionStarter]: For program point L495(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,096 INFO L425 ceAbstractionStarter]: For program point L462(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,096 INFO L425 ceAbstractionStarter]: For program point L429(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:55,096 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-07 12:57:55,096 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-07 12:57:55,096 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-07 12:57:55,096 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-07 12:57:55,097 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-07 12:57:55,097 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-07 12:57:55,097 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-07 12:57:55,097 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-07 12:57:55,097 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-07 12:57:55,097 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-07 12:57:55,097 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-07 12:57:55,097 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-07 12:57:55,097 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-07 12:57:55,097 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-07 12:57:55,097 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-07 12:57:55,098 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-07 12:57:55,098 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-07 12:57:55,098 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-07 12:57:55,098 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-07 12:57:55,098 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:57:55,098 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 12:57:55,098 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 12:57:55,098 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:57:55,098 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) (= |old(~a25~0)| ~a25~0) (= ~a19~0 1) (= ~a28~0 7)) (not (= 1 |old(~a19~0)|)) (not (= 0 |old(~a11~0)|)) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|))) [2018-11-07 12:57:55,098 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-07 12:57:55,098 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 10 ~a28~0)) (not (= ~a11~0 1)) (not (= 0 |old(~a11~0)|)) (<= ~a17~0 7) (not (= 1 |old(~a19~0)|)) (and (= 1 ~a25~0) (= 8 ~a17~0) (= 1 ~a19~0)) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|))) [2018-11-07 12:57:55,099 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-07 12:57:55,099 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-07 12:57:55,099 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 10 ~a28~0)) (not (= ~a11~0 1)) (not (= 0 |old(~a11~0)|)) (<= ~a17~0 7) (not (= 1 |old(~a19~0)|)) (and (= 1 ~a25~0) (= 8 ~a17~0) (= 1 ~a19~0)) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|))) [2018-11-07 12:57:55,099 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-07 12:57:55,099 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-07 12:57:55,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:57:55 BoogieIcfgContainer [2018-11-07 12:57:55,110 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 12:57:55,111 INFO L168 Benchmark]: Toolchain (without parser) took 51751.74 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.4 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-11-07 12:57:55,113 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 12:57:55,113 INFO L168 Benchmark]: CACSL2BoogieTranslator took 742.29 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 12:57:55,114 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 12:57:55,115 INFO L168 Benchmark]: Boogie Preprocessor took 264.99 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 770.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -841.9 MB). Peak memory consumption was 18.2 MB. Max. memory is 7.1 GB. [2018-11-07 12:57:55,116 INFO L168 Benchmark]: RCFGBuilder took 3321.96 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: 108.9 MB). Peak memory consumption was 108.9 MB. Max. memory is 7.1 GB. [2018-11-07 12:57:55,116 INFO L168 Benchmark]: TraceAbstraction took 47360.67 ms. Allocated memory was 2.3 GB in the beginning and 2.9 GB in the end (delta: 622.3 MB). Free memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: -454.9 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-11-07 12:57:55,121 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 742.29 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 56.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 264.99 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 770.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -841.9 MB). Peak memory consumption was 18.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3321.96 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: 108.9 MB). Peak memory consumption was 108.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 47360.67 ms. Allocated memory was 2.3 GB in the beginning and 2.9 GB in the end (delta: 622.3 MB). Free memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: -454.9 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 541]: 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))) || !(10 == a28)) || !(a11 == 1)) || !(0 == \old(a11))) || a17 <= 7) || !(1 == \old(a19))) || ((1 == a25 && 8 == a17) && 1 == a19)) || !(8 == \old(a17))) || !(0 == \old(a25)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 47.2s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 33.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1390 SDtfs, 5206 SDslu, 1054 SDs, 0 SdLazy, 7712 SolverSat, 1468 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.7s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 618 GetRequests, 541 SyntacticMatches, 9 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2292occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.7s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9978905121061985 AbsIntWeakeningRatio, 0.18181818181818182 AbsIntAvgWeakeningVarsNumRemoved, 24.494949494949495 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 52 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 85 PreInvPairs, 145 NumberOfFragments, 437 HoareAnnotationTreeSize, 85 FomulaSimplifications, 3543 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 2570 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1787 NumberOfCodeBlocks, 1787 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1942 ConstructedInterpolants, 0 QuantifiedInterpolants, 1674018 SizeOfPredicates, 2 NumberOfNonLiveVariables, 424 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 393/414 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...