java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label31_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 12:54:50,630 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 12:54:50,632 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 12:54:50,648 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 12:54:50,649 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 12:54:50,651 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 12:54:50,652 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 12:54:50,654 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 12:54:50,655 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 12:54:50,656 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 12:54:50,657 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 12:54:50,657 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 12:54:50,658 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 12:54:50,660 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 12:54:50,661 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 12:54:50,664 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 12:54:50,666 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 12:54:50,674 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 12:54:50,679 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 12:54:50,680 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 12:54:50,683 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 12:54:50,685 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 12:54:50,688 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 12:54:50,688 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 12:54:50,688 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 12:54:50,689 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 12:54:50,691 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 12:54:50,692 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 12:54:50,692 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 12:54:50,697 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 12:54:50,698 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 12:54:50,698 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 12:54:50,700 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 12:54:50,700 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 12:54:50,701 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 12:54:50,702 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 12:54:50,702 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 12:54:50,723 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 12:54:50,723 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 12:54:50,726 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 12:54:50,726 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 12:54:50,727 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 12:54:50,727 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 12:54:50,727 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 12:54:50,727 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 12:54:50,728 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 12:54:50,728 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 12:54:50,728 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 12:54:50,728 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 12:54:50,730 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 12:54:50,730 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 12:54:50,730 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 12:54:50,730 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 12:54:50,730 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 12:54:50,731 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 12:54:50,731 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 12:54:50,731 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 12:54:50,731 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 12:54:50,731 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 12:54:50,731 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 12:54:50,733 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 12:54:50,733 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:54:50,733 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 12:54:50,734 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 12:54:50,734 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 12:54:50,734 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 12:54:50,734 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 12:54:50,734 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 12:54:50,735 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 12:54:50,735 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 12:54:50,735 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 12:54:50,797 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 12:54:50,810 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 12:54:50,815 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 12:54:50,817 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 12:54:50,817 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 12:54:50,818 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label31_true-unreach-call_false-termination.c [2018-11-07 12:54:50,879 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c46cdbb43/ff29236a8c6c4e0ca34112ca81e7b587/FLAG07a0ec1ea [2018-11-07 12:54:51,468 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 12:54:51,469 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label31_true-unreach-call_false-termination.c [2018-11-07 12:54:51,484 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c46cdbb43/ff29236a8c6c4e0ca34112ca81e7b587/FLAG07a0ec1ea [2018-11-07 12:54:51,514 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c46cdbb43/ff29236a8c6c4e0ca34112ca81e7b587 [2018-11-07 12:54:51,532 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 12:54:51,535 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 12:54:51,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 12:54:51,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 12:54:51,542 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 12:54:51,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:54:51" (1/1) ... [2018-11-07 12:54:51,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3a7f21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:51, skipping insertion in model container [2018-11-07 12:54:51,548 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:54:51" (1/1) ... [2018-11-07 12:54:51,559 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 12:54:51,645 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 12:54:52,129 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:54:52,134 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 12:54:52,252 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:54:52,277 INFO L193 MainTranslator]: Completed translation [2018-11-07 12:54:52,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:52 WrapperNode [2018-11-07 12:54:52,278 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 12:54:52,279 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 12:54:52,279 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 12:54:52,279 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 12:54:52,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:52" (1/1) ... [2018-11-07 12:54:52,308 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:52" (1/1) ... [2018-11-07 12:54:52,405 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 12:54:52,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 12:54:52,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 12:54:52,406 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 12:54:52,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:52" (1/1) ... [2018-11-07 12:54:52,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:52" (1/1) ... [2018-11-07 12:54:52,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:52" (1/1) ... [2018-11-07 12:54:52,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:52" (1/1) ... [2018-11-07 12:54:52,504 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:52" (1/1) ... [2018-11-07 12:54:52,525 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:52" (1/1) ... [2018-11-07 12:54:52,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:52" (1/1) ... [2018-11-07 12:54:52,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 12:54:52,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 12:54:52,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 12:54:52,540 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 12:54:52,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:54:52,619 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 12:54:52,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 12:54:52,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 12:54:52,619 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 12:54:52,619 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 12:54:52,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 12:54:52,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 12:54:52,620 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 12:54:52,620 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 12:54:55,805 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 12:54:55,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:54:55 BoogieIcfgContainer [2018-11-07 12:54:55,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 12:54:55,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 12:54:55,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 12:54:55,810 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 12:54:55,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:54:51" (1/3) ... [2018-11-07 12:54:55,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dda56b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:54:55, skipping insertion in model container [2018-11-07 12:54:55,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:52" (2/3) ... [2018-11-07 12:54:55,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dda56b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:54:55, skipping insertion in model container [2018-11-07 12:54:55,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:54:55" (3/3) ... [2018-11-07 12:54:55,814 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label31_true-unreach-call_false-termination.c [2018-11-07 12:54:55,825 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 12:54:55,834 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 12:54:55,852 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 12:54:55,892 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 12:54:55,892 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 12:54:55,892 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 12:54:55,893 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 12:54:55,893 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 12:54:55,897 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 12:54:55,897 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 12:54:55,897 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 12:54:55,926 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-07 12:54:55,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-07 12:54:55,941 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:54:55,942 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:54:55,945 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:54:55,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:55,951 INFO L82 PathProgramCache]: Analyzing trace with hash -639549745, now seen corresponding path program 1 times [2018-11-07 12:54:55,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:54:56,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:56,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:56,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:56,005 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:54:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:56,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:54:56,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:54:56,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 12:54:56,608 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:54:56,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:54:56,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:54:56,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:54:56,635 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-07 12:54:58,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:54:58,306 INFO L93 Difference]: Finished difference Result 626 states and 1068 transitions. [2018-11-07 12:54:58,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:54:58,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2018-11-07 12:54:58,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:54:58,327 INFO L225 Difference]: With dead ends: 626 [2018-11-07 12:54:58,328 INFO L226 Difference]: Without dead ends: 387 [2018-11-07 12:54:58,334 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:54:58,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-11-07 12:54:58,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2018-11-07 12:54:58,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-11-07 12:54:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 644 transitions. [2018-11-07 12:54:58,419 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 644 transitions. Word has length 123 [2018-11-07 12:54:58,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:54:58,420 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 644 transitions. [2018-11-07 12:54:58,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:54:58,420 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 644 transitions. [2018-11-07 12:54:58,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-07 12:54:58,427 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:54:58,427 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, 1, 1, 1, 1] [2018-11-07 12:54:58,428 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:54:58,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:58,428 INFO L82 PathProgramCache]: Analyzing trace with hash 533241592, now seen corresponding path program 1 times [2018-11-07 12:54:58,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:54:58,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:58,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:58,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:58,431 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:54:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:58,692 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:54:58,997 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 12:54:58,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:54:58,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 12:54:58,998 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:54:59,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 12:54:59,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 12:54:59,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 12:54:59,001 INFO L87 Difference]: Start difference. First operand 383 states and 644 transitions. Second operand 6 states. [2018-11-07 12:55:00,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:55:00,925 INFO L93 Difference]: Finished difference Result 1195 states and 2114 transitions. [2018-11-07 12:55:00,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 12:55:00,928 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2018-11-07 12:55:00,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:55:00,937 INFO L225 Difference]: With dead ends: 1195 [2018-11-07 12:55:00,937 INFO L226 Difference]: Without dead ends: 818 [2018-11-07 12:55:00,945 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 12:55:00,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2018-11-07 12:55:01,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 799. [2018-11-07 12:55:01,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2018-11-07 12:55:01,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1290 transitions. [2018-11-07 12:55:01,013 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1290 transitions. Word has length 144 [2018-11-07 12:55:01,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:55:01,014 INFO L480 AbstractCegarLoop]: Abstraction has 799 states and 1290 transitions. [2018-11-07 12:55:01,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 12:55:01,014 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1290 transitions. [2018-11-07 12:55:01,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-07 12:55:01,023 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:55:01,024 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:55:01,024 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:55:01,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:01,027 INFO L82 PathProgramCache]: Analyzing trace with hash 132953093, now seen corresponding path program 1 times [2018-11-07 12:55:01,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:55:01,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:01,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:55:01,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:01,029 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:55:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:55:01,294 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:55:01,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:55:01,294 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:55:01,295 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 154 with the following transitions: [2018-11-07 12:55:01,298 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [45], [50], [52], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [655], [657], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:55:01,355 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:55:01,356 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:55:02,198 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:55:02,200 INFO L272 AbstractInterpreter]: Visited 124 different actions 124 times. Never merged. Never widened. Never found a fixpoint. Largest state had 38 variables. [2018-11-07 12:55:02,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:02,241 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:55:02,757 INFO L227 lantSequenceWeakener]: Weakened 129 states. On average, predicates are now at 81.32% of their original sizes. [2018-11-07 12:55:02,757 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:55:03,514 INFO L415 sIntCurrentIteration]: We unified 152 AI predicates to 152 [2018-11-07 12:55:03,514 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:55:03,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:55:03,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 18 [2018-11-07 12:55:03,516 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:55:03,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 12:55:03,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 12:55:03,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-07 12:55:03,517 INFO L87 Difference]: Start difference. First operand 799 states and 1290 transitions. Second operand 14 states. [2018-11-07 12:55:19,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:55:19,455 INFO L93 Difference]: Finished difference Result 1892 states and 3057 transitions. [2018-11-07 12:55:19,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 12:55:19,455 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 153 [2018-11-07 12:55:19,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:55:19,462 INFO L225 Difference]: With dead ends: 1892 [2018-11-07 12:55:19,462 INFO L226 Difference]: Without dead ends: 1099 [2018-11-07 12:55:19,466 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 165 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2018-11-07 12:55:19,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2018-11-07 12:55:19,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 946. [2018-11-07 12:55:19,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 946 states. [2018-11-07 12:55:19,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1448 transitions. [2018-11-07 12:55:19,499 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1448 transitions. Word has length 153 [2018-11-07 12:55:19,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:55:19,499 INFO L480 AbstractCegarLoop]: Abstraction has 946 states and 1448 transitions. [2018-11-07 12:55:19,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 12:55:19,499 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1448 transitions. [2018-11-07 12:55:19,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-07 12:55:19,504 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:55:19,504 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:55:19,505 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:55:19,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:19,505 INFO L82 PathProgramCache]: Analyzing trace with hash 2026664401, now seen corresponding path program 1 times [2018-11-07 12:55:19,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:55:19,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:19,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:55:19,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:19,507 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:55:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:55:19,669 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 39 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:55:19,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:55:19,670 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:55:19,670 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 159 with the following transitions: [2018-11-07 12:55:19,671 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [45], [50], [52], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [655], [657], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:55:19,677 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:55:19,677 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:55:20,004 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:55:20,004 INFO L272 AbstractInterpreter]: Visited 127 different actions 250 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-07 12:55:20,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:20,010 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:55:20,424 INFO L227 lantSequenceWeakener]: Weakened 67 states. On average, predicates are now at 81.41% of their original sizes. [2018-11-07 12:55:20,424 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:55:21,563 INFO L415 sIntCurrentIteration]: We unified 157 AI predicates to 157 [2018-11-07 12:55:21,564 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:55:21,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:55:21,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-07 12:55:21,564 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:55:21,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 12:55:21,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 12:55:21,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-07 12:55:21,566 INFO L87 Difference]: Start difference. First operand 946 states and 1448 transitions. Second operand 18 states. [2018-11-07 12:55:40,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:55:40,706 INFO L93 Difference]: Finished difference Result 2498 states and 4010 transitions. [2018-11-07 12:55:40,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 12:55:40,706 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 158 [2018-11-07 12:55:40,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:55:40,714 INFO L225 Difference]: With dead ends: 2498 [2018-11-07 12:55:40,714 INFO L226 Difference]: Without dead ends: 1558 [2018-11-07 12:55:40,719 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 172 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 12:55:40,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2018-11-07 12:55:40,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1546. [2018-11-07 12:55:40,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-07 12:55:40,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2182 transitions. [2018-11-07 12:55:40,763 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2182 transitions. Word has length 158 [2018-11-07 12:55:40,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:55:40,763 INFO L480 AbstractCegarLoop]: Abstraction has 1546 states and 2182 transitions. [2018-11-07 12:55:40,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 12:55:40,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2182 transitions. [2018-11-07 12:55:40,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-07 12:55:40,769 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:55:40,769 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:55:40,770 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:55:40,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:40,770 INFO L82 PathProgramCache]: Analyzing trace with hash 175093060, now seen corresponding path program 1 times [2018-11-07 12:55:40,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:55:40,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:40,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:55:40,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:40,772 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:55:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:55:40,960 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 35 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 12:55:40,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:55:40,960 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:55:40,961 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2018-11-07 12:55:40,961 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [45], [50], [52], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [655], [657], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:55:40,965 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:55:40,966 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:55:41,418 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:55:41,419 INFO L272 AbstractInterpreter]: Visited 128 different actions 383 times. Merged at 7 different actions 21 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-07 12:55:41,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:41,427 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:55:41,658 INFO L227 lantSequenceWeakener]: Weakened 158 states. On average, predicates are now at 81.03% of their original sizes. [2018-11-07 12:55:41,658 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:55:41,857 INFO L415 sIntCurrentIteration]: We unified 162 AI predicates to 162 [2018-11-07 12:55:41,857 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:55:41,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:55:41,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2018-11-07 12:55:41,858 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:55:41,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 12:55:41,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 12:55:41,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 12:55:41,859 INFO L87 Difference]: Start difference. First operand 1546 states and 2182 transitions. Second operand 10 states. [2018-11-07 12:55:48,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:55:48,271 INFO L93 Difference]: Finished difference Result 4385 states and 6384 transitions. [2018-11-07 12:55:48,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 12:55:48,271 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 163 [2018-11-07 12:55:48,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:55:48,286 INFO L225 Difference]: With dead ends: 4385 [2018-11-07 12:55:48,286 INFO L226 Difference]: Without dead ends: 2845 [2018-11-07 12:55:48,293 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 171 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-11-07 12:55:48,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2018-11-07 12:55:48,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 2788. [2018-11-07 12:55:48,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2788 states. [2018-11-07 12:55:48,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2788 states to 2788 states and 3660 transitions. [2018-11-07 12:55:48,372 INFO L78 Accepts]: Start accepts. Automaton has 2788 states and 3660 transitions. Word has length 163 [2018-11-07 12:55:48,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:55:48,372 INFO L480 AbstractCegarLoop]: Abstraction has 2788 states and 3660 transitions. [2018-11-07 12:55:48,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 12:55:48,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2788 states and 3660 transitions. [2018-11-07 12:55:48,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-07 12:55:48,381 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:55:48,382 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:55:48,382 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:55:48,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:48,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1149725923, now seen corresponding path program 1 times [2018-11-07 12:55:48,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:55:48,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:48,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:55:48,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:48,384 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:55:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:55:48,829 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 51 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 12:55:48,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:55:48,829 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:55:48,830 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 178 with the following transitions: [2018-11-07 12:55:48,830 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [45], [50], [52], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [655], [657], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:55:48,833 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:55:48,834 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:55:49,479 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:55:49,479 INFO L272 AbstractInterpreter]: Visited 129 different actions 517 times. Merged at 8 different actions 34 times. Never widened. Found 8 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 12:55:49,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:49,513 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:55:49,781 INFO L227 lantSequenceWeakener]: Weakened 172 states. On average, predicates are now at 81.05% of their original sizes. [2018-11-07 12:55:49,781 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:55:50,157 INFO L415 sIntCurrentIteration]: We unified 176 AI predicates to 176 [2018-11-07 12:55:50,157 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:55:50,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:55:50,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2018-11-07 12:55:50,158 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:55:50,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 12:55:50,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 12:55:50,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 12:55:50,159 INFO L87 Difference]: Start difference. First operand 2788 states and 3660 transitions. Second operand 10 states. [2018-11-07 12:55:56,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:55:56,328 INFO L93 Difference]: Finished difference Result 6440 states and 8752 transitions. [2018-11-07 12:55:56,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 12:55:56,328 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2018-11-07 12:55:56,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:55:56,347 INFO L225 Difference]: With dead ends: 6440 [2018-11-07 12:55:56,348 INFO L226 Difference]: Without dead ends: 3658 [2018-11-07 12:55:56,357 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 185 GetRequests, 132 SyntacticMatches, 36 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-11-07 12:55:56,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3658 states. [2018-11-07 12:55:56,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3658 to 3618. [2018-11-07 12:55:56,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3618 states. [2018-11-07 12:55:56,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3618 states to 3618 states and 4690 transitions. [2018-11-07 12:55:56,469 INFO L78 Accepts]: Start accepts. Automaton has 3618 states and 4690 transitions. Word has length 177 [2018-11-07 12:55:56,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:55:56,471 INFO L480 AbstractCegarLoop]: Abstraction has 3618 states and 4690 transitions. [2018-11-07 12:55:56,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 12:55:56,471 INFO L276 IsEmpty]: Start isEmpty. Operand 3618 states and 4690 transitions. [2018-11-07 12:55:56,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-07 12:55:56,488 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:55:56,488 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:55:56,488 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:55:56,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:56,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1548818448, now seen corresponding path program 1 times [2018-11-07 12:55:56,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:55:56,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:56,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:55:56,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:56,491 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:55:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:55:56,667 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 76 proven. 36 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-07 12:55:56,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:55:56,668 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:55:56,668 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 193 with the following transitions: [2018-11-07 12:55:56,668 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [13], [14], [18], [22], [25], [26], [30], [34], [38], [42], [45], [50], [52], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [655], [657], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:55:56,671 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:55:56,671 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:55:57,355 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:55:57,356 INFO L272 AbstractInterpreter]: Visited 132 different actions 393 times. Merged at 8 different actions 25 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-07 12:55:57,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:57,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:55:57,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:55:57,397 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:55:57,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:55:57,416 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:55:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:55:57,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:55:58,020 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 12:55:58,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:55:58,584 WARN L179 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-07 12:55:58,958 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 88 proven. 10 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-07 12:55:58,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:55:58,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 14 [2018-11-07 12:55:58,992 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:55:58,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:55:58,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:55:58,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-11-07 12:55:58,993 INFO L87 Difference]: Start difference. First operand 3618 states and 4690 transitions. Second operand 11 states. [2018-11-07 12:56:07,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:56:07,096 INFO L93 Difference]: Finished difference Result 11442 states and 16774 transitions. [2018-11-07 12:56:07,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 12:56:07,097 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 192 [2018-11-07 12:56:07,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:56:07,122 INFO L225 Difference]: With dead ends: 11442 [2018-11-07 12:56:07,122 INFO L226 Difference]: Without dead ends: 5775 [2018-11-07 12:56:07,147 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 395 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=284, Invalid=976, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 12:56:07,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5775 states. [2018-11-07 12:56:07,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5775 to 5463. [2018-11-07 12:56:07,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5463 states. [2018-11-07 12:56:07,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5463 states to 5463 states and 6730 transitions. [2018-11-07 12:56:07,279 INFO L78 Accepts]: Start accepts. Automaton has 5463 states and 6730 transitions. Word has length 192 [2018-11-07 12:56:07,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:56:07,280 INFO L480 AbstractCegarLoop]: Abstraction has 5463 states and 6730 transitions. [2018-11-07 12:56:07,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:56:07,280 INFO L276 IsEmpty]: Start isEmpty. Operand 5463 states and 6730 transitions. [2018-11-07 12:56:07,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-07 12:56:07,297 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:56:07,297 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:56:07,298 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:56:07,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:56:07,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1328933883, now seen corresponding path program 1 times [2018-11-07 12:56:07,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:56:07,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:56:07,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:56:07,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:56:07,299 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:56:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:56:07,572 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 100 proven. 23 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-07 12:56:07,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:56:07,573 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:56:07,573 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 220 with the following transitions: [2018-11-07 12:56:07,573 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [45], [50], [52], [53], [56], [59], [63], [64], [68], [72], [76], [80], [84], [88], [92], [96], [99], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [655], [657], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:56:07,578 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:56:07,578 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:56:12,254 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:56:12,254 INFO L272 AbstractInterpreter]: Visited 133 different actions 2807 times. Merged at 9 different actions 243 times. Widened at 1 different actions 18 times. Found 59 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 12:56:12,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:56:12,262 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:56:12,636 INFO L227 lantSequenceWeakener]: Weakened 215 states. On average, predicates are now at 81.05% of their original sizes. [2018-11-07 12:56:12,636 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:56:12,899 INFO L415 sIntCurrentIteration]: We unified 218 AI predicates to 218 [2018-11-07 12:56:12,900 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:56:12,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:56:12,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 18 [2018-11-07 12:56:12,901 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:56:12,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 12:56:12,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 12:56:12,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-11-07 12:56:12,903 INFO L87 Difference]: Start difference. First operand 5463 states and 6730 transitions. Second operand 14 states. [2018-11-07 12:56:36,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:56:36,624 INFO L93 Difference]: Finished difference Result 10915 states and 13597 transitions. [2018-11-07 12:56:36,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 12:56:36,624 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 219 [2018-11-07 12:56:36,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:56:36,625 INFO L225 Difference]: With dead ends: 10915 [2018-11-07 12:56:36,625 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 12:56:36,645 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 247 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=300, Invalid=1506, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 12:56:36,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 12:56:36,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 12:56:36,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 12:56:36,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 12:56:36,646 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 219 [2018-11-07 12:56:36,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:56:36,646 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 12:56:36,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 12:56:36,647 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 12:56:36,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 12:56:36,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 12:56:37,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:56:37,243 WARN L179 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 188 [2018-11-07 12:56:37,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:56:37,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:56:37,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:56:37,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:56:37,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:56:37,601 WARN L179 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 248 DAG size of output: 201 [2018-11-07 12:56:38,424 WARN L179 SmtUtils]: Spent 821.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2018-11-07 12:56:38,855 WARN L179 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 77 [2018-11-07 12:56:44,625 WARN L179 SmtUtils]: Spent 5.75 s on a formula simplification. DAG size of input: 324 DAG size of output: 136 [2018-11-07 12:56:45,738 WARN L179 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 218 DAG size of output: 107 [2018-11-07 12:56:46,997 WARN L179 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 236 DAG size of output: 112 [2018-11-07 12:56:47,001 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:56:47,001 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a17~0 |old(~a17~0)|) (= |old(~a19~0)| ~a19~0) (= |old(~a25~0)| ~a25~0)) [2018-11-07 12:56:47,001 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:56:47,002 INFO L425 ceAbstractionStarter]: For program point L564(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,002 INFO L425 ceAbstractionStarter]: For program point L531(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,002 INFO L425 ceAbstractionStarter]: For program point L498(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,002 INFO L425 ceAbstractionStarter]: For program point L465(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,002 INFO L425 ceAbstractionStarter]: For program point L432(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,002 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-07 12:56:47,002 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-07 12:56:47,002 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-07 12:56:47,002 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-07 12:56:47,002 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-07 12:56:47,002 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-07 12:56:47,003 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-07 12:56:47,003 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-07 12:56:47,003 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-07 12:56:47,003 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-07 12:56:47,003 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-07 12:56:47,003 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-07 12:56:47,003 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-07 12:56:47,003 INFO L425 ceAbstractionStarter]: For program point L567(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,003 INFO L425 ceAbstractionStarter]: For program point L534(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,003 INFO L425 ceAbstractionStarter]: For program point L501(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,003 INFO L425 ceAbstractionStarter]: For program point L468(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,003 INFO L425 ceAbstractionStarter]: For program point L435(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,003 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-07 12:56:47,004 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-07 12:56:47,004 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-07 12:56:47,004 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-07 12:56:47,004 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-07 12:56:47,004 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-07 12:56:47,004 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-07 12:56:47,004 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-07 12:56:47,004 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-07 12:56:47,004 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-07 12:56:47,004 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-07 12:56:47,004 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-07 12:56:47,005 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-07 12:56:47,005 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-07 12:56:47,005 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-07 12:56:47,005 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-07 12:56:47,005 INFO L425 ceAbstractionStarter]: For program point L570(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,005 INFO L425 ceAbstractionStarter]: For program point L537(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,005 INFO L425 ceAbstractionStarter]: For program point L504(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,005 INFO L425 ceAbstractionStarter]: For program point L471(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,005 INFO L425 ceAbstractionStarter]: For program point L438(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,006 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-07 12:56:47,006 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-07 12:56:47,006 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-07 12:56:47,006 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-07 12:56:47,006 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-07 12:56:47,006 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-07 12:56:47,006 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-07 12:56:47,006 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-07 12:56:47,006 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-07 12:56:47,007 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-07 12:56:47,007 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-07 12:56:47,007 INFO L425 ceAbstractionStarter]: For program point L573(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,007 INFO L425 ceAbstractionStarter]: For program point L540(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,007 INFO L425 ceAbstractionStarter]: For program point L507(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,007 INFO L425 ceAbstractionStarter]: For program point L474(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,007 INFO L425 ceAbstractionStarter]: For program point L441(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,007 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-07 12:56:47,008 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-07 12:56:47,008 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-07 12:56:47,008 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-07 12:56:47,008 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-07 12:56:47,008 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-07 12:56:47,008 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-07 12:56:47,008 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-07 12:56:47,008 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-07 12:56:47,008 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-07 12:56:47,008 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-07 12:56:47,008 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-07 12:56:47,008 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-07 12:56:47,009 INFO L425 ceAbstractionStarter]: For program point L576(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,009 INFO L425 ceAbstractionStarter]: For program point L543(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,009 INFO L425 ceAbstractionStarter]: For program point L510(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,009 INFO L425 ceAbstractionStarter]: For program point L477(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,009 INFO L425 ceAbstractionStarter]: For program point L444(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,009 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-07 12:56:47,009 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-07 12:56:47,009 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-07 12:56:47,009 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-07 12:56:47,009 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-07 12:56:47,009 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-07 12:56:47,009 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-07 12:56:47,010 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-07 12:56:47,012 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-07 12:56:47,012 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-07 12:56:47,012 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-07 12:56:47,012 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-07 12:56:47,012 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-07 12:56:47,012 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-07 12:56:47,012 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-07 12:56:47,013 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-07 12:56:47,013 INFO L425 ceAbstractionStarter]: For program point L579(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,013 INFO L425 ceAbstractionStarter]: For program point L546(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,013 INFO L425 ceAbstractionStarter]: For program point L513(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,013 INFO L425 ceAbstractionStarter]: For program point L480(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,013 INFO L425 ceAbstractionStarter]: For program point L447(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,013 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-07 12:56:47,013 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-07 12:56:47,013 INFO L425 ceAbstractionStarter]: For program point L414-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,013 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-07 12:56:47,013 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-07 12:56:47,013 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-07 12:56:47,013 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,014 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,014 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-07 12:56:47,014 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-07 12:56:47,014 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-07 12:56:47,014 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-07 12:56:47,014 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-07 12:56:47,014 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-07 12:56:47,014 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-07 12:56:47,014 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-07 12:56:47,014 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-07 12:56:47,015 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-07 12:56:47,015 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-07 12:56:47,015 INFO L425 ceAbstractionStarter]: For program point L582(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,015 INFO L425 ceAbstractionStarter]: For program point L549(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,015 INFO L425 ceAbstractionStarter]: For program point L516(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,015 INFO L425 ceAbstractionStarter]: For program point L483(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,015 INFO L425 ceAbstractionStarter]: For program point L450(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,015 INFO L425 ceAbstractionStarter]: For program point L417(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,015 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-07 12:56:47,016 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-07 12:56:47,016 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-07 12:56:47,016 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-07 12:56:47,016 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-07 12:56:47,016 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-07 12:56:47,016 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-07 12:56:47,016 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-07 12:56:47,016 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-07 12:56:47,016 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-07 12:56:47,016 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-07 12:56:47,016 INFO L425 ceAbstractionStarter]: For program point L585(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,016 INFO L425 ceAbstractionStarter]: For program point L552(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,016 INFO L425 ceAbstractionStarter]: For program point L486(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,016 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,017 INFO L425 ceAbstractionStarter]: For program point L453(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,017 INFO L425 ceAbstractionStarter]: For program point L420(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,017 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-07 12:56:47,017 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-07 12:56:47,017 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-07 12:56:47,017 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-07 12:56:47,017 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-07 12:56:47,017 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-07 12:56:47,017 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-07 12:56:47,018 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-07 12:56:47,018 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-07 12:56:47,018 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-07 12:56:47,018 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-07 12:56:47,018 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-07 12:56:47,018 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-07 12:56:47,018 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-07 12:56:47,018 INFO L425 ceAbstractionStarter]: For program point L588(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,019 INFO L425 ceAbstractionStarter]: For program point L555(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,019 INFO L425 ceAbstractionStarter]: For program point L522(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,019 INFO L425 ceAbstractionStarter]: For program point L489(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,019 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse3 (< |old(~a28~0)| 7)) (.cse35 (not (= 0 |old(~a25~0)|))) (.cse32 (< 1 |old(~a25~0)|)) (.cse34 (not (= 0 |old(~a11~0)|))) (.cse33 (< 11 |old(~a28~0)|)) (.cse26 (not (= 1 ~a21~0))) (.cse30 (<= ~a28~0 11)) (.cse17 (= ~a17~0 8)) (.cse18 (<= 0 ~a11~0)) (.cse24 (= 1 |old(~a25~0)|)) (.cse8 (= 8 |old(~a28~0)|)) (.cse25 (<= ~a17~0 |old(~a17~0)|)) (.cse21 (= |old(~a19~0)| ~a19~0)) (.cse20 (= |old(~a25~0)| ~a25~0)) (.cse28 (= ~a28~0 8))) (let ((.cse19 (not .cse28)) (.cse22 (and .cse25 .cse21 .cse20)) (.cse23 (< 7 |old(~a17~0)|)) (.cse27 (not .cse8)) (.cse31 (<= ~a11~0 1)) (.cse29 (< 1 |old(~a11~0)|)) (.cse1 (not .cse24)) (.cse15 (= ~a11~0 0)) (.cse16 (and .cse30 .cse17 .cse18)) (.cse6 (<= 7 ~a28~0)) (.cse7 (<= ~a28~0 8)) (.cse2 (let ((.cse36 (< 1 |old(~a19~0)|))) (and (or .cse36 .cse26 (< (+ |old(~a19~0)| 1) 0) .cse33) (or .cse36 .cse26 (< |old(~a19~0)| 0))))) (.cse4 (< |old(~a11~0)| 0)) (.cse5 (< 8 |old(~a28~0)|)) (.cse10 (< 0 |old(~a19~0)|)) (.cse0 (< 6 |calculate_output_#in~input|)) (.cse12 (and (or .cse26 .cse34 .cse33 .cse3 .cse35) (or .cse26 (< |old(~a28~0)| 8) .cse32 .cse34 .cse33))) (.cse13 (< |old(~a25~0)| 0)) (.cse14 (not (= 1 |old(~a19~0)|))) (.cse9 (not (= 8 |old(~a17~0)|))) (.cse11 (< |calculate_output_#in~input| 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7) .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse12 .cse13 .cse14 .cse15 .cse8 .cse9 .cse11) (or .cse0 (and (or .cse16 (and (<= 0 ~a19~0) .cse17 .cse18)) .cse19 .cse20 .cse21 (<= 6 ~a28~0) (<= ~a28~0 21)) .cse2 .cse13 .cse4 .cse8 (< 21 |old(~a28~0)|) (< |old(~a28~0)| 6) .cse9 .cse11) (or .cse22 .cse23 .cse24) (or .cse8 (and .cse25 .cse21 .cse19 .cse20) .cse23) (or .cse22 (not (= |old(~a19~0)| 1)) .cse23) (or .cse0 .cse26 .cse1 .cse27 .cse4 .cse14 .cse9 (and (= ~a25~0 1) .cse18 .cse28 .cse17 (= ~a19~0 1)) .cse11) (or .cse0 .cse2 .cse29 .cse13 .cse3 .cse4 (and .cse6 .cse30 .cse31) .cse14 .cse32 .cse8 .cse33 .cse9 .cse11) (or .cse0 .cse26 .cse1 .cse29 .cse27 .cse4 .cse31 .cse14 .cse9 .cse11) (or (<= ~a28~0 10) (or .cse0 .cse26 .cse29 .cse13 .cse3 (< 10 |old(~a28~0)|) .cse14 .cse32 .cse8) .cse4 .cse9 .cse11) (or .cse0 (or (not (= 11 |old(~a28~0)|)) .cse1) .cse2 .cse34 (= ~a28~0 11) .cse14 .cse9 .cse11) (or .cse0 .cse1 .cse15 .cse12 .cse14 .cse9 .cse11) (or (= ~a28~0 7) (or (or .cse26 .cse0 (not (= 7 |old(~a28~0)|)) .cse34) .cse14 .cse9) .cse35 .cse11) (or .cse0 (and .cse16 .cse20 .cse6 .cse21 .cse7) .cse2 .cse13 .cse3 .cse24 .cse4 .cse5 .cse9 .cse10 .cse11) (or .cse0 .cse12 (or (= ~a25~0 0) (<= 8 ~a28~0)) .cse13 .cse14 .cse8 .cse9 .cse11)))) [2018-11-07 12:56:47,019 INFO L425 ceAbstractionStarter]: For program point L456(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,020 INFO L425 ceAbstractionStarter]: For program point L423(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,020 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-07 12:56:47,020 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-07 12:56:47,020 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-07 12:56:47,020 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-07 12:56:47,020 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-07 12:56:47,020 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-07 12:56:47,020 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-07 12:56:47,020 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-07 12:56:47,020 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-07 12:56:47,021 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-07 12:56:47,021 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-07 12:56:47,021 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-07 12:56:47,021 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-07 12:56:47,021 INFO L425 ceAbstractionStarter]: For program point L591(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,021 INFO L425 ceAbstractionStarter]: For program point L558(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,021 INFO L425 ceAbstractionStarter]: For program point L525(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,021 INFO L425 ceAbstractionStarter]: For program point L492(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,021 INFO L425 ceAbstractionStarter]: For program point L459(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,022 INFO L425 ceAbstractionStarter]: For program point L426(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,022 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-07 12:56:47,022 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-07 12:56:47,022 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-07 12:56:47,022 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-07 12:56:47,022 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-07 12:56:47,022 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-07 12:56:47,022 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-07 12:56:47,022 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-07 12:56:47,022 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-07 12:56:47,023 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-07 12:56:47,023 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-07 12:56:47,023 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-07 12:56:47,023 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-07 12:56:47,023 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-07 12:56:47,023 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 520) no Hoare annotation was computed. [2018-11-07 12:56:47,023 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-07 12:56:47,023 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 596) no Hoare annotation was computed. [2018-11-07 12:56:47,023 INFO L425 ceAbstractionStarter]: For program point L561(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,024 INFO L425 ceAbstractionStarter]: For program point L528(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,024 INFO L425 ceAbstractionStarter]: For program point L495(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,024 INFO L425 ceAbstractionStarter]: For program point L462(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,024 INFO L425 ceAbstractionStarter]: For program point L429(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:47,024 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-07 12:56:47,024 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-07 12:56:47,024 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-07 12:56:47,024 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-07 12:56:47,024 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-07 12:56:47,024 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-07 12:56:47,025 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-07 12:56:47,025 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-07 12:56:47,025 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-07 12:56:47,025 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-07 12:56:47,025 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-07 12:56:47,025 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-07 12:56:47,025 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-07 12:56:47,025 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-07 12:56:47,025 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-07 12:56:47,025 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-07 12:56:47,026 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-07 12:56:47,026 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-07 12:56:47,026 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-07 12:56:47,026 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:56:47,026 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~z~0 26) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a~0 1) (= ~a19~0 1) (= ~a28~0 7)) [2018-11-07 12:56:47,026 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 12:56:47,026 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:56:47,027 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (and (= ~a11~0 0) (= ~a25~0 0) (= ~a19~0 1) (= ~a28~0 7) (= ~a17~0 8)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-07 12:56:47,027 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-07 12:56:47,027 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse6 (= ~a21~0 1)) (.cse10 (= ~a25~0 1))) (let ((.cse0 (not .cse10)) (.cse5 (<= 0 (+ ~a19~0 1))) (.cse7 (<= ~a17~0 7)) (.cse8 (not (= ~a28~0 8))) (.cse1 (<= 1 main_~input~0)) (.cse2 (let ((.cse12 (<= 0 (+ main_~input~0 2147483648))) (.cse13 (<= 0 ~a25~0)) (.cse14 (<= ~a19~0 1)) (.cse15 (<= 0 ~a11~0))) (or (and .cse12 (<= ~a28~0 11) .cse13 (<= 6 ~a28~0) .cse14 .cse6 .cse15) (and .cse12 .cse13 (<= 0 ~a19~0) .cse14 .cse6 (<= 7 ~a28~0) .cse15)))) (.cse3 (<= main_~input~0 6)) (.cse9 (<= ~a28~0 21)) (.cse4 (= ~a17~0 8)) (.cse11 (= ~a19~0 1))) (or (and (<= ~a19~0 0) .cse0 .cse1 .cse2 .cse3 (<= ~a28~0 8) .cse4 .cse5) (not .cse6) (not (= ~y~0 25)) (and .cse7 .cse0) (and (= |old(~a19~0)| ~a19~0) .cse7) (and .cse1 .cse2 .cse3 .cse8 .cse9 .cse4 .cse5) (and .cse7 .cse8) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and .cse1 .cse2 .cse3 .cse10 .cse9 .cse4 .cse11) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (and (and (= ~a11~0 0) (= ~a25~0 0)) .cse4 .cse11 (= ~a28~0 7)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0))))) [2018-11-07 12:56:47,027 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-07 12:56:47,027 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-07 12:56:47,028 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse6 (= ~a21~0 1)) (.cse10 (= ~a25~0 1))) (let ((.cse0 (not .cse10)) (.cse5 (<= 0 (+ ~a19~0 1))) (.cse7 (<= ~a17~0 7)) (.cse8 (not (= ~a28~0 8))) (.cse1 (<= 1 main_~input~0)) (.cse2 (let ((.cse11 (<= 0 (+ main_~input~0 2147483648))) (.cse12 (<= 0 ~a25~0)) (.cse13 (<= ~a19~0 1)) (.cse14 (<= 0 ~a11~0))) (or (and .cse11 (<= ~a28~0 11) .cse12 (<= 6 ~a28~0) .cse13 .cse6 .cse14) (and .cse11 .cse12 (<= 0 ~a19~0) .cse13 .cse6 (<= 7 ~a28~0) .cse14)))) (.cse3 (<= main_~input~0 6)) (.cse9 (<= ~a28~0 21)) (.cse4 (= ~a17~0 8))) (or (and (<= ~a19~0 0) .cse0 .cse1 .cse2 .cse3 (<= ~a28~0 8) .cse4 .cse5) (not .cse6) (not (= ~y~0 25)) (and .cse7 .cse0) (and (= |old(~a19~0)| ~a19~0) .cse7) (and .cse1 .cse2 .cse3 .cse8 .cse9 .cse4 .cse5) (and .cse7 .cse8) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and .cse1 .cse2 .cse3 .cse10 .cse9 .cse4 (= ~a19~0 1)) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0))))) [2018-11-07 12:56:47,028 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-07 12:56:47,028 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-07 12:56:47,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:56:47 BoogieIcfgContainer [2018-11-07 12:56:47,055 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 12:56:47,056 INFO L168 Benchmark]: Toolchain (without parser) took 115522.79 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -752.0 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-11-07 12:56:47,059 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 12:56:47,059 INFO L168 Benchmark]: CACSL2BoogieTranslator took 742.34 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 12:56:47,060 INFO L168 Benchmark]: Boogie Procedure Inliner took 126.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -825.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 7.1 GB. [2018-11-07 12:56:47,063 INFO L168 Benchmark]: Boogie Preprocessor took 133.81 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 12:56:47,064 INFO L168 Benchmark]: RCFGBuilder took 3266.21 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: 116.5 MB). Peak memory consumption was 116.5 MB. Max. memory is 7.1 GB. [2018-11-07 12:56:47,064 INFO L168 Benchmark]: TraceAbstraction took 111247.80 ms. Allocated memory was 2.3 GB in the beginning and 3.9 GB in the end (delta: 1.6 GB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -85.8 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-11-07 12:56:47,073 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 742.34 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 126.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -825.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.81 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 3266.21 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: 116.5 MB). Peak memory consumption was 116.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 111247.80 ms. Allocated memory was 2.3 GB in the beginning and 3.9 GB in the end (delta: 1.6 GB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -85.8 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 520]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((a19 <= 0 && !(a25 == 1)) && 1 <= input) && (((((((0 <= input + 2147483648 && a28 <= 11) && 0 <= a25) && 6 <= a28) && a19 <= 1) && a21 == 1) && 0 <= a11) || ((((((0 <= input + 2147483648 && 0 <= a25) && 0 <= a19) && a19 <= 1) && a21 == 1) && 7 <= a28) && 0 <= a11))) && input <= 6) && a28 <= 8) && a17 == 8) && 0 <= a19 + 1) || !(a21 == 1)) || !(y == 25)) || (a17 <= 7 && !(a25 == 1))) || (\old(a19) == a19 && a17 <= 7)) || ((((((1 <= input && (((((((0 <= input + 2147483648 && a28 <= 11) && 0 <= a25) && 6 <= a28) && a19 <= 1) && a21 == 1) && 0 <= a11) || ((((((0 <= input + 2147483648 && 0 <= a25) && 0 <= a19) && a19 <= 1) && a21 == 1) && 7 <= a28) && 0 <= a11))) && input <= 6) && !(a28 == 8)) && a28 <= 21) && a17 == 8) && 0 <= a19 + 1)) || (a17 <= 7 && !(a28 == 8))) || !(1 == \old(a19))) || !(x == 24)) || !(e == 5)) || !(d == 4)) || !(21 == u)) || !(22 == v)) || !(\old(a11) == 0)) || ((((((1 <= input && (((((((0 <= input + 2147483648 && a28 <= 11) && 0 <= a25) && 6 <= a28) && a19 <= 1) && a21 == 1) && 0 <= a11) || ((((((0 <= input + 2147483648 && 0 <= a25) && 0 <= a19) && a19 <= 1) && a21 == 1) && 7 <= a28) && 0 <= a11))) && input <= 6) && a25 == 1) && a28 <= 21) && a17 == 8) && a19 == 1)) || !(z == 26)) || !(0 == \old(a25))) || !(3 == c)) || ((((a11 == 0 && a25 == 0) && a17 == 8) && a19 == 1) && a28 == 7)) || !(23 == w)) || !(\old(a28) == 7)) || !(a == 1)) || !(\old(a17) == 8)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 111.1s OverallTime, 8 OverallIterations, 6 TraceHistogramMax, 83.2s AutomataDifference, 0.0s DeadEndRemovalTime, 10.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1401 SDtfs, 9346 SDslu, 3187 SDs, 0 SdLazy, 20015 SolverSat, 2688 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.7s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 1387 GetRequests, 1172 SyntacticMatches, 42 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5463occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 7.8s AbstIntTime, 6 AbstIntIterations, 5 AbstIntStrong, 0.9964888451865661 AbsIntWeakeningRatio, 0.23930635838150288 AbsIntAvgWeakeningVarsNumRemoved, 26.298265895953758 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 597 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 141 PreInvPairs, 234 NumberOfFragments, 1649 HoareAnnotationTreeSize, 141 FomulaSimplifications, 17116 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 7 FomulaSimplificationsInter, 24269 FormulaSimplificationTreeSizeReductionInter, 9.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1521 NumberOfCodeBlocks, 1521 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1703 ConstructedInterpolants, 0 QuantifiedInterpolants, 461835 SizeOfPredicates, 1 NumberOfNonLiveVariables, 540 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 750/868 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...