java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label51_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 12:56:44,802 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 12:56:44,804 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 12:56:44,821 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 12:56:44,821 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 12:56:44,823 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 12:56:44,824 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 12:56:44,834 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 12:56:44,838 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 12:56:44,839 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 12:56:44,842 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 12:56:44,843 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 12:56:44,844 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 12:56:44,845 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 12:56:44,847 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 12:56:44,848 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 12:56:44,849 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 12:56:44,853 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 12:56:44,858 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 12:56:44,859 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 12:56:44,863 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 12:56:44,864 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 12:56:44,867 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 12:56:44,868 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 12:56:44,868 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 12:56:44,869 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 12:56:44,871 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 12:56:44,872 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 12:56:44,873 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 12:56:44,874 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 12:56:44,874 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 12:56:44,875 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 12:56:44,875 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 12:56:44,875 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 12:56:44,878 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 12:56:44,879 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 12:56:44,880 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 12:56:44,909 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 12:56:44,909 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 12:56:44,910 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 12:56:44,911 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 12:56:44,911 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 12:56:44,911 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 12:56:44,911 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 12:56:44,911 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 12:56:44,912 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 12:56:44,912 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 12:56:44,912 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 12:56:44,912 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 12:56:44,913 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 12:56:44,913 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 12:56:44,914 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 12:56:44,914 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 12:56:44,914 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 12:56:44,914 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 12:56:44,914 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 12:56:44,914 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 12:56:44,915 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 12:56:44,915 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 12:56:44,915 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 12:56:44,915 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 12:56:44,915 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:56:44,916 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 12:56:44,916 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 12:56:44,916 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 12:56:44,916 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 12:56:44,916 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 12:56:44,917 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 12:56:44,917 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 12:56:44,917 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 12:56:44,917 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 12:56:44,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 12:56:44,977 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 12:56:44,980 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 12:56:44,982 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 12:56:44,983 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 12:56:44,983 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label51_true-unreach-call_false-termination.c [2018-11-07 12:56:45,046 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/857ab0c12/26e92ef33dae41519a89a2cbf875870a/FLAGc5f5c99fd [2018-11-07 12:56:45,661 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 12:56:45,662 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label51_true-unreach-call_false-termination.c [2018-11-07 12:56:45,686 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/857ab0c12/26e92ef33dae41519a89a2cbf875870a/FLAGc5f5c99fd [2018-11-07 12:56:45,702 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/857ab0c12/26e92ef33dae41519a89a2cbf875870a [2018-11-07 12:56:45,713 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 12:56:45,714 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 12:56:45,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 12:56:45,716 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 12:56:45,722 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 12:56:45,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:56:45" (1/1) ... [2018-11-07 12:56:45,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44783422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:45, skipping insertion in model container [2018-11-07 12:56:45,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:56:45" (1/1) ... [2018-11-07 12:56:45,738 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 12:56:45,815 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 12:56:46,316 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:56:46,321 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 12:56:46,473 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:56:46,502 INFO L193 MainTranslator]: Completed translation [2018-11-07 12:56:46,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:46 WrapperNode [2018-11-07 12:56:46,503 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 12:56:46,504 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 12:56:46,504 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 12:56:46,504 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 12:56:46,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:46" (1/1) ... [2018-11-07 12:56:46,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:46" (1/1) ... [2018-11-07 12:56:46,635 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 12:56:46,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 12:56:46,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 12:56:46,636 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 12:56:46,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:46" (1/1) ... [2018-11-07 12:56:46,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:46" (1/1) ... [2018-11-07 12:56:46,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:46" (1/1) ... [2018-11-07 12:56:46,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:46" (1/1) ... [2018-11-07 12:56:46,696 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:46" (1/1) ... [2018-11-07 12:56:46,715 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:46" (1/1) ... [2018-11-07 12:56:46,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:46" (1/1) ... [2018-11-07 12:56:46,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 12:56:46,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 12:56:46,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 12:56:46,738 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 12:56:46,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:56:46,826 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 12:56:46,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 12:56:46,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 12:56:46,828 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 12:56:46,828 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 12:56:46,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 12:56:46,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 12:56:46,829 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 12:56:46,829 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 12:56:50,049 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 12:56:50,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:56:50 BoogieIcfgContainer [2018-11-07 12:56:50,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 12:56:50,051 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 12:56:50,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 12:56:50,055 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 12:56:50,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:56:45" (1/3) ... [2018-11-07 12:56:50,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4add7fb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:56:50, skipping insertion in model container [2018-11-07 12:56:50,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:46" (2/3) ... [2018-11-07 12:56:50,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4add7fb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:56:50, skipping insertion in model container [2018-11-07 12:56:50,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:56:50" (3/3) ... [2018-11-07 12:56:50,063 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label51_true-unreach-call_false-termination.c [2018-11-07 12:56:50,074 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 12:56:50,084 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 12:56:50,102 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 12:56:50,144 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 12:56:50,145 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 12:56:50,145 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 12:56:50,145 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 12:56:50,146 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 12:56:50,146 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 12:56:50,146 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 12:56:50,146 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 12:56:50,188 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-07 12:56:50,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-07 12:56:50,202 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:56:50,203 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] [2018-11-07 12:56:50,206 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:56:50,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:56:50,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1195562327, now seen corresponding path program 1 times [2018-11-07 12:56:50,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:56:50,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:56:50,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:56:50,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:56:50,263 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:56:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:56:50,772 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:56:50,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:56:50,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:56:50,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 12:56:50,937 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:56:50,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:56:50,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:56:50,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:56:50,965 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-07 12:56:52,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:56:52,507 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-11-07 12:56:52,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:56:52,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-11-07 12:56:52,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:56:52,529 INFO L225 Difference]: With dead ends: 621 [2018-11-07 12:56:52,529 INFO L226 Difference]: Without dead ends: 382 [2018-11-07 12:56:52,537 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:56:52,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-07 12:56:52,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-11-07 12:56:52,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-07 12:56:52,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-11-07 12:56:52,617 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 117 [2018-11-07 12:56:52,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:56:52,618 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-11-07 12:56:52,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:56:52,619 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-11-07 12:56:52,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-07 12:56:52,625 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:56:52,625 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] [2018-11-07 12:56:52,626 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:56:52,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:56:52,627 INFO L82 PathProgramCache]: Analyzing trace with hash -324277142, now seen corresponding path program 1 times [2018-11-07 12:56:52,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:56:52,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:56:52,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:56:52,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:56:52,629 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:56:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:56:53,125 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:56:53,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:56:53,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 12:56:53,125 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:56:53,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 12:56:53,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 12:56:53,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:56:53,128 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-11-07 12:56:54,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:56:54,854 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-11-07 12:56:54,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 12:56:54,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2018-11-07 12:56:54,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:56:54,860 INFO L225 Difference]: With dead ends: 903 [2018-11-07 12:56:54,861 INFO L226 Difference]: Without dead ends: 381 [2018-11-07 12:56:54,868 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:56:54,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-11-07 12:56:54,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-11-07 12:56:54,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-11-07 12:56:54,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-11-07 12:56:54,896 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 126 [2018-11-07 12:56:54,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:56:54,896 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-11-07 12:56:54,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 12:56:54,897 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-11-07 12:56:54,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-07 12:56:54,900 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:56:54,901 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:56:54,901 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:56:54,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:56:54,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1188045302, now seen corresponding path program 1 times [2018-11-07 12:56:54,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:56:54,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:56:54,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:56:54,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:56:54,904 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:56:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:56:55,288 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2018-11-07 12:56:55,415 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:56:55,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:56:55,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 12:56:55,415 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:56:55,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 12:56:55,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 12:56:55,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:56:55,417 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-11-07 12:56:57,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:56:57,125 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-11-07 12:56:57,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 12:56:57,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2018-11-07 12:56:57,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:56:57,135 INFO L225 Difference]: With dead ends: 901 [2018-11-07 12:56:57,136 INFO L226 Difference]: Without dead ends: 380 [2018-11-07 12:56:57,138 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:56:57,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-11-07 12:56:57,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-11-07 12:56:57,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-07 12:56:57,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-11-07 12:56:57,158 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 132 [2018-11-07 12:56:57,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:56:57,158 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-11-07 12:56:57,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 12:56:57,158 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-11-07 12:56:57,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-07 12:56:57,161 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:56:57,162 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:56:57,162 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:56:57,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:56:57,162 INFO L82 PathProgramCache]: Analyzing trace with hash -34077619, now seen corresponding path program 1 times [2018-11-07 12:56:57,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:56:57,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:56:57,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:56:57,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:56:57,164 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:56:57,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:56:57,424 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:56:57,687 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:56:57,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:56:57,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 12:56:57,688 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:56:57,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 12:56:57,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 12:56:57,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 12:56:57,689 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-11-07 12:57:00,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:57:00,884 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-11-07 12:57:00,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 12:57:00,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2018-11-07 12:57:00,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:57:00,890 INFO L225 Difference]: With dead ends: 1193 [2018-11-07 12:57:00,890 INFO L226 Difference]: Without dead ends: 819 [2018-11-07 12:57:00,892 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 12:57:00,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-11-07 12:57:00,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-11-07 12:57:00,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-11-07 12:57:00,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-11-07 12:57:00,930 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 140 [2018-11-07 12:57:00,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:57:00,931 INFO L480 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-11-07 12:57:00,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 12:57:00,931 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-11-07 12:57:00,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-07 12:57:00,934 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:57:00,935 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:57:00,935 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:57:00,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:57:00,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1593443119, now seen corresponding path program 1 times [2018-11-07 12:57:00,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:57:00,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:00,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:57:00,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:00,937 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:57:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:57:01,198 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:57:01,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:57:01,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 12:57:01,199 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:57:01,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 12:57:01,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 12:57:01,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:57:01,200 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-11-07 12:57:02,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:57:02,328 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-11-07 12:57:02,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 12:57:02,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2018-11-07 12:57:02,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:57:02,336 INFO L225 Difference]: With dead ends: 1753 [2018-11-07 12:57:02,336 INFO L226 Difference]: Without dead ends: 804 [2018-11-07 12:57:02,340 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:57:02,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-11-07 12:57:02,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-11-07 12:57:02,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-11-07 12:57:02,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-11-07 12:57:02,365 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 142 [2018-11-07 12:57:02,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:57:02,366 INFO L480 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-11-07 12:57:02,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 12:57:02,366 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-11-07 12:57:02,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-07 12:57:02,369 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:57:02,370 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:57:02,370 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:57:02,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:57:02,370 INFO L82 PathProgramCache]: Analyzing trace with hash 890086741, now seen corresponding path program 1 times [2018-11-07 12:57:02,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:57:02,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:02,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:57:02,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:02,372 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:57:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:57:02,665 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:57:02,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:57:02,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 12:57:02,665 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:57:02,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 12:57:02,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 12:57:02,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:57:02,667 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-11-07 12:57:04,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:57:04,206 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-11-07 12:57:04,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 12:57:04,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2018-11-07 12:57:04,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:57:04,217 INFO L225 Difference]: With dead ends: 1747 [2018-11-07 12:57:04,217 INFO L226 Difference]: Without dead ends: 801 [2018-11-07 12:57:04,221 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:57:04,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-11-07 12:57:04,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-11-07 12:57:04,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-11-07 12:57:04,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-11-07 12:57:04,263 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 144 [2018-11-07 12:57:04,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:57:04,264 INFO L480 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-11-07 12:57:04,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 12:57:04,264 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-11-07 12:57:04,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-07 12:57:04,267 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:57:04,268 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:57:04,268 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:57:04,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:57:04,269 INFO L82 PathProgramCache]: Analyzing trace with hash 207226461, now seen corresponding path program 1 times [2018-11-07 12:57:04,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:57:04,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:04,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:57:04,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:04,274 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:57:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:57:04,556 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:57:04,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:57:04,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 12:57:04,557 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:57:04,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 12:57:04,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 12:57:04,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 12:57:04,558 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-11-07 12:57:05,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:57:05,939 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-11-07 12:57:05,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 12:57:05,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2018-11-07 12:57:05,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:57:05,955 INFO L225 Difference]: With dead ends: 2381 [2018-11-07 12:57:05,955 INFO L226 Difference]: Without dead ends: 1586 [2018-11-07 12:57:05,960 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 12:57:05,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-11-07 12:57:06,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-11-07 12:57:06,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-11-07 12:57:06,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-11-07 12:57:06,009 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 148 [2018-11-07 12:57:06,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:57:06,010 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-11-07 12:57:06,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 12:57:06,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-11-07 12:57:06,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-07 12:57:06,016 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:57:06,016 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:57:06,017 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:57:06,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:57:06,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1224274575, now seen corresponding path program 1 times [2018-11-07 12:57:06,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:57:06,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:06,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:57:06,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:06,019 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:57:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:57:06,416 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:57:06,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:57:06,416 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:57:06,417 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 184 with the following transitions: [2018-11-07 12:57:06,421 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [607], [609], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:57:06,477 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:57:06,477 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:57:07,644 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:57:07,646 INFO L272 AbstractInterpreter]: Visited 121 different actions 238 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-07 12:57:07,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:57:07,687 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:57:08,399 INFO L227 lantSequenceWeakener]: Weakened 94 states. On average, predicates are now at 80.99% of their original sizes. [2018-11-07 12:57:08,400 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:57:09,334 INFO L415 sIntCurrentIteration]: We unified 182 AI predicates to 182 [2018-11-07 12:57:09,334 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:57:09,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:57:09,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-07 12:57:09,335 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:57:09,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 12:57:09,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 12:57:09,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-07 12:57:09,337 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 18 states. [2018-11-07 12:57:26,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:57:26,711 INFO L93 Difference]: Finished difference Result 3716 states and 5313 transitions. [2018-11-07 12:57:26,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 12:57:26,711 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 183 [2018-11-07 12:57:26,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:57:26,721 INFO L225 Difference]: With dead ends: 3716 [2018-11-07 12:57:26,721 INFO L226 Difference]: Without dead ends: 2164 [2018-11-07 12:57:26,727 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 196 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=182, Invalid=810, Unknown=0, NotChecked=0, Total=992 [2018-11-07 12:57:26,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2018-11-07 12:57:26,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 2152. [2018-11-07 12:57:26,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2152 states. [2018-11-07 12:57:26,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 2889 transitions. [2018-11-07 12:57:26,784 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 2889 transitions. Word has length 183 [2018-11-07 12:57:26,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:57:26,785 INFO L480 AbstractCegarLoop]: Abstraction has 2152 states and 2889 transitions. [2018-11-07 12:57:26,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 12:57:26,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 2889 transitions. [2018-11-07 12:57:26,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-07 12:57:26,793 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:57:26,793 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:57:26,793 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:57:26,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:57:26,794 INFO L82 PathProgramCache]: Analyzing trace with hash 133706701, now seen corresponding path program 1 times [2018-11-07 12:57:26,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:57:26,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:26,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:57:26,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:26,795 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:57:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:57:27,053 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 73 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:57:27,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:57:27,054 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:57:27,054 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 187 with the following transitions: [2018-11-07 12:57:27,055 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [607], [609], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:57:27,060 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:57:27,060 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:57:27,410 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:57:27,410 INFO L272 AbstractInterpreter]: Visited 121 different actions 238 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-07 12:57:27,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:57:27,417 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:57:27,832 INFO L227 lantSequenceWeakener]: Weakened 95 states. On average, predicates are now at 80.99% of their original sizes. [2018-11-07 12:57:27,832 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:57:28,272 INFO L415 sIntCurrentIteration]: We unified 185 AI predicates to 185 [2018-11-07 12:57:28,272 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:57:28,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:57:28,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-07 12:57:28,273 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:57:28,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 12:57:28,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 12:57:28,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-07 12:57:28,274 INFO L87 Difference]: Start difference. First operand 2152 states and 2889 transitions. Second operand 18 states. [2018-11-07 12:57:46,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:57:46,189 INFO L93 Difference]: Finished difference Result 5055 states and 6869 transitions. [2018-11-07 12:57:46,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 12:57:46,189 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 186 [2018-11-07 12:57:46,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:57:46,202 INFO L225 Difference]: With dead ends: 5055 [2018-11-07 12:57:46,202 INFO L226 Difference]: Without dead ends: 2909 [2018-11-07 12:57:46,209 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 200 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 12:57:46,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2018-11-07 12:57:46,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 2899. [2018-11-07 12:57:46,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2899 states. [2018-11-07 12:57:46,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2899 states to 2899 states and 3786 transitions. [2018-11-07 12:57:46,280 INFO L78 Accepts]: Start accepts. Automaton has 2899 states and 3786 transitions. Word has length 186 [2018-11-07 12:57:46,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:57:46,281 INFO L480 AbstractCegarLoop]: Abstraction has 2899 states and 3786 transitions. [2018-11-07 12:57:46,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 12:57:46,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2899 states and 3786 transitions. [2018-11-07 12:57:46,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-07 12:57:46,290 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:57:46,291 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] [2018-11-07 12:57:46,291 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:57:46,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:57:46,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1298981372, now seen corresponding path program 1 times [2018-11-07 12:57:46,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:57:46,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:46,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:57:46,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:57:46,293 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:57:46,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:57:46,495 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:57:46,632 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 85 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:57:46,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:57:46,632 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:57:46,633 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 189 with the following transitions: [2018-11-07 12:57:46,633 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], [607], [609], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:57:46,637 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:57:46,638 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:57:47,140 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:57:47,141 INFO L272 AbstractInterpreter]: Visited 123 different actions 365 times. Merged at 7 different actions 20 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 12:57:47,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:57:47,152 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:57:47,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:57:47,152 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:57:47,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:57:47,167 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:57:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:57:47,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:57:47,533 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 12:57:47,534 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:57:47,799 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 12:57:47,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:57:47,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2018-11-07 12:57:47,821 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:57:47,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 12:57:47,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 12:57:47,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-11-07 12:57:47,823 INFO L87 Difference]: Start difference. First operand 2899 states and 3786 transitions. Second operand 14 states. [2018-11-07 12:57:48,458 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-11-07 12:57:52,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:57:52,855 INFO L93 Difference]: Finished difference Result 8790 states and 12022 transitions. [2018-11-07 12:57:52,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 12:57:52,864 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 188 [2018-11-07 12:57:52,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:57:52,864 INFO L225 Difference]: With dead ends: 8790 [2018-11-07 12:57:52,865 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 12:57:52,887 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 388 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 12:57:52,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 12:57:52,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 12:57:52,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 12:57:52,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 12:57:52,888 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2018-11-07 12:57:52,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:57:52,889 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 12:57:52,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 12:57:52,889 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 12:57:52,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 12:57:52,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 12:57:53,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:57:53,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:57:53,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:57:53,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:57:53,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:57:53,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:57:53,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:57:53,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:57:53,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:57:53,275 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2018-11-07 12:57:55,263 WARN L179 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 210 DAG size of output: 94 [2018-11-07 12:57:55,479 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 47 [2018-11-07 12:57:56,193 WARN L179 SmtUtils]: Spent 711.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 47 [2018-11-07 12:57:56,196 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:57:56,196 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a17~0)| ~a17~0) (= |old(~a25~0)| ~a25~0) (= ~a28~0 |old(~a28~0)|)) [2018-11-07 12:57:56,196 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:57:56,196 INFO L425 ceAbstractionStarter]: For program point L564(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,196 INFO L425 ceAbstractionStarter]: For program point L531(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,196 INFO L425 ceAbstractionStarter]: For program point L498(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,196 INFO L425 ceAbstractionStarter]: For program point L465(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,197 INFO L425 ceAbstractionStarter]: For program point L432(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,197 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-07 12:57:56,197 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-07 12:57:56,197 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-07 12:57:56,197 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-07 12:57:56,197 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-07 12:57:56,197 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-07 12:57:56,197 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-07 12:57:56,197 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-07 12:57:56,198 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-07 12:57:56,198 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-07 12:57:56,198 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 502) no Hoare annotation was computed. [2018-11-07 12:57:56,198 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-07 12:57:56,198 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-07 12:57:56,198 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-07 12:57:56,198 INFO L425 ceAbstractionStarter]: For program point L567(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,198 INFO L425 ceAbstractionStarter]: For program point L534(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,198 INFO L425 ceAbstractionStarter]: For program point L468(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,198 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,199 INFO L425 ceAbstractionStarter]: For program point L435(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,199 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-07 12:57:56,199 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-07 12:57:56,199 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-07 12:57:56,199 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-07 12:57:56,199 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-07 12:57:56,199 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-07 12:57:56,199 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-07 12:57:56,199 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-07 12:57:56,200 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-07 12:57:56,200 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-07 12:57:56,200 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-07 12:57:56,200 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-07 12:57:56,200 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-07 12:57:56,200 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-07 12:57:56,200 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-07 12:57:56,200 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-07 12:57:56,201 INFO L425 ceAbstractionStarter]: For program point L570(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,201 INFO L425 ceAbstractionStarter]: For program point L537(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,201 INFO L425 ceAbstractionStarter]: For program point L504(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,201 INFO L425 ceAbstractionStarter]: For program point L471(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,201 INFO L425 ceAbstractionStarter]: For program point L438(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,201 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-07 12:57:56,201 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-07 12:57:56,201 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-07 12:57:56,201 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-07 12:57:56,202 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-07 12:57:56,202 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-07 12:57:56,202 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-07 12:57:56,202 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-07 12:57:56,202 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-07 12:57:56,202 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-07 12:57:56,202 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-07 12:57:56,202 INFO L425 ceAbstractionStarter]: For program point L573(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,203 INFO L425 ceAbstractionStarter]: For program point L540(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,203 INFO L425 ceAbstractionStarter]: For program point L507(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,203 INFO L425 ceAbstractionStarter]: For program point L474(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,203 INFO L425 ceAbstractionStarter]: For program point L441(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,203 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-07 12:57:56,203 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-07 12:57:56,203 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-07 12:57:56,203 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-07 12:57:56,203 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-07 12:57:56,204 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-07 12:57:56,204 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-07 12:57:56,204 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-07 12:57:56,204 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-07 12:57:56,204 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-07 12:57:56,204 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-07 12:57:56,204 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-07 12:57:56,204 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-07 12:57:56,204 INFO L425 ceAbstractionStarter]: For program point L576(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,205 INFO L425 ceAbstractionStarter]: For program point L543(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,205 INFO L425 ceAbstractionStarter]: For program point L510(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,205 INFO L425 ceAbstractionStarter]: For program point L477(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,205 INFO L425 ceAbstractionStarter]: For program point L444(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,205 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-07 12:57:56,205 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-07 12:57:56,205 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-07 12:57:56,205 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-07 12:57:56,206 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-07 12:57:56,206 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-07 12:57:56,206 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-07 12:57:56,206 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-07 12:57:56,206 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-07 12:57:56,206 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-07 12:57:56,206 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-07 12:57:56,206 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-07 12:57:56,206 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-07 12:57:56,207 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-07 12:57:56,207 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-07 12:57:56,207 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-07 12:57:56,207 INFO L425 ceAbstractionStarter]: For program point L579(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,207 INFO L425 ceAbstractionStarter]: For program point L546(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,207 INFO L425 ceAbstractionStarter]: For program point L513(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,207 INFO L425 ceAbstractionStarter]: For program point L480(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,207 INFO L425 ceAbstractionStarter]: For program point L447(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,208 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-07 12:57:56,208 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-07 12:57:56,208 INFO L425 ceAbstractionStarter]: For program point L414-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,208 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-07 12:57:56,208 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-07 12:57:56,208 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-07 12:57:56,208 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,208 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,209 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-07 12:57:56,209 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-07 12:57:56,209 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-07 12:57:56,209 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-07 12:57:56,209 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-07 12:57:56,209 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-07 12:57:56,209 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-07 12:57:56,209 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-07 12:57:56,210 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-07 12:57:56,210 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-07 12:57:56,210 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-07 12:57:56,210 INFO L425 ceAbstractionStarter]: For program point L582(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,210 INFO L425 ceAbstractionStarter]: For program point L549(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,210 INFO L425 ceAbstractionStarter]: For program point L516(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,210 INFO L425 ceAbstractionStarter]: For program point L483(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,210 INFO L425 ceAbstractionStarter]: For program point L450(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,210 INFO L425 ceAbstractionStarter]: For program point L417(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,210 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-07 12:57:56,211 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-07 12:57:56,211 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-07 12:57:56,211 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-07 12:57:56,211 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-07 12:57:56,211 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-07 12:57:56,211 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-07 12:57:56,211 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-07 12:57:56,211 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-07 12:57:56,211 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-07 12:57:56,212 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-07 12:57:56,212 INFO L425 ceAbstractionStarter]: For program point L585(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,212 INFO L425 ceAbstractionStarter]: For program point L552(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,212 INFO L425 ceAbstractionStarter]: For program point L519(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,212 INFO L425 ceAbstractionStarter]: For program point L486(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,212 INFO L425 ceAbstractionStarter]: For program point L453(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,212 INFO L425 ceAbstractionStarter]: For program point L420(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,212 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-07 12:57:56,212 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-07 12:57:56,212 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-07 12:57:56,213 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-07 12:57:56,213 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-07 12:57:56,213 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-07 12:57:56,213 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-07 12:57:56,213 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-07 12:57:56,213 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-07 12:57:56,213 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-07 12:57:56,213 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-07 12:57:56,213 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-07 12:57:56,214 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-07 12:57:56,214 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-07 12:57:56,214 INFO L425 ceAbstractionStarter]: For program point L588(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,214 INFO L425 ceAbstractionStarter]: For program point L555(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,214 INFO L425 ceAbstractionStarter]: For program point L522(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,214 INFO L425 ceAbstractionStarter]: For program point L489(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,215 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse19 (= |old(~a17~0)| ~a17~0)) (.cse20 (= |old(~a25~0)| ~a25~0)) (.cse21 (= ~a28~0 |old(~a28~0)|)) (.cse6 (= 1 |old(~a11~0)|)) (.cse16 (= 1 |old(~a19~0)|)) (.cse17 (= 1 |old(~a25~0)|)) (.cse11 (= 1 ~a11~0)) (.cse12 (= 1 ~a19~0))) (let ((.cse0 (and .cse11 .cse12)) (.cse2 (not .cse17)) (.cse3 (not .cse16)) (.cse10 (not (= 7 |old(~a28~0)|))) (.cse4 (not (= 8 |old(~a17~0)|))) (.cse5 (not .cse6)) (.cse13 (= 9 |old(~a28~0)|)) (.cse8 (not (= ~a11~0 1))) (.cse15 (not (= |old(~a17~0)| 8))) (.cse18 (and .cse19 .cse20 .cse21)) (.cse1 (not (= 1 ~a21~0))) (.cse7 (= 8 |old(~a28~0)|)) (.cse9 (< 7 |old(~a17~0)|))) (and (or .cse0 .cse1 (not (= 10 |old(~a28~0)|)) .cse2 .cse3 .cse4 .cse5) (or .cse1 .cse6 .cse7 .cse8 .cse9) (or .cse1 .cse10 .cse2 .cse3 .cse5 .cse0 (not (= 7 |old(~a17~0)|))) (or .cse1 .cse2 .cse3 .cse4 (and .cse11 (= 1 ~a25~0) (= 9 ~a28~0) (= 8 ~a17~0) .cse12) (not .cse13) .cse5) (or (< 6 |calculate_output_#in~input|) (let ((.cse14 (not (= 0 |old(~a11~0)|)))) (and (or .cse1 .cse14 (not (= 0 |old(~a25~0)|))) (or .cse1 (< |old(~a28~0)| 8) .cse14))) (< |old(~a25~0)| 0) (< |old(~a28~0)| 7) (and (= ~a11~0 0) (= ~a19~0 1)) .cse3 (< 1 |old(~a25~0)|) (< 11 |old(~a28~0)|) .cse15 (< |calculate_output_#in~input| 1)) (or .cse16 .cse1 .cse10 .cse4 (and .cse11 (not .cse12)) .cse5 .cse17) (or .cse1 .cse7 .cse18 .cse13 .cse15) (or .cse1 .cse6 (and .cse19 .cse20 .cse21 .cse8) .cse15) (or .cse1 .cse7 .cse18 .cse15 .cse17) (or .cse18 .cse1 .cse7 .cse9)))) [2018-11-07 12:57:56,215 INFO L425 ceAbstractionStarter]: For program point L456(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,215 INFO L425 ceAbstractionStarter]: For program point L423(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,215 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-07 12:57:56,215 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-07 12:57:56,215 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-07 12:57:56,215 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-07 12:57:56,215 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-07 12:57:56,216 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-07 12:57:56,216 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-07 12:57:56,216 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-07 12:57:56,216 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-07 12:57:56,216 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-07 12:57:56,216 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-07 12:57:56,216 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-07 12:57:56,216 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-07 12:57:56,216 INFO L425 ceAbstractionStarter]: For program point L591(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,217 INFO L425 ceAbstractionStarter]: For program point L558(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,217 INFO L425 ceAbstractionStarter]: For program point L525(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,217 INFO L425 ceAbstractionStarter]: For program point L492(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,217 INFO L425 ceAbstractionStarter]: For program point L459(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,217 INFO L425 ceAbstractionStarter]: For program point L426(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,217 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-07 12:57:56,217 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-07 12:57:56,217 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-07 12:57:56,217 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-07 12:57:56,218 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-07 12:57:56,218 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-07 12:57:56,218 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-07 12:57:56,218 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-07 12:57:56,218 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-07 12:57:56,218 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-07 12:57:56,218 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-07 12:57:56,218 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-07 12:57:56,218 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-07 12:57:56,218 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-07 12:57:56,219 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-07 12:57:56,219 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 596) no Hoare annotation was computed. [2018-11-07 12:57:56,219 INFO L425 ceAbstractionStarter]: For program point L561(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,219 INFO L425 ceAbstractionStarter]: For program point L528(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,219 INFO L425 ceAbstractionStarter]: For program point L495(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,219 INFO L425 ceAbstractionStarter]: For program point L462(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,219 INFO L425 ceAbstractionStarter]: For program point L429(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:57:56,219 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-07 12:57:56,220 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-07 12:57:56,220 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-07 12:57:56,220 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-07 12:57:56,220 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-07 12:57:56,220 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-07 12:57:56,220 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-07 12:57:56,220 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-07 12:57:56,220 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-07 12:57:56,220 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-07 12:57:56,221 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-07 12:57:56,221 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-07 12:57:56,221 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-07 12:57:56,221 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-07 12:57:56,221 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-07 12:57:56,221 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-07 12:57:56,221 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-07 12:57:56,221 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-07 12:57:56,222 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-07 12:57:56,222 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:57:56,222 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 7) (= ~a21~0 1)) [2018-11-07 12:57:56,222 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 12:57:56,222 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:57:56,222 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 1 |old(~a19~0)|)) (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|))) [2018-11-07 12:57:56,223 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-07 12:57:56,223 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse0 (not (= ~a28~0 8))) (.cse1 (= |old(~a17~0)| ~a17~0))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (and (<= ~a17~0 7) .cse0) (not (= 0 |old(~a11~0)|)) (and (= 9 ~a28~0) (= 8 ~a17~0) (= 1 ~a19~0)) (not (= 0 |old(~a25~0)|)) (and .cse1 .cse0 (not (= ~a28~0 9))) (not (= 1 |old(~a19~0)|)) (and (not (= ~a25~0 1)) .cse1 .cse0) (not (= 8 |old(~a17~0)|)) (and .cse1 (not (= ~a11~0 1))))) [2018-11-07 12:57:56,223 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-07 12:57:56,223 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-07 12:57:56,223 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse1 (= |old(~a17~0)| ~a17~0)) (.cse0 (not (= ~a28~0 8)))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (and (<= ~a17~0 7) .cse0) (not (= 0 |old(~a11~0)|)) (and (= 9 ~a28~0) (= 8 ~a17~0) (= 1 ~a19~0)) (not (= 0 |old(~a25~0)|)) (and .cse1 (not (= ~a11~0 1))) (and .cse1 .cse0 (not (= ~a28~0 9))) (not (= 1 |old(~a19~0)|)) (and (not (= ~a25~0 1)) .cse1 .cse0) (not (= 8 |old(~a17~0)|)))) [2018-11-07 12:57:56,223 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-07 12:57:56,223 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-07 12:57:56,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:57:56 BoogieIcfgContainer [2018-11-07 12:57:56,236 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 12:57:56,237 INFO L168 Benchmark]: Toolchain (without parser) took 70523.23 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -926.1 MB). Peak memory consumption was 968.7 MB. Max. memory is 7.1 GB. [2018-11-07 12:57:56,238 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 12:57:56,239 INFO L168 Benchmark]: CACSL2BoogieTranslator took 787.73 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-07 12:57:56,239 INFO L168 Benchmark]: Boogie Procedure Inliner took 131.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -815.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. [2018-11-07 12:57:56,240 INFO L168 Benchmark]: Boogie Preprocessor took 101.77 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 12:57:56,241 INFO L168 Benchmark]: RCFGBuilder took 3313.22 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.2 MB). Peak memory consumption was 104.2 MB. Max. memory is 7.1 GB. [2018-11-07 12:57:56,241 INFO L168 Benchmark]: TraceAbstraction took 66184.45 ms. Allocated memory was 2.3 GB in the beginning and 3.4 GB in the end (delta: 1.2 GB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -247.0 MB). Peak memory consumption was 909.0 MB. Max. memory is 7.1 GB. [2018-11-07 12:57:56,246 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 787.73 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 131.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -815.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 101.77 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3313.22 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.2 MB). Peak memory consumption was 104.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 66184.45 ms. Allocated memory was 2.3 GB in the beginning and 3.4 GB in the end (delta: 1.2 GB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -247.0 MB). Peak memory consumption was 909.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 502]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((!(1 == a21) || !(7 == \old(a28))) || (a17 <= 7 && !(a28 == 8))) || !(0 == \old(a11))) || ((9 == a28 && 8 == a17) && 1 == a19)) || !(0 == \old(a25))) || ((\old(a17) == a17 && !(a28 == 8)) && !(a28 == 9))) || !(1 == \old(a19))) || ((!(a25 == 1) && \old(a17) == a17) && !(a28 == 8))) || !(8 == \old(a17))) || (\old(a17) == a17 && !(a11 == 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 66.0s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 52.7s AutomataDifference, 0.0s DeadEndRemovalTime, 3.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1369 SDtfs, 8885 SDslu, 2248 SDs, 0 SdLazy, 13258 SolverSat, 2085 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.0s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 873 GetRequests, 745 SyntacticMatches, 8 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2899occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.1s AbstIntTime, 3 AbstIntIterations, 2 AbstIntStrong, 0.9976481335593377 AbsIntWeakeningRatio, 0.1880108991825613 AbsIntAvgWeakeningVarsNumRemoved, 26.337874659400544 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 62 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 102 PreInvPairs, 182 NumberOfFragments, 542 HoareAnnotationTreeSize, 102 FomulaSimplifications, 5932 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 4848 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1694 NumberOfCodeBlocks, 1694 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1870 ConstructedInterpolants, 0 QuantifiedInterpolants, 1434393 SizeOfPredicates, 0 NumberOfNonLiveVariables, 497 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 581/617 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...