java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label23_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 17:13:21,877 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 17:13:21,879 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 17:13:21,892 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 17:13:21,892 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 17:13:21,893 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 17:13:21,895 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 17:13:21,898 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 17:13:21,899 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 17:13:21,901 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 17:13:21,902 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 17:13:21,902 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 17:13:21,905 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 17:13:21,906 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 17:13:21,907 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 17:13:21,908 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 17:13:21,909 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 17:13:21,911 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 17:13:21,913 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 17:13:21,914 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 17:13:21,915 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 17:13:21,916 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 17:13:21,919 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 17:13:21,919 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 17:13:21,919 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 17:13:21,920 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 17:13:21,921 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 17:13:21,922 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 17:13:21,923 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 17:13:21,924 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 17:13:21,924 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 17:13:21,925 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 17:13:21,925 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 17:13:21,925 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 17:13:21,926 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 17:13:21,927 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 17:13:21,927 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 17:13:21,943 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 17:13:21,943 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 17:13:21,944 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 17:13:21,944 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 17:13:21,945 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 17:13:21,945 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 17:13:21,945 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 17:13:21,945 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 17:13:21,945 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 17:13:21,946 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 17:13:21,946 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 17:13:21,946 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 17:13:21,946 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 17:13:21,947 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 17:13:21,947 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 17:13:21,948 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 17:13:21,948 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 17:13:21,948 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 17:13:21,948 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 17:13:21,948 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 17:13:21,949 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 17:13:21,949 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 17:13:21,949 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 17:13:21,949 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 17:13:21,950 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 17:13:21,950 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:13:21,950 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 17:13:21,950 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 17:13:21,950 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 17:13:21,951 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 17:13:21,951 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 17:13:21,951 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 17:13:21,951 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 17:13:21,951 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 17:13:21,952 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 17:13:22,027 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 17:13:22,046 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 17:13:22,051 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 17:13:22,053 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 17:13:22,053 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 17:13:22,054 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label23_true-unreach-call_false-termination.c [2018-11-12 17:13:22,126 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04eb14d8b/bde5d3a7b525484da6ce726b0188c262/FLAGf4f7d1c6f [2018-11-12 17:13:22,720 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 17:13:22,721 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label23_true-unreach-call_false-termination.c [2018-11-12 17:13:22,735 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04eb14d8b/bde5d3a7b525484da6ce726b0188c262/FLAGf4f7d1c6f [2018-11-12 17:13:22,763 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04eb14d8b/bde5d3a7b525484da6ce726b0188c262 [2018-11-12 17:13:22,776 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 17:13:22,778 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 17:13:22,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 17:13:22,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 17:13:22,784 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 17:13:22,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:13:22" (1/1) ... [2018-11-12 17:13:22,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37adae32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:22, skipping insertion in model container [2018-11-12 17:13:22,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:13:22" (1/1) ... [2018-11-12 17:13:22,799 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 17:13:22,863 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 17:13:23,351 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:13:23,359 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 17:13:23,507 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:13:23,537 INFO L193 MainTranslator]: Completed translation [2018-11-12 17:13:23,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:23 WrapperNode [2018-11-12 17:13:23,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 17:13:23,539 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 17:13:23,539 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 17:13:23,539 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 17:13:23,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:23" (1/1) ... [2018-11-12 17:13:23,655 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:23" (1/1) ... [2018-11-12 17:13:23,663 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 17:13:23,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 17:13:23,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 17:13:23,664 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 17:13:23,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:23" (1/1) ... [2018-11-12 17:13:23,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:23" (1/1) ... [2018-11-12 17:13:23,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:23" (1/1) ... [2018-11-12 17:13:23,694 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:23" (1/1) ... [2018-11-12 17:13:23,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:23" (1/1) ... [2018-11-12 17:13:23,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:23" (1/1) ... [2018-11-12 17:13:23,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:23" (1/1) ... [2018-11-12 17:13:23,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 17:13:23,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 17:13:23,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 17:13:23,786 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 17:13:23,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:23" (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-12 17:13:23,857 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 17:13:23,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 17:13:23,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 17:13:23,858 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 17:13:23,858 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 17:13:23,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 17:13:23,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 17:13:23,858 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 17:13:23,859 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 17:13:26,963 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 17:13:26,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:13:26 BoogieIcfgContainer [2018-11-12 17:13:26,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 17:13:26,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 17:13:26,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 17:13:26,970 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 17:13:26,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:13:22" (1/3) ... [2018-11-12 17:13:26,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f928b7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:13:26, skipping insertion in model container [2018-11-12 17:13:26,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:23" (2/3) ... [2018-11-12 17:13:26,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f928b7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:13:26, skipping insertion in model container [2018-11-12 17:13:26,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:13:26" (3/3) ... [2018-11-12 17:13:26,978 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label23_true-unreach-call_false-termination.c [2018-11-12 17:13:26,988 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 17:13:26,998 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 17:13:27,016 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 17:13:27,054 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 17:13:27,054 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 17:13:27,055 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 17:13:27,055 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 17:13:27,055 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 17:13:27,055 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 17:13:27,055 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 17:13:27,055 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 17:13:27,083 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-12 17:13:27,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-12 17:13:27,100 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:13:27,102 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] [2018-11-12 17:13:27,104 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:13:27,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:27,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1739350872, now seen corresponding path program 1 times [2018-11-12 17:13:27,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:13:27,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:27,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:27,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:27,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:13:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:27,812 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-12 17:13:27,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:13:27,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:13:27,815 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:13:27,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:13:27,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:13:27,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:13:27,844 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-12 17:13:29,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:13:29,926 INFO L93 Difference]: Finished difference Result 621 states and 1060 transitions. [2018-11-12 17:13:29,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:13:29,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2018-11-12 17:13:29,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:13:29,948 INFO L225 Difference]: With dead ends: 621 [2018-11-12 17:13:29,948 INFO L226 Difference]: Without dead ends: 382 [2018-11-12 17:13:29,962 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-12 17:13:29,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-12 17:13:30,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2018-11-12 17:13:30,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-11-12 17:13:30,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 637 transitions. [2018-11-12 17:13:30,055 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 637 transitions. Word has length 140 [2018-11-12 17:13:30,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:13:30,056 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 637 transitions. [2018-11-12 17:13:30,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:13:30,057 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 637 transitions. [2018-11-12 17:13:30,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-12 17:13:30,064 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:13:30,064 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] [2018-11-12 17:13:30,065 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:13:30,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:30,065 INFO L82 PathProgramCache]: Analyzing trace with hash -994164683, now seen corresponding path program 1 times [2018-11-12 17:13:30,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:13:30,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:30,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:30,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:30,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:13:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:30,521 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-12 17:13:30,636 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-12 17:13:30,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:13:30,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 17:13:30,637 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:13:30,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 17:13:30,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 17:13:30,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:13:30,640 INFO L87 Difference]: Start difference. First operand 381 states and 637 transitions. Second operand 5 states. [2018-11-12 17:13:32,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:13:32,278 INFO L93 Difference]: Finished difference Result 901 states and 1555 transitions. [2018-11-12 17:13:32,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:13:32,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2018-11-12 17:13:32,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:13:32,284 INFO L225 Difference]: With dead ends: 901 [2018-11-12 17:13:32,284 INFO L226 Difference]: Without dead ends: 380 [2018-11-12 17:13:32,290 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:13:32,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-11-12 17:13:32,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-11-12 17:13:32,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-12 17:13:32,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 632 transitions. [2018-11-12 17:13:32,316 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 632 transitions. Word has length 149 [2018-11-12 17:13:32,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:13:32,317 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 632 transitions. [2018-11-12 17:13:32,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 17:13:32,317 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 632 transitions. [2018-11-12 17:13:32,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-12 17:13:32,321 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:13:32,321 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, 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] [2018-11-12 17:13:32,322 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:13:32,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:32,322 INFO L82 PathProgramCache]: Analyzing trace with hash -408118830, now seen corresponding path program 1 times [2018-11-12 17:13:32,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:13:32,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:32,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:32,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:32,324 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:13:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:32,541 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:13:32,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:13:32,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:13:32,542 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:13:32,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:13:32,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:13:32,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:13:32,544 INFO L87 Difference]: Start difference. First operand 380 states and 632 transitions. Second operand 6 states. [2018-11-12 17:13:34,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:13:34,912 INFO L93 Difference]: Finished difference Result 1184 states and 2066 transitions. [2018-11-12 17:13:34,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 17:13:34,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 174 [2018-11-12 17:13:34,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:13:34,924 INFO L225 Difference]: With dead ends: 1184 [2018-11-12 17:13:34,924 INFO L226 Difference]: Without dead ends: 810 [2018-11-12 17:13:34,927 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-12 17:13:34,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2018-11-12 17:13:34,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 800. [2018-11-12 17:13:35,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2018-11-12 17:13:35,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1274 transitions. [2018-11-12 17:13:35,005 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1274 transitions. Word has length 174 [2018-11-12 17:13:35,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:13:35,006 INFO L480 AbstractCegarLoop]: Abstraction has 800 states and 1274 transitions. [2018-11-12 17:13:35,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:13:35,006 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1274 transitions. [2018-11-12 17:13:35,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-12 17:13:35,010 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:13:35,010 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:13:35,011 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:13:35,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:35,011 INFO L82 PathProgramCache]: Analyzing trace with hash 464706266, now seen corresponding path program 1 times [2018-11-12 17:13:35,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:13:35,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:35,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:35,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:35,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:13:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:35,496 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:13:35,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:13:35,497 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:13:35,498 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2018-11-12 17:13:35,500 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [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], [791], [793], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:13:35,554 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:13:35,554 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:13:36,985 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:13:36,987 INFO L272 AbstractInterpreter]: Visited 143 different actions 282 times. Merged at 5 different actions 7 times. Never widened. Performed 4049 root evaluator evaluations with a maximum evaluation depth of 4. Performed 4049 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-12 17:13:37,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:37,032 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:13:37,927 INFO L227 lantSequenceWeakener]: Weakened 50 states. On average, predicates are now at 83.33% of their original sizes. [2018-11-12 17:13:37,928 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:13:39,204 INFO L415 sIntCurrentIteration]: We unified 174 AI predicates to 174 [2018-11-12 17:13:39,204 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:13:39,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:13:39,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 17 [2018-11-12 17:13:39,206 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:13:39,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 17:13:39,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 17:13:39,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-12 17:13:39,208 INFO L87 Difference]: Start difference. First operand 800 states and 1274 transitions. Second operand 12 states. [2018-11-12 17:13:58,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:13:58,494 INFO L93 Difference]: Finished difference Result 2331 states and 3671 transitions. [2018-11-12 17:13:58,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 17:13:58,494 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 175 [2018-11-12 17:13:58,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:13:58,504 INFO L225 Difference]: With dead ends: 2331 [2018-11-12 17:13:58,505 INFO L226 Difference]: Without dead ends: 1537 [2018-11-12 17:13:58,508 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 183 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-11-12 17:13:58,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2018-11-12 17:13:58,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1534. [2018-11-12 17:13:58,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1534 states. [2018-11-12 17:13:58,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 2086 transitions. [2018-11-12 17:13:58,561 INFO L78 Accepts]: Start accepts. Automaton has 1534 states and 2086 transitions. Word has length 175 [2018-11-12 17:13:58,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:13:58,562 INFO L480 AbstractCegarLoop]: Abstraction has 1534 states and 2086 transitions. [2018-11-12 17:13:58,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 17:13:58,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 2086 transitions. [2018-11-12 17:13:58,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-12 17:13:58,568 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:13:58,569 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:13:58,569 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:13:58,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:58,569 INFO L82 PathProgramCache]: Analyzing trace with hash 2109985497, now seen corresponding path program 1 times [2018-11-12 17:13:58,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:13:58,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:58,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:58,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:58,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:13:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:58,765 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-12 17:13:58,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:13:58,766 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:13:58,766 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 186 with the following transitions: [2018-11-12 17:13:58,767 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [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], [791], [793], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:13:58,772 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:13:58,773 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:13:59,718 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:13:59,719 INFO L272 AbstractInterpreter]: Visited 144 different actions 431 times. Merged at 7 different actions 21 times. Never widened. Performed 7469 root evaluator evaluations with a maximum evaluation depth of 4. Performed 7469 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 4 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-12 17:13:59,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:59,756 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:14:00,726 INFO L227 lantSequenceWeakener]: Weakened 76 states. On average, predicates are now at 82.49% of their original sizes. [2018-11-12 17:14:00,727 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:14:03,597 INFO L415 sIntCurrentIteration]: We unified 184 AI predicates to 184 [2018-11-12 17:14:03,597 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:14:03,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:14:03,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [8] total 20 [2018-11-12 17:14:03,598 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:14:03,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 17:14:03,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 17:14:03,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-11-12 17:14:03,599 INFO L87 Difference]: Start difference. First operand 1534 states and 2086 transitions. Second operand 14 states. [2018-11-12 17:14:16,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:14:16,852 INFO L93 Difference]: Finished difference Result 3227 states and 4624 transitions. [2018-11-12 17:14:16,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-12 17:14:16,852 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 185 [2018-11-12 17:14:16,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:14:16,863 INFO L225 Difference]: With dead ends: 3227 [2018-11-12 17:14:16,863 INFO L226 Difference]: Without dead ends: 2139 [2018-11-12 17:14:16,867 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 193 GetRequests, 124 SyntacticMatches, 48 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2018-11-12 17:14:16,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2018-11-12 17:14:16,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2132. [2018-11-12 17:14:16,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2018-11-12 17:14:16,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2797 transitions. [2018-11-12 17:14:16,936 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2797 transitions. Word has length 185 [2018-11-12 17:14:16,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:14:16,936 INFO L480 AbstractCegarLoop]: Abstraction has 2132 states and 2797 transitions. [2018-11-12 17:14:16,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 17:14:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2797 transitions. [2018-11-12 17:14:16,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-12 17:14:16,944 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:16,945 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:14:16,945 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:16,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:16,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1738206433, now seen corresponding path program 1 times [2018-11-12 17:14:16,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:16,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:16,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:16,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:16,948 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:17,416 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 55 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:14:17,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:17,417 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:14:17,417 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2018-11-12 17:14:17,418 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [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], [791], [793], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:14:17,432 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:14:17,437 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:14:18,078 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:14:18,079 INFO L272 AbstractInterpreter]: Visited 144 different actions 426 times. Merged at 7 different actions 16 times. Never widened. Performed 6349 root evaluator evaluations with a maximum evaluation depth of 4. Performed 6349 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 4 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-12 17:14:18,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:18,085 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:14:18,472 INFO L227 lantSequenceWeakener]: Weakened 50 states. On average, predicates are now at 83.33% of their original sizes. [2018-11-12 17:14:18,472 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:14:18,666 INFO L415 sIntCurrentIteration]: We unified 188 AI predicates to 188 [2018-11-12 17:14:18,666 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:14:18,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:14:18,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-11-12 17:14:18,667 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:14:18,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 17:14:18,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 17:14:18,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-12 17:14:18,668 INFO L87 Difference]: Start difference. First operand 2132 states and 2797 transitions. Second operand 12 states. [2018-11-12 17:14:29,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:14:29,179 INFO L93 Difference]: Finished difference Result 4187 states and 5754 transitions. [2018-11-12 17:14:29,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-12 17:14:29,179 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 189 [2018-11-12 17:14:29,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:14:29,192 INFO L225 Difference]: With dead ends: 4187 [2018-11-12 17:14:29,192 INFO L226 Difference]: Without dead ends: 2736 [2018-11-12 17:14:29,198 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 197 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2018-11-12 17:14:29,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2018-11-12 17:14:29,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 2728. [2018-11-12 17:14:29,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2728 states. [2018-11-12 17:14:29,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2728 states to 2728 states and 3540 transitions. [2018-11-12 17:14:29,278 INFO L78 Accepts]: Start accepts. Automaton has 2728 states and 3540 transitions. Word has length 189 [2018-11-12 17:14:29,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:14:29,278 INFO L480 AbstractCegarLoop]: Abstraction has 2728 states and 3540 transitions. [2018-11-12 17:14:29,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 17:14:29,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2728 states and 3540 transitions. [2018-11-12 17:14:29,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-12 17:14:29,288 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:29,288 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] [2018-11-12 17:14:29,289 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:29,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:29,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1029888413, now seen corresponding path program 1 times [2018-11-12 17:14:29,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:29,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:29,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:29,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:29,290 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:29,550 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:14:30,025 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-12 17:14:30,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:30,026 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:14:30,026 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-11-12 17:14:30,027 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], [791], [793], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:14:30,030 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:14:30,031 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:14:30,673 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:14:30,673 INFO L272 AbstractInterpreter]: Visited 146 different actions 431 times. Merged at 7 different actions 17 times. Never widened. Performed 6275 root evaluator evaluations with a maximum evaluation depth of 4. Performed 6275 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:14:30,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:30,676 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:14:30,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:30,676 INFO L192 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-12 17:14:30,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:30,687 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:14:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:30,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:14:31,004 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-12 17:14:31,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:14:31,281 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-12 17:14:31,885 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-12 17:14:31,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:14:31,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2018-11-12 17:14:31,907 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:14:31,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 17:14:31,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 17:14:31,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-11-12 17:14:31,911 INFO L87 Difference]: Start difference. First operand 2728 states and 3540 transitions. Second operand 14 states. [2018-11-12 17:14:35,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:14:35,785 INFO L93 Difference]: Finished difference Result 6288 states and 8910 transitions. [2018-11-12 17:14:35,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 17:14:35,788 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 211 [2018-11-12 17:14:35,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:14:35,803 INFO L225 Difference]: With dead ends: 6288 [2018-11-12 17:14:35,803 INFO L226 Difference]: Without dead ends: 3114 [2018-11-12 17:14:35,815 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 434 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2018-11-12 17:14:35,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2018-11-12 17:14:35,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 3042. [2018-11-12 17:14:35,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3042 states. [2018-11-12 17:14:35,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3042 states to 3042 states and 3577 transitions. [2018-11-12 17:14:35,897 INFO L78 Accepts]: Start accepts. Automaton has 3042 states and 3577 transitions. Word has length 211 [2018-11-12 17:14:35,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:14:35,897 INFO L480 AbstractCegarLoop]: Abstraction has 3042 states and 3577 transitions. [2018-11-12 17:14:35,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 17:14:35,897 INFO L276 IsEmpty]: Start isEmpty. Operand 3042 states and 3577 transitions. [2018-11-12 17:14:35,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-12 17:14:35,908 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:35,909 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:14:35,909 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:35,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:35,909 INFO L82 PathProgramCache]: Analyzing trace with hash 113011449, now seen corresponding path program 1 times [2018-11-12 17:14:35,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:35,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:35,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:35,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:35,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:36,348 WARN L179 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2018-11-12 17:14:36,642 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-12 17:14:36,707 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 93 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:14:36,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:36,708 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:14:36,708 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 228 with the following transitions: [2018-11-12 17:14:36,709 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [324], [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], [791], [793], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:14:36,711 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:14:36,711 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:14:37,478 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:14:37,479 INFO L272 AbstractInterpreter]: Visited 145 different actions 431 times. Merged at 7 different actions 20 times. Never widened. Performed 6246 root evaluator evaluations with a maximum evaluation depth of 5. Performed 6246 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:14:37,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:37,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:14:37,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:37,518 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:14:37,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:37,534 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:14:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:37,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:14:37,824 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-12 17:14:37,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:14:38,033 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-12 17:14:38,054 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:14:38,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-11-12 17:14:38,054 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:14:38,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:14:38,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:14:38,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-12 17:14:38,056 INFO L87 Difference]: Start difference. First operand 3042 states and 3577 transitions. Second operand 3 states. [2018-11-12 17:14:38,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:14:38,693 INFO L93 Difference]: Finished difference Result 5789 states and 6977 transitions. [2018-11-12 17:14:38,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:14:38,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2018-11-12 17:14:38,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:14:38,710 INFO L225 Difference]: With dead ends: 5789 [2018-11-12 17:14:38,710 INFO L226 Difference]: Without dead ends: 3889 [2018-11-12 17:14:38,718 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 452 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-12 17:14:38,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3889 states. [2018-11-12 17:14:38,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3889 to 3826. [2018-11-12 17:14:38,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2018-11-12 17:14:38,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 4465 transitions. [2018-11-12 17:14:38,821 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 4465 transitions. Word has length 227 [2018-11-12 17:14:38,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:14:38,822 INFO L480 AbstractCegarLoop]: Abstraction has 3826 states and 4465 transitions. [2018-11-12 17:14:38,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:14:38,822 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 4465 transitions. [2018-11-12 17:14:38,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-11-12 17:14:38,836 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:38,837 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:14:38,837 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:38,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:38,838 INFO L82 PathProgramCache]: Analyzing trace with hash 2042894620, now seen corresponding path program 1 times [2018-11-12 17:14:38,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:38,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:38,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:38,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:38,839 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:39,259 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 130 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 17:14:39,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:39,259 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:14:39,259 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 256 with the following transitions: [2018-11-12 17:14:39,260 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [312], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [791], [793], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:14:39,262 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:14:39,262 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:14:39,797 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:14:39,798 INFO L272 AbstractInterpreter]: Visited 145 different actions 433 times. Merged at 7 different actions 20 times. Never widened. Performed 5932 root evaluator evaluations with a maximum evaluation depth of 4. Performed 5932 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:14:39,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:39,806 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:14:40,142 INFO L227 lantSequenceWeakener]: Weakened 252 states. On average, predicates are now at 81.06% of their original sizes. [2018-11-12 17:14:40,142 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:14:40,238 INFO L415 sIntCurrentIteration]: We unified 254 AI predicates to 254 [2018-11-12 17:14:40,239 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:14:40,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:14:40,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-12 17:14:40,239 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:14:40,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:14:40,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:14:40,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:14:40,240 INFO L87 Difference]: Start difference. First operand 3826 states and 4465 transitions. Second operand 11 states. [2018-11-12 17:14:47,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:14:47,374 INFO L93 Difference]: Finished difference Result 7479 states and 9006 transitions. [2018-11-12 17:14:47,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 17:14:47,374 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 255 [2018-11-12 17:14:47,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:14:47,393 INFO L225 Difference]: With dead ends: 7479 [2018-11-12 17:14:47,393 INFO L226 Difference]: Without dead ends: 4719 [2018-11-12 17:14:47,402 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 266 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-11-12 17:14:47,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4719 states. [2018-11-12 17:14:47,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4719 to 4589. [2018-11-12 17:14:47,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4589 states. [2018-11-12 17:14:47,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4589 states to 4589 states and 5231 transitions. [2018-11-12 17:14:47,506 INFO L78 Accepts]: Start accepts. Automaton has 4589 states and 5231 transitions. Word has length 255 [2018-11-12 17:14:47,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:14:47,506 INFO L480 AbstractCegarLoop]: Abstraction has 4589 states and 5231 transitions. [2018-11-12 17:14:47,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:14:47,507 INFO L276 IsEmpty]: Start isEmpty. Operand 4589 states and 5231 transitions. [2018-11-12 17:14:47,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-11-12 17:14:47,521 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:47,521 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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-12 17:14:47,522 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:47,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:47,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1279752066, now seen corresponding path program 1 times [2018-11-12 17:14:47,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:47,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:47,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:47,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:47,523 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:47,800 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 140 proven. 70 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-12 17:14:47,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:47,801 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:14:47,801 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 271 with the following transitions: [2018-11-12 17:14:47,801 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [45], [50], [52], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [99], [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], [791], [793], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:14:47,804 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:14:47,804 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:14:48,614 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:14:48,614 INFO L272 AbstractInterpreter]: Visited 150 different actions 602 times. Merged at 10 different actions 42 times. Widened at 1 different actions 1 times. Performed 8290 root evaluator evaluations with a maximum evaluation depth of 4. Performed 8290 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 12 fixpoints after 5 different actions. Largest state had 38 variables. [2018-11-12 17:14:48,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:48,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:14:48,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:48,627 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:14:48,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:48,637 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:14:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:48,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:14:48,834 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 209 proven. 2 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-12 17:14:48,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:14:49,001 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 167 proven. 34 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-12 17:14:49,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:14:49,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-12 17:14:49,023 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:14:49,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 17:14:49,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 17:14:49,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:14:49,024 INFO L87 Difference]: Start difference. First operand 4589 states and 5231 transitions. Second operand 9 states. [2018-11-12 17:14:52,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:14:52,280 INFO L93 Difference]: Finished difference Result 10484 states and 12305 transitions. [2018-11-12 17:14:52,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-12 17:14:52,288 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 270 [2018-11-12 17:14:52,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:14:52,310 INFO L225 Difference]: With dead ends: 10484 [2018-11-12 17:14:52,310 INFO L226 Difference]: Without dead ends: 5558 [2018-11-12 17:14:52,323 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 558 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=330, Invalid=1152, Unknown=0, NotChecked=0, Total=1482 [2018-11-12 17:14:52,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5558 states. [2018-11-12 17:14:52,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5558 to 4874. [2018-11-12 17:14:52,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4874 states. [2018-11-12 17:14:52,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4874 states to 4874 states and 5429 transitions. [2018-11-12 17:14:52,433 INFO L78 Accepts]: Start accepts. Automaton has 4874 states and 5429 transitions. Word has length 270 [2018-11-12 17:14:52,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:14:52,433 INFO L480 AbstractCegarLoop]: Abstraction has 4874 states and 5429 transitions. [2018-11-12 17:14:52,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 17:14:52,434 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 5429 transitions. [2018-11-12 17:14:52,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-11-12 17:14:52,454 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:52,455 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-12 17:14:52,455 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:52,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:52,456 INFO L82 PathProgramCache]: Analyzing trace with hash 91888909, now seen corresponding path program 1 times [2018-11-12 17:14:52,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:52,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:52,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:52,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:52,457 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:52,963 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 272 proven. 2 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-12 17:14:52,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:52,963 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:14:52,964 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 328 with the following transitions: [2018-11-12 17:14:52,964 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], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [236], [237], [241], [245], [248], [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], [791], [793], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:14:52,966 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:14:52,967 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:14:54,655 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:14:54,655 INFO L272 AbstractInterpreter]: Visited 147 different actions 737 times. Merged at 9 different actions 49 times. Widened at 1 different actions 1 times. Performed 10262 root evaluator evaluations with a maximum evaluation depth of 6. Performed 10262 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 11 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:14:54,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:54,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:14:54,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:54,662 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:14:54,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:54,672 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:14:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:54,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:14:54,878 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 272 proven. 2 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-12 17:14:54,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:14:55,080 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 272 proven. 2 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-12 17:14:55,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:14:55,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2018-11-12 17:14:55,101 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:14:55,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 17:14:55,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 17:14:55,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-12 17:14:55,102 INFO L87 Difference]: Start difference. First operand 4874 states and 5429 transitions. Second operand 7 states. [2018-11-12 17:14:56,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:14:56,440 INFO L93 Difference]: Finished difference Result 8217 states and 9271 transitions. [2018-11-12 17:14:56,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 17:14:56,442 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 327 [2018-11-12 17:14:56,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:14:56,443 INFO L225 Difference]: With dead ends: 8217 [2018-11-12 17:14:56,443 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 17:14:56,461 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 653 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-12 17:14:56,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 17:14:56,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 17:14:56,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 17:14:56,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 17:14:56,462 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 327 [2018-11-12 17:14:56,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:14:56,462 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 17:14:56,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 17:14:56,462 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 17:14:56,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 17:14:56,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 17:14:56,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:14:56,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:14:56,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:14:56,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:14:57,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:14:57,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:14:57,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:14:57,138 WARN L179 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 200 [2018-11-12 17:14:57,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:14:57,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:14:57,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:14:57,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:14:57,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:14:57,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:14:57,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:14:57,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:14:57,453 WARN L179 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 205 [2018-11-12 17:14:58,254 WARN L179 SmtUtils]: Spent 799.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-11-12 17:14:58,550 WARN L179 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 77 [2018-11-12 17:15:03,597 WARN L179 SmtUtils]: Spent 5.03 s on a formula simplification. DAG size of input: 326 DAG size of output: 81 [2018-11-12 17:15:03,887 WARN L179 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2018-11-12 17:15:07,355 WARN L179 SmtUtils]: Spent 3.46 s on a formula simplification. DAG size of input: 231 DAG size of output: 106 [2018-11-12 17:15:08,533 WARN L179 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 233 DAG size of output: 99 [2018-11-12 17:15:08,536 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:15:08,537 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a11~0)| ~a11~0) (= |old(~a17~0)| ~a17~0) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-11-12 17:15:08,537 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:15:08,537 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,537 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,537 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,537 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,537 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,537 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-12 17:15:08,538 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-12 17:15:08,538 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-12 17:15:08,538 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-12 17:15:08,538 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-12 17:15:08,538 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-12 17:15:08,538 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-12 17:15:08,538 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-12 17:15:08,538 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-12 17:15:08,539 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-12 17:15:08,539 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-12 17:15:08,539 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-12 17:15:08,539 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-12 17:15:08,539 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,539 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,539 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,539 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,539 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-12 17:15:08,539 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,539 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-12 17:15:08,539 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-12 17:15:08,539 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-12 17:15:08,539 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-12 17:15:08,540 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-12 17:15:08,540 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-12 17:15:08,540 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-12 17:15:08,540 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-12 17:15:08,540 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-12 17:15:08,540 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-12 17:15:08,540 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-12 17:15:08,540 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-12 17:15:08,540 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-12 17:15:08,540 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-12 17:15:08,540 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-12 17:15:08,541 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,541 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,541 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,541 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,541 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,541 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-12 17:15:08,542 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-12 17:15:08,542 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-12 17:15:08,542 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-12 17:15:08,542 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-12 17:15:08,542 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-12 17:15:08,542 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-12 17:15:08,542 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-12 17:15:08,542 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-12 17:15:08,543 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-12 17:15:08,543 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-12 17:15:08,543 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,543 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,543 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,543 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,543 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,543 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-12 17:15:08,543 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-12 17:15:08,544 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-12 17:15:08,544 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-12 17:15:08,544 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-12 17:15:08,544 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-12 17:15:08,544 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-12 17:15:08,544 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-12 17:15:08,544 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-12 17:15:08,544 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 571) no Hoare annotation was computed. [2018-11-12 17:15:08,545 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-12 17:15:08,545 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-12 17:15:08,545 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-12 17:15:08,545 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-12 17:15:08,545 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,545 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,545 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,545 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,546 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,546 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-12 17:15:08,546 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-12 17:15:08,546 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-12 17:15:08,546 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-12 17:15:08,546 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-12 17:15:08,546 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-12 17:15:08,546 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-12 17:15:08,546 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-12 17:15:08,547 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-12 17:15:08,547 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-12 17:15:08,547 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-12 17:15:08,547 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-12 17:15:08,547 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-12 17:15:08,547 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-12 17:15:08,547 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-12 17:15:08,547 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-12 17:15:08,547 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,548 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,548 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,548 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,548 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-12 17:15:08,548 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,548 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-12 17:15:08,548 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,548 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-12 17:15:08,548 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-12 17:15:08,549 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-12 17:15:08,549 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,549 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,549 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-12 17:15:08,549 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-12 17:15:08,549 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-12 17:15:08,549 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-12 17:15:08,549 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-12 17:15:08,549 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-12 17:15:08,549 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-12 17:15:08,550 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-12 17:15:08,550 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-12 17:15:08,550 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-12 17:15:08,550 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-12 17:15:08,550 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,550 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,550 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,550 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,550 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,551 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,551 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-12 17:15:08,551 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-12 17:15:08,551 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-12 17:15:08,551 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-12 17:15:08,551 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-12 17:15:08,551 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-12 17:15:08,551 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-12 17:15:08,551 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-12 17:15:08,551 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-12 17:15:08,552 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-12 17:15:08,552 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-12 17:15:08,552 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,552 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,552 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,552 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,552 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,552 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,553 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-12 17:15:08,553 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-12 17:15:08,553 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-12 17:15:08,553 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-12 17:15:08,553 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-12 17:15:08,553 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-12 17:15:08,553 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-12 17:15:08,553 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-12 17:15:08,553 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-12 17:15:08,554 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-12 17:15:08,554 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-12 17:15:08,554 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-12 17:15:08,554 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-12 17:15:08,554 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-12 17:15:08,554 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,554 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,554 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,555 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse1 (= |old(~a11~0)| ~a11~0)) (.cse2 (= |old(~a17~0)| ~a17~0)) (.cse14 (= ~a19~0 |old(~a19~0)|)) (.cse3 (= ~a28~0 |old(~a28~0)|)) (.cse15 (= ~a25~0 |old(~a25~0)|))) (let ((.cse12 (< 7 |old(~a28~0)|)) (.cse4 (= 8 |old(~a28~0)|)) (.cse6 (< 7 |old(~a17~0)|)) (.cse5 (= 9 |old(~a28~0)|)) (.cse13 (< 0 |old(~a19~0)|)) (.cse0 (not (= 1 ~a21~0))) (.cse9 (= 1 |old(~a11~0)|)) (.cse7 (not (= 1 |old(~a25~0)|))) (.cse10 (and .cse1 .cse2 .cse14 .cse3 .cse15)) (.cse8 (not (= 1 |old(~a19~0)|))) (.cse11 (not (= |old(~a17~0)| 8)))) (and (or .cse0 (and .cse1 .cse2 .cse3) .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse8 (not (= 8 |old(~a17~0)|)) (and (= 1 ~a11~0) (= 1 ~a25~0) (= 9 ~a28~0) (= 8 ~a17~0) (= 1 ~a19~0)) (not .cse5) (not .cse9)) (or .cse0 .cse9 .cse10 .cse8 .cse4 .cse11) (or .cse0 .cse12 .cse10 .cse11 .cse13) (or .cse0 .cse12 .cse7 .cse8 .cse11 (and .cse2 .cse1 .cse14 .cse3 .cse15)) (or .cse0 (and .cse1 (<= ~a19~0 0) .cse2 .cse3) .cse4 .cse13 .cse6) (or .cse0 .cse9 .cse5 .cse11 .cse13 .cse10) (or (< 6 |calculate_output_#in~input|) (and .cse1 (= ~a17~0 8) .cse14 .cse3 .cse15) (or .cse0 .cse8 (< 1 |old(~a25~0)|) (< |old(~a28~0)| 9) (< 11 |old(~a28~0)|) (< |old(~a25~0)| 0)) .cse11 (< |calculate_output_#in~input| 1)) (or .cse0 .cse9 .cse7 .cse10 .cse8 .cse11)))) [2018-11-12 17:15:08,555 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,555 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,555 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,555 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-12 17:15:08,555 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-12 17:15:08,555 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-12 17:15:08,556 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-12 17:15:08,556 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-12 17:15:08,556 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-12 17:15:08,556 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-12 17:15:08,556 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-12 17:15:08,556 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-12 17:15:08,556 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-12 17:15:08,556 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-12 17:15:08,556 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-12 17:15:08,556 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-12 17:15:08,557 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,557 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,557 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,557 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,557 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,557 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,557 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-12 17:15:08,557 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-12 17:15:08,557 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-12 17:15:08,557 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-12 17:15:08,558 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-12 17:15:08,558 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-12 17:15:08,558 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-12 17:15:08,558 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-12 17:15:08,558 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-12 17:15:08,558 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-12 17:15:08,558 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-12 17:15:08,558 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-12 17:15:08,558 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-12 17:15:08,559 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-12 17:15:08,559 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-12 17:15:08,559 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-11-12 17:15:08,559 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,559 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,559 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,559 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,559 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:08,559 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-12 17:15:08,559 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-12 17:15:08,559 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-12 17:15:08,560 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-12 17:15:08,560 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-12 17:15:08,560 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-12 17:15:08,560 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-12 17:15:08,560 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-12 17:15:08,560 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-12 17:15:08,560 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-12 17:15:08,560 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-12 17:15:08,560 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-12 17:15:08,561 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-12 17:15:08,561 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-12 17:15:08,561 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-12 17:15:08,561 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-12 17:15:08,561 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-12 17:15:08,561 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-12 17:15:08,561 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-12 17:15:08,561 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:15:08,561 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~z~0 26) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a~0 1) (= ~a19~0 1) (= ~a28~0 7)) [2018-11-12 17:15:08,562 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 17:15:08,562 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:15:08,562 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (and (= ~a11~0 0) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|) (= ~a17~0 8) (= ~a19~0 |old(~a19~0)|)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-12 17:15:08,562 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-12 17:15:08,562 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse6 (<= ~a28~0 7)) (.cse4 (= 1 ~a25~0)) (.cse2 (= 1 ~a19~0)) (.cse5 (<= ~a19~0 0)) (.cse0 (= |old(~a17~0)| ~a17~0)) (.cse3 (not (= ~a11~0 1))) (.cse7 (<= ~a17~0 7)) (.cse1 (not (= ~a28~0 8))) (.cse8 (not (= ~a28~0 9)))) (or (and .cse0 .cse1 .cse2 .cse3) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse0 .cse4 .cse2 .cse3) (and .cse5 .cse6 .cse0) (and .cse7 .cse5 .cse1) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and .cse6 .cse0 .cse4 .cse2) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (and .cse5 .cse0 .cse3 .cse8) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (and (<= ~a28~0 11) (<= 0 ~a25~0) (= ~a17~0 8) (= ~a19~0 1) (<= 9 ~a28~0) (<= ~a25~0 1)) (and .cse7 .cse1 .cse8) (not (= 6 ~f~0)))) [2018-11-12 17:15:08,562 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-12 17:15:08,563 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-12 17:15:08,563 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse6 (<= ~a28~0 7)) (.cse4 (= 1 ~a25~0)) (.cse2 (= 1 ~a19~0)) (.cse5 (<= ~a19~0 0)) (.cse0 (= |old(~a17~0)| ~a17~0)) (.cse3 (not (= ~a11~0 1))) (.cse7 (<= ~a17~0 7)) (.cse1 (not (= ~a28~0 8))) (.cse8 (not (= ~a28~0 9)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (= 9 ~a28~0) (= 8 ~a17~0) .cse2) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse0 .cse4 .cse2 .cse3) (and .cse5 .cse6 .cse0) (and .cse7 .cse5 .cse1) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and .cse6 .cse0 .cse4 .cse2) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (and .cse5 .cse0 .cse3 .cse8) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (and (<= 1 main_~input~0) (<= main_~input~0 6) (and (<= ~a28~0 11) (<= 0 ~a25~0) (= ~a19~0 1) (<= 9 ~a28~0) (<= ~a25~0 1)) (= ~a17~0 8)) (not (= |old(~a17~0)| 8)) (and .cse7 .cse1 .cse8) (not (= 6 ~f~0)))) [2018-11-12 17:15:08,563 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-12 17:15:08,563 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-12 17:15:08,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:15:08 BoogieIcfgContainer [2018-11-12 17:15:08,577 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 17:15:08,578 INFO L168 Benchmark]: Toolchain (without parser) took 105801.30 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -397.3 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-11-12 17:15:08,579 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 17:15:08,580 INFO L168 Benchmark]: CACSL2BoogieTranslator took 758.47 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-12 17:15:08,580 INFO L168 Benchmark]: Boogie Procedure Inliner took 124.43 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 677.9 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -755.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. [2018-11-12 17:15:08,584 INFO L168 Benchmark]: Boogie Preprocessor took 122.13 ms. Allocated memory is still 2.2 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 17:15:08,585 INFO L168 Benchmark]: RCFGBuilder took 3178.53 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 123.9 MB). Peak memory consumption was 123.9 MB. Max. memory is 7.1 GB. [2018-11-12 17:15:08,586 INFO L168 Benchmark]: TraceAbstraction took 101611.78 ms. Allocated memory was 2.2 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 1.8 GB in the end (delta: 202.4 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-11-12 17:15:08,593 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 758.47 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 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 124.43 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 677.9 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -755.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 122.13 ms. Allocated memory is still 2.2 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3178.53 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 123.9 MB). Peak memory consumption was 123.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 101611.78 ms. Allocated memory was 2.2 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 1.8 GB in the end (delta: 202.4 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 571]: 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: ((((((((((((((((((((((((((\old(a17) == a17 && !(a28 == 8)) && 1 == a19) && !(a11 == 1)) || !(a21 == 1)) || !(y == 25)) || (((\old(a17) == a17 && 1 == a25) && 1 == a19) && !(a11 == 1))) || ((a19 <= 0 && a28 <= 7) && \old(a17) == a17)) || ((a17 <= 7 && a19 <= 0) && !(a28 == 8))) || !(1 == \old(a19))) || !(x == 24)) || !(e == 5)) || !(d == 4)) || !(21 == u)) || !(22 == v)) || !(\old(a11) == 0)) || (((a28 <= 7 && \old(a17) == a17) && 1 == a25) && 1 == a19)) || !(z == 26)) || !(0 == \old(a25))) || !(3 == c)) || !(23 == w)) || (((a19 <= 0 && \old(a17) == a17) && !(a11 == 1)) && !(a28 == 9))) || !(\old(a28) == 7)) || !(a == 1)) || !(\old(a17) == 8)) || (((((a28 <= 11 && 0 <= a25) && a17 == 8) && a19 == 1) && 9 <= a28) && a25 <= 1)) || ((a17 <= 7 && !(a28 == 8)) && !(a28 == 9))) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 101.5s OverallTime, 11 OverallIterations, 6 TraceHistogramMax, 65.6s AutomataDifference, 0.0s DeadEndRemovalTime, 12.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1601 SDtfs, 11690 SDslu, 1632 SDs, 0 SdLazy, 15356 SolverSat, 2631 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.0s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 3047 GetRequests, 2816 SyntacticMatches, 58 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4874occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 7.7s AbstIntTime, 8 AbstIntIterations, 4 AbstIntStrong, 0.9977697419057708 AbsIntWeakeningRatio, 0.165 AbsIntAvgWeakeningVarsNumRemoved, 22.31625 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 978 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 166 PreInvPairs, 267 NumberOfFragments, 856 HoareAnnotationTreeSize, 166 FomulaSimplifications, 13043 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 7 FomulaSimplificationsInter, 15520 FormulaSimplificationTreeSizeReductionInter, 11.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 3337 NumberOfCodeBlocks, 3337 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 4353 ConstructedInterpolants, 0 QuantifiedInterpolants, 2389459 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2334 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 19 InterpolantComputations, 5 PerfectInterpolantSequences, 2895/3109 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...