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_label53_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 12:56:49,760 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 12:56:49,763 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 12:56:49,777 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 12:56:49,777 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 12:56:49,778 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 12:56:49,780 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 12:56:49,781 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 12:56:49,783 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 12:56:49,784 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 12:56:49,785 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 12:56:49,785 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 12:56:49,786 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 12:56:49,787 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 12:56:49,788 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 12:56:49,789 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 12:56:49,790 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 12:56:49,792 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 12:56:49,794 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 12:56:49,795 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 12:56:49,796 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 12:56:49,798 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 12:56:49,800 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 12:56:49,800 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 12:56:49,800 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 12:56:49,801 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 12:56:49,802 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 12:56:49,803 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 12:56:49,804 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 12:56:49,805 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 12:56:49,805 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 12:56:49,806 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 12:56:49,806 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 12:56:49,806 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 12:56:49,807 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 12:56:49,807 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 12:56:49,808 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:56:49,825 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 12:56:49,825 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 12:56:49,826 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 12:56:49,826 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 12:56:49,826 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 12:56:49,827 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 12:56:49,827 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 12:56:49,828 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 12:56:49,828 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 12:56:49,828 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 12:56:49,828 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 12:56:49,829 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 12:56:49,829 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 12:56:49,831 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 12:56:49,831 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 12:56:49,831 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 12:56:49,831 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 12:56:49,832 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 12:56:49,832 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 12:56:49,832 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 12:56:49,832 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 12:56:49,832 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 12:56:49,834 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 12:56:49,834 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 12:56:49,834 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:56:49,834 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 12:56:49,834 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 12:56:49,835 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 12:56:49,835 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 12:56:49,835 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 12:56:49,835 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 12:56:49,835 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 12:56:49,836 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 12:56:49,836 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 12:56:49,895 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 12:56:49,911 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 12:56:49,915 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 12:56:49,917 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 12:56:49,917 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 12:56:49,918 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label53_true-unreach-call_false-termination.c [2018-11-07 12:56:49,980 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14d6ae136/3b7e02fec24f425b92d09d82b31a1f4f/FLAG0dd3a6797 [2018-11-07 12:56:50,587 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 12:56:50,588 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label53_true-unreach-call_false-termination.c [2018-11-07 12:56:50,600 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14d6ae136/3b7e02fec24f425b92d09d82b31a1f4f/FLAG0dd3a6797 [2018-11-07 12:56:50,614 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14d6ae136/3b7e02fec24f425b92d09d82b31a1f4f [2018-11-07 12:56:50,625 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 12:56:50,627 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 12:56:50,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 12:56:50,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 12:56:50,632 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 12:56:50,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:56:50" (1/1) ... [2018-11-07 12:56:50,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41fd93e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:50, skipping insertion in model container [2018-11-07 12:56:50,636 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:56:50" (1/1) ... [2018-11-07 12:56:50,646 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 12:56:50,701 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 12:56:51,145 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:56:51,153 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 12:56:51,269 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:56:51,298 INFO L193 MainTranslator]: Completed translation [2018-11-07 12:56:51,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:51 WrapperNode [2018-11-07 12:56:51,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 12:56:51,299 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 12:56:51,300 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 12:56:51,300 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 12:56:51,308 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:56:51" (1/1) ... [2018-11-07 12:56:51,326 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:56:51" (1/1) ... [2018-11-07 12:56:51,421 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 12:56:51,421 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 12:56:51,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 12:56:51,422 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 12:56:51,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:51" (1/1) ... [2018-11-07 12:56:51,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:51" (1/1) ... [2018-11-07 12:56:51,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:51" (1/1) ... [2018-11-07 12:56:51,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:51" (1/1) ... [2018-11-07 12:56:51,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:51" (1/1) ... [2018-11-07 12:56:51,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:51" (1/1) ... [2018-11-07 12:56:51,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:51" (1/1) ... [2018-11-07 12:56:51,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 12:56:51,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 12:56:51,535 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 12:56:51,535 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 12:56:51,536 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:51" (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:56:51,613 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 12:56:51,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 12:56:51,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 12:56:51,613 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 12:56:51,614 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 12:56:51,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 12:56:51,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 12:56:51,614 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 12:56:51,614 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 12:56:54,807 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 12:56:54,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:56:54 BoogieIcfgContainer [2018-11-07 12:56:54,808 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 12:56:54,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 12:56:54,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 12:56:54,816 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 12:56:54,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:56:50" (1/3) ... [2018-11-07 12:56:54,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63211ee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:56:54, skipping insertion in model container [2018-11-07 12:56:54,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:51" (2/3) ... [2018-11-07 12:56:54,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63211ee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:56:54, skipping insertion in model container [2018-11-07 12:56:54,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:56:54" (3/3) ... [2018-11-07 12:56:54,822 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label53_true-unreach-call_false-termination.c [2018-11-07 12:56:54,832 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 12:56:54,843 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 12:56:54,858 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 12:56:54,897 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 12:56:54,897 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 12:56:54,897 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 12:56:54,898 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 12:56:54,898 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 12:56:54,898 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 12:56:54,898 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 12:56:54,899 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 12:56:54,927 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-07 12:56:54,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-07 12:56:54,945 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:56:54,946 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:56:54,949 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:56:54,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:56:54,956 INFO L82 PathProgramCache]: Analyzing trace with hash 151697799, now seen corresponding path program 1 times [2018-11-07 12:56:54,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:56:55,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:56:55,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:56:55,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:56:55,010 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:56:55,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:56:55,600 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:56:55,683 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:56:55,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:56:55,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 12:56:55,687 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:56:55,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:56:55,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:56:55,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:56:55,713 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-07 12:56:57,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:56:57,434 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-11-07 12:56:57,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:56:57,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2018-11-07 12:56:57,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:56:57,455 INFO L225 Difference]: With dead ends: 621 [2018-11-07 12:56:57,456 INFO L226 Difference]: Without dead ends: 382 [2018-11-07 12:56:57,463 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:56:57,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-07 12:56:57,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-11-07 12:56:57,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-07 12:56:57,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-11-07 12:56:57,544 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 145 [2018-11-07 12:56:57,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:56:57,545 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-11-07 12:56:57,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:56:57,545 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-11-07 12:56:57,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-07 12:56:57,552 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:56:57,553 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:56:57,553 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:56:57,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:56:57,554 INFO L82 PathProgramCache]: Analyzing trace with hash 627656218, now seen corresponding path program 1 times [2018-11-07 12:56:57,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:56:57,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:56:57,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:56:57,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:56:57,556 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:56:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:56:57,998 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:56:57,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:56:57,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 12:56:57,999 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:56:58,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 12:56:58,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 12:56:58,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:56:58,002 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-11-07 12:56:59,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:56:59,670 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-11-07 12:56:59,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 12:56:59,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2018-11-07 12:56:59,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:56:59,677 INFO L225 Difference]: With dead ends: 903 [2018-11-07 12:56:59,677 INFO L226 Difference]: Without dead ends: 381 [2018-11-07 12:56:59,684 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:56:59,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-11-07 12:56:59,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-11-07 12:56:59,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-11-07 12:56:59,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-11-07 12:56:59,715 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 154 [2018-11-07 12:56:59,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:56:59,716 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-11-07 12:56:59,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 12:56:59,716 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-11-07 12:56:59,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-07 12:56:59,719 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:56:59,720 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:56:59,720 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:56:59,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:56:59,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1014173274, now seen corresponding path program 1 times [2018-11-07 12:56:59,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:56:59,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:56:59,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:56:59,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:56:59,723 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:56:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:57:00,255 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:00,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:57:00,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 12:57:00,256 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:57:00,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 12:57:00,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 12:57:00,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:57:00,258 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-11-07 12:57:01,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:57:01,849 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-11-07 12:57:01,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 12:57:01,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2018-11-07 12:57:01,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:57:01,857 INFO L225 Difference]: With dead ends: 901 [2018-11-07 12:57:01,857 INFO L226 Difference]: Without dead ends: 380 [2018-11-07 12:57:01,862 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:01,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-11-07 12:57:01,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-11-07 12:57:01,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-07 12:57:01,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-11-07 12:57:01,904 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 160 [2018-11-07 12:57:01,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:57:01,904 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-11-07 12:57:01,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 12:57:01,906 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-11-07 12:57:01,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-07 12:57:01,909 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:57:01,910 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:57:01,910 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:57:01,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:57:01,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1544846205, now seen corresponding path program 1 times [2018-11-07 12:57:01,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:57:01,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:01,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:57:01,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:01,912 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:57:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:57:02,086 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:02,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:57:02,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 12:57:02,087 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:57:02,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 12:57:02,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 12:57:02,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 12:57:02,088 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-11-07 12:57:05,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:57:05,164 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-11-07 12:57:05,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 12:57:05,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 168 [2018-11-07 12:57:05,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:57:05,170 INFO L225 Difference]: With dead ends: 1193 [2018-11-07 12:57:05,170 INFO L226 Difference]: Without dead ends: 819 [2018-11-07 12:57:05,172 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:05,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-11-07 12:57:05,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-11-07 12:57:05,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-11-07 12:57:05,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-11-07 12:57:05,205 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 168 [2018-11-07 12:57:05,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:57:05,205 INFO L480 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-11-07 12:57:05,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 12:57:05,205 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-11-07 12:57:05,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-07 12:57:05,209 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:57:05,210 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:57:05,210 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:57:05,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:57:05,211 INFO L82 PathProgramCache]: Analyzing trace with hash -869251583, now seen corresponding path program 1 times [2018-11-07 12:57:05,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:57:05,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:05,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:57:05,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:05,212 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:57:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:57:05,490 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:05,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:57:05,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 12:57:05,491 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:57:05,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 12:57:05,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 12:57:05,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:57:05,493 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-11-07 12:57:06,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:57:06,485 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-11-07 12:57:06,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 12:57:06,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 170 [2018-11-07 12:57:06,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:57:06,500 INFO L225 Difference]: With dead ends: 1753 [2018-11-07 12:57:06,500 INFO L226 Difference]: Without dead ends: 804 [2018-11-07 12:57:06,503 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:06,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-11-07 12:57:06,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-11-07 12:57:06,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-11-07 12:57:06,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-11-07 12:57:06,541 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 170 [2018-11-07 12:57:06,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:57:06,542 INFO L480 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-11-07 12:57:06,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 12:57:06,542 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-11-07 12:57:06,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-07 12:57:06,546 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:57:06,546 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:57:06,547 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:57:06,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:57:06,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1524482181, now seen corresponding path program 1 times [2018-11-07 12:57:06,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:57:06,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:06,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:57:06,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:06,549 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:57:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:57:06,893 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:06,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:57:06,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 12:57:06,894 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:57:06,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 12:57:06,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 12:57:06,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:57:06,895 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-11-07 12:57:07,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:57:07,838 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-11-07 12:57:07,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 12:57:07,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2018-11-07 12:57:07,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:57:07,852 INFO L225 Difference]: With dead ends: 1747 [2018-11-07 12:57:07,852 INFO L226 Difference]: Without dead ends: 801 [2018-11-07 12:57:07,856 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:07,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-11-07 12:57:07,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-11-07 12:57:07,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-11-07 12:57:07,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-11-07 12:57:07,884 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 172 [2018-11-07 12:57:07,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:57:07,885 INFO L480 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-11-07 12:57:07,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 12:57:07,885 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-11-07 12:57:07,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-07 12:57:07,889 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:57:07,889 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:57:07,890 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:57:07,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:57:07,890 INFO L82 PathProgramCache]: Analyzing trace with hash 406701453, now seen corresponding path program 1 times [2018-11-07 12:57:07,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:57:07,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:07,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:57:07,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:07,891 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:57:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:57:08,124 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:57:08,513 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:08,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:57:08,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 12:57:08,514 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:57:08,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 12:57:08,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 12:57:08,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 12:57:08,516 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-11-07 12:57:11,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:57:11,210 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-11-07 12:57:11,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 12:57:11,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2018-11-07 12:57:11,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:57:11,220 INFO L225 Difference]: With dead ends: 2381 [2018-11-07 12:57:11,220 INFO L226 Difference]: Without dead ends: 1586 [2018-11-07 12:57:11,224 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 12:57:11,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-11-07 12:57:11,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-11-07 12:57:11,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-11-07 12:57:11,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-11-07 12:57:11,270 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 176 [2018-11-07 12:57:11,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:57:11,270 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-11-07 12:57:11,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 12:57:11,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-11-07 12:57:11,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-07 12:57:11,279 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:57:11,280 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,280 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:57:11,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:57:11,280 INFO L82 PathProgramCache]: Analyzing trace with hash 337466047, now seen corresponding path program 1 times [2018-11-07 12:57:11,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:57:11,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:11,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:57:11,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:11,282 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:57:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:57:11,458 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:57:11,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:57:11,459 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:57:11,460 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-11-07 12:57:11,462 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [831], [833], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:57:11,514 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:57:11,514 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:57:12,852 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:57:12,853 INFO L272 AbstractInterpreter]: Visited 149 different actions 294 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-07 12:57:12,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:57:12,898 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:57:13,908 INFO L227 lantSequenceWeakener]: Weakened 122 states. On average, predicates are now at 81.53% of their original sizes. [2018-11-07 12:57:13,909 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:57:15,716 INFO L415 sIntCurrentIteration]: We unified 210 AI predicates to 210 [2018-11-07 12:57:15,716 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:57:15,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:57:15,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-07 12:57:15,718 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:57:15,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 12:57:15,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 12:57:15,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-07 12:57:15,720 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 18 states. [2018-11-07 12:57:34,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:57:34,551 INFO L93 Difference]: Finished difference Result 3716 states and 5313 transitions. [2018-11-07 12:57:34,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 12:57:34,551 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 211 [2018-11-07 12:57:34,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:57:34,561 INFO L225 Difference]: With dead ends: 3716 [2018-11-07 12:57:34,562 INFO L226 Difference]: Without dead ends: 2164 [2018-11-07 12:57:34,567 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 224 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=182, Invalid=810, Unknown=0, NotChecked=0, Total=992 [2018-11-07 12:57:34,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2018-11-07 12:57:34,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 2152. [2018-11-07 12:57:34,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2152 states. [2018-11-07 12:57:34,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 2889 transitions. [2018-11-07 12:57:34,622 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 2889 transitions. Word has length 211 [2018-11-07 12:57:34,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:57:34,622 INFO L480 AbstractCegarLoop]: Abstraction has 2152 states and 2889 transitions. [2018-11-07 12:57:34,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 12:57:34,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 2889 transitions. [2018-11-07 12:57:34,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-07 12:57:34,633 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:57:34,633 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,633 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:57:34,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:57:34,634 INFO L82 PathProgramCache]: Analyzing trace with hash -345437012, now seen corresponding path program 1 times [2018-11-07 12:57:34,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:57:34,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:34,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:57:34,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:34,635 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:57:34,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:57:34,908 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 85 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:57:34,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:57:34,909 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:57:34,909 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 217 with the following transitions: [2018-11-07 12:57:34,910 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [119], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [831], [833], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:57:34,916 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:57:34,917 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:57:35,623 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:57:35,624 INFO L272 AbstractInterpreter]: Visited 151 different actions 450 times. Merged at 7 different actions 21 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-07 12:57:35,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:57:35,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:57:35,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:57:35,631 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:35,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:57:35,642 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:57:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:57:35,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:57:36,308 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 12:57:36,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:57:36,580 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-07 12:57:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 12:57:37,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:57:37,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2018-11-07 12:57:37,205 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:57:37,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 12:57:37,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 12:57:37,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-11-07 12:57:37,206 INFO L87 Difference]: Start difference. First operand 2152 states and 2889 transitions. Second operand 14 states. [2018-11-07 12:57:41,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:57:41,862 INFO L93 Difference]: Finished difference Result 6995 states and 9849 transitions. [2018-11-07 12:57:41,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 12:57:41,864 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 216 [2018-11-07 12:57:41,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:57:41,864 INFO L225 Difference]: With dead ends: 6995 [2018-11-07 12:57:41,864 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 12:57:41,883 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 444 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 12:57:41,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 12:57:41,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 12:57:41,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 12:57:41,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 12:57:41,885 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 216 [2018-11-07 12:57:41,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:57:41,885 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 12:57:41,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 12:57:41,885 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 12:57:41,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 12:57:41,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 12:57:42,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:57:42,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:57:42,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:57:42,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:57:42,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:57:42,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:57:42,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:57:42,240 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2018-11-07 12:57:43,583 WARN L179 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 180 DAG size of output: 93 [2018-11-07 12:57:43,780 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 47 [2018-11-07 12:57:44,015 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 47 [2018-11-07 12:57:44,018 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:57:44,018 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a17~0)| ~a17~0) (= |old(~a25~0)| ~a25~0) (= ~a28~0 |old(~a28~0)|)) [2018-11-07 12:57:44,018 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:57:44,019 INFO L425 ceAbstractionStarter]: For program point L564(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,019 INFO L425 ceAbstractionStarter]: For program point L531(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,019 INFO L425 ceAbstractionStarter]: For program point L498(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,019 INFO L425 ceAbstractionStarter]: For program point L465(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,019 INFO L425 ceAbstractionStarter]: For program point L432(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,019 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-07 12:57:44,019 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-07 12:57:44,019 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-07 12:57:44,020 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-07 12:57:44,020 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-07 12:57:44,020 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-07 12:57:44,020 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-07 12:57:44,020 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-07 12:57:44,020 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-07 12:57:44,020 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-07 12:57:44,020 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-07 12:57:44,020 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-07 12:57:44,021 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-07 12:57:44,021 INFO L425 ceAbstractionStarter]: For program point L567(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,021 INFO L425 ceAbstractionStarter]: For program point L534(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,021 INFO L425 ceAbstractionStarter]: For program point L501(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,021 INFO L425 ceAbstractionStarter]: For program point L468(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,021 INFO L425 ceAbstractionStarter]: For program point L435(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,021 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-07 12:57:44,021 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-07 12:57:44,021 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-07 12:57:44,021 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-07 12:57:44,021 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-07 12:57:44,021 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-07 12:57:44,022 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-07 12:57:44,022 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-07 12:57:44,022 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-07 12:57:44,022 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-07 12:57:44,022 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-07 12:57:44,022 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-07 12:57:44,022 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-07 12:57:44,022 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-07 12:57:44,022 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-07 12:57:44,022 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-07 12:57:44,022 INFO L425 ceAbstractionStarter]: For program point L570(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,022 INFO L425 ceAbstractionStarter]: For program point L537(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,022 INFO L425 ceAbstractionStarter]: For program point L504(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,023 INFO L425 ceAbstractionStarter]: For program point L471(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,023 INFO L425 ceAbstractionStarter]: For program point L438(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,023 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-07 12:57:44,023 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-07 12:57:44,023 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-07 12:57:44,023 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-07 12:57:44,023 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-07 12:57:44,023 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-07 12:57:44,024 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-07 12:57:44,024 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-07 12:57:44,024 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-07 12:57:44,024 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-07 12:57:44,024 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-07 12:57:44,024 INFO L425 ceAbstractionStarter]: For program point L573(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,024 INFO L425 ceAbstractionStarter]: For program point L540(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,024 INFO L425 ceAbstractionStarter]: For program point L507(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,024 INFO L425 ceAbstractionStarter]: For program point L474(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,025 INFO L425 ceAbstractionStarter]: For program point L441(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,025 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-07 12:57:44,025 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-07 12:57:44,025 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-07 12:57:44,025 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-07 12:57:44,025 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-07 12:57:44,025 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-07 12:57:44,025 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-07 12:57:44,025 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-07 12:57:44,026 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-07 12:57:44,026 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-07 12:57:44,026 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-07 12:57:44,026 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-07 12:57:44,026 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-07 12:57:44,026 INFO L425 ceAbstractionStarter]: For program point L576(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,026 INFO L425 ceAbstractionStarter]: For program point L543(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,026 INFO L425 ceAbstractionStarter]: For program point L510(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,026 INFO L425 ceAbstractionStarter]: For program point L477(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,026 INFO L425 ceAbstractionStarter]: For program point L444(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,026 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-07 12:57:44,027 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-07 12:57:44,027 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-07 12:57:44,027 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-07 12:57:44,027 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-07 12:57:44,027 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-07 12:57:44,027 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-07 12:57:44,027 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-07 12:57:44,027 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-07 12:57:44,027 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-07 12:57:44,027 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-07 12:57:44,027 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-07 12:57:44,028 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-07 12:57:44,028 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-07 12:57:44,028 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-07 12:57:44,028 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-07 12:57:44,028 INFO L425 ceAbstractionStarter]: For program point L579(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,028 INFO L425 ceAbstractionStarter]: For program point L546(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,028 INFO L425 ceAbstractionStarter]: For program point L513(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,028 INFO L425 ceAbstractionStarter]: For program point L480(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,028 INFO L425 ceAbstractionStarter]: For program point L447(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,028 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-07 12:57:44,028 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-07 12:57:44,028 INFO L425 ceAbstractionStarter]: For program point L414-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,028 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-07 12:57:44,029 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-07 12:57:44,029 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-07 12:57:44,029 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,029 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 586) no Hoare annotation was computed. [2018-11-07 12:57:44,029 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,029 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-07 12:57:44,029 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-07 12:57:44,030 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-07 12:57:44,030 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-07 12:57:44,030 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-07 12:57:44,030 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-07 12:57:44,030 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-07 12:57:44,030 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-07 12:57:44,030 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-07 12:57:44,030 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-07 12:57:44,031 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-07 12:57:44,031 INFO L425 ceAbstractionStarter]: For program point L582(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,031 INFO L425 ceAbstractionStarter]: For program point L549(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,031 INFO L425 ceAbstractionStarter]: For program point L516(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,031 INFO L425 ceAbstractionStarter]: For program point L483(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,031 INFO L425 ceAbstractionStarter]: For program point L450(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,031 INFO L425 ceAbstractionStarter]: For program point L417(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,031 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-07 12:57:44,032 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-07 12:57:44,032 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-07 12:57:44,032 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-07 12:57:44,032 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-07 12:57:44,032 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-07 12:57:44,032 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-07 12:57:44,032 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-07 12:57:44,032 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-07 12:57:44,032 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-07 12:57:44,033 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-07 12:57:44,033 INFO L425 ceAbstractionStarter]: For program point L552(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,033 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,033 INFO L425 ceAbstractionStarter]: For program point L519(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,033 INFO L425 ceAbstractionStarter]: For program point L486(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,033 INFO L425 ceAbstractionStarter]: For program point L453(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,033 INFO L425 ceAbstractionStarter]: For program point L420(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,033 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-07 12:57:44,033 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-07 12:57:44,034 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-07 12:57:44,034 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-07 12:57:44,034 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-07 12:57:44,034 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-07 12:57:44,034 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-07 12:57:44,034 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-07 12:57:44,034 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-07 12:57:44,034 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-07 12:57:44,034 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-07 12:57:44,035 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-07 12:57:44,035 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-07 12:57:44,035 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-07 12:57:44,035 INFO L425 ceAbstractionStarter]: For program point L588(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,035 INFO L425 ceAbstractionStarter]: For program point L555(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,035 INFO L425 ceAbstractionStarter]: For program point L522(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,035 INFO L425 ceAbstractionStarter]: For program point L489(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,036 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse19 (= |old(~a17~0)| ~a17~0)) (.cse20 (= |old(~a25~0)| ~a25~0)) (.cse21 (= ~a28~0 |old(~a28~0)|)) (.cse8 (= 1 |old(~a11~0)|)) (.cse16 (= 1 |old(~a19~0)|)) (.cse17 (= 1 |old(~a25~0)|)) (.cse13 (= 1 ~a11~0)) (.cse14 (= 1 ~a19~0))) (let ((.cse0 (and .cse13 .cse14)) (.cse2 (not .cse17)) (.cse3 (not .cse16)) (.cse12 (not (= 7 |old(~a28~0)|))) (.cse4 (not (= 8 |old(~a17~0)|))) (.cse5 (not .cse8)) (.cse15 (= 9 |old(~a28~0)|)) (.cse10 (not (= ~a11~0 1))) (.cse7 (not (= |old(~a17~0)| 8))) (.cse18 (and .cse19 .cse20 .cse21)) (.cse1 (not (= 1 ~a21~0))) (.cse9 (= 8 |old(~a28~0)|)) (.cse11 (< 7 |old(~a17~0)|))) (and (or .cse0 .cse1 (not (= 10 |old(~a28~0)|)) .cse2 .cse3 .cse4 .cse5) (or (< 6 |calculate_output_#in~input|) (and (= ~a11~0 0) (= ~a19~0 1)) (let ((.cse6 (not (= 0 |old(~a11~0)|)))) (and (or .cse1 (< |old(~a28~0)| 8) .cse6) (or .cse1 .cse6 (not (= 0 |old(~a25~0)|))))) (< |old(~a25~0)| 0) (< |old(~a28~0)| 7) (< 9 |old(~a28~0)|) .cse3 (< 1 |old(~a25~0)|) .cse7 (< |calculate_output_#in~input| 1)) (or .cse1 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse12 .cse2 .cse3 .cse5 .cse0 (not (= 7 |old(~a17~0)|))) (or .cse1 .cse2 .cse3 .cse4 (and .cse13 (= 1 ~a25~0) (= 9 ~a28~0) (= 8 ~a17~0) .cse14) (not .cse15) .cse5) (or .cse16 .cse1 .cse12 .cse4 (and .cse13 (not .cse14)) .cse5 .cse17) (or .cse1 .cse9 .cse18 .cse15 .cse7) (or .cse1 .cse8 (and .cse19 .cse20 .cse21 .cse10) .cse7) (or .cse1 .cse9 .cse18 .cse7 .cse17) (or .cse18 .cse1 .cse9 .cse11)))) [2018-11-07 12:57:44,036 INFO L425 ceAbstractionStarter]: For program point L456(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,036 INFO L425 ceAbstractionStarter]: For program point L423(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,036 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-07 12:57:44,036 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-07 12:57:44,036 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-07 12:57:44,036 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-07 12:57:44,036 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-07 12:57:44,037 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-07 12:57:44,037 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-07 12:57:44,037 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-07 12:57:44,037 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-07 12:57:44,037 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-07 12:57:44,037 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-07 12:57:44,037 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-07 12:57:44,037 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-07 12:57:44,037 INFO L425 ceAbstractionStarter]: For program point L591(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,037 INFO L425 ceAbstractionStarter]: For program point L558(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,038 INFO L425 ceAbstractionStarter]: For program point L525(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,038 INFO L425 ceAbstractionStarter]: For program point L492(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,038 INFO L425 ceAbstractionStarter]: For program point L459(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,038 INFO L425 ceAbstractionStarter]: For program point L426(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,038 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-07 12:57:44,038 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-07 12:57:44,038 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-07 12:57:44,038 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-07 12:57:44,038 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-07 12:57:44,039 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-07 12:57:44,039 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-07 12:57:44,039 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-07 12:57:44,039 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-07 12:57:44,039 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-07 12:57:44,039 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-07 12:57:44,039 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-07 12:57:44,039 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-07 12:57:44,039 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-07 12:57:44,040 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-07 12:57:44,040 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 596) no Hoare annotation was computed. [2018-11-07 12:57:44,040 INFO L425 ceAbstractionStarter]: For program point L561(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,040 INFO L425 ceAbstractionStarter]: For program point L528(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,040 INFO L425 ceAbstractionStarter]: For program point L495(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,040 INFO L425 ceAbstractionStarter]: For program point L462(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,040 INFO L425 ceAbstractionStarter]: For program point L429(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:44,040 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-07 12:57:44,040 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-07 12:57:44,040 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-07 12:57:44,041 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-07 12:57:44,041 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-07 12:57:44,041 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-07 12:57:44,041 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-07 12:57:44,041 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-07 12:57:44,041 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-07 12:57:44,041 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-07 12:57:44,041 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-07 12:57:44,041 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-07 12:57:44,042 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-07 12:57:44,042 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-07 12:57:44,042 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-07 12:57:44,042 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-07 12:57:44,042 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-07 12:57:44,042 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-07 12:57:44,042 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-07 12:57:44,042 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:57:44,042 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:44,043 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 12:57:44,043 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:57:44,043 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 1 |old(~a19~0)|)) (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|))) [2018-11-07 12:57:44,043 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-07 12:57:44,043 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse1 (= |old(~a17~0)| ~a17~0)) (.cse0 (not (= ~a28~0 8)))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (and (<= ~a17~0 7) .cse0) (not (= 0 |old(~a11~0)|)) (and (= 9 ~a28~0) (= 8 ~a17~0) (= 1 ~a19~0)) (not (= 0 |old(~a25~0)|)) (and .cse1 (not (= ~a11~0 1))) (and .cse1 .cse0 (not (= ~a28~0 9))) (not (= 1 |old(~a19~0)|)) (and (not (= ~a25~0 1)) .cse1 .cse0) (not (= 8 |old(~a17~0)|)))) [2018-11-07 12:57:44,043 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-07 12:57:44,043 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-07 12:57:44,044 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse1 (= |old(~a17~0)| ~a17~0)) (.cse0 (not (= ~a28~0 8)))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (and (<= ~a17~0 7) .cse0) (not (= 0 |old(~a11~0)|)) (and (= 9 ~a28~0) (= 8 ~a17~0) (= 1 ~a19~0)) (not (= 0 |old(~a25~0)|)) (and .cse1 (not (= ~a11~0 1))) (and .cse1 .cse0 (not (= ~a28~0 9))) (not (= 1 |old(~a19~0)|)) (and (not (= ~a25~0 1)) .cse1 .cse0) (not (= 8 |old(~a17~0)|)))) [2018-11-07 12:57:44,044 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-07 12:57:44,044 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-07 12:57:44,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:57:44 BoogieIcfgContainer [2018-11-07 12:57:44,055 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 12:57:44,056 INFO L168 Benchmark]: Toolchain (without parser) took 53430.63 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -893.4 MB). Peak memory consumption was 608.2 MB. Max. memory is 7.1 GB. [2018-11-07 12:57:44,057 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 12:57:44,058 INFO L168 Benchmark]: CACSL2BoogieTranslator took 671.35 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:44,058 INFO L168 Benchmark]: Boogie Procedure Inliner took 121.85 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -817.9 MB). Peak memory consumption was 18.5 MB. Max. memory is 7.1 GB. [2018-11-07 12:57:44,059 INFO L168 Benchmark]: Boogie Preprocessor took 112.84 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 12:57:44,060 INFO L168 Benchmark]: RCFGBuilder took 3273.24 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: 105.0 MB). Peak memory consumption was 105.0 MB. Max. memory is 7.1 GB. [2018-11-07 12:57:44,061 INFO L168 Benchmark]: TraceAbstraction took 49242.41 ms. Allocated memory was 2.3 GB in the beginning and 3.0 GB in the end (delta: 760.2 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -212.2 MB). Peak memory consumption was 548.0 MB. Max. memory is 7.1 GB. [2018-11-07 12:57:44,066 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 671.35 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 121.85 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -817.9 MB). Peak memory consumption was 18.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 112.84 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3273.24 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: 105.0 MB). Peak memory consumption was 105.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 49242.41 ms. Allocated memory was 2.3 GB in the beginning and 3.0 GB in the end (delta: 760.2 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -212.2 MB). Peak memory consumption was 548.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 586]: 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))) || (a17 <= 7 && !(a28 == 8))) || !(0 == \old(a11))) || ((9 == a28 && 8 == a17) && 1 == a19)) || !(0 == \old(a25))) || (\old(a17) == a17 && !(a11 == 1))) || ((\old(a17) == a17 && !(a28 == 8)) && !(a28 == 9))) || !(1 == \old(a19))) || ((!(a25 == 1) && \old(a17) == a17) && !(a28 == 8))) || !(8 == \old(a17)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 49.1s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 36.3s AutomataDifference, 0.0s DeadEndRemovalTime, 2.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1171 SDtfs, 8044 SDslu, 1505 SDs, 0 SdLazy, 9740 SolverSat, 1927 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.2s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 757 GetRequests, 660 SyntacticMatches, 8 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2152occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.1s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9978787791392834 AbsIntWeakeningRatio, 0.15714285714285714 AbsIntAvgWeakeningVarsNumRemoved, 22.933333333333334 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 52 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 78 PreInvPairs, 144 NumberOfFragments, 542 HoareAnnotationTreeSize, 78 FomulaSimplifications, 2524 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 2700 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1788 NumberOfCodeBlocks, 1788 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1993 ConstructedInterpolants, 0 QuantifiedInterpolants, 1678726 SizeOfPredicates, 0 NumberOfNonLiveVariables, 525 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 508/542 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...