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-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label53_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 07:06:30,705 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 07:06:30,708 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 07:06:30,722 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 07:06:30,722 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 07:06:30,723 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 07:06:30,725 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 07:06:30,727 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 07:06:30,728 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 07:06:30,731 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 07:06:30,732 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 07:06:30,733 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 07:06:30,733 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 07:06:30,734 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 07:06:30,740 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 07:06:30,741 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 07:06:30,745 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 07:06:30,747 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 07:06:30,751 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 07:06:30,755 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 07:06:30,756 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 07:06:30,757 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 07:06:30,760 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 07:06:30,761 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 07:06:30,761 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 07:06:30,762 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 07:06:30,762 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 07:06:30,763 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 07:06:30,764 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 07:06:30,765 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 07:06:30,765 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 07:06:30,766 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 07:06:30,766 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 07:06:30,766 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 07:06:30,769 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 07:06:30,769 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 07:06:30,770 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 07:06:30,798 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 07:06:30,798 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 07:06:30,799 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 07:06:30,800 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 07:06:30,803 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 07:06:30,803 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 07:06:30,803 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 07:06:30,803 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 07:06:30,804 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 07:06:30,804 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 07:06:30,804 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 07:06:30,804 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 07:06:30,804 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 07:06:30,805 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 07:06:30,806 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 07:06:30,806 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 07:06:30,806 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 07:06:30,806 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 07:06:30,807 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 07:06:30,807 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 07:06:30,807 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 07:06:30,807 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 07:06:30,808 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 07:06:30,809 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 07:06:30,809 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 07:06:30,810 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 07:06:30,810 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 07:06:30,810 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 07:06:30,810 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 07:06:30,810 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 07:06:30,811 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 07:06:30,811 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 07:06:30,811 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 07:06:30,811 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 07:06:30,811 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 07:06:30,812 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 07:06:30,875 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 07:06:30,895 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 07:06:30,899 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 07:06:30,900 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 07:06:30,901 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 07:06:30,902 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label53_true-unreach-call_false-termination.c [2018-11-07 07:06:30,966 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b5248767/da385d3f558c49b38db30998a1334887/FLAGb4d63d54d [2018-11-07 07:06:31,581 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 07:06:31,584 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label53_true-unreach-call_false-termination.c [2018-11-07 07:06:31,600 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b5248767/da385d3f558c49b38db30998a1334887/FLAGb4d63d54d [2018-11-07 07:06:31,614 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b5248767/da385d3f558c49b38db30998a1334887 [2018-11-07 07:06:31,627 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 07:06:31,629 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 07:06:31,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 07:06:31,632 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 07:06:31,637 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 07:06:31,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:06:31" (1/1) ... [2018-11-07 07:06:31,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eb2a5c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:31, skipping insertion in model container [2018-11-07 07:06:31,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:06:31" (1/1) ... [2018-11-07 07:06:31,652 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 07:06:31,731 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 07:06:32,286 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 07:06:32,291 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 07:06:32,410 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 07:06:32,428 INFO L193 MainTranslator]: Completed translation [2018-11-07 07:06:32,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:32 WrapperNode [2018-11-07 07:06:32,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 07:06:32,429 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 07:06:32,429 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 07:06:32,429 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 07:06:32,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:32" (1/1) ... [2018-11-07 07:06:32,546 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:32" (1/1) ... [2018-11-07 07:06:32,560 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 07:06:32,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 07:06:32,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 07:06:32,561 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 07:06:32,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:32" (1/1) ... [2018-11-07 07:06:32,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:32" (1/1) ... [2018-11-07 07:06:32,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:32" (1/1) ... [2018-11-07 07:06:32,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:32" (1/1) ... [2018-11-07 07:06:32,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:32" (1/1) ... [2018-11-07 07:06:32,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:32" (1/1) ... [2018-11-07 07:06:32,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:32" (1/1) ... [2018-11-07 07:06:32,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 07:06:32,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 07:06:32,653 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 07:06:32,653 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 07:06:32,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:32" (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 07:06:32,720 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 07:06:32,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 07:06:32,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 07:06:32,721 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 07:06:32,721 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 07:06:32,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 07:06:32,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 07:06:32,722 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 07:06:32,722 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 07:06:35,773 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 07:06:35,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:06:35 BoogieIcfgContainer [2018-11-07 07:06:35,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 07:06:35,775 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 07:06:35,775 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 07:06:35,779 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 07:06:35,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:06:31" (1/3) ... [2018-11-07 07:06:35,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115fe8da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:06:35, skipping insertion in model container [2018-11-07 07:06:35,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:06:32" (2/3) ... [2018-11-07 07:06:35,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115fe8da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:06:35, skipping insertion in model container [2018-11-07 07:06:35,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:06:35" (3/3) ... [2018-11-07 07:06:35,783 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label53_true-unreach-call_false-termination.c [2018-11-07 07:06:35,792 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 07:06:35,800 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 07:06:35,814 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 07:06:35,855 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 07:06:35,856 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 07:06:35,856 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 07:06:35,856 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 07:06:35,856 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 07:06:35,856 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 07:06:35,857 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 07:06:35,857 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 07:06:35,886 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-07 07:06:35,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-07 07:06:35,900 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:06:35,902 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:06:35,905 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:06:35,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:35,912 INFO L82 PathProgramCache]: Analyzing trace with hash 311071925, now seen corresponding path program 1 times [2018-11-07 07:06:35,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:06:35,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:35,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:35,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:35,970 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:06:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:36,604 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 07:06:36,765 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 07:06:36,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:06:36,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 07:06:36,768 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:06:36,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:06:36,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:06:36,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:06:36,796 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-07 07:06:38,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:06:38,151 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-07 07:06:38,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:06:38,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2018-11-07 07:06:38,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:06:38,173 INFO L225 Difference]: With dead ends: 550 [2018-11-07 07:06:38,173 INFO L226 Difference]: Without dead ends: 340 [2018-11-07 07:06:38,180 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 07:06:38,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-07 07:06:38,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-07 07:06:38,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-07 07:06:38,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-11-07 07:06:38,254 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 121 [2018-11-07 07:06:38,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:06:38,256 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-11-07 07:06:38,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:06:38,256 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-11-07 07:06:38,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-07 07:06:38,262 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:06:38,263 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:06:38,263 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:06:38,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:38,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1224558518, now seen corresponding path program 1 times [2018-11-07 07:06:38,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:06:38,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:38,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:38,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:38,266 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:06:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:38,497 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:06:38,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:06:38,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 07:06:38,498 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:06:38,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 07:06:38,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 07:06:38,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 07:06:38,501 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-11-07 07:06:40,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:06:40,535 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-11-07 07:06:40,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 07:06:40,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2018-11-07 07:06:40,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:06:40,544 INFO L225 Difference]: With dead ends: 888 [2018-11-07 07:06:40,544 INFO L226 Difference]: Without dead ends: 554 [2018-11-07 07:06:40,548 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:06:40,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-07 07:06:40,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-11-07 07:06:40,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-11-07 07:06:40,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-11-07 07:06:40,592 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 132 [2018-11-07 07:06:40,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:06:40,593 INFO L480 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-11-07 07:06:40,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 07:06:40,593 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-11-07 07:06:40,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-07 07:06:40,597 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:06:40,597 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:06:40,597 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:06:40,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:40,598 INFO L82 PathProgramCache]: Analyzing trace with hash 408720354, now seen corresponding path program 1 times [2018-11-07 07:06:40,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:06:40,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:40,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:40,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:40,600 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:06:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:41,192 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-07 07:06:41,455 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:06:41,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:06:41,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 07:06:41,456 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:06:41,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 07:06:41,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 07:06:41,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:06:41,458 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 5 states. [2018-11-07 07:06:43,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:06:43,747 INFO L93 Difference]: Finished difference Result 1210 states and 1896 transitions. [2018-11-07 07:06:43,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 07:06:43,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2018-11-07 07:06:43,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:06:43,755 INFO L225 Difference]: With dead ends: 1210 [2018-11-07 07:06:43,756 INFO L226 Difference]: Without dead ends: 536 [2018-11-07 07:06:43,759 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:06:43,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-11-07 07:06:43,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2018-11-07 07:06:43,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-11-07 07:06:43,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 787 transitions. [2018-11-07 07:06:43,804 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 787 transitions. Word has length 133 [2018-11-07 07:06:43,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:06:43,804 INFO L480 AbstractCegarLoop]: Abstraction has 536 states and 787 transitions. [2018-11-07 07:06:43,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 07:06:43,804 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 787 transitions. [2018-11-07 07:06:43,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-07 07:06:43,809 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:06:43,810 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:06:43,810 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:06:43,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:43,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1676803526, now seen corresponding path program 1 times [2018-11-07 07:06:43,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:06:43,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:43,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:43,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:43,812 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:06:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:44,288 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-11-07 07:06:44,557 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-11-07 07:06:44,665 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:06:44,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:06:44,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 07:06:44,665 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:06:44,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 07:06:44,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 07:06:44,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:06:44,666 INFO L87 Difference]: Start difference. First operand 536 states and 787 transitions. Second operand 5 states. [2018-11-07 07:06:46,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:06:46,477 INFO L93 Difference]: Finished difference Result 1204 states and 1799 transitions. [2018-11-07 07:06:46,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 07:06:46,478 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2018-11-07 07:06:46,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:06:46,482 INFO L225 Difference]: With dead ends: 1204 [2018-11-07 07:06:46,482 INFO L226 Difference]: Without dead ends: 535 [2018-11-07 07:06:46,485 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:06:46,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-11-07 07:06:46,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2018-11-07 07:06:46,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-11-07 07:06:46,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 782 transitions. [2018-11-07 07:06:46,510 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 782 transitions. Word has length 134 [2018-11-07 07:06:46,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:06:46,511 INFO L480 AbstractCegarLoop]: Abstraction has 535 states and 782 transitions. [2018-11-07 07:06:46,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 07:06:46,511 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 782 transitions. [2018-11-07 07:06:46,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-07 07:06:46,514 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:06:46,514 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:06:46,514 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:06:46,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:46,515 INFO L82 PathProgramCache]: Analyzing trace with hash 468681710, now seen corresponding path program 1 times [2018-11-07 07:06:46,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:06:46,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:46,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:46,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:46,516 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:06:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:46,805 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:06:46,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:06:46,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 07:06:46,806 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:06:46,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:06:46,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:06:46,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:06:46,807 INFO L87 Difference]: Start difference. First operand 535 states and 782 transitions. Second operand 3 states. [2018-11-07 07:06:48,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:06:48,465 INFO L93 Difference]: Finished difference Result 1521 states and 2300 transitions. [2018-11-07 07:06:48,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:06:48,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2018-11-07 07:06:48,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:06:48,473 INFO L225 Difference]: With dead ends: 1521 [2018-11-07 07:06:48,473 INFO L226 Difference]: Without dead ends: 992 [2018-11-07 07:06:48,476 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:06:48,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-11-07 07:06:48,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2018-11-07 07:06:48,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-11-07 07:06:48,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1411 transitions. [2018-11-07 07:06:48,508 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1411 transitions. Word has length 139 [2018-11-07 07:06:48,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:06:48,509 INFO L480 AbstractCegarLoop]: Abstraction has 992 states and 1411 transitions. [2018-11-07 07:06:48,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:06:48,509 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1411 transitions. [2018-11-07 07:06:48,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-07 07:06:48,513 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:06:48,514 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:06:48,514 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:06:48,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:48,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1975800262, now seen corresponding path program 1 times [2018-11-07 07:06:48,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:06:48,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:48,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:48,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:48,516 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:06:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:48,710 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:06:48,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:06:48,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 07:06:48,710 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:06:48,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 07:06:48,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 07:06:48,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 07:06:48,711 INFO L87 Difference]: Start difference. First operand 992 states and 1411 transitions. Second operand 6 states. [2018-11-07 07:06:49,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:06:49,681 INFO L93 Difference]: Finished difference Result 2947 states and 4374 transitions. [2018-11-07 07:06:49,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 07:06:49,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2018-11-07 07:06:49,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:06:49,696 INFO L225 Difference]: With dead ends: 2947 [2018-11-07 07:06:49,696 INFO L226 Difference]: Without dead ends: 1961 [2018-11-07 07:06:49,704 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:06:49,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2018-11-07 07:06:49,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1928. [2018-11-07 07:06:49,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-11-07 07:06:49,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2554 transitions. [2018-11-07 07:06:49,773 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2554 transitions. Word has length 140 [2018-11-07 07:06:49,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:06:49,773 INFO L480 AbstractCegarLoop]: Abstraction has 1928 states and 2554 transitions. [2018-11-07 07:06:49,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 07:06:49,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2554 transitions. [2018-11-07 07:06:49,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-07 07:06:49,781 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:06:49,781 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:06:49,782 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:06:49,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:49,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1294574634, now seen corresponding path program 1 times [2018-11-07 07:06:49,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:06:49,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:49,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:49,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:49,784 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:06:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:50,014 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 07:06:50,062 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 07:06:50,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:06:50,063 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:06:50,064 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2018-11-07 07:06:50,066 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [77], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:06:50,121 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:06:50,121 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:06:50,850 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:06:50,852 INFO L272 AbstractInterpreter]: Visited 121 different actions 121 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-11-07 07:06:50,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:50,910 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:06:51,407 INFO L227 lantSequenceWeakener]: Weakened 142 states. On average, predicates are now at 80.49% of their original sizes. [2018-11-07 07:06:51,407 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:06:51,647 INFO L415 sIntCurrentIteration]: We unified 147 AI predicates to 147 [2018-11-07 07:06:51,648 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:06:51,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:06:51,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2018-11-07 07:06:51,649 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:06:51,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 07:06:51,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 07:06:51,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 07:06:51,650 INFO L87 Difference]: Start difference. First operand 1928 states and 2554 transitions. Second operand 6 states. [2018-11-07 07:07:02,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:07:02,644 INFO L93 Difference]: Finished difference Result 3988 states and 5280 transitions. [2018-11-07 07:07:02,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 07:07:02,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2018-11-07 07:07:02,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:07:02,656 INFO L225 Difference]: With dead ends: 3988 [2018-11-07 07:07:02,656 INFO L226 Difference]: Without dead ends: 2066 [2018-11-07 07:07:02,663 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 07:07:02,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2018-11-07 07:07:02,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 2064. [2018-11-07 07:07:02,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2064 states. [2018-11-07 07:07:02,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 2696 transitions. [2018-11-07 07:07:02,729 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 2696 transitions. Word has length 148 [2018-11-07 07:07:02,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:07:02,730 INFO L480 AbstractCegarLoop]: Abstraction has 2064 states and 2696 transitions. [2018-11-07 07:07:02,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 07:07:02,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 2696 transitions. [2018-11-07 07:07:02,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-07 07:07:02,738 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:07:02,739 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:07:02,739 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:07:02,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:07:02,740 INFO L82 PathProgramCache]: Analyzing trace with hash 430394681, now seen corresponding path program 1 times [2018-11-07 07:07:02,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:07:02,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:02,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:07:02,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:02,741 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:07:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:07:03,038 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:07:03,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:07:03,039 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:07:03,039 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 158 with the following transitions: [2018-11-07 07:07:03,040 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [77], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:07:03,047 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:07:03,047 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:07:03,403 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:07:03,404 INFO L272 AbstractInterpreter]: Visited 125 different actions 244 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 07:07:03,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:07:03,415 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:07:03,634 INFO L227 lantSequenceWeakener]: Weakened 154 states. On average, predicates are now at 81.94% of their original sizes. [2018-11-07 07:07:03,635 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:07:04,134 INFO L415 sIntCurrentIteration]: We unified 156 AI predicates to 156 [2018-11-07 07:07:04,134 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:07:04,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:07:04,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-07 07:07:04,135 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:07:04,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 07:07:04,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 07:07:04,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:07:04,136 INFO L87 Difference]: Start difference. First operand 2064 states and 2696 transitions. Second operand 10 states. [2018-11-07 07:07:11,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:07:11,314 INFO L93 Difference]: Finished difference Result 4127 states and 5425 transitions. [2018-11-07 07:07:11,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 07:07:11,314 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 157 [2018-11-07 07:07:11,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:07:11,326 INFO L225 Difference]: With dead ends: 4127 [2018-11-07 07:07:11,326 INFO L226 Difference]: Without dead ends: 2205 [2018-11-07 07:07:11,332 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 164 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-11-07 07:07:11,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2018-11-07 07:07:11,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 2202. [2018-11-07 07:07:11,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2018-11-07 07:07:11,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 2844 transitions. [2018-11-07 07:07:11,397 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 2844 transitions. Word has length 157 [2018-11-07 07:07:11,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:07:11,397 INFO L480 AbstractCegarLoop]: Abstraction has 2202 states and 2844 transitions. [2018-11-07 07:07:11,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 07:07:11,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 2844 transitions. [2018-11-07 07:07:11,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-07 07:07:11,407 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:07:11,408 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:07:11,408 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:07:11,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:07:11,408 INFO L82 PathProgramCache]: Analyzing trace with hash 949105357, now seen corresponding path program 1 times [2018-11-07 07:07:11,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:07:11,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:11,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:07:11,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:11,410 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:07:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:07:11,652 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 88 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:07:11,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:07:11,653 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:07:11,653 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2018-11-07 07:07:11,653 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [77], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:07:11,659 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:07:11,659 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:07:11,829 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:07:11,829 INFO L272 AbstractInterpreter]: Visited 125 different actions 244 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 07:07:11,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:07:11,835 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:07:12,085 INFO L227 lantSequenceWeakener]: Weakened 187 states. On average, predicates are now at 81.88% of their original sizes. [2018-11-07 07:07:12,086 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:07:12,299 INFO L415 sIntCurrentIteration]: We unified 189 AI predicates to 189 [2018-11-07 07:07:12,300 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:07:12,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:07:12,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-07 07:07:12,300 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:07:12,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 07:07:12,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 07:07:12,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:07:12,302 INFO L87 Difference]: Start difference. First operand 2202 states and 2844 transitions. Second operand 10 states. [2018-11-07 07:07:17,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:07:17,419 INFO L93 Difference]: Finished difference Result 4541 states and 5909 transitions. [2018-11-07 07:07:17,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 07:07:17,420 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 190 [2018-11-07 07:07:17,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:07:17,432 INFO L225 Difference]: With dead ends: 4541 [2018-11-07 07:07:17,432 INFO L226 Difference]: Without dead ends: 2619 [2018-11-07 07:07:17,439 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 198 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-11-07 07:07:17,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2619 states. [2018-11-07 07:07:17,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2619 to 2616. [2018-11-07 07:07:17,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2616 states. [2018-11-07 07:07:17,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2616 states to 2616 states and 3280 transitions. [2018-11-07 07:07:17,513 INFO L78 Accepts]: Start accepts. Automaton has 2616 states and 3280 transitions. Word has length 190 [2018-11-07 07:07:17,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:07:17,514 INFO L480 AbstractCegarLoop]: Abstraction has 2616 states and 3280 transitions. [2018-11-07 07:07:17,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 07:07:17,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 3280 transitions. [2018-11-07 07:07:17,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-07 07:07:17,524 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:07:17,524 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2018-11-07 07:07:17,525 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:07:17,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:07:17,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1559476336, now seen corresponding path program 1 times [2018-11-07 07:07:17,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:07:17,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:17,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:07:17,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:17,527 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:07:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:07:18,156 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 75 proven. 32 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 07:07:18,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:07:18,156 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:07:18,157 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 200 with the following transitions: [2018-11-07 07:07:18,157 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [77], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:07:18,167 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:07:18,168 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:07:18,471 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:07:18,472 INFO L272 AbstractInterpreter]: Visited 126 different actions 379 times. Merged at 8 different actions 23 times. Never widened. Found 5 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 07:07:18,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:07:18,509 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:07:18,912 INFO L227 lantSequenceWeakener]: Weakened 196 states. On average, predicates are now at 83.61% of their original sizes. [2018-11-07 07:07:18,912 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:07:19,548 INFO L415 sIntCurrentIteration]: We unified 198 AI predicates to 198 [2018-11-07 07:07:19,549 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:07:19,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:07:19,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2018-11-07 07:07:19,549 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:07:19,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 07:07:19,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 07:07:19,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:07:19,551 INFO L87 Difference]: Start difference. First operand 2616 states and 3280 transitions. Second operand 9 states. [2018-11-07 07:07:25,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:07:25,323 INFO L93 Difference]: Finished difference Result 5384 states and 6927 transitions. [2018-11-07 07:07:25,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 07:07:25,324 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 199 [2018-11-07 07:07:25,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:07:25,340 INFO L225 Difference]: With dead ends: 5384 [2018-11-07 07:07:25,340 INFO L226 Difference]: Without dead ends: 3462 [2018-11-07 07:07:25,348 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 204 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-11-07 07:07:25,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3462 states. [2018-11-07 07:07:25,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3462 to 3449. [2018-11-07 07:07:25,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3449 states. [2018-11-07 07:07:25,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3449 states to 3449 states and 4292 transitions. [2018-11-07 07:07:25,450 INFO L78 Accepts]: Start accepts. Automaton has 3449 states and 4292 transitions. Word has length 199 [2018-11-07 07:07:25,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:07:25,451 INFO L480 AbstractCegarLoop]: Abstraction has 3449 states and 4292 transitions. [2018-11-07 07:07:25,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 07:07:25,452 INFO L276 IsEmpty]: Start isEmpty. Operand 3449 states and 4292 transitions. [2018-11-07 07:07:25,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-07 07:07:25,464 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:07:25,465 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:07:25,465 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:07:25,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:07:25,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1041225973, now seen corresponding path program 1 times [2018-11-07 07:07:25,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:07:25,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:25,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:07:25,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:25,467 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:07:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:07:26,153 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 85 proven. 39 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 07:07:26,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:07:26,154 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:07:26,154 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 208 with the following transitions: [2018-11-07 07:07:26,154 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:07:26,157 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:07:26,157 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:07:26,495 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:07:26,495 INFO L272 AbstractInterpreter]: Visited 128 different actions 510 times. Merged at 9 different actions 34 times. Never widened. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 07:07:26,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:07:26,501 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:07:26,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:07:26,501 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 07:07:26,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:07:26,512 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:07:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:07:26,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:07:26,939 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 103 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-07 07:07:26,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:07:27,247 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 91 proven. 31 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-07 07:07:27,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 07:07:27,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-07 07:07:27,267 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 07:07:27,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 07:07:27,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 07:07:27,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-07 07:07:27,269 INFO L87 Difference]: Start difference. First operand 3449 states and 4292 transitions. Second operand 11 states. [2018-11-07 07:07:31,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:07:31,830 INFO L93 Difference]: Finished difference Result 11305 states and 15014 transitions. [2018-11-07 07:07:31,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 07:07:31,834 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 207 [2018-11-07 07:07:31,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:07:31,871 INFO L225 Difference]: With dead ends: 11305 [2018-11-07 07:07:31,871 INFO L226 Difference]: Without dead ends: 8412 [2018-11-07 07:07:31,890 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 417 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-11-07 07:07:31,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8412 states. [2018-11-07 07:07:32,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8412 to 8337. [2018-11-07 07:07:32,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8337 states. [2018-11-07 07:07:32,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8337 states to 8337 states and 10424 transitions. [2018-11-07 07:07:32,129 INFO L78 Accepts]: Start accepts. Automaton has 8337 states and 10424 transitions. Word has length 207 [2018-11-07 07:07:32,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:07:32,129 INFO L480 AbstractCegarLoop]: Abstraction has 8337 states and 10424 transitions. [2018-11-07 07:07:32,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 07:07:32,130 INFO L276 IsEmpty]: Start isEmpty. Operand 8337 states and 10424 transitions. [2018-11-07 07:07:32,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-07 07:07:32,151 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:07:32,152 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:07:32,152 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:07:32,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:07:32,153 INFO L82 PathProgramCache]: Analyzing trace with hash 69921341, now seen corresponding path program 1 times [2018-11-07 07:07:32,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:07:32,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:32,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:07:32,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:32,154 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:07:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:07:32,680 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 07:07:32,854 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 131 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 07:07:32,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:07:32,855 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:07:32,855 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 217 with the following transitions: [2018-11-07 07:07:32,855 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:07:32,860 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:07:32,860 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:07:33,266 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:07:33,267 INFO L272 AbstractInterpreter]: Visited 127 different actions 373 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-07 07:07:33,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:07:33,302 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:07:33,594 INFO L227 lantSequenceWeakener]: Weakened 213 states. On average, predicates are now at 83.49% of their original sizes. [2018-11-07 07:07:33,594 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:07:34,015 INFO L415 sIntCurrentIteration]: We unified 215 AI predicates to 215 [2018-11-07 07:07:34,016 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:07:34,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:07:34,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-07 07:07:34,016 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:07:34,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 07:07:34,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 07:07:34,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:07:34,017 INFO L87 Difference]: Start difference. First operand 8337 states and 10424 transitions. Second operand 10 states. [2018-11-07 07:07:40,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:07:40,476 INFO L93 Difference]: Finished difference Result 16671 states and 20946 transitions. [2018-11-07 07:07:40,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 07:07:40,476 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 216 [2018-11-07 07:07:40,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:07:40,509 INFO L225 Difference]: With dead ends: 16671 [2018-11-07 07:07:40,509 INFO L226 Difference]: Without dead ends: 9034 [2018-11-07 07:07:40,535 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 223 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-11-07 07:07:40,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9034 states. [2018-11-07 07:07:40,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9034 to 9029. [2018-11-07 07:07:40,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9029 states. [2018-11-07 07:07:40,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9029 states to 9029 states and 11201 transitions. [2018-11-07 07:07:40,742 INFO L78 Accepts]: Start accepts. Automaton has 9029 states and 11201 transitions. Word has length 216 [2018-11-07 07:07:40,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:07:40,743 INFO L480 AbstractCegarLoop]: Abstraction has 9029 states and 11201 transitions. [2018-11-07 07:07:40,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 07:07:40,743 INFO L276 IsEmpty]: Start isEmpty. Operand 9029 states and 11201 transitions. [2018-11-07 07:07:40,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-11-07 07:07:40,767 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:07:40,768 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 07:07:40,768 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:07:40,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:07:40,768 INFO L82 PathProgramCache]: Analyzing trace with hash -969326417, now seen corresponding path program 1 times [2018-11-07 07:07:40,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:07:40,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:40,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:07:40,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:40,770 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:07:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:07:41,310 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 07:07:41,509 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 157 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 07:07:41,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:07:41,509 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:07:41,510 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 233 with the following transitions: [2018-11-07 07:07:41,510 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:07:41,513 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:07:41,513 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:07:41,935 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:07:41,936 INFO L272 AbstractInterpreter]: Visited 128 different actions 511 times. Merged at 9 different actions 35 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 07:07:41,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:07:41,944 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:07:41,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:07:41,944 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 07:07:41,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:07:41,953 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:07:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:07:42,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:07:42,526 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 140 proven. 14 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-07 07:07:42,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:07:42,678 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 152 proven. 2 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-07 07:07:42,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 07:07:42,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2018-11-07 07:07:42,699 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 07:07:42,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 07:07:42,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 07:07:42,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:07:42,701 INFO L87 Difference]: Start difference. First operand 9029 states and 11201 transitions. Second operand 8 states. [2018-11-07 07:07:45,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:07:45,792 INFO L93 Difference]: Finished difference Result 17830 states and 22808 transitions. [2018-11-07 07:07:45,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 07:07:45,792 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 232 [2018-11-07 07:07:45,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:07:45,826 INFO L225 Difference]: With dead ends: 17830 [2018-11-07 07:07:45,827 INFO L226 Difference]: Without dead ends: 10193 [2018-11-07 07:07:45,852 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 473 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2018-11-07 07:07:45,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10193 states. [2018-11-07 07:07:46,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10193 to 9273. [2018-11-07 07:07:46,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9273 states. [2018-11-07 07:07:46,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9273 states to 9273 states and 11129 transitions. [2018-11-07 07:07:46,089 INFO L78 Accepts]: Start accepts. Automaton has 9273 states and 11129 transitions. Word has length 232 [2018-11-07 07:07:46,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:07:46,090 INFO L480 AbstractCegarLoop]: Abstraction has 9273 states and 11129 transitions. [2018-11-07 07:07:46,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 07:07:46,090 INFO L276 IsEmpty]: Start isEmpty. Operand 9273 states and 11129 transitions. [2018-11-07 07:07:46,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-11-07 07:07:46,115 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:07:46,115 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 07:07:46,115 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:07:46,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:07:46,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1797507141, now seen corresponding path program 1 times [2018-11-07 07:07:46,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:07:46,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:46,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:07:46,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:46,117 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:07:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:07:47,150 WARN L179 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 07:07:47,381 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 174 proven. 52 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-07 07:07:47,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:07:47,381 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:07:47,381 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 243 with the following transitions: [2018-11-07 07:07:47,382 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [41], [42], [46], [50], [54], [58], [62], [66], [70], [74], [77], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:07:47,385 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:07:47,385 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:07:47,719 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:07:47,719 INFO L272 AbstractInterpreter]: Visited 128 different actions 513 times. Merged at 9 different actions 37 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 07:07:47,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:07:47,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:07:47,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:07:47,727 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 07:07:47,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:07:47,738 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:07:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:07:47,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:07:47,950 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 185 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-07 07:07:47,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:07:48,086 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 185 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-07 07:07:48,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 07:07:48,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2018-11-07 07:07:48,107 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 07:07:48,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 07:07:48,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 07:07:48,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-11-07 07:07:48,109 INFO L87 Difference]: Start difference. First operand 9273 states and 11129 transitions. Second operand 12 states. [2018-11-07 07:07:48,849 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 07:07:53,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:07:53,349 INFO L93 Difference]: Finished difference Result 17902 states and 23113 transitions. [2018-11-07 07:07:53,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 07:07:53,349 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 242 [2018-11-07 07:07:53,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:07:53,390 INFO L225 Difference]: With dead ends: 17902 [2018-11-07 07:07:53,390 INFO L226 Difference]: Without dead ends: 9604 [2018-11-07 07:07:53,410 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 501 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=418, Invalid=1652, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 07:07:53,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9604 states. [2018-11-07 07:07:53,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9604 to 8789. [2018-11-07 07:07:53,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8789 states. [2018-11-07 07:07:53,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8789 states to 8789 states and 10116 transitions. [2018-11-07 07:07:53,665 INFO L78 Accepts]: Start accepts. Automaton has 8789 states and 10116 transitions. Word has length 242 [2018-11-07 07:07:53,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:07:53,665 INFO L480 AbstractCegarLoop]: Abstraction has 8789 states and 10116 transitions. [2018-11-07 07:07:53,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 07:07:53,666 INFO L276 IsEmpty]: Start isEmpty. Operand 8789 states and 10116 transitions. [2018-11-07 07:07:53,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-11-07 07:07:53,690 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:07:53,690 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:07:53,691 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:07:53,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:07:53,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1055628796, now seen corresponding path program 1 times [2018-11-07 07:07:53,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:07:53,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:53,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:07:53,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:07:53,693 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:07:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:07:54,394 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 175 proven. 93 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-07 07:07:54,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:07:54,394 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:07:54,395 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 260 with the following transitions: [2018-11-07 07:07:54,395 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [41], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [129], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:07:54,398 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:07:54,398 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:07:54,816 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:07:54,816 INFO L272 AbstractInterpreter]: Visited 129 different actions 633 times. Merged at 10 different actions 36 times. Never widened. Found 13 fixpoints after 4 different actions. Largest state had 42 variables. [2018-11-07 07:07:54,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:07:54,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:07:54,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:07:54,822 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 07:07:54,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:07:54,831 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:07:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:07:54,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:07:55,126 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 217 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-07 07:07:55,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:07:55,304 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 217 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-07 07:07:55,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 07:07:55,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-11-07 07:07:55,327 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 07:07:55,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 07:07:55,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 07:07:55,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-07 07:07:55,328 INFO L87 Difference]: Start difference. First operand 8789 states and 10116 transitions. Second operand 12 states. [2018-11-07 07:08:00,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:08:00,064 INFO L93 Difference]: Finished difference Result 17538 states and 20851 transitions. [2018-11-07 07:08:00,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 07:08:00,064 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 259 [2018-11-07 07:08:00,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:08:00,088 INFO L225 Difference]: With dead ends: 17538 [2018-11-07 07:08:00,089 INFO L226 Difference]: Without dead ends: 7549 [2018-11-07 07:08:00,106 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 542 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=431, Invalid=1731, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 07:08:00,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7549 states. [2018-11-07 07:08:00,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7549 to 5863. [2018-11-07 07:08:00,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5863 states. [2018-11-07 07:08:00,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5863 states to 5863 states and 6475 transitions. [2018-11-07 07:08:00,243 INFO L78 Accepts]: Start accepts. Automaton has 5863 states and 6475 transitions. Word has length 259 [2018-11-07 07:08:00,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:08:00,243 INFO L480 AbstractCegarLoop]: Abstraction has 5863 states and 6475 transitions. [2018-11-07 07:08:00,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 07:08:00,244 INFO L276 IsEmpty]: Start isEmpty. Operand 5863 states and 6475 transitions. [2018-11-07 07:08:00,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-11-07 07:08:00,261 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:08:00,261 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 07:08:00,261 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:08:00,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:08:00,262 INFO L82 PathProgramCache]: Analyzing trace with hash -317338975, now seen corresponding path program 1 times [2018-11-07 07:08:00,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:08:00,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:08:00,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:08:00,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:08:00,263 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:08:00,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:08:00,908 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 246 proven. 112 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-07 07:08:00,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:08:00,909 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:08:00,909 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 279 with the following transitions: [2018-11-07 07:08:00,909 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [37], [38], [42], [46], [50], [53], [54], [58], [62], [66], [70], [74], [77], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:08:00,912 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:08:00,912 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:08:01,540 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:08:01,540 INFO L272 AbstractInterpreter]: Visited 130 different actions 524 times. Merged at 11 different actions 40 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 07:08:01,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:08:01,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:08:01,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:08:01,546 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 07:08:01,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:08:01,555 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:08:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:08:01,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:08:01,907 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2018-11-07 07:08:01,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:08:02,676 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2018-11-07 07:08:02,712 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:08:02,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-11-07 07:08:02,713 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:08:02,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:08:02,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:08:02,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:08:02,714 INFO L87 Difference]: Start difference. First operand 5863 states and 6475 transitions. Second operand 3 states. [2018-11-07 07:08:03,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:08:03,283 INFO L93 Difference]: Finished difference Result 10882 states and 12061 transitions. [2018-11-07 07:08:03,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:08:03,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2018-11-07 07:08:03,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:08:03,294 INFO L225 Difference]: With dead ends: 10882 [2018-11-07 07:08:03,295 INFO L226 Difference]: Without dead ends: 5863 [2018-11-07 07:08:03,302 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 556 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:08:03,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5863 states. [2018-11-07 07:08:03,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5863 to 5589. [2018-11-07 07:08:03,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5589 states. [2018-11-07 07:08:03,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5589 states to 5589 states and 6153 transitions. [2018-11-07 07:08:03,404 INFO L78 Accepts]: Start accepts. Automaton has 5589 states and 6153 transitions. Word has length 278 [2018-11-07 07:08:03,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:08:03,405 INFO L480 AbstractCegarLoop]: Abstraction has 5589 states and 6153 transitions. [2018-11-07 07:08:03,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:08:03,405 INFO L276 IsEmpty]: Start isEmpty. Operand 5589 states and 6153 transitions. [2018-11-07 07:08:03,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-11-07 07:08:03,418 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:08:03,418 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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 07:08:03,418 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:08:03,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:08:03,419 INFO L82 PathProgramCache]: Analyzing trace with hash -757481712, now seen corresponding path program 1 times [2018-11-07 07:08:03,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:08:03,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:08:03,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:08:03,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:08:03,420 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:08:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:08:03,962 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 265 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-07 07:08:03,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:08:03,962 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:08:03,963 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 282 with the following transitions: [2018-11-07 07:08:03,963 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [37], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [105], [106], [109], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:08:03,965 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:08:03,967 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:08:04,443 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:08:04,444 INFO L272 AbstractInterpreter]: Visited 129 different actions 518 times. Merged at 9 different actions 38 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 07:08:04,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:08:04,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:08:04,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:08:04,478 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 07:08:04,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:08:04,496 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:08:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:08:04,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:08:04,760 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 265 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-07 07:08:04,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:08:04,858 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 265 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-07 07:08:04,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 07:08:04,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-07 07:08:04,879 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 07:08:04,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 07:08:04,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 07:08:04,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-07 07:08:04,880 INFO L87 Difference]: Start difference. First operand 5589 states and 6153 transitions. Second operand 9 states. [2018-11-07 07:08:05,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:08:05,764 INFO L93 Difference]: Finished difference Result 9235 states and 10276 transitions. [2018-11-07 07:08:05,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 07:08:05,765 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 281 [2018-11-07 07:08:05,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:08:05,765 INFO L225 Difference]: With dead ends: 9235 [2018-11-07 07:08:05,765 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 07:08:05,778 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 563 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-11-07 07:08:05,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 07:08:05,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 07:08:05,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 07:08:05,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 07:08:05,779 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 281 [2018-11-07 07:08:05,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:08:05,780 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 07:08:05,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 07:08:05,780 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 07:08:05,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 07:08:05,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 07:08:05,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:05,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:06,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:06,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:06,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:06,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:06,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:06,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:06,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:06,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:06,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:06,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:06,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:06,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:06,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:06,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:06,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:06,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:06,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:06,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:06,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:06,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:06,924 WARN L179 SmtUtils]: Spent 837.00 ms on a formula simplification. DAG size of input: 469 DAG size of output: 351 [2018-11-07 07:08:06,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:06,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:06,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:06,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:07,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:07,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:07,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:07,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:07,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:07,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:07,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:07,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:07,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:07,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:07,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:07,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:07,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:07,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:07,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:07,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:07,541 WARN L179 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 448 DAG size of output: 333 [2018-11-07 07:08:08,030 WARN L179 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 20 [2018-11-07 07:08:08,397 WARN L179 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 41 [2018-11-07 07:08:12,194 WARN L179 SmtUtils]: Spent 3.78 s on a formula simplification. DAG size of input: 259 DAG size of output: 104 [2018-11-07 07:08:14,572 WARN L179 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 338 DAG size of output: 94 [2018-11-07 07:08:16,845 WARN L179 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 324 DAG size of output: 94 [2018-11-07 07:08:16,849 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 07:08:16,849 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a8~0 |old(~a8~0)|) (= ~a17~0 |old(~a17~0)|) (= |old(~a7~0)| ~a7~0) (<= |old(~a8~0)| ~a8~0) (= |old(~a16~0)| ~a16~0) (= ~a20~0 |old(~a20~0)|) (= ~a21~0 |old(~a21~0)|)) [2018-11-07 07:08:16,849 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 07:08:16,849 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-07 07:08:16,849 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-07 07:08:16,849 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,849 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,850 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,850 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,850 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,850 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,850 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-07 07:08:16,850 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-07 07:08:16,850 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-07 07:08:16,850 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-07 07:08:16,850 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-07 07:08:16,851 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-07 07:08:16,851 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-07 07:08:16,851 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-07 07:08:16,851 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-07 07:08:16,851 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-07 07:08:16,851 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,851 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,851 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,851 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,852 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,852 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,852 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-07 07:08:16,852 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-07 07:08:16,852 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-07 07:08:16,852 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-07 07:08:16,852 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-07 07:08:16,852 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-07 07:08:16,852 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-07 07:08:16,853 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-07 07:08:16,853 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-07 07:08:16,853 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-07 07:08:16,853 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-07 07:08:16,853 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-07 07:08:16,853 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-07 07:08:16,853 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-07 07:08:16,853 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-07 07:08:16,853 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,854 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,854 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,854 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,854 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,854 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-07 07:08:16,854 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-07 07:08:16,854 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-07 07:08:16,854 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-07 07:08:16,854 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-07 07:08:16,854 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-07 07:08:16,855 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-07 07:08:16,855 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-07 07:08:16,855 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-07 07:08:16,855 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,855 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,855 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,855 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,855 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,855 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-07 07:08:16,855 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-07 07:08:16,855 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-07 07:08:16,855 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-07 07:08:16,855 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-07 07:08:16,856 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-07 07:08:16,856 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-07 07:08:16,856 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-07 07:08:16,856 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-07 07:08:16,856 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-07 07:08:16,856 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-07 07:08:16,856 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-07 07:08:16,856 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-07 07:08:16,856 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,857 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,857 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,857 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,857 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,857 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-07 07:08:16,857 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-07 07:08:16,857 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-07 07:08:16,857 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-07 07:08:16,857 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-07 07:08:16,858 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-07 07:08:16,858 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-07 07:08:16,858 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-07 07:08:16,858 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-07 07:08:16,858 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,858 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,858 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,858 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,858 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,858 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,859 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,859 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-07 07:08:16,859 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-07 07:08:16,859 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-07 07:08:16,859 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-07 07:08:16,859 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-07 07:08:16,859 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-07 07:08:16,859 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-07 07:08:16,859 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-07 07:08:16,859 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-07 07:08:16,860 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-07 07:08:16,860 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-07 07:08:16,860 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-07 07:08:16,860 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-07 07:08:16,860 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 518) no Hoare annotation was computed. [2018-11-07 07:08:16,860 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-07 07:08:16,860 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,860 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,860 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,861 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,861 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,861 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-07 07:08:16,861 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-07 07:08:16,861 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-07 07:08:16,861 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-07 07:08:16,861 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-07 07:08:16,861 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-07 07:08:16,861 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-07 07:08:16,861 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-07 07:08:16,862 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,862 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,862 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,862 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,862 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,862 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-07 07:08:16,862 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-07 07:08:16,862 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-07 07:08:16,862 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-07 07:08:16,862 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-07 07:08:16,862 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-07 07:08:16,863 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-07 07:08:16,863 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-07 07:08:16,863 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-07 07:08:16,863 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-07 07:08:16,863 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse6 (<= ~a21~0 |old(~a21~0)|)) (.cse15 (= 1 ~a21~0)) (.cse4 (= |old(~a16~0)| ~a16~0)) (.cse14 (<= ~a8~0 |old(~a8~0)|)) (.cse5 (= ~a17~0 |old(~a17~0)|)) (.cse7 (= |old(~a7~0)| ~a7~0)) (.cse16 (<= |old(~a8~0)| ~a8~0)) (.cse8 (= ~a20~0 |old(~a20~0)|)) (.cse19 (= 1 |old(~a17~0)|)) (.cse25 (= 4 |old(~a16~0)|))) (let ((.cse2 (not .cse25)) (.cse24 (not (= 13 |old(~a8~0)|))) (.cse9 (not .cse19)) (.cse26 (< |old(~a20~0)| 1)) (.cse22 (< 0 |old(~a21~0)|)) (.cse21 (and .cse4 (= ~a21~0 |old(~a21~0)|) .cse14 .cse5 .cse7 .cse16 .cse8)) (.cse30 (< |old(~a8~0)| 15)) (.cse28 (< |old(~a8~0)| 14)) (.cse29 (and .cse4 .cse14 .cse5 .cse7 .cse16 .cse15 .cse8)) (.cse10 (not (= 0 |old(~a7~0)|))) (.cse11 (not (= 1 |old(~a21~0)|))) (.cse17 (= ~a20~0 1)) (.cse12 (= |calculate_output_#in~input| 0)) (.cse1 (not (= 1 |old(~a20~0)|))) (.cse13 (not (= 15 |old(~a8~0)|))) (.cse27 (= 6 |old(~a16~0)|)) (.cse0 (= 1 |old(~a7~0)|)) (.cse18 (and .cse4 .cse14 .cse5 .cse6 .cse7 .cse8)) (.cse3 (not (= 8 ~a12~0))) (.cse20 (< 14 |old(~a8~0)|)) (.cse23 (< 0 |old(~a20~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8) .cse9) (or .cse10 .cse11 .cse3 .cse12 .cse1 .cse13 (not (= 5 |old(~a16~0)|)) (and .cse14 .cse15 .cse5 .cse7 .cse16 .cse17 (= ~a16~0 5))) (or .cse0 .cse1 .cse18 .cse3 .cse19 .cse20) (or .cse21 (< 4 |old(~a16~0)|) .cse3 .cse20 .cse22 .cse23) (or .cse0 .cse18 .cse2 .cse3 .cse19 .cse20 .cse23) (or .cse11 .cse1 .cse2 .cse3 (and (= 13 ~a8~0) .cse15) .cse24 .cse9) (or .cse0 .cse25 .cse1 .cse18 .cse3 .cse20) (or .cse0 .cse25 .cse3 .cse26 .cse19 .cse20 .cse18) (or .cse27 .cse11 .cse25 .cse28 .cse29 .cse3 .cse19 .cse20) (or .cse11 .cse29 (or .cse0 .cse25 .cse1 .cse3 .cse19) .cse30) (or .cse11 .cse1 .cse2 (and (= 1 ~a7~0) (= 1 ~a20~0) .cse4 (= 1 ~a17~0)) .cse3 (not .cse0) .cse24 .cse9) (or .cse25 .cse3 .cse26 .cse19 .cse20 .cse22 .cse21) (or (or .cse10 .cse11 .cse13 .cse3 .cse12 .cse23) .cse29) (or (or .cse27 .cse1 .cse3 .cse22) .cse21 .cse20) (or .cse27 .cse11 .cse0 .cse3 .cse29 .cse30 .cse23) (or .cse27 .cse11 .cse28 .cse29 .cse3 .cse19 .cse23) (or .cse10 .cse11 (and .cse4 .cse14 .cse15 .cse5 .cse7 .cse16 .cse17) .cse3 .cse12 .cse1 .cse13 .cse19) (or .cse27 .cse0 .cse25 .cse18 .cse3 .cse20 .cse23)))) [2018-11-07 07:08:16,863 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-07 07:08:16,864 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,864 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,864 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,864 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,864 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,864 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-07 07:08:16,864 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,864 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-07 07:08:16,864 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-07 07:08:16,864 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-07 07:08:16,865 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-07 07:08:16,865 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-07 07:08:16,865 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-07 07:08:16,865 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-07 07:08:16,865 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-07 07:08:16,865 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-07 07:08:16,865 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-07 07:08:16,865 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-07 07:08:16,865 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-07 07:08:16,865 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,865 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,866 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,866 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,866 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,866 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,866 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-07 07:08:16,866 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-07 07:08:16,866 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-07 07:08:16,866 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-07 07:08:16,866 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-07 07:08:16,866 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-07 07:08:16,866 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-07 07:08:16,867 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-07 07:08:16,867 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-07 07:08:16,867 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-07 07:08:16,867 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-07 07:08:16,867 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-07 07:08:16,867 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-07 07:08:16,867 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-07 07:08:16,867 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-07 07:08:16,867 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,867 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,867 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,867 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,868 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,868 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:08:16,868 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-07 07:08:16,868 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-07 07:08:16,868 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-07 07:08:16,868 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-07 07:08:16,868 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-07 07:08:16,868 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-07 07:08:16,868 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-07 07:08:16,868 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-07 07:08:16,868 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-07 07:08:16,868 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-07 07:08:16,868 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 07:08:16,868 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a7~0 0) (= ~a8~0 15) (= 1 ~a21~0) (= ~a12~0 8) (= ~a20~0 1) (= 1 ~a17~0) (= ~a16~0 5)) [2018-11-07 07:08:16,869 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 07:08:16,869 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 07:08:16,869 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (not (= 1 |old(~a17~0)|)) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|)) (and (<= ~a8~0 |old(~a8~0)|) (= 1 ~a21~0) (= ~a17~0 |old(~a17~0)|) (= |old(~a7~0)| ~a7~0) (<= |old(~a8~0)| ~a8~0) (= ~a20~0 1) (= ~a16~0 5))) [2018-11-07 07:08:16,869 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-07 07:08:16,869 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse0 (<= 14 ~a8~0)) (.cse10 (<= ~a8~0 |old(~a8~0)|)) (.cse11 (= ~a7~0 |old(~a7~0)|)) (.cse12 (= ~a20~0 |old(~a20~0)|)) (.cse9 (not (= main_~input~0 0))) (.cse7 (<= ~a20~0 0)) (.cse2 (= 1 ~a21~0)) (.cse16 (= |old(~a20~0)| ~a20~0)) (.cse13 (= 4 ~a16~0)) (.cse15 (= 1 ~a17~0)) (.cse14 (= 1 ~a20~0)) (.cse1 (not (= ~a16~0 6))) (.cse6 (<= ~a21~0 0)) (.cse8 (not (= ~a7~0 1))) (.cse3 (not (= ~a17~0 1))) (.cse5 (not (= ~a16~0 4))) (.cse17 (<= 1 ~a20~0)) (.cse4 (<= ~a8~0 14))) (or (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (not (= 1 |old(~a20~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (not (= 5 |old(~a16~0)|)) (and .cse6 .cse4 .cse7 (<= ~a16~0 4)) (and (and (and .cse8 .cse1 .cse5) .cse7) .cse4) (and .cse9 .cse3 .cse10 .cse11 .cse2 .cse12) (and (and (and .cse8 .cse1 .cse7) (<= 15 ~a8~0)) .cse2) (and (and .cse1 .cse3 .cse7) .cse0 .cse2) (and .cse9 .cse10 .cse11 .cse2 .cse12 (= ~a16~0 5)) (and (and .cse8 .cse13 .cse3 .cse7) .cse4) (and (= ~a7~0 0) .cse9 (= ~a8~0 15) (= ~a21~0 1) .cse7) (and .cse14 (= 13 ~a8~0) .cse13 .cse2 .cse15) (and .cse8 .cse16 .cse4) (and (and (and .cse8 .cse3 .cse5) .cse14) .cse2) (and .cse8 .cse16 .cse13 .cse15) (and .cse4 (and .cse6 .cse14 .cse1)) (and .cse6 .cse3 .cse4 .cse17 .cse5) (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a17~0)|)) (not (= 15 |old(~a8~0)|)) (and (and .cse8 .cse3 .cse5 .cse17) .cse4))) [2018-11-07 07:08:16,869 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-07 07:08:16,869 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-07 07:08:16,870 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-07 07:08:16,870 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse8 (<= ~a8~0 |old(~a8~0)|)) (.cse9 (= ~a7~0 |old(~a7~0)|)) (.cse10 (= ~a20~0 |old(~a20~0)|)) (.cse0 (<= 14 ~a8~0)) (.cse7 (<= ~a20~0 0)) (.cse2 (= 1 ~a21~0)) (.cse15 (= |old(~a20~0)| ~a20~0)) (.cse12 (= 4 ~a16~0)) (.cse14 (= 1 ~a17~0)) (.cse13 (= 1 ~a20~0)) (.cse1 (not (= ~a16~0 6))) (.cse6 (<= ~a21~0 0)) (.cse11 (not (= ~a7~0 1))) (.cse3 (not (= ~a17~0 1))) (.cse5 (not (= ~a16~0 4))) (.cse16 (<= 1 ~a20~0)) (.cse4 (<= ~a8~0 14))) (or (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (not (= 1 |old(~a20~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (not (= 5 |old(~a16~0)|)) (and .cse6 .cse4 .cse7 (<= ~a16~0 4)) (and .cse8 .cse9 .cse2 .cse10 (= ~a16~0 5)) (and (and (and .cse11 .cse1 .cse5) .cse7) .cse4) (and (not (= main_~input~0 0)) .cse3 .cse8 .cse9 .cse2 .cse10) (and (and (and .cse11 .cse1 .cse7) (<= 15 ~a8~0)) .cse2) (and (and .cse1 .cse3 .cse7) .cse0 .cse2) (and (and (= ~a7~0 0) (= ~a8~0 15) .cse7) .cse2) (and (and .cse11 .cse12 .cse3 .cse7) .cse4) (and .cse13 (= 13 ~a8~0) .cse12 .cse2 .cse14) (and .cse11 .cse15 .cse4) (and (and (and .cse11 .cse3 .cse5) .cse13) .cse2) (and .cse11 .cse15 .cse12 .cse14) (and .cse4 (and .cse6 .cse13 .cse1)) (and .cse6 .cse3 .cse4 .cse16 .cse5) (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a17~0)|)) (not (= 15 |old(~a8~0)|)) (and (and .cse11 .cse3 .cse5 .cse16) .cse4))) [2018-11-07 07:08:16,870 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-07 07:08:16,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:08:16 BoogieIcfgContainer [2018-11-07 07:08:16,895 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 07:08:16,896 INFO L168 Benchmark]: Toolchain (without parser) took 105268.13 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-11-07 07:08:16,899 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 07:08:16,899 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.33 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-11-07 07:08:16,900 INFO L168 Benchmark]: Boogie Procedure Inliner took 131.45 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -829.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2018-11-07 07:08:16,903 INFO L168 Benchmark]: Boogie Preprocessor took 91.43 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 07:08:16,903 INFO L168 Benchmark]: RCFGBuilder took 3121.84 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 103.7 MB). Peak memory consumption was 103.7 MB. Max. memory is 7.1 GB. [2018-11-07 07:08:16,904 INFO L168 Benchmark]: TraceAbstraction took 101119.52 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.7 GB in the end (delta: -579.6 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-11-07 07:08:16,908 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 797.33 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 131.45 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -829.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 91.43 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 3121.84 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 103.7 MB). Peak memory consumption was 103.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 101119.52 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.7 GB in the end (delta: -579.6 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 518]: 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: 583]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(1 == \old(a21)) || !(8 == a12)) || !(1 == \old(a20))) || (((((14 <= a8 && !(a16 == 6)) && 1 == a21) && !(a17 == 1)) && a8 <= 14) && !(a16 == 4))) || !(5 == \old(a16))) || (((a21 <= 0 && a8 <= 14) && a20 <= 0) && a16 <= 4)) || ((((a8 <= \old(a8) && a7 == \old(a7)) && 1 == a21) && a20 == \old(a20)) && a16 == 5)) || ((((!(a7 == 1) && !(a16 == 6)) && !(a16 == 4)) && a20 <= 0) && a8 <= 14)) || (((((!(input == 0) && !(a17 == 1)) && a8 <= \old(a8)) && a7 == \old(a7)) && 1 == a21) && a20 == \old(a20))) || ((((!(a7 == 1) && !(a16 == 6)) && a20 <= 0) && 15 <= a8) && 1 == a21)) || ((((!(a16 == 6) && !(a17 == 1)) && a20 <= 0) && 14 <= a8) && 1 == a21)) || (((a7 == 0 && a8 == 15) && a20 <= 0) && 1 == a21)) || ((((!(a7 == 1) && 4 == a16) && !(a17 == 1)) && a20 <= 0) && a8 <= 14)) || ((((1 == a20 && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || ((!(a7 == 1) && \old(a20) == a20) && a8 <= 14)) || ((((!(a7 == 1) && !(a17 == 1)) && !(a16 == 4)) && 1 == a20) && 1 == a21)) || (((!(a7 == 1) && \old(a20) == a20) && 4 == a16) && 1 == a17)) || (a8 <= 14 && (a21 <= 0 && 1 == a20) && !(a16 == 6))) || ((((a21 <= 0 && !(a17 == 1)) && a8 <= 14) && 1 <= a20) && !(a16 == 4))) || !(0 == \old(a7))) || !(1 == \old(a17))) || !(15 == \old(a8))) || ((((!(a7 == 1) && !(a17 == 1)) && !(a16 == 4)) && 1 <= a20) && a8 <= 14) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 101.0s OverallTime, 17 OverallIterations, 7 TraceHistogramMax, 65.2s AutomataDifference, 0.0s DeadEndRemovalTime, 11.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2045 SDtfs, 15399 SDslu, 3574 SDs, 0 SdLazy, 21436 SolverSat, 2996 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.2s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 4197 GetRequests, 3935 SyntacticMatches, 22 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1462 ImplicationChecksByTransitivity, 11.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9273occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.9s AbstIntTime, 11 AbstIntIterations, 5 AbstIntStrong, 0.9974020493159287 AbsIntWeakeningRatio, 0.20662983425414364 AbsIntAvgWeakeningVarsNumRemoved, 28.113812154696134 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 3844 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 411 PreInvPairs, 541 NumberOfFragments, 1496 HoareAnnotationTreeSize, 411 FomulaSimplifications, 60596 FormulaSimplificationTreeSizeReduction, 1.7s HoareSimplificationTime, 7 FomulaSimplificationsInter, 58647 FormulaSimplificationTreeSizeReductionInter, 9.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 4707 NumberOfCodeBlocks, 4707 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 6177 ConstructedInterpolants, 0 QuantifiedInterpolants, 3177349 SizeOfPredicates, 7 NumberOfNonLiveVariables, 4010 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 29 InterpolantComputations, 8 PerfectInterpolantSequences, 5362/5781 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...