java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label53_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:08:38,614 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:08:38,618 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:08:38,632 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:08:38,632 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:08:38,633 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:08:38,635 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:08:38,637 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:08:38,638 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:08:38,639 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:08:38,640 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:08:38,641 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:08:38,642 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:08:38,642 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:08:38,644 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:08:38,644 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:08:38,645 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:08:38,647 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:08:38,649 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:08:38,651 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:08:38,652 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:08:38,654 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:08:38,656 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:08:38,656 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:08:38,656 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:08:38,657 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:08:38,658 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:08:38,659 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:08:38,660 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:08:38,661 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:08:38,662 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:08:38,662 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:08:38,663 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:08:38,663 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:08:38,664 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:08:38,665 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:08:38,665 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 00:08:38,680 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:08:38,681 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:08:38,682 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:08:38,682 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:08:38,682 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:08:38,682 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:08:38,682 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:08:38,683 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:08:38,683 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:08:38,683 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:08:38,683 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:08:38,683 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:08:38,684 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:08:38,684 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:08:38,685 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:08:38,685 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:08:38,685 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:08:38,685 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:08:38,685 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:08:38,686 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:08:38,687 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:08:38,687 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:08:38,687 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:08:38,687 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:08:38,687 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:08:38,688 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:08:38,688 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:08:38,688 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:08:38,688 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:08:38,689 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:08:38,689 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:08:38,689 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:08:38,690 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:08:38,690 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:08:38,690 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:08:38,690 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:08:38,747 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:08:38,760 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:08:38,767 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:08:38,769 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:08:38,769 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:08:38,770 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label53_true-unreach-call_false-termination.c [2018-10-25 00:08:38,834 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/006d8b944/7681d4f4a6f741ebbb44036a80558fd1/FLAG2dcc1afae [2018-10-25 00:08:39,409 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:08:39,410 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label53_true-unreach-call_false-termination.c [2018-10-25 00:08:39,430 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/006d8b944/7681d4f4a6f741ebbb44036a80558fd1/FLAG2dcc1afae [2018-10-25 00:08:39,445 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/006d8b944/7681d4f4a6f741ebbb44036a80558fd1 [2018-10-25 00:08:39,458 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:08:39,459 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:08:39,461 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:08:39,461 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:08:39,465 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:08:39,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:08:39" (1/1) ... [2018-10-25 00:08:39,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ae6b03e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:39, skipping insertion in model container [2018-10-25 00:08:39,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:08:39" (1/1) ... [2018-10-25 00:08:39,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:08:39,559 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:08:40,075 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:08:40,080 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:08:40,216 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:08:40,236 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:08:40,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:40 WrapperNode [2018-10-25 00:08:40,236 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:08:40,238 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:08:40,238 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:08:40,238 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:08:40,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:40" (1/1) ... [2018-10-25 00:08:40,265 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:40" (1/1) ... [2018-10-25 00:08:40,420 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:08:40,420 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:08:40,421 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:08:40,421 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:08:40,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:40" (1/1) ... [2018-10-25 00:08:40,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:40" (1/1) ... [2018-10-25 00:08:40,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:40" (1/1) ... [2018-10-25 00:08:40,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:40" (1/1) ... [2018-10-25 00:08:40,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:40" (1/1) ... [2018-10-25 00:08:40,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:40" (1/1) ... [2018-10-25 00:08:40,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:40" (1/1) ... [2018-10-25 00:08:40,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:08:40,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:08:40,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:08:40,505 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:08:40,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-25 00:08:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:08:40,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:08:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:08:40,577 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:08:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:08:40,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:08:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:08:40,578 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:08:43,864 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:08:43,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:08:43 BoogieIcfgContainer [2018-10-25 00:08:43,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:08:43,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:08:43,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:08:43,873 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:08:43,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:08:39" (1/3) ... [2018-10-25 00:08:43,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51a2d06b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:08:43, skipping insertion in model container [2018-10-25 00:08:43,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:40" (2/3) ... [2018-10-25 00:08:43,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51a2d06b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:08:43, skipping insertion in model container [2018-10-25 00:08:43,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:08:43" (3/3) ... [2018-10-25 00:08:43,877 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label53_true-unreach-call_false-termination.c [2018-10-25 00:08:43,889 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:08:43,907 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:08:43,927 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:08:43,980 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:08:43,980 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:08:43,980 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:08:43,981 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:08:43,981 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:08:43,981 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:08:43,981 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:08:43,981 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:08:44,019 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-25 00:08:44,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-25 00:08:44,036 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:44,037 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:44,039 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:44,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:44,045 INFO L82 PathProgramCache]: Analyzing trace with hash 151697799, now seen corresponding path program 1 times [2018-10-25 00:08:44,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:44,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:44,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:44,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:44,104 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:44,738 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:08:44,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:44,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:44,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:08:44,843 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:44,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:08:44,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:08:44,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:08:44,869 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-25 00:08:46,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:46,455 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-10-25 00:08:46,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:08:46,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2018-10-25 00:08:46,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:46,480 INFO L225 Difference]: With dead ends: 621 [2018-10-25 00:08:46,480 INFO L226 Difference]: Without dead ends: 382 [2018-10-25 00:08:46,487 INFO L605 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-10-25 00:08:46,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-25 00:08:46,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-10-25 00:08:46,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-25 00:08:46,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-10-25 00:08:46,563 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 145 [2018-10-25 00:08:46,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:46,564 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-10-25 00:08:46,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:08:46,564 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-10-25 00:08:46,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-25 00:08:46,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:46,572 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:46,572 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:46,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:46,573 INFO L82 PathProgramCache]: Analyzing trace with hash 627656218, now seen corresponding path program 1 times [2018-10-25 00:08:46,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:46,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:46,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:46,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:46,575 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:47,119 WARN L179 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-25 00:08:47,349 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-25 00:08:47,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:47,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:47,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:08:47,466 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:47,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:08:47,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:08:47,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:08:47,468 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-10-25 00:08:49,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:49,072 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-10-25 00:08:49,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:08:49,073 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2018-10-25 00:08:49,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:49,078 INFO L225 Difference]: With dead ends: 903 [2018-10-25 00:08:49,078 INFO L226 Difference]: Without dead ends: 381 [2018-10-25 00:08:49,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:08:49,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-25 00:08:49,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-10-25 00:08:49,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-25 00:08:49,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-10-25 00:08:49,108 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 154 [2018-10-25 00:08:49,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:49,109 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-10-25 00:08:49,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:08:49,109 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-10-25 00:08:49,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-25 00:08:49,113 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:49,113 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:49,114 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:49,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:49,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1014173274, now seen corresponding path program 1 times [2018-10-25 00:08:49,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:49,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:49,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:49,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:49,116 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:49,587 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:49,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:49,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:08:49,587 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:49,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:08:49,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:08:49,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:08:49,589 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-10-25 00:08:51,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:51,233 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-10-25 00:08:51,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:08:51,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2018-10-25 00:08:51,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:51,237 INFO L225 Difference]: With dead ends: 901 [2018-10-25 00:08:51,237 INFO L226 Difference]: Without dead ends: 380 [2018-10-25 00:08:51,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:08:51,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-25 00:08:51,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-10-25 00:08:51,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-25 00:08:51,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-10-25 00:08:51,256 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 160 [2018-10-25 00:08:51,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:51,257 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-10-25 00:08:51,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:08:51,257 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-10-25 00:08:51,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-25 00:08:51,260 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:51,261 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:51,261 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:51,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:51,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1544846205, now seen corresponding path program 1 times [2018-10-25 00:08:51,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:51,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:51,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:51,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:51,263 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:51,526 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:08:51,682 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:51,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:51,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:08:51,683 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:51,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:08:51,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:08:51,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:08:51,684 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-10-25 00:08:54,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:54,961 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-10-25 00:08:54,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:08:54,962 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 168 [2018-10-25 00:08:54,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:54,968 INFO L225 Difference]: With dead ends: 1193 [2018-10-25 00:08:54,968 INFO L226 Difference]: Without dead ends: 819 [2018-10-25 00:08:54,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:08:54,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-10-25 00:08:55,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-10-25 00:08:55,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-10-25 00:08:55,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-10-25 00:08:55,006 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 168 [2018-10-25 00:08:55,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:55,006 INFO L481 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-10-25 00:08:55,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:08:55,007 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-10-25 00:08:55,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-25 00:08:55,011 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:55,011 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:55,011 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:55,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:55,012 INFO L82 PathProgramCache]: Analyzing trace with hash -869251583, now seen corresponding path program 1 times [2018-10-25 00:08:55,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:55,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:55,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:55,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:55,013 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:55,446 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-25 00:08:55,677 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-25 00:08:55,760 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:55,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:55,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:08:55,761 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:55,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:08:55,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:08:55,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:08:55,763 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-10-25 00:08:56,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:56,775 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-10-25 00:08:56,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:08:56,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 170 [2018-10-25 00:08:56,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:56,795 INFO L225 Difference]: With dead ends: 1753 [2018-10-25 00:08:56,795 INFO L226 Difference]: Without dead ends: 804 [2018-10-25 00:08:56,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:08:56,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-10-25 00:08:56,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-10-25 00:08:56,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-10-25 00:08:56,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-10-25 00:08:56,833 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 170 [2018-10-25 00:08:56,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:56,834 INFO L481 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-10-25 00:08:56,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:08:56,834 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-10-25 00:08:56,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-25 00:08:56,838 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:56,839 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:56,839 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:56,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:56,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1524482181, now seen corresponding path program 1 times [2018-10-25 00:08:56,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:56,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:56,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:56,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:56,841 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:57,168 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:57,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:57,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:08:57,169 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:57,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:08:57,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:08:57,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:08:57,170 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-10-25 00:08:58,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:58,811 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-10-25 00:08:58,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:08:58,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2018-10-25 00:08:58,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:58,820 INFO L225 Difference]: With dead ends: 1747 [2018-10-25 00:08:58,821 INFO L226 Difference]: Without dead ends: 801 [2018-10-25 00:08:58,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:08:58,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-10-25 00:08:58,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-10-25 00:08:58,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-10-25 00:08:58,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-10-25 00:08:58,856 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 172 [2018-10-25 00:08:58,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:58,857 INFO L481 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-10-25 00:08:58,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:08:58,857 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-10-25 00:08:58,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-25 00:08:58,866 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:58,866 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:58,868 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:58,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:58,869 INFO L82 PathProgramCache]: Analyzing trace with hash 406701453, now seen corresponding path program 1 times [2018-10-25 00:08:58,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:58,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:58,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:58,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:58,877 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:59,094 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:08:59,377 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:59,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:59,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:08:59,378 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:59,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:08:59,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:08:59,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:08:59,379 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-10-25 00:09:00,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:09:00,504 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-10-25 00:09:00,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:09:00,506 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2018-10-25 00:09:00,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:09:00,516 INFO L225 Difference]: With dead ends: 2381 [2018-10-25 00:09:00,517 INFO L226 Difference]: Without dead ends: 1586 [2018-10-25 00:09:00,521 INFO L605 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-10-25 00:09:00,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-10-25 00:09:00,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-10-25 00:09:00,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-10-25 00:09:00,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-10-25 00:09:00,568 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 176 [2018-10-25 00:09:00,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:09:00,569 INFO L481 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-10-25 00:09:00,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:09:00,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-10-25 00:09:00,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-25 00:09:00,577 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:09:00,577 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:09:00,577 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:09:00,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:00,578 INFO L82 PathProgramCache]: Analyzing trace with hash 337466047, now seen corresponding path program 1 times [2018-10-25 00:09:00,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:09:00,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:00,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:09:00,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:00,579 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:09:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:09:01,024 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:09:01,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:09:01,025 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:09:01,026 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-10-25 00:09:01,028 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [831], [833], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:09:01,121 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:09:01,122 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:09:02,389 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:09:02,391 INFO L272 AbstractInterpreter]: Visited 149 different actions 292 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-25 00:09:02,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:02,439 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:09:04,074 INFO L232 lantSequenceWeakener]: Weakened 163 states. On average, predicates are now at 81.6% of their original sizes. [2018-10-25 00:09:04,074 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:09:09,412 INFO L413 sIntCurrentIteration]: We have 210 unified AI predicates [2018-10-25 00:09:09,413 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:09:09,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:09:09,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-10-25 00:09:09,414 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:09:09,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-25 00:09:09,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-25 00:09:09,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:09:09,416 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 18 states. [2018-10-25 00:09:29,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:09:29,009 INFO L93 Difference]: Finished difference Result 4236 states and 6014 transitions. [2018-10-25 00:09:29,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-25 00:09:29,009 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 211 [2018-10-25 00:09:29,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:09:29,023 INFO L225 Difference]: With dead ends: 4236 [2018-10-25 00:09:29,024 INFO L226 Difference]: Without dead ends: 2684 [2018-10-25 00:09:29,031 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 226 GetRequests, 75 SyntacticMatches, 119 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=224, Invalid=898, Unknown=0, NotChecked=0, Total=1122 [2018-10-25 00:09:29,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2018-10-25 00:09:29,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2459. [2018-10-25 00:09:29,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2459 states. [2018-10-25 00:09:29,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 3247 transitions. [2018-10-25 00:09:29,101 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 3247 transitions. Word has length 211 [2018-10-25 00:09:29,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:09:29,101 INFO L481 AbstractCegarLoop]: Abstraction has 2459 states and 3247 transitions. [2018-10-25 00:09:29,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-25 00:09:29,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 3247 transitions. [2018-10-25 00:09:29,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-25 00:09:29,111 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:09:29,112 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:09:29,112 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:09:29,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:29,113 INFO L82 PathProgramCache]: Analyzing trace with hash -345437012, now seen corresponding path program 1 times [2018-10-25 00:09:29,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:09:29,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:29,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:09:29,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:29,114 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:09:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:09:29,360 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 85 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:09:29,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:09:29,360 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:09:29,361 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 217 with the following transitions: [2018-10-25 00:09:29,361 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [119], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [831], [833], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:09:29,369 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:09:29,369 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:09:29,948 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:09:29,949 INFO L272 AbstractInterpreter]: Visited 151 different actions 450 times. Merged at 8 different actions 21 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-25 00:09:29,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:29,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:09:29,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:09:29,978 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-25 00:09:29,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:09:29,996 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:09:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:09:30,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:09:30,372 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:09:30,372 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:09:31,418 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:09:31,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:09:31,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2018-10-25 00:09:31,452 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:09:31,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-25 00:09:31,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-25 00:09:31,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-10-25 00:09:31,454 INFO L87 Difference]: Start difference. First operand 2459 states and 3247 transitions. Second operand 14 states. [2018-10-25 00:09:36,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:09:36,604 INFO L93 Difference]: Finished difference Result 7756 states and 10803 transitions. [2018-10-25 00:09:36,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-25 00:09:36,604 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 216 [2018-10-25 00:09:36,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:09:36,605 INFO L225 Difference]: With dead ends: 7756 [2018-10-25 00:09:36,605 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 00:09:36,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 444 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2018-10-25 00:09:36,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 00:09:36,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 00:09:36,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 00:09:36,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 00:09:36,628 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 216 [2018-10-25 00:09:36,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:09:36,628 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 00:09:36,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-25 00:09:36,628 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 00:09:36,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 00:09:36,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 00:09:36,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:36,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:36,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:36,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:36,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:36,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:36,951 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 69 [2018-10-25 00:09:37,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:37,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:37,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:37,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:37,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:37,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:37,068 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 72 [2018-10-25 00:09:37,740 WARN L179 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-10-25 00:09:37,996 WARN L179 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 77 [2018-10-25 00:09:40,183 WARN L179 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 258 DAG size of output: 76 [2018-10-25 00:09:40,711 WARN L179 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 90 [2018-10-25 00:09:41,038 WARN L179 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 90 [2018-10-25 00:09:41,041 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:09:41,041 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a17~0)| ~a17~0) (= |old(~a25~0)| ~a25~0) (= ~a28~0 |old(~a28~0)|)) [2018-10-25 00:09:41,041 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:09:41,041 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,041 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,042 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,042 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,042 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,042 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-10-25 00:09:41,042 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-10-25 00:09:41,042 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-10-25 00:09:41,042 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-10-25 00:09:41,042 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-10-25 00:09:41,043 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-10-25 00:09:41,043 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-10-25 00:09:41,043 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-10-25 00:09:41,043 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-10-25 00:09:41,043 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-10-25 00:09:41,043 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:09:41,043 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:09:41,043 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-10-25 00:09:41,044 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,044 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,044 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,044 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,044 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-10-25 00:09:41,044 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,044 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-10-25 00:09:41,044 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-10-25 00:09:41,044 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-10-25 00:09:41,044 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-10-25 00:09:41,045 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-10-25 00:09:41,045 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-10-25 00:09:41,045 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-10-25 00:09:41,045 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:09:41,045 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:09:41,045 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-10-25 00:09:41,045 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-10-25 00:09:41,045 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-10-25 00:09:41,045 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:09:41,045 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:09:41,046 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-10-25 00:09:41,046 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,046 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,046 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,046 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,046 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,046 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:09:41,046 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-10-25 00:09:41,046 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:09:41,046 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-10-25 00:09:41,047 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-10-25 00:09:41,047 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-10-25 00:09:41,047 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-10-25 00:09:41,047 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-10-25 00:09:41,047 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-10-25 00:09:41,047 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-10-25 00:09:41,047 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-10-25 00:09:41,047 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,047 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,048 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,048 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,048 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,048 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-10-25 00:09:41,048 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-10-25 00:09:41,048 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-10-25 00:09:41,048 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-10-25 00:09:41,048 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-10-25 00:09:41,048 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-10-25 00:09:41,049 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-10-25 00:09:41,049 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-10-25 00:09:41,049 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-10-25 00:09:41,049 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-10-25 00:09:41,049 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-10-25 00:09:41,049 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-10-25 00:09:41,049 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-10-25 00:09:41,049 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,049 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,049 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,049 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,049 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,050 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-10-25 00:09:41,050 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-10-25 00:09:41,050 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-10-25 00:09:41,050 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-10-25 00:09:41,050 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-10-25 00:09:41,050 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-10-25 00:09:41,050 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-10-25 00:09:41,050 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-10-25 00:09:41,050 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-10-25 00:09:41,050 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-10-25 00:09:41,050 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-10-25 00:09:41,051 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-10-25 00:09:41,051 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-10-25 00:09:41,051 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:09:41,051 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-10-25 00:09:41,051 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:09:41,051 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,051 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,051 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,051 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,052 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-10-25 00:09:41,052 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,052 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:09:41,052 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,052 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:09:41,052 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:09:41,052 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:09:41,052 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 586) no Hoare annotation was computed. [2018-10-25 00:09:41,053 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,053 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,053 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-10-25 00:09:41,053 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-10-25 00:09:41,053 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-10-25 00:09:41,053 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-10-25 00:09:41,053 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-10-25 00:09:41,053 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-10-25 00:09:41,053 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-10-25 00:09:41,053 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-10-25 00:09:41,053 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-10-25 00:09:41,053 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-10-25 00:09:41,053 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-10-25 00:09:41,054 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,054 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,054 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,054 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,054 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,054 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,054 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-10-25 00:09:41,054 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-10-25 00:09:41,054 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-10-25 00:09:41,054 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-10-25 00:09:41,054 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-10-25 00:09:41,054 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-10-25 00:09:41,054 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-10-25 00:09:41,054 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-10-25 00:09:41,055 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-10-25 00:09:41,055 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-10-25 00:09:41,055 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-10-25 00:09:41,055 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,055 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,055 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,055 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,055 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,055 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,055 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-10-25 00:09:41,055 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-10-25 00:09:41,056 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-10-25 00:09:41,056 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-10-25 00:09:41,056 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-10-25 00:09:41,056 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-10-25 00:09:41,056 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-10-25 00:09:41,056 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-10-25 00:09:41,056 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-10-25 00:09:41,056 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-10-25 00:09:41,056 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-10-25 00:09:41,056 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-10-25 00:09:41,056 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-10-25 00:09:41,056 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-10-25 00:09:41,056 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,056 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,057 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,057 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse18 (= |old(~a17~0)| ~a17~0)) (.cse19 (= |old(~a25~0)| ~a25~0)) (.cse20 (= ~a28~0 |old(~a28~0)|)) (.cse6 (= 1 |old(~a11~0)|)) (.cse14 (= 1 |old(~a19~0)|)) (.cse15 (= 1 |old(~a25~0)|)) (.cse11 (= 1 ~a11~0)) (.cse12 (= 1 ~a19~0))) (let ((.cse0 (and .cse11 .cse12)) (.cse2 (not .cse15)) (.cse3 (not .cse14)) (.cse10 (not (= 7 |old(~a28~0)|))) (.cse4 (not (= 8 |old(~a17~0)|))) (.cse5 (not .cse6)) (.cse13 (= 9 |old(~a28~0)|)) (.cse8 (not (= ~a11~0 1))) (.cse17 (not (= |old(~a17~0)| 8))) (.cse16 (and .cse18 .cse19 .cse20)) (.cse1 (not (= 1 ~a21~0))) (.cse7 (= 8 |old(~a28~0)|)) (.cse9 (< 7 |old(~a17~0)|))) (and (or .cse0 .cse1 (not (= 10 |old(~a28~0)|)) .cse2 .cse3 .cse4 .cse5) (or .cse1 .cse6 .cse7 .cse8 .cse9) (or .cse1 .cse10 .cse2 .cse3 .cse5 .cse0 (not (= 7 |old(~a17~0)|))) (or .cse1 .cse2 .cse3 .cse4 (and .cse11 (= 1 ~a25~0) (= 9 ~a28~0) (= 8 ~a17~0) .cse12) (not .cse13) .cse5) (or (and (= ~a11~0 0) (= ~a19~0 1)) (or .cse1 .cse3 (= 0 |old(~a28~0)|) (not (= 0 |old(~a11~0)|)) .cse4 (= |calculate_output_#in~input| 0))) (or .cse14 .cse1 .cse10 .cse4 (and .cse11 (not .cse12)) .cse5 .cse15) (or .cse1 .cse7 .cse16 .cse13 .cse17) (or .cse1 .cse6 (and .cse18 .cse19 .cse20 .cse8) .cse17) (or .cse1 .cse7 .cse16 .cse17 .cse15) (or .cse16 .cse1 .cse7 .cse9)))) [2018-10-25 00:09:41,057 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,057 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,057 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,057 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-10-25 00:09:41,057 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-10-25 00:09:41,057 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-10-25 00:09:41,057 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-10-25 00:09:41,058 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-10-25 00:09:41,058 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-10-25 00:09:41,058 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-10-25 00:09:41,058 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-10-25 00:09:41,058 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-10-25 00:09:41,058 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-10-25 00:09:41,058 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-10-25 00:09:41,058 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-10-25 00:09:41,058 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-10-25 00:09:41,058 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,058 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,059 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,059 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,059 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,059 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,059 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-10-25 00:09:41,059 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-10-25 00:09:41,059 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-10-25 00:09:41,059 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-10-25 00:09:41,059 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-10-25 00:09:41,059 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-10-25 00:09:41,060 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-10-25 00:09:41,060 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-10-25 00:09:41,060 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-10-25 00:09:41,060 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-10-25 00:09:41,060 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-10-25 00:09:41,060 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:09:41,060 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:09:41,060 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-10-25 00:09:41,060 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-10-25 00:09:41,061 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-10-25 00:09:41,061 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,061 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,061 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,061 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,061 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:41,061 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-10-25 00:09:41,061 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-10-25 00:09:41,061 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-10-25 00:09:41,061 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-10-25 00:09:41,061 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-10-25 00:09:41,061 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-10-25 00:09:41,062 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-10-25 00:09:41,062 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-10-25 00:09:41,062 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-10-25 00:09:41,062 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-10-25 00:09:41,062 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-10-25 00:09:41,062 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:09:41,062 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-10-25 00:09:41,062 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:09:41,062 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-10-25 00:09:41,062 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:09:41,062 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:09:41,062 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-10-25 00:09:41,062 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-10-25 00:09:41,062 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:09:41,063 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-10-25 00:09:41,063 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 00:09:41,063 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:09:41,063 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)) (and (= ~a11~0 0) (= ~a25~0 0) (= ~a19~0 1) (= |old(~a28~0)| ~a28~0) (= ~a17~0 8)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (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-10-25 00:09:41,063 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-10-25 00:09:41,063 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse1 (= |old(~a17~0)| ~a17~0)) (.cse0 (not (= ~a28~0 8)))) (or (and (<= ~a17~0 7) .cse0) (and (= 9 ~a28~0) (= 8 ~a17~0) (= 1 ~a19~0)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse1 (not (= ~a11~0 1))) (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)) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (and .cse1 .cse0 (not (= ~a28~0 9))) (not (= ~a~0 1)) (and (not (= ~a25~0 1)) .cse1 .cse0) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-10-25 00:09:41,063 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:09:41,063 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:09:41,064 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse1 (= |old(~a17~0)| ~a17~0)) (.cse0 (not (= ~a28~0 8)))) (or (and (<= ~a17~0 7) .cse0) (and (= 9 ~a28~0) (= 8 ~a17~0) (= 1 ~a19~0)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse1 (not (= ~a11~0 1))) (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)) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (and .cse1 .cse0 (not (= ~a28~0 9))) (not (= ~a~0 1)) (and (not (= ~a25~0 1)) .cse1 .cse0) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-10-25 00:09:41,064 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-10-25 00:09:41,064 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-10-25 00:09:41,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:09:41 BoogieIcfgContainer [2018-10-25 00:09:41,078 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:09:41,079 INFO L168 Benchmark]: Toolchain (without parser) took 61620.15 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -787.8 MB). Peak memory consumption was 837.5 MB. Max. memory is 7.1 GB. [2018-10-25 00:09:41,080 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:09:41,080 INFO L168 Benchmark]: CACSL2BoogieTranslator took 776.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-25 00:09:41,081 INFO L168 Benchmark]: Boogie Procedure Inliner took 182.60 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -790.9 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-10-25 00:09:41,082 INFO L168 Benchmark]: Boogie Preprocessor took 83.78 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:09:41,082 INFO L168 Benchmark]: RCFGBuilder took 3364.26 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 119.9 MB). Peak memory consumption was 119.9 MB. Max. memory is 7.1 GB. [2018-10-25 00:09:41,083 INFO L168 Benchmark]: TraceAbstraction took 57208.08 ms. Allocated memory was 2.2 GB in the beginning and 3.1 GB in the end (delta: 909.6 MB). Free memory was 2.0 GB in the beginning and 2.2 GB in the end (delta: -148.5 MB). Peak memory consumption was 761.1 MB. Max. memory is 7.1 GB. [2018-10-25 00:09:41,088 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 776.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 182.60 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -790.9 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 83.78 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3364.26 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 119.9 MB). Peak memory consumption was 119.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 57208.08 ms. Allocated memory was 2.2 GB in the beginning and 3.1 GB in the end (delta: 909.6 MB). Free memory was 2.0 GB in the beginning and 2.2 GB in the end (delta: -148.5 MB). Peak memory consumption was 761.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 586]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((((((((((((((a17 <= 7 && !(a28 == 8)) || ((9 == a28 && 8 == a17) && 1 == a19)) || !(a21 == 1)) || !(y == 25)) || (\old(a17) == a17 && !(a11 == 1))) || !(1 == \old(a19))) || !(x == 24)) || !(e == 5)) || !(d == 4)) || !(21 == u)) || !(22 == v)) || !(\old(a11) == 0)) || !(z == 26)) || !(0 == \old(a25))) || !(3 == c)) || !(23 == w)) || !(\old(a28) == 7)) || ((\old(a17) == a17 && !(a28 == 8)) && !(a28 == 9))) || !(a == 1)) || ((!(a25 == 1) && \old(a17) == a17) && !(a28 == 8))) || !(\old(a17) == 8)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 57.1s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 36.8s AutomataDifference, 0.0s DeadEndRemovalTime, 4.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1142 SDtfs, 8025 SDslu, 1176 SDs, 0 SdLazy, 10838 SolverSat, 1876 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.6s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 759 GetRequests, 541 SyntacticMatches, 127 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1325 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2459occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.0s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9978787791392834 AbsIntWeakeningRatio, 0.15714285714285714 AbsIntAvgWeakeningVarsNumRemoved, 0.11904761904761904 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 265 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 84 PreInvPairs, 162 NumberOfFragments, 671 HoareAnnotationTreeSize, 84 FomulaSimplifications, 6095 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 7 FomulaSimplificationsInter, 4765 FormulaSimplificationTreeSizeReductionInter, 3.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1788 NumberOfCodeBlocks, 1788 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1993 ConstructedInterpolants, 0 QuantifiedInterpolants, 1678726 SizeOfPredicates, 0 NumberOfNonLiveVariables, 525 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 508/542 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...