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_label34_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:07:11,858 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:07:11,861 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:07:11,873 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:07:11,873 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:07:11,874 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:07:11,876 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:07:11,883 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:07:11,885 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:07:11,886 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:07:11,888 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:07:11,888 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:07:11,889 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:07:11,890 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:07:11,891 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:07:11,892 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:07:11,893 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:07:11,895 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:07:11,896 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:07:11,898 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:07:11,899 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:07:11,901 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:07:11,903 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:07:11,904 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:07:11,904 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:07:11,905 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:07:11,906 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:07:11,907 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:07:11,908 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:07:11,909 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:07:11,909 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:07:11,910 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:07:11,910 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:07:11,911 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:07:11,912 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:07:11,912 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:07:11,913 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:07:11,928 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:07:11,928 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:07:11,929 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:07:11,929 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:07:11,929 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:07:11,930 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:07:11,930 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:07:11,930 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:07:11,930 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:07:11,930 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:07:11,931 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:07:11,931 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:07:11,931 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:07:11,931 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:07:11,932 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:07:11,932 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:07:11,932 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:07:11,933 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:07:11,933 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:07:11,933 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:07:11,933 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:07:11,933 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:07:11,934 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:07:11,934 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:07:11,934 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:07:11,934 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:07:11,934 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:07:11,935 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:07:11,935 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:07:11,935 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:07:11,935 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:07:11,935 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:07:11,936 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:07:11,936 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:07:11,936 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:07:11,936 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:07:11,994 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:07:12,011 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:07:12,015 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:07:12,017 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:07:12,018 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:07:12,020 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label34_true-unreach-call_false-termination.c [2018-10-25 00:07:12,091 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a9f90579e/884b0392fb174e30962c232ab3354680/FLAG2d35cf37e [2018-10-25 00:07:12,705 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:07:12,706 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label34_true-unreach-call_false-termination.c [2018-10-25 00:07:12,726 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a9f90579e/884b0392fb174e30962c232ab3354680/FLAG2d35cf37e [2018-10-25 00:07:12,742 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a9f90579e/884b0392fb174e30962c232ab3354680 [2018-10-25 00:07:12,754 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:07:12,755 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:07:12,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:07:12,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:07:12,764 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:07:12,765 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:07:12" (1/1) ... [2018-10-25 00:07:12,769 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d7203e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:12, skipping insertion in model container [2018-10-25 00:07:12,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:07:12" (1/1) ... [2018-10-25 00:07:12,779 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:07:12,849 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:07:13,419 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:07:13,424 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:07:13,543 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:07:13,563 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:07:13,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:13 WrapperNode [2018-10-25 00:07:13,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:07:13,565 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:07:13,565 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:07:13,565 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:07:13,576 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:07:13" (1/1) ... [2018-10-25 00:07:13,606 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:07:13" (1/1) ... [2018-10-25 00:07:13,755 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:07:13,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:07:13,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:07:13,756 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:07:13,767 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:13" (1/1) ... [2018-10-25 00:07:13,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:13" (1/1) ... [2018-10-25 00:07:13,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:13" (1/1) ... [2018-10-25 00:07:13,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:13" (1/1) ... [2018-10-25 00:07:13,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:13" (1/1) ... [2018-10-25 00:07:13,837 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:13" (1/1) ... [2018-10-25 00:07:13,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:13" (1/1) ... [2018-10-25 00:07:13,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:07:13,849 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:07:13,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:07:13,849 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:07:13,850 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:13" (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:07:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:07:13,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:07:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:07:13,929 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:07:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:07:13,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:07:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:07:13,930 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:07:17,068 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:07:17,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:07:17 BoogieIcfgContainer [2018-10-25 00:07:17,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:07:17,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:07:17,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:07:17,081 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:07:17,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:07:12" (1/3) ... [2018-10-25 00:07:17,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2cd37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:07:17, skipping insertion in model container [2018-10-25 00:07:17,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:13" (2/3) ... [2018-10-25 00:07:17,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2cd37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:07:17, skipping insertion in model container [2018-10-25 00:07:17,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:07:17" (3/3) ... [2018-10-25 00:07:17,088 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label34_true-unreach-call_false-termination.c [2018-10-25 00:07:17,101 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:07:17,111 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:07:17,129 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:07:17,174 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:07:17,174 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:07:17,174 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:07:17,175 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:07:17,175 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:07:17,175 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:07:17,175 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:07:17,176 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:07:17,205 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-25 00:07:17,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-25 00:07:17,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:07:17,220 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] [2018-10-25 00:07:17,222 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:07:17,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:17,228 INFO L82 PathProgramCache]: Analyzing trace with hash -2048669081, now seen corresponding path program 1 times [2018-10-25 00:07:17,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:07:17,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:17,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:07:17,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:17,280 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:07:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:07:17,844 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:07:17,950 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:07:17,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:07:17,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:07:17,953 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:07:17,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:07:17,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:07:17,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:07:17,981 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-25 00:07:19,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:07:19,308 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2018-10-25 00:07:19,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:07:19,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2018-10-25 00:07:19,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:07:19,330 INFO L225 Difference]: With dead ends: 618 [2018-10-25 00:07:19,330 INFO L226 Difference]: Without dead ends: 379 [2018-10-25 00:07:19,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:07:19,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-10-25 00:07:19,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-10-25 00:07:19,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-10-25 00:07:19,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 621 transitions. [2018-10-25 00:07:19,418 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 621 transitions. Word has length 105 [2018-10-25 00:07:19,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:07:19,419 INFO L481 AbstractCegarLoop]: Abstraction has 379 states and 621 transitions. [2018-10-25 00:07:19,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:07:19,420 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 621 transitions. [2018-10-25 00:07:19,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-25 00:07:19,427 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:07:19,428 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-25 00:07:19,428 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:07:19,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:19,429 INFO L82 PathProgramCache]: Analyzing trace with hash -926147150, now seen corresponding path program 1 times [2018-10-25 00:07:19,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:07:19,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:19,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:07:19,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:19,431 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:07:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:07:19,672 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:07:19,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:07:19,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:07:19,672 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:07:19,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:07:19,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:07:19,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:07:19,675 INFO L87 Difference]: Start difference. First operand 379 states and 621 transitions. Second operand 6 states. [2018-10-25 00:07:21,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:07:21,890 INFO L93 Difference]: Finished difference Result 1231 states and 2094 transitions. [2018-10-25 00:07:21,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-25 00:07:21,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2018-10-25 00:07:21,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:07:21,903 INFO L225 Difference]: With dead ends: 1231 [2018-10-25 00:07:21,903 INFO L226 Difference]: Without dead ends: 858 [2018-10-25 00:07:21,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:07:21,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2018-10-25 00:07:21,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 821. [2018-10-25 00:07:21,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-10-25 00:07:21,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1290 transitions. [2018-10-25 00:07:21,974 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1290 transitions. Word has length 121 [2018-10-25 00:07:21,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:07:21,974 INFO L481 AbstractCegarLoop]: Abstraction has 821 states and 1290 transitions. [2018-10-25 00:07:21,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:07:21,975 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1290 transitions. [2018-10-25 00:07:21,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-25 00:07:21,981 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:07:21,981 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] [2018-10-25 00:07:21,982 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:07:21,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:21,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1688257955, now seen corresponding path program 1 times [2018-10-25 00:07:21,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:07:21,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:21,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:07:21,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:21,984 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:07:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:07:22,262 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:07:22,398 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:07:22,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:07:22,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:07:22,399 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:07:22,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:07:22,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:07:22,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:07:22,401 INFO L87 Difference]: Start difference. First operand 821 states and 1290 transitions. Second operand 6 states. [2018-10-25 00:07:26,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:07:26,441 INFO L93 Difference]: Finished difference Result 2553 states and 4218 transitions. [2018-10-25 00:07:26,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:07:26,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2018-10-25 00:07:26,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:07:26,467 INFO L225 Difference]: With dead ends: 2553 [2018-10-25 00:07:26,467 INFO L226 Difference]: Without dead ends: 1738 [2018-10-25 00:07:26,474 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:07:26,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-10-25 00:07:26,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1680. [2018-10-25 00:07:26,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1680 states. [2018-10-25 00:07:26,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2538 transitions. [2018-10-25 00:07:26,557 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2538 transitions. Word has length 128 [2018-10-25 00:07:26,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:07:26,557 INFO L481 AbstractCegarLoop]: Abstraction has 1680 states and 2538 transitions. [2018-10-25 00:07:26,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:07:26,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2538 transitions. [2018-10-25 00:07:26,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-25 00:07:26,568 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:07:26,568 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2018-10-25 00:07:26,568 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:07:26,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:26,570 INFO L82 PathProgramCache]: Analyzing trace with hash -690130107, now seen corresponding path program 1 times [2018-10-25 00:07:26,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:07:26,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:26,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:07:26,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:26,572 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:07:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:07:26,718 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-25 00:07:26,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:07:26,719 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:07:26,720 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 131 with the following transitions: [2018-10-25 00:07:26,722 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [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], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:07:26,772 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:07:26,772 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:07:27,288 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:07:27,289 INFO L272 AbstractInterpreter]: Visited 106 different actions 106 times. Never merged. Never widened. Never found a fixpoint. Largest state had 38 variables. [2018-10-25 00:07:27,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:27,337 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:07:27,826 INFO L232 lantSequenceWeakener]: Weakened 121 states. On average, predicates are now at 80.75% of their original sizes. [2018-10-25 00:07:27,826 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:07:28,083 INFO L413 sIntCurrentIteration]: We have 129 unified AI predicates [2018-10-25 00:07:28,083 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:07:28,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:07:28,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 00:07:28,085 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:07:28,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:07:28,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:07:28,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:07:28,086 INFO L87 Difference]: Start difference. First operand 1680 states and 2538 transitions. Second operand 6 states. [2018-10-25 00:07:40,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:07:40,187 INFO L93 Difference]: Finished difference Result 3502 states and 5277 transitions. [2018-10-25 00:07:40,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:07:40,188 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2018-10-25 00:07:40,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:07:40,198 INFO L225 Difference]: With dead ends: 3502 [2018-10-25 00:07:40,198 INFO L226 Difference]: Without dead ends: 1828 [2018-10-25 00:07:40,204 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-25 00:07:40,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1828 states. [2018-10-25 00:07:40,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1828 to 1825. [2018-10-25 00:07:40,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1825 states. [2018-10-25 00:07:40,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1825 states and 2690 transitions. [2018-10-25 00:07:40,257 INFO L78 Accepts]: Start accepts. Automaton has 1825 states and 2690 transitions. Word has length 130 [2018-10-25 00:07:40,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:07:40,257 INFO L481 AbstractCegarLoop]: Abstraction has 1825 states and 2690 transitions. [2018-10-25 00:07:40,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:07:40,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 2690 transitions. [2018-10-25 00:07:40,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-25 00:07:40,263 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:07:40,263 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2018-10-25 00:07:40,264 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:07:40,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:40,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1874144486, now seen corresponding path program 1 times [2018-10-25 00:07:40,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:07:40,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:40,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:07:40,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:40,266 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:07:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:07:40,552 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 32 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 00:07:40,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:07:40,553 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:07:40,553 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2018-10-25 00:07:40,553 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [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], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:07:40,558 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:07:40,559 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:07:41,121 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:07:41,121 INFO L272 AbstractInterpreter]: Visited 110 different actions 327 times. Merged at 7 different actions 19 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-25 00:07:41,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:41,160 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:07:42,229 INFO L232 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 81.94% of their original sizes. [2018-10-25 00:07:42,230 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:07:46,119 INFO L413 sIntCurrentIteration]: We have 139 unified AI predicates [2018-10-25 00:07:46,119 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:07:46,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:07:46,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 19 [2018-10-25 00:07:46,120 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:07:46,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-25 00:07:46,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-25 00:07:46,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-25 00:07:46,122 INFO L87 Difference]: Start difference. First operand 1825 states and 2690 transitions. Second operand 12 states. [2018-10-25 00:07:58,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:07:58,775 INFO L93 Difference]: Finished difference Result 5082 states and 7440 transitions. [2018-10-25 00:07:58,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-25 00:07:58,775 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 140 [2018-10-25 00:07:58,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:07:58,792 INFO L225 Difference]: With dead ends: 5082 [2018-10-25 00:07:58,793 INFO L226 Difference]: Without dead ends: 3263 [2018-10-25 00:07:58,800 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 143 GetRequests, 27 SyntacticMatches, 102 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-10-25 00:07:58,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3263 states. [2018-10-25 00:07:58,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3263 to 3067. [2018-10-25 00:07:58,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3067 states. [2018-10-25 00:07:58,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 4235 transitions. [2018-10-25 00:07:58,901 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 4235 transitions. Word has length 140 [2018-10-25 00:07:58,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:07:58,902 INFO L481 AbstractCegarLoop]: Abstraction has 3067 states and 4235 transitions. [2018-10-25 00:07:58,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-25 00:07:58,902 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 4235 transitions. [2018-10-25 00:07:58,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-25 00:07:58,911 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:07:58,911 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:58,912 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:07:58,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:58,912 INFO L82 PathProgramCache]: Analyzing trace with hash 506322742, now seen corresponding path program 1 times [2018-10-25 00:07:58,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:07:58,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:58,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:07:58,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:58,914 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:07:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:07:59,122 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:07:59,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:07:59,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:07:59,127 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:07:59,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:07:59,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:07:59,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:07:59,128 INFO L87 Difference]: Start difference. First operand 3067 states and 4235 transitions. Second operand 3 states. [2018-10-25 00:08:00,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:00,488 INFO L93 Difference]: Finished difference Result 7134 states and 10403 transitions. [2018-10-25 00:08:00,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:08:00,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2018-10-25 00:08:00,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:00,505 INFO L225 Difference]: With dead ends: 7134 [2018-10-25 00:08:00,506 INFO L226 Difference]: Without dead ends: 2858 [2018-10-25 00:08:00,522 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:08:00,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2018-10-25 00:08:00,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2858. [2018-10-25 00:08:00,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2858 states. [2018-10-25 00:08:00,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2858 states and 3654 transitions. [2018-10-25 00:08:00,592 INFO L78 Accepts]: Start accepts. Automaton has 2858 states and 3654 transitions. Word has length 142 [2018-10-25 00:08:00,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:00,592 INFO L481 AbstractCegarLoop]: Abstraction has 2858 states and 3654 transitions. [2018-10-25 00:08:00,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:08:00,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 3654 transitions. [2018-10-25 00:08:00,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-25 00:08:00,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:00,599 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,599 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:00,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:00,600 INFO L82 PathProgramCache]: Analyzing trace with hash -919197045, now seen corresponding path program 1 times [2018-10-25 00:08:00,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:00,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:00,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:00,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:00,601 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:00,830 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:08:01,145 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 66 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-25 00:08:01,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:08:01,145 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:08:01,145 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 168 with the following transitions: [2018-10-25 00:08:01,146 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [127], [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], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:08:01,153 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:08:01,154 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:08:01,534 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:08:01,534 INFO L272 AbstractInterpreter]: Visited 110 different actions 334 times. Merged at 8 different actions 26 times. Widened at 1 different actions 1 times. Found 4 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-25 00:08:01,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:01,544 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:08:02,625 INFO L232 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 83.33% of their original sizes. [2018-10-25 00:08:02,626 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:08:06,124 INFO L413 sIntCurrentIteration]: We have 166 unified AI predicates [2018-10-25 00:08:06,124 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:08:06,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:08:06,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-10-25 00:08:06,124 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:06,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-25 00:08:06,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-25 00:08:06,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-10-25 00:08:06,125 INFO L87 Difference]: Start difference. First operand 2858 states and 3654 transitions. Second operand 12 states. [2018-10-25 00:08:20,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:20,059 INFO L93 Difference]: Finished difference Result 7075 states and 9010 transitions. [2018-10-25 00:08:20,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-25 00:08:20,060 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 167 [2018-10-25 00:08:20,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:20,081 INFO L225 Difference]: With dead ends: 7075 [2018-10-25 00:08:20,082 INFO L226 Difference]: Without dead ends: 4520 [2018-10-25 00:08:20,088 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 173 GetRequests, 36 SyntacticMatches, 120 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2018-10-25 00:08:20,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4520 states. [2018-10-25 00:08:20,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4520 to 4207. [2018-10-25 00:08:20,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4207 states. [2018-10-25 00:08:20,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4207 states to 4207 states and 5093 transitions. [2018-10-25 00:08:20,200 INFO L78 Accepts]: Start accepts. Automaton has 4207 states and 5093 transitions. Word has length 167 [2018-10-25 00:08:20,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:20,201 INFO L481 AbstractCegarLoop]: Abstraction has 4207 states and 5093 transitions. [2018-10-25 00:08:20,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-25 00:08:20,201 INFO L276 IsEmpty]: Start isEmpty. Operand 4207 states and 5093 transitions. [2018-10-25 00:08:20,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-25 00:08:20,213 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:20,214 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,214 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:20,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:20,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1394719238, now seen corresponding path program 1 times [2018-10-25 00:08:20,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:20,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:20,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:20,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:20,216 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:20,453 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:08:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 107 proven. 35 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-25 00:08:20,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:08:20,671 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:08:20,671 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 211 with the following transitions: [2018-10-25 00:08:20,671 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [127], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [225], [228], [232], [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], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:08:20,675 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:08:20,675 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:08:21,214 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:08:21,214 INFO L272 AbstractInterpreter]: Visited 113 different actions 446 times. Merged at 8 different actions 34 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 4 different actions. Largest state had 38 variables. [2018-10-25 00:08:21,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:21,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:08:21,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:08:21,222 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:08:21,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:21,231 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:08:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:21,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:08:21,663 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 93 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-25 00:08:21,663 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:08:22,236 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 107 proven. 35 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-25 00:08:22,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:08:22,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-10-25 00:08:22,258 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:08:22,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 00:08:22,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 00:08:22,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:08:22,260 INFO L87 Difference]: Start difference. First operand 4207 states and 5093 transitions. Second operand 9 states. [2018-10-25 00:08:23,118 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-10-25 00:08:24,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:24,602 INFO L93 Difference]: Finished difference Result 9958 states and 12313 transitions. [2018-10-25 00:08:24,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 00:08:24,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 210 [2018-10-25 00:08:24,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:24,627 INFO L225 Difference]: With dead ends: 9958 [2018-10-25 00:08:24,627 INFO L226 Difference]: Without dead ends: 6052 [2018-10-25 00:08:24,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 419 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-10-25 00:08:24,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6052 states. [2018-10-25 00:08:24,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6052 to 6005. [2018-10-25 00:08:24,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6005 states. [2018-10-25 00:08:24,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6005 states to 6005 states and 7306 transitions. [2018-10-25 00:08:24,815 INFO L78 Accepts]: Start accepts. Automaton has 6005 states and 7306 transitions. Word has length 210 [2018-10-25 00:08:24,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:24,816 INFO L481 AbstractCegarLoop]: Abstraction has 6005 states and 7306 transitions. [2018-10-25 00:08:24,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-25 00:08:24,816 INFO L276 IsEmpty]: Start isEmpty. Operand 6005 states and 7306 transitions. [2018-10-25 00:08:24,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-25 00:08:24,835 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:24,836 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:24,836 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:24,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:24,836 INFO L82 PathProgramCache]: Analyzing trace with hash -735902478, now seen corresponding path program 1 times [2018-10-25 00:08:24,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:24,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:24,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:24,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:24,838 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:25,288 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 115 proven. 35 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-25 00:08:25,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:08:25,289 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:08:25,289 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 215 with the following transitions: [2018-10-25 00:08:25,289 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [127], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [225], [228], [232], [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], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:08:25,292 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:08:25,293 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:08:26,341 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:08:26,341 INFO L272 AbstractInterpreter]: Visited 113 different actions 449 times. Merged at 8 different actions 37 times. Widened at 1 different actions 3 times. Found 6 fixpoints after 4 different actions. Largest state had 38 variables. [2018-10-25 00:08:26,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:26,376 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:08:26,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:08:26,376 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-25 00:08:26,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:26,392 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:08:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:26,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:08:26,951 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:08:26,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:08:27,068 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:08:27,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:08:27,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-10-25 00:08:27,091 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:08:27,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 00:08:27,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 00:08:27,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-10-25 00:08:27,092 INFO L87 Difference]: Start difference. First operand 6005 states and 7306 transitions. Second operand 9 states. [2018-10-25 00:08:31,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:31,446 INFO L93 Difference]: Finished difference Result 10874 states and 13425 transitions. [2018-10-25 00:08:31,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-25 00:08:31,446 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 214 [2018-10-25 00:08:31,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:31,461 INFO L225 Difference]: With dead ends: 10874 [2018-10-25 00:08:31,461 INFO L226 Difference]: Without dead ends: 3604 [2018-10-25 00:08:31,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 446 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2018-10-25 00:08:31,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3604 states. [2018-10-25 00:08:31,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3604 to 3499. [2018-10-25 00:08:31,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3499 states. [2018-10-25 00:08:31,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3499 states to 3499 states and 4012 transitions. [2018-10-25 00:08:31,575 INFO L78 Accepts]: Start accepts. Automaton has 3499 states and 4012 transitions. Word has length 214 [2018-10-25 00:08:31,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:31,575 INFO L481 AbstractCegarLoop]: Abstraction has 3499 states and 4012 transitions. [2018-10-25 00:08:31,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-25 00:08:31,576 INFO L276 IsEmpty]: Start isEmpty. Operand 3499 states and 4012 transitions. [2018-10-25 00:08:31,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-25 00:08:31,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:31,586 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,586 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:31,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:31,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1941426456, now seen corresponding path program 1 times [2018-10-25 00:08:31,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:31,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:31,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:31,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:31,588 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:32,242 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 105 proven. 54 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 00:08:32,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:08:32,242 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:08:32,243 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 216 with the following transitions: [2018-10-25 00:08:32,243 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [225], [228], [232], [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], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:08:32,245 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:08:32,246 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:08:32,687 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:08:32,687 INFO L272 AbstractInterpreter]: Visited 110 different actions 322 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-25 00:08:32,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:32,730 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:08:33,937 INFO L232 lantSequenceWeakener]: Weakened 104 states. On average, predicates are now at 81.04% of their original sizes. [2018-10-25 00:08:33,938 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:08:37,793 INFO L413 sIntCurrentIteration]: We have 214 unified AI predicates [2018-10-25 00:08:37,793 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:08:37,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:08:37,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [10] total 21 [2018-10-25 00:08:37,794 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:37,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-25 00:08:37,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-25 00:08:37,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-10-25 00:08:37,795 INFO L87 Difference]: Start difference. First operand 3499 states and 4012 transitions. Second operand 13 states. [2018-10-25 00:08:52,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:52,187 INFO L93 Difference]: Finished difference Result 6731 states and 7765 transitions. [2018-10-25 00:08:52,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-25 00:08:52,187 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 215 [2018-10-25 00:08:52,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:52,205 INFO L225 Difference]: With dead ends: 6731 [2018-10-25 00:08:52,205 INFO L226 Difference]: Without dead ends: 4812 [2018-10-25 00:08:52,210 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 219 GetRequests, 50 SyntacticMatches, 153 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:08:52,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4812 states. [2018-10-25 00:08:52,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4812 to 4761. [2018-10-25 00:08:52,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4761 states. [2018-10-25 00:08:52,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4761 states to 4761 states and 5415 transitions. [2018-10-25 00:08:52,327 INFO L78 Accepts]: Start accepts. Automaton has 4761 states and 5415 transitions. Word has length 215 [2018-10-25 00:08:52,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:52,328 INFO L481 AbstractCegarLoop]: Abstraction has 4761 states and 5415 transitions. [2018-10-25 00:08:52,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-25 00:08:52,328 INFO L276 IsEmpty]: Start isEmpty. Operand 4761 states and 5415 transitions. [2018-10-25 00:08:52,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-25 00:08:52,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:52,342 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-25 00:08:52,342 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:52,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:52,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1479282081, now seen corresponding path program 1 times [2018-10-25 00:08:52,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:52,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:52,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:52,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:52,344 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:52,925 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 160 proven. 95 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-10-25 00:08:52,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:08:52,925 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:08:52,926 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 271 with the following transitions: [2018-10-25 00:08:52,926 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [225], [228], [232], [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], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:08:52,928 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:08:52,928 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:08:53,441 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:08:53,441 INFO L272 AbstractInterpreter]: Visited 113 different actions 449 times. Merged at 8 different actions 34 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-25 00:08:53,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:53,446 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:08:55,687 INFO L232 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 81.11% of their original sizes. [2018-10-25 00:08:55,687 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:09:02,129 INFO L413 sIntCurrentIteration]: We have 269 unified AI predicates [2018-10-25 00:09:02,130 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:09:02,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:09:02,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [10] total 23 [2018-10-25 00:09:02,130 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:09:02,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 00:09:02,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 00:09:02,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-10-25 00:09:02,132 INFO L87 Difference]: Start difference. First operand 4761 states and 5415 transitions. Second operand 15 states. [2018-10-25 00:09:17,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:09:17,317 INFO L93 Difference]: Finished difference Result 6859 states and 7780 transitions. [2018-10-25 00:09:17,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-25 00:09:17,317 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 270 [2018-10-25 00:09:17,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:09:17,318 INFO L225 Difference]: With dead ends: 6859 [2018-10-25 00:09:17,318 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 00:09:17,329 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 275 GetRequests, 43 SyntacticMatches, 213 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1493 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2018-10-25 00:09:17,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 00:09:17,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 00:09:17,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 00:09:17,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 00:09:17,330 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 270 [2018-10-25 00:09:17,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:09:17,330 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 00:09:17,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-25 00:09:17,331 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 00:09:17,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 00:09:17,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 00:09:17,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:17,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:17,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:17,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:17,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:17,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:17,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:17,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:17,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:17,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:17,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:17,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:17,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:17,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:18,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:18,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:18,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:18,568 WARN L179 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 187 [2018-10-25 00:09:18,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:18,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:19,007 WARN L179 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 258 DAG size of output: 194 [2018-10-25 00:09:19,943 WARN L179 SmtUtils]: Spent 934.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2018-10-25 00:09:20,548 WARN L179 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 77 [2018-10-25 00:09:26,099 WARN L179 SmtUtils]: Spent 5.53 s on a formula simplification. DAG size of input: 312 DAG size of output: 81 [2018-10-25 00:09:27,361 WARN L179 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 205 DAG size of output: 97 [2018-10-25 00:09:28,345 WARN L179 SmtUtils]: Spent 979.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 97 [2018-10-25 00:09:28,348 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:09:28,348 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a17~0 |old(~a17~0)|) (= |old(~a28~0)| ~a28~0) (= |old(~a19~0)| ~a19~0) (= ~a11~0 |old(~a11~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-10-25 00:09:28,348 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:09:28,348 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,349 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,349 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,349 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,349 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,349 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-10-25 00:09:28,349 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-10-25 00:09:28,349 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-10-25 00:09:28,349 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-10-25 00:09:28,350 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-10-25 00:09:28,350 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-10-25 00:09:28,350 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-10-25 00:09:28,350 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-10-25 00:09:28,350 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-10-25 00:09:28,350 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-10-25 00:09:28,350 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:09:28,350 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:09:28,350 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-10-25 00:09:28,351 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,351 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,351 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,351 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,351 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-10-25 00:09:28,351 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,351 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-10-25 00:09:28,351 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-10-25 00:09:28,352 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-10-25 00:09:28,352 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-10-25 00:09:28,352 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-10-25 00:09:28,352 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-10-25 00:09:28,352 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-10-25 00:09:28,352 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:09:28,352 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:09:28,352 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-10-25 00:09:28,352 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-10-25 00:09:28,353 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-10-25 00:09:28,353 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:09:28,353 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:09:28,353 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-10-25 00:09:28,353 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,353 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,353 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,353 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,353 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,354 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:09:28,354 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-10-25 00:09:28,354 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:09:28,354 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-10-25 00:09:28,354 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-10-25 00:09:28,354 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-10-25 00:09:28,354 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-10-25 00:09:28,354 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-10-25 00:09:28,354 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-10-25 00:09:28,355 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-10-25 00:09:28,355 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-10-25 00:09:28,355 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,355 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,355 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,355 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,355 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,355 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-10-25 00:09:28,355 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-10-25 00:09:28,356 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-10-25 00:09:28,356 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-10-25 00:09:28,356 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-10-25 00:09:28,356 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-10-25 00:09:28,356 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-10-25 00:09:28,356 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-10-25 00:09:28,356 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-10-25 00:09:28,356 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-10-25 00:09:28,356 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-10-25 00:09:28,357 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-10-25 00:09:28,357 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-10-25 00:09:28,357 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,357 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,357 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,357 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,357 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,357 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-10-25 00:09:28,358 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-10-25 00:09:28,358 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-10-25 00:09:28,358 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-10-25 00:09:28,358 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-10-25 00:09:28,358 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-10-25 00:09:28,358 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-10-25 00:09:28,358 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-10-25 00:09:28,358 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-10-25 00:09:28,358 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-10-25 00:09:28,359 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-10-25 00:09:28,359 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-10-25 00:09:28,359 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-10-25 00:09:28,359 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:09:28,359 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-10-25 00:09:28,359 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:09:28,359 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,359 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,359 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,359 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,360 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-10-25 00:09:28,360 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,360 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:09:28,360 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,360 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:09:28,360 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:09:28,360 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:09:28,360 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,360 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,361 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-10-25 00:09:28,361 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-10-25 00:09:28,361 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-10-25 00:09:28,361 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-10-25 00:09:28,361 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-10-25 00:09:28,361 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-10-25 00:09:28,361 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-10-25 00:09:28,361 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-10-25 00:09:28,361 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-10-25 00:09:28,361 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-10-25 00:09:28,362 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-10-25 00:09:28,362 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 466) no Hoare annotation was computed. [2018-10-25 00:09:28,362 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,362 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,362 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,362 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,362 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,362 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,362 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-10-25 00:09:28,363 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-10-25 00:09:28,363 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-10-25 00:09:28,363 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-10-25 00:09:28,363 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-10-25 00:09:28,363 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-10-25 00:09:28,363 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-10-25 00:09:28,363 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-10-25 00:09:28,363 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-10-25 00:09:28,363 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-10-25 00:09:28,363 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-10-25 00:09:28,364 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,364 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,364 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,364 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,364 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,364 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,364 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-10-25 00:09:28,364 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-10-25 00:09:28,365 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-10-25 00:09:28,365 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-10-25 00:09:28,365 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-10-25 00:09:28,365 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-10-25 00:09:28,365 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-10-25 00:09:28,365 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-10-25 00:09:28,365 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-10-25 00:09:28,365 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-10-25 00:09:28,365 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-10-25 00:09:28,366 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-10-25 00:09:28,366 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-10-25 00:09:28,366 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-10-25 00:09:28,366 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,366 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,366 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,367 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse22 (not (= ~a28~0 0))) (.cse11 (= ~a19~0 1))) (let ((.cse1 (= 1 |old(~a25~0)|)) (.cse2 (<= ~a17~0 |old(~a17~0)|)) (.cse3 (= |old(~a28~0)| ~a28~0)) (.cse16 (and .cse22 .cse11 (= ~a21~0 1) (not (= ~a17~0 0)))) (.cse6 (= ~a25~0 |old(~a25~0)|)) (.cse17 (not (= 1 ~a21~0))) (.cse24 (not (= 1 |old(~a19~0)|))) (.cse18 (= 0 |old(~a28~0)|)) (.cse19 (not (= 8 |old(~a17~0)|)))) (let ((.cse12 (or .cse17 .cse24 .cse18 .cse19)) (.cse5 (= 1 ~a11~0)) (.cse20 (= |old(~a25~0)| ~a25~0)) (.cse0 (not (= 1 |old(~a11~0)|))) (.cse4 (= |old(~a19~0)| ~a19~0)) (.cse9 (= ~a11~0 0)) (.cse10 (= ~a17~0 8)) (.cse13 (or .cse17 .cse18 (not (= 0 |old(~a11~0)|)) .cse19)) (.cse14 (< 10 |old(~a28~0)|)) (.cse23 (and .cse2 .cse3 (= ~a11~0 |old(~a11~0)|) .cse16 .cse6)) (.cse8 (not .cse1)) (.cse15 (or .cse17 (= 0 |old(~a17~0)|) .cse24 .cse18)) (.cse21 (= |old(~a11~0)| |old(~a19~0)|)) (.cse7 (< 7 |old(~a17~0)|))) (and (or (or .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6) .cse7) (or .cse8 (and .cse3 .cse6 (and .cse9 .cse10 .cse11)) .cse12 .cse13) (or .cse14 .cse8 .cse15 (and .cse2 .cse3 .cse5 .cse16 .cse6) .cse0 .cse7) (or .cse14 (and .cse3 .cse10) .cse8 (or .cse17 .cse18 .cse19) .cse0) (or (and .cse4 .cse5 .cse20) .cse21 .cse0) (or .cse12 (and .cse5 .cse20 (and .cse22 .cse10 .cse11)) .cse0) (or (= 7 |old(~a17~0)|) (not (= ~a17~0 7)) .cse21 .cse0) (or .cse14 (and .cse3 .cse4 (and .cse9 .cse10) .cse6) .cse13) (or .cse14 .cse15 .cse23 .cse21 .cse7) (or .cse23 .cse8 .cse15 .cse21 .cse7))))) [2018-10-25 00:09:28,367 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,367 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,367 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,367 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-10-25 00:09:28,367 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-10-25 00:09:28,367 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-10-25 00:09:28,368 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-10-25 00:09:28,368 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-10-25 00:09:28,368 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-10-25 00:09:28,368 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-10-25 00:09:28,368 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-10-25 00:09:28,368 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-10-25 00:09:28,368 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-10-25 00:09:28,368 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-10-25 00:09:28,368 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-10-25 00:09:28,369 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-10-25 00:09:28,369 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,369 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,369 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,369 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,369 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,369 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,369 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-10-25 00:09:28,369 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-10-25 00:09:28,370 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-10-25 00:09:28,370 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-10-25 00:09:28,370 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-10-25 00:09:28,370 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-10-25 00:09:28,370 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-10-25 00:09:28,370 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-10-25 00:09:28,370 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-10-25 00:09:28,370 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-10-25 00:09:28,370 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-10-25 00:09:28,371 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:09:28,371 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:09:28,371 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-10-25 00:09:28,371 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-10-25 00:09:28,371 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-10-25 00:09:28,371 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,371 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,371 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,371 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,371 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:28,372 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-10-25 00:09:28,372 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-10-25 00:09:28,372 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-10-25 00:09:28,372 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-10-25 00:09:28,372 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-10-25 00:09:28,372 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-10-25 00:09:28,372 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-10-25 00:09:28,372 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-10-25 00:09:28,372 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-10-25 00:09:28,373 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-10-25 00:09:28,373 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-10-25 00:09:28,373 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:09:28,373 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-10-25 00:09:28,373 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:09:28,373 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-10-25 00:09:28,373 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:09:28,373 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:09:28,373 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-10-25 00:09:28,373 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-10-25 00:09:28,374 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:09:28,374 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:28,374 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 00:09:28,374 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:09:28,374 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (and (= ~a19~0 1) (= ~a25~0 |old(~a25~0)|) (= ~a11~0 |old(~a11~0)|) (= |old(~a28~0)| ~a28~0) (= ~a17~0 8)) (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (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:28,374 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-10-25 00:09:28,375 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse6 (not (= ~a28~0 0))) (.cse7 (= ~a17~0 8)) (.cse0 (= ~a21~0 1))) (let ((.cse3 (and (= ~a11~0 0) .cse6 .cse7 .cse0)) (.cse4 (and .cse6 .cse7 (= ~a19~0 1) .cse0)) (.cse5 (<= ~a17~0 7)) (.cse1 (= 1 ~a11~0)) (.cse2 (<= ~a28~0 10))) (or (not .cse0) (not (= ~y~0 25)) (and .cse1 (not (= ~a19~0 ~a11~0))) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (and .cse2 .cse3) (and (and (= 1 ~a25~0) .cse4) .cse3) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse5 .cse1 .cse2 (and .cse6 (not (= ~a17~0 0)))) (and .cse1 .cse4) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and .cse5 (not (= ~a25~0 1)) .cse1 .cse2) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0))))) [2018-10-25 00:09:28,375 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:09:28,375 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:09:28,375 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse6 (not (= ~a28~0 0))) (.cse7 (= ~a17~0 8)) (.cse0 (= ~a21~0 1))) (let ((.cse3 (and (= ~a11~0 0) .cse6 .cse7 .cse0)) (.cse4 (and .cse6 .cse7 (= ~a19~0 1) .cse0)) (.cse5 (<= ~a17~0 7)) (.cse1 (= 1 ~a11~0)) (.cse2 (<= ~a28~0 10))) (or (not .cse0) (not (= ~y~0 25)) (and .cse1 (not (= ~a19~0 ~a11~0))) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (and .cse2 .cse3) (and (and (= 1 ~a25~0) .cse4) .cse3) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse5 .cse1 .cse2 (and .cse6 (not (= ~a17~0 0)))) (and .cse1 .cse4) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and .cse5 (not (= ~a25~0 1)) .cse1 .cse2) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0))))) [2018-10-25 00:09:28,375 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-10-25 00:09:28,375 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-10-25 00:09:28,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:09:28 BoogieIcfgContainer [2018-10-25 00:09:28,392 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:09:28,393 INFO L168 Benchmark]: Toolchain (without parser) took 135638.35 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2018-10-25 00:09:28,394 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:09:28,394 INFO L168 Benchmark]: CACSL2BoogieTranslator took 807.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-25 00:09:28,395 INFO L168 Benchmark]: Boogie Procedure Inliner took 190.69 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -834.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2018-10-25 00:09:28,396 INFO L168 Benchmark]: Boogie Preprocessor took 92.71 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:09:28,396 INFO L168 Benchmark]: RCFGBuilder took 3221.80 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 114.5 MB). Peak memory consumption was 114.5 MB. Max. memory is 7.1 GB. [2018-10-25 00:09:28,397 INFO L168 Benchmark]: TraceAbstraction took 131313.99 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 3.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-10-25 00:09:28,402 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.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 807.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 190.69 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -834.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 92.71 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3221.80 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 114.5 MB). Peak memory consumption was 114.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 131313.99 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 3.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 466]: 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: (((((((((((((((((((((!(a21 == 1) || !(y == 25)) || (1 == a11 && !(a19 == a11))) || !(1 == \old(a19))) || !(x == 24)) || (a28 <= 10 && ((a11 == 0 && !(a28 == 0)) && a17 == 8) && a21 == 1)) || ((1 == a25 && ((!(a28 == 0) && a17 == 8) && a19 == 1) && a21 == 1) && ((a11 == 0 && !(a28 == 0)) && a17 == 8) && a21 == 1)) || !(e == 5)) || !(d == 4)) || (((a17 <= 7 && 1 == a11) && a28 <= 10) && !(a28 == 0) && !(a17 == 0))) || (1 == a11 && ((!(a28 == 0) && a17 == 8) && a19 == 1) && a21 == 1)) || !(21 == u)) || !(22 == v)) || !(\old(a11) == 0)) || (((a17 <= 7 && !(a25 == 1)) && 1 == a11) && a28 <= 10)) || !(z == 26)) || !(0 == \old(a25))) || !(3 == c)) || !(23 == w)) || !(\old(a28) == 7)) || !(a == 1)) || !(\old(a17) == 8)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 131.2s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 84.2s AutomataDifference, 0.0s DeadEndRemovalTime, 11.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1518 SDtfs, 9185 SDslu, 1596 SDs, 0 SdLazy, 17460 SolverSat, 1637 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.1s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 1883 GetRequests, 1155 SyntacticMatches, 595 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3980 ImplicationChecksByTransitivity, 21.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6005occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.2s AbstIntTime, 7 AbstIntIterations, 5 AbstIntStrong, 0.9966928334844017 AbsIntWeakeningRatio, 0.22464558342420937 AbsIntAvgWeakeningVarsNumRemoved, 4.140676117775355 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 810 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 188 PreInvPairs, 272 NumberOfFragments, 908 HoareAnnotationTreeSize, 188 FomulaSimplifications, 28105 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 7 FomulaSimplificationsInter, 39738 FormulaSimplificationTreeSizeReductionInter, 9.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 2266 NumberOfCodeBlocks, 2266 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2675 ConstructedInterpolants, 0 QuantifiedInterpolants, 1016052 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1030 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 15 InterpolantComputations, 4 PerfectInterpolantSequences, 1373/1667 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...