java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label24_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 17:13:29,050 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 17:13:29,052 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 17:13:29,065 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 17:13:29,065 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 17:13:29,066 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 17:13:29,067 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 17:13:29,072 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 17:13:29,074 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 17:13:29,075 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 17:13:29,076 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 17:13:29,076 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 17:13:29,077 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 17:13:29,078 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 17:13:29,079 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 17:13:29,080 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 17:13:29,081 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 17:13:29,083 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 17:13:29,085 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 17:13:29,086 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 17:13:29,087 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 17:13:29,088 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 17:13:29,091 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 17:13:29,091 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 17:13:29,091 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 17:13:29,092 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 17:13:29,093 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 17:13:29,094 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 17:13:29,095 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 17:13:29,096 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 17:13:29,096 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 17:13:29,097 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 17:13:29,097 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 17:13:29,097 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 17:13:29,098 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 17:13:29,099 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 17:13:29,099 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 17:13:29,119 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 17:13:29,119 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 17:13:29,120 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 17:13:29,120 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 17:13:29,120 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 17:13:29,121 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 17:13:29,121 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 17:13:29,121 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 17:13:29,121 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 17:13:29,121 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 17:13:29,122 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 17:13:29,122 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 17:13:29,122 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 17:13:29,123 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 17:13:29,123 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 17:13:29,123 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 17:13:29,123 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 17:13:29,123 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 17:13:29,124 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 17:13:29,124 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 17:13:29,124 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 17:13:29,124 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 17:13:29,124 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 17:13:29,125 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 17:13:29,125 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 17:13:29,125 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:13:29,125 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 17:13:29,125 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 17:13:29,125 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 17:13:29,126 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 17:13:29,126 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 17:13:29,126 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 17:13:29,126 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 17:13:29,126 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 17:13:29,127 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 17:13:29,189 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 17:13:29,204 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 17:13:29,208 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 17:13:29,210 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 17:13:29,210 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 17:13:29,211 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label24_true-unreach-call_false-termination.c [2018-11-12 17:13:29,273 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ec8bf5ba/f6bcf12bf940442fbc27bcef3c64951d/FLAG6887f96ff [2018-11-12 17:13:29,897 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 17:13:29,901 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label24_true-unreach-call_false-termination.c [2018-11-12 17:13:29,929 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ec8bf5ba/f6bcf12bf940442fbc27bcef3c64951d/FLAG6887f96ff [2018-11-12 17:13:29,946 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ec8bf5ba/f6bcf12bf940442fbc27bcef3c64951d [2018-11-12 17:13:29,959 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 17:13:29,962 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 17:13:29,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 17:13:29,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 17:13:29,970 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 17:13:29,971 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:13:29" (1/1) ... [2018-11-12 17:13:29,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e2cff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:29, skipping insertion in model container [2018-11-12 17:13:29,974 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:13:29" (1/1) ... [2018-11-12 17:13:29,986 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 17:13:30,065 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 17:13:30,550 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:13:30,557 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 17:13:30,695 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:13:30,714 INFO L193 MainTranslator]: Completed translation [2018-11-12 17:13:30,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:30 WrapperNode [2018-11-12 17:13:30,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 17:13:30,718 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 17:13:30,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 17:13:30,719 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 17:13:30,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:30" (1/1) ... [2018-11-12 17:13:30,845 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:30" (1/1) ... [2018-11-12 17:13:30,854 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 17:13:30,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 17:13:30,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 17:13:30,854 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 17:13:30,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:30" (1/1) ... [2018-11-12 17:13:30,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:30" (1/1) ... [2018-11-12 17:13:30,870 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:30" (1/1) ... [2018-11-12 17:13:30,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:30" (1/1) ... [2018-11-12 17:13:30,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:30" (1/1) ... [2018-11-12 17:13:30,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:30" (1/1) ... [2018-11-12 17:13:30,942 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:30" (1/1) ... [2018-11-12 17:13:30,961 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 17:13:30,962 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 17:13:30,962 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 17:13:30,962 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 17:13:30,963 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:13:31,042 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 17:13:31,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 17:13:31,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 17:13:31,043 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 17:13:31,043 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 17:13:31,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 17:13:31,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 17:13:31,043 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 17:13:31,046 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 17:13:34,767 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 17:13:34,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:13:34 BoogieIcfgContainer [2018-11-12 17:13:34,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 17:13:34,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 17:13:34,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 17:13:34,779 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 17:13:34,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:13:29" (1/3) ... [2018-11-12 17:13:34,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b26562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:13:34, skipping insertion in model container [2018-11-12 17:13:34,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:13:30" (2/3) ... [2018-11-12 17:13:34,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b26562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:13:34, skipping insertion in model container [2018-11-12 17:13:34,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:13:34" (3/3) ... [2018-11-12 17:13:34,783 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label24_true-unreach-call_false-termination.c [2018-11-12 17:13:34,791 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 17:13:34,799 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 17:13:34,818 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 17:13:34,862 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 17:13:34,863 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 17:13:34,863 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 17:13:34,863 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 17:13:34,863 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 17:13:34,864 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 17:13:34,864 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 17:13:34,864 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 17:13:34,896 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-12 17:13:34,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-12 17:13:34,914 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:13:34,916 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:13:34,918 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:13:34,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:34,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1658764377, now seen corresponding path program 1 times [2018-11-12 17:13:34,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:13:34,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:34,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:34,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:34,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:13:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:35,574 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:13:35,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:13:35,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:13:35,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:13:35,652 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:13:35,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:13:35,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:13:35,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:13:35,677 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-12 17:13:37,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:13:37,422 INFO L93 Difference]: Finished difference Result 621 states and 1060 transitions. [2018-11-12 17:13:37,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:13:37,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2018-11-12 17:13:37,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:13:37,447 INFO L225 Difference]: With dead ends: 621 [2018-11-12 17:13:37,447 INFO L226 Difference]: Without dead ends: 382 [2018-11-12 17:13:37,454 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:13:37,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-12 17:13:37,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2018-11-12 17:13:37,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-11-12 17:13:37,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 637 transitions. [2018-11-12 17:13:37,528 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 637 transitions. Word has length 121 [2018-11-12 17:13:37,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:13:37,529 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 637 transitions. [2018-11-12 17:13:37,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:13:37,530 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 637 transitions. [2018-11-12 17:13:37,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-12 17:13:37,537 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:13:37,538 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:13:37,538 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:13:37,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:37,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1422747334, now seen corresponding path program 1 times [2018-11-12 17:13:37,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:13:37,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:37,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:37,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:37,541 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:13:37,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:37,972 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:13:37,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:13:37,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 17:13:37,973 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:13:37,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 17:13:37,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 17:13:37,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:13:37,976 INFO L87 Difference]: Start difference. First operand 381 states and 637 transitions. Second operand 5 states. [2018-11-12 17:13:39,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:13:39,540 INFO L93 Difference]: Finished difference Result 901 states and 1555 transitions. [2018-11-12 17:13:39,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:13:39,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2018-11-12 17:13:39,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:13:39,546 INFO L225 Difference]: With dead ends: 901 [2018-11-12 17:13:39,547 INFO L226 Difference]: Without dead ends: 380 [2018-11-12 17:13:39,550 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:13:39,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-11-12 17:13:39,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-11-12 17:13:39,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-12 17:13:39,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 632 transitions. [2018-11-12 17:13:39,578 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 632 transitions. Word has length 130 [2018-11-12 17:13:39,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:13:39,578 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 632 transitions. [2018-11-12 17:13:39,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 17:13:39,579 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 632 transitions. [2018-11-12 17:13:39,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-12 17:13:39,583 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:13:39,584 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-12 17:13:39,584 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:13:39,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:39,585 INFO L82 PathProgramCache]: Analyzing trace with hash -2099227971, now seen corresponding path program 1 times [2018-11-12 17:13:39,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:13:39,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:39,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:39,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:39,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:13:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:39,840 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:13:40,018 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:13:40,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:13:40,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:13:40,019 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:13:40,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:13:40,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:13:40,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:13:40,020 INFO L87 Difference]: Start difference. First operand 380 states and 632 transitions. Second operand 6 states. [2018-11-12 17:13:42,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:13:42,593 INFO L93 Difference]: Finished difference Result 1184 states and 2066 transitions. [2018-11-12 17:13:42,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 17:13:42,594 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2018-11-12 17:13:42,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:13:42,610 INFO L225 Difference]: With dead ends: 1184 [2018-11-12 17:13:42,610 INFO L226 Difference]: Without dead ends: 810 [2018-11-12 17:13:42,613 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 17:13:42,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2018-11-12 17:13:42,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 800. [2018-11-12 17:13:42,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2018-11-12 17:13:42,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1274 transitions. [2018-11-12 17:13:42,688 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1274 transitions. Word has length 155 [2018-11-12 17:13:42,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:13:42,689 INFO L480 AbstractCegarLoop]: Abstraction has 800 states and 1274 transitions. [2018-11-12 17:13:42,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:13:42,689 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1274 transitions. [2018-11-12 17:13:42,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-12 17:13:42,693 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:13:42,693 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:13:42,694 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:13:42,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:42,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1213735243, now seen corresponding path program 1 times [2018-11-12 17:13:42,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:13:42,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:42,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:42,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:42,696 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:13:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:42,895 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:13:42,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:13:42,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:13:42,896 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:13:42,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:13:42,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:13:42,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:13:42,897 INFO L87 Difference]: Start difference. First operand 800 states and 1274 transitions. Second operand 3 states. [2018-11-12 17:13:45,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:13:45,347 INFO L93 Difference]: Finished difference Result 2306 states and 3791 transitions. [2018-11-12 17:13:45,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:13:45,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2018-11-12 17:13:45,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:13:45,368 INFO L225 Difference]: With dead ends: 2306 [2018-11-12 17:13:45,369 INFO L226 Difference]: Without dead ends: 1512 [2018-11-12 17:13:45,373 INFO L604 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-11-12 17:13:45,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2018-11-12 17:13:45,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1507. [2018-11-12 17:13:45,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-12 17:13:45,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 2312 transitions. [2018-11-12 17:13:45,425 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 2312 transitions. Word has length 156 [2018-11-12 17:13:45,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:13:45,426 INFO L480 AbstractCegarLoop]: Abstraction has 1507 states and 2312 transitions. [2018-11-12 17:13:45,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:13:45,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 2312 transitions. [2018-11-12 17:13:45,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-12 17:13:45,434 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:13:45,435 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:13:45,435 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:13:45,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:45,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1427113375, now seen corresponding path program 1 times [2018-11-12 17:13:45,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:13:45,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:45,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:45,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:45,437 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:13:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:46,104 WARN L179 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2018-11-12 17:13:46,154 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 44 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:13:46,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:13:46,155 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:13:46,156 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 174 with the following transitions: [2018-11-12 17:13:46,158 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [198], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [639], [641], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:13:46,227 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:13:46,227 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:13:47,626 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:13:47,628 INFO L272 AbstractInterpreter]: Visited 124 different actions 244 times. Merged at 5 different actions 7 times. Never widened. Performed 4172 root evaluator evaluations with a maximum evaluation depth of 4. Performed 4172 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-12 17:13:47,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:47,674 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:13:49,016 INFO L227 lantSequenceWeakener]: Weakened 76 states. On average, predicates are now at 81.8% of their original sizes. [2018-11-12 17:13:49,017 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:13:51,497 INFO L415 sIntCurrentIteration]: We unified 172 AI predicates to 172 [2018-11-12 17:13:51,497 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:13:51,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:13:51,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [6] total 25 [2018-11-12 17:13:51,498 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:13:51,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 17:13:51,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 17:13:51,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2018-11-12 17:13:51,500 INFO L87 Difference]: Start difference. First operand 1507 states and 2312 transitions. Second operand 21 states. [2018-11-12 17:14:11,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:14:11,199 INFO L93 Difference]: Finished difference Result 3752 states and 5778 transitions. [2018-11-12 17:14:11,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-12 17:14:11,199 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 173 [2018-11-12 17:14:11,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:14:11,213 INFO L225 Difference]: With dead ends: 3752 [2018-11-12 17:14:11,213 INFO L226 Difference]: Without dead ends: 2251 [2018-11-12 17:14:11,220 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 188 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=297, Invalid=1035, Unknown=0, NotChecked=0, Total=1332 [2018-11-12 17:14:11,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2251 states. [2018-11-12 17:14:11,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2251 to 2237. [2018-11-12 17:14:11,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2237 states. [2018-11-12 17:14:11,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 3111 transitions. [2018-11-12 17:14:11,291 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 3111 transitions. Word has length 173 [2018-11-12 17:14:11,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:14:11,292 INFO L480 AbstractCegarLoop]: Abstraction has 2237 states and 3111 transitions. [2018-11-12 17:14:11,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 17:14:11,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 3111 transitions. [2018-11-12 17:14:11,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-12 17:14:11,301 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:11,301 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 17:14:11,301 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:11,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:11,302 INFO L82 PathProgramCache]: Analyzing trace with hash 9233952, now seen corresponding path program 1 times [2018-11-12 17:14:11,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:11,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:11,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:11,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:11,304 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:12,068 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 57 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-12 17:14:12,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:12,069 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:14:12,069 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 184 with the following transitions: [2018-11-12 17:14:12,071 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], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [198], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [639], [641], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:14:12,085 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:14:12,086 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:14:12,825 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:14:12,826 INFO L272 AbstractInterpreter]: Visited 125 different actions 373 times. Merged at 7 different actions 20 times. Never widened. Performed 6072 root evaluator evaluations with a maximum evaluation depth of 4. Performed 6072 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 4 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:14:12,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:12,831 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:14:13,327 INFO L227 lantSequenceWeakener]: Weakened 57 states. On average, predicates are now at 82.21% of their original sizes. [2018-11-12 17:14:13,327 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:14:13,762 INFO L415 sIntCurrentIteration]: We unified 182 AI predicates to 182 [2018-11-12 17:14:13,764 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:14:13,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:14:13,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 21 [2018-11-12 17:14:13,765 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:14:13,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-12 17:14:13,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-12 17:14:13,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-11-12 17:14:13,767 INFO L87 Difference]: Start difference. First operand 2237 states and 3111 transitions. Second operand 15 states. [2018-11-12 17:14:32,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:14:32,337 INFO L93 Difference]: Finished difference Result 4628 states and 6683 transitions. [2018-11-12 17:14:32,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-12 17:14:32,338 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 183 [2018-11-12 17:14:32,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:14:32,352 INFO L225 Difference]: With dead ends: 4628 [2018-11-12 17:14:32,352 INFO L226 Difference]: Without dead ends: 2833 [2018-11-12 17:14:32,359 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 192 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2018-11-12 17:14:32,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2833 states. [2018-11-12 17:14:32,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2833 to 2825. [2018-11-12 17:14:32,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2825 states. [2018-11-12 17:14:32,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 3790 transitions. [2018-11-12 17:14:32,441 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 3790 transitions. Word has length 183 [2018-11-12 17:14:32,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:14:32,441 INFO L480 AbstractCegarLoop]: Abstraction has 2825 states and 3790 transitions. [2018-11-12 17:14:32,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-12 17:14:32,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 3790 transitions. [2018-11-12 17:14:32,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-12 17:14:32,451 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:32,452 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 17:14:32,452 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:32,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:32,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1466739305, now seen corresponding path program 1 times [2018-11-12 17:14:32,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:32,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:32,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:32,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:32,454 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:32,594 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 81 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:14:32,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:32,594 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:14:32,595 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 197 with the following transitions: [2018-11-12 17:14:32,595 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [248], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [639], [641], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:14:32,599 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:14:32,599 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:14:32,982 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:14:32,982 INFO L272 AbstractInterpreter]: Visited 125 different actions 247 times. Merged at 5 different actions 8 times. Never widened. Performed 3571 root evaluator evaluations with a maximum evaluation depth of 4. Performed 3571 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-12 17:14:32,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:32,990 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:14:33,669 INFO L227 lantSequenceWeakener]: Weakened 86 states. On average, predicates are now at 81.55% of their original sizes. [2018-11-12 17:14:33,669 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:14:35,139 INFO L415 sIntCurrentIteration]: We unified 195 AI predicates to 195 [2018-11-12 17:14:35,140 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:14:35,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:14:35,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [6] total 20 [2018-11-12 17:14:35,140 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:14:35,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-12 17:14:35,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-12 17:14:35,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-11-12 17:14:35,142 INFO L87 Difference]: Start difference. First operand 2825 states and 3790 transitions. Second operand 16 states. [2018-11-12 17:14:53,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:14:53,548 INFO L93 Difference]: Finished difference Result 5678 states and 7880 transitions. [2018-11-12 17:14:53,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 17:14:53,548 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 196 [2018-11-12 17:14:53,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:14:53,564 INFO L225 Difference]: With dead ends: 5678 [2018-11-12 17:14:53,564 INFO L226 Difference]: Without dead ends: 3589 [2018-11-12 17:14:53,571 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 211 GetRequests, 130 SyntacticMatches, 51 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=199, Invalid=793, Unknown=0, NotChecked=0, Total=992 [2018-11-12 17:14:53,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3589 states. [2018-11-12 17:14:53,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3589 to 3425. [2018-11-12 17:14:53,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3425 states. [2018-11-12 17:14:53,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3425 states to 3425 states and 4504 transitions. [2018-11-12 17:14:53,665 INFO L78 Accepts]: Start accepts. Automaton has 3425 states and 4504 transitions. Word has length 196 [2018-11-12 17:14:53,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:14:53,665 INFO L480 AbstractCegarLoop]: Abstraction has 3425 states and 4504 transitions. [2018-11-12 17:14:53,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-12 17:14:53,665 INFO L276 IsEmpty]: Start isEmpty. Operand 3425 states and 4504 transitions. [2018-11-12 17:14:53,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-12 17:14:53,676 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:53,677 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-12 17:14:53,677 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:53,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:53,678 INFO L82 PathProgramCache]: Analyzing trace with hash -53175711, now seen corresponding path program 1 times [2018-11-12 17:14:53,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:53,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:53,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:53,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:53,679 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:53,885 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-12 17:14:53,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:14:53,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:14:53,885 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:14:53,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:14:53,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:14:53,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:14:53,887 INFO L87 Difference]: Start difference. First operand 3425 states and 4504 transitions. Second operand 3 states. [2018-11-12 17:14:54,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:14:54,792 INFO L93 Difference]: Finished difference Result 5955 states and 8017 transitions. [2018-11-12 17:14:54,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:14:54,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2018-11-12 17:14:54,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:14:54,806 INFO L225 Difference]: With dead ends: 5955 [2018-11-12 17:14:54,806 INFO L226 Difference]: Without dead ends: 3425 [2018-11-12 17:14:54,814 INFO L604 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-11-12 17:14:54,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3425 states. [2018-11-12 17:14:54,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3425 to 3425. [2018-11-12 17:14:54,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3425 states. [2018-11-12 17:14:54,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3425 states to 3425 states and 4229 transitions. [2018-11-12 17:14:54,903 INFO L78 Accepts]: Start accepts. Automaton has 3425 states and 4229 transitions. Word has length 205 [2018-11-12 17:14:54,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:14:54,904 INFO L480 AbstractCegarLoop]: Abstraction has 3425 states and 4229 transitions. [2018-11-12 17:14:54,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:14:54,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3425 states and 4229 transitions. [2018-11-12 17:14:54,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-11-12 17:14:54,916 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:54,916 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:14:54,916 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:54,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:54,917 INFO L82 PathProgramCache]: Analyzing trace with hash -923173500, now seen corresponding path program 1 times [2018-11-12 17:14:54,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:54,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:54,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:54,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:54,918 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:55,152 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:14:55,482 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 108 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:14:55,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:55,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:14:55,483 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 218 with the following transitions: [2018-11-12 17:14:55,484 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [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], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [639], [641], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:14:55,487 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:14:55,488 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:14:56,031 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:14:56,031 INFO L272 AbstractInterpreter]: Visited 127 different actions 377 times. Merged at 7 different actions 20 times. Never widened. Performed 5401 root evaluator evaluations with a maximum evaluation depth of 4. Performed 5401 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:14:56,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:56,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:14:56,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:14:56,039 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:14:56,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:56,052 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:14:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:56,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:14:56,464 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 123 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-12 17:14:56,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:14:56,855 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 123 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-12 17:14:56,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:14:56,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2018-11-12 17:14:56,887 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:14:56,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 17:14:56,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 17:14:56,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-11-12 17:14:56,890 INFO L87 Difference]: Start difference. First operand 3425 states and 4229 transitions. Second operand 14 states. [2018-11-12 17:15:00,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:15:00,771 INFO L93 Difference]: Finished difference Result 8538 states and 11207 transitions. [2018-11-12 17:15:00,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-12 17:15:00,772 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 217 [2018-11-12 17:15:00,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:15:00,785 INFO L225 Difference]: With dead ends: 8538 [2018-11-12 17:15:00,786 INFO L226 Difference]: Without dead ends: 2872 [2018-11-12 17:15:00,808 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 448 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=449, Invalid=1273, Unknown=0, NotChecked=0, Total=1722 [2018-11-12 17:15:00,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2872 states. [2018-11-12 17:15:00,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2872 to 2257. [2018-11-12 17:15:00,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2257 states. [2018-11-12 17:15:00,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 2621 transitions. [2018-11-12 17:15:00,879 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 2621 transitions. Word has length 217 [2018-11-12 17:15:00,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:15:00,880 INFO L480 AbstractCegarLoop]: Abstraction has 2257 states and 2621 transitions. [2018-11-12 17:15:00,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 17:15:00,880 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 2621 transitions. [2018-11-12 17:15:00,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-11-12 17:15:00,888 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:15:00,888 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, 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] [2018-11-12 17:15:00,889 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:15:00,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:00,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1622128461, now seen corresponding path program 1 times [2018-11-12 17:15:00,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:15:00,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:00,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:15:00,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:00,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:15:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:15:01,084 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 109 proven. 54 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 17:15:01,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:15:01,084 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:15:01,085 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 234 with the following transitions: [2018-11-12 17:15:01,085 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], [233], [237], [241], [245], [248], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [639], [641], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:15:01,087 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:15:01,088 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:15:01,591 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:15:01,591 INFO L272 AbstractInterpreter]: Visited 126 different actions 378 times. Merged at 8 different actions 22 times. Never widened. Performed 5202 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5202 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 4 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:15:01,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:01,598 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:15:02,265 INFO L227 lantSequenceWeakener]: Weakened 230 states. On average, predicates are now at 80.87% of their original sizes. [2018-11-12 17:15:02,265 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:15:02,437 INFO L415 sIntCurrentIteration]: We unified 232 AI predicates to 232 [2018-11-12 17:15:02,437 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:15:02,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:15:02,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2018-11-12 17:15:02,438 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:15:02,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:15:02,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:15:02,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:15:02,439 INFO L87 Difference]: Start difference. First operand 2257 states and 2621 transitions. Second operand 11 states. [2018-11-12 17:15:07,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:15:07,041 INFO L93 Difference]: Finished difference Result 2298 states and 2679 transitions. [2018-11-12 17:15:07,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 17:15:07,041 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 233 [2018-11-12 17:15:07,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:15:07,042 INFO L225 Difference]: With dead ends: 2298 [2018-11-12 17:15:07,042 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 17:15:07,047 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 241 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-11-12 17:15:07,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 17:15:07,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 17:15:07,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 17:15:07,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 17:15:07,048 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 233 [2018-11-12 17:15:07,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:15:07,048 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 17:15:07,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:15:07,048 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 17:15:07,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 17:15:07,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 17:15:07,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:15:07,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:15:07,660 WARN L179 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 193 [2018-11-12 17:15:07,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:15:07,999 WARN L179 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 199 [2018-11-12 17:15:08,932 WARN L179 SmtUtils]: Spent 931.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2018-11-12 17:15:10,658 WARN L179 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 124 DAG size of output: 77 [2018-11-12 17:15:17,285 WARN L179 SmtUtils]: Spent 6.61 s on a formula simplification. DAG size of input: 305 DAG size of output: 94 [2018-11-12 17:15:20,392 WARN L179 SmtUtils]: Spent 3.10 s on a formula simplification. DAG size of input: 220 DAG size of output: 101 [2018-11-12 17:15:22,079 WARN L179 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 226 DAG size of output: 108 [2018-11-12 17:15:22,083 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:15:22,083 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a11~0)| ~a11~0) (= |old(~a28~0)| ~a28~0) (= |old(~a17~0)| ~a17~0)) [2018-11-12 17:15:22,083 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:15:22,083 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,083 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,084 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,084 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,084 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,084 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-12 17:15:22,084 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-12 17:15:22,084 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-12 17:15:22,084 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-12 17:15:22,084 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-12 17:15:22,085 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-12 17:15:22,085 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-12 17:15:22,085 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-12 17:15:22,085 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-12 17:15:22,085 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-12 17:15:22,085 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-12 17:15:22,085 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-12 17:15:22,085 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-12 17:15:22,086 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,086 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,086 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,086 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,086 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-12 17:15:22,086 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,086 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-12 17:15:22,086 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-12 17:15:22,087 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-12 17:15:22,087 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-12 17:15:22,087 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-12 17:15:22,087 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-12 17:15:22,087 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-12 17:15:22,087 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-12 17:15:22,087 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-12 17:15:22,087 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-12 17:15:22,087 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-12 17:15:22,088 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-12 17:15:22,088 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-12 17:15:22,088 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-12 17:15:22,088 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-12 17:15:22,088 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,088 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,088 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,088 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,089 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,089 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-12 17:15:22,089 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-12 17:15:22,089 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-12 17:15:22,089 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-12 17:15:22,089 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-12 17:15:22,089 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-12 17:15:22,089 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-12 17:15:22,090 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-12 17:15:22,090 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-12 17:15:22,090 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-12 17:15:22,090 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-12 17:15:22,090 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,090 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,090 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,090 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,091 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,091 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-12 17:15:22,091 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-12 17:15:22,091 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-12 17:15:22,091 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-12 17:15:22,091 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-12 17:15:22,091 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-12 17:15:22,091 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-12 17:15:22,092 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-12 17:15:22,092 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-12 17:15:22,092 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-12 17:15:22,092 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-12 17:15:22,092 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-12 17:15:22,092 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-12 17:15:22,092 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,092 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,092 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,093 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,093 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,093 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-12 17:15:22,093 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-12 17:15:22,093 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-12 17:15:22,093 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-12 17:15:22,093 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-12 17:15:22,093 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-12 17:15:22,093 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-12 17:15:22,094 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-12 17:15:22,094 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-12 17:15:22,094 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-12 17:15:22,094 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-12 17:15:22,094 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-12 17:15:22,094 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-12 17:15:22,094 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-12 17:15:22,094 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-12 17:15:22,094 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-12 17:15:22,095 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,095 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,095 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,095 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,095 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-12 17:15:22,095 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,095 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-12 17:15:22,095 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,096 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-12 17:15:22,096 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-12 17:15:22,096 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-12 17:15:22,096 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,096 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,096 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-12 17:15:22,096 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-12 17:15:22,096 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-12 17:15:22,097 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-12 17:15:22,097 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-12 17:15:22,097 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-12 17:15:22,097 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-12 17:15:22,097 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-12 17:15:22,097 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-12 17:15:22,097 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-12 17:15:22,097 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-12 17:15:22,097 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,098 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,098 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,098 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,098 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,098 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,098 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-12 17:15:22,098 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-12 17:15:22,098 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-12 17:15:22,098 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-12 17:15:22,098 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-12 17:15:22,099 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-12 17:15:22,099 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-12 17:15:22,099 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-12 17:15:22,099 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-12 17:15:22,099 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-12 17:15:22,099 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-12 17:15:22,099 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 514) no Hoare annotation was computed. [2018-11-12 17:15:22,100 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,100 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,100 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,100 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,100 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,100 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,100 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-12 17:15:22,100 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-12 17:15:22,101 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-12 17:15:22,101 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-12 17:15:22,101 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-12 17:15:22,101 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-12 17:15:22,101 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-12 17:15:22,101 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-12 17:15:22,101 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-12 17:15:22,101 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-12 17:15:22,101 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-12 17:15:22,101 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-12 17:15:22,102 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-12 17:15:22,102 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-12 17:15:22,102 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,102 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,102 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,103 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse6 (< 6 |calculate_output_#in~input|)) (.cse12 (< 1 |old(~a25~0)|)) (.cse8 (not (= 0 |old(~a11~0)|))) (.cse13 (< 11 |old(~a28~0)|)) (.cse3 (not (= 8 |old(~a17~0)|))) (.cse9 (< |old(~a25~0)| 0)) (.cse10 (< |old(~a28~0)| 7)) (.cse23 (< 10 |old(~a28~0)|)) (.cse0 (not (= 1 ~a21~0))) (.cse2 (not (= 1 |old(~a19~0)|)))) (let ((.cse7 (and (or .cse23 (< 1 |old(~a19~0)|) .cse0) (or .cse0 .cse2))) (.cse11 (< |old(~a19~0)| 0)) (.cse5 (not (= 1 |old(~a11~0)|))) (.cse17 (= 9 |old(~a17~0)|)) (.cse18 (= 1 ~a25~0)) (.cse1 (not (= 1 |old(~a25~0)|))) (.cse19 (= |old(~a11~0)| ~a11~0)) (.cse14 (= |old(~a28~0)| ~a28~0)) (.cse16 (= |old(~a17~0)| ~a17~0)) (.cse4 (= 9 |old(~a28~0)|)) (.cse20 (not (= 7 |old(~a17~0)|))) (.cse22 (or .cse0 .cse6 .cse2 .cse12 .cse8 .cse13 .cse3 .cse9 .cse10)) (.cse21 (not (= 0 |old(~a25~0)|))) (.cse15 (< |calculate_output_#in~input| 1))) (and (or .cse0 .cse1 .cse2 .cse3 (= 1 ~a19~0) (not .cse4) .cse5) (or .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse3 (and (and (<= 0 ~a25~0) (= ~a11~0 0) (<= ~a25~0 1)) .cse14 (<= 0 ~a19~0) (<= ~a19~0 1) (= ~a17~0 8)) .cse15) (or .cse0 (and .cse14 (= 1 ~a11~0) .cse16) .cse5 .cse17) (or .cse6 .cse1 .cse7 .cse8 .cse10 .cse11 .cse13 .cse3 .cse18 .cse15) (or .cse0 .cse1 .cse18 .cse5 .cse17) (or .cse0 (and .cse19 .cse14 .cse16 .cse18) .cse1 .cse20) (or (and .cse21 (< |old(~a28~0)| 8)) (= ~a19~0 1) .cse22 .cse15) (or .cse0 (and .cse19 .cse14 .cse16) .cse4 .cse20) (or (or .cse23 .cse22 .cse21) (= ~a25~0 0) .cse15)))) [2018-11-12 17:15:22,103 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,103 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,103 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,103 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-12 17:15:22,103 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-12 17:15:22,103 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-12 17:15:22,103 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-12 17:15:22,104 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-12 17:15:22,104 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-12 17:15:22,104 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-12 17:15:22,104 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-12 17:15:22,104 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-12 17:15:22,104 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-12 17:15:22,104 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-12 17:15:22,104 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-12 17:15:22,105 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-12 17:15:22,105 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,105 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,105 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,105 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,105 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,105 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,105 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-12 17:15:22,106 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-12 17:15:22,106 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-12 17:15:22,106 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-12 17:15:22,106 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-12 17:15:22,106 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-12 17:15:22,106 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-12 17:15:22,106 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-12 17:15:22,106 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-12 17:15:22,106 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-12 17:15:22,107 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-12 17:15:22,107 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-12 17:15:22,107 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-12 17:15:22,107 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-12 17:15:22,107 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-12 17:15:22,107 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-11-12 17:15:22,107 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,107 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,107 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,108 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,108 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:15:22,108 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-12 17:15:22,108 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-12 17:15:22,108 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-12 17:15:22,108 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-12 17:15:22,108 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-12 17:15:22,108 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-12 17:15:22,109 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-12 17:15:22,109 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-12 17:15:22,109 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-12 17:15:22,109 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-12 17:15:22,109 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-12 17:15:22,109 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-12 17:15:22,109 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-12 17:15:22,109 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-12 17:15:22,110 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-12 17:15:22,110 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-12 17:15:22,110 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-12 17:15:22,110 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-12 17:15:22,110 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-12 17:15:22,110 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:15:22,110 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~z~0 26) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a~0 1) (= ~a19~0 1) (= ~a28~0 7)) [2018-11-12 17:15:22,110 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 17:15:22,111 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:15:22,111 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (and (= ~a11~0 0) (= ~a25~0 0) (= ~a19~0 1) (= |old(~a28~0)| ~a28~0) (= ~a17~0 8)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-12 17:15:22,111 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-12 17:15:22,111 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse3 (= 1 ~a11~0)) (.cse4 (= 7 ~a17~0)) (.cse1 (= ~a19~0 1)) (.cse0 (= ~a11~0 0)) (.cse2 (= ~a17~0 8))) (or (and .cse0 (= ~a25~0 0) .cse1 (and (= (+ main_~output~0 1) 0) .cse2) (= |old(~a28~0)| ~a28~0)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse3 .cse4 (= 1 ~a25~0)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (and .cse3 (= |old(~a17~0)| ~a17~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (and .cse3 .cse4 (not (= ~a28~0 9))) (not (= 3 ~c~0)) (and (<= 1 main_~input~0) (let ((.cse5 (<= ~a25~0 1))) (or (and (<= ~a28~0 10) (<= 7 ~a28~0) .cse5) (and .cse1 (<= 9 ~a28~0) .cse5))) (<= main_~input~0 6) (<= ~a28~0 11) (<= 0 ~a25~0) .cse0 (<= 0 ~a19~0) (<= ~a19~0 1) .cse2) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-11-12 17:15:22,111 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-12 17:15:22,111 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-12 17:15:22,112 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse0 (= 1 ~a11~0)) (.cse1 (= 7 ~a17~0))) (or (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse0 .cse1 (= 1 ~a25~0)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (and .cse0 (= |old(~a17~0)| ~a17~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (and .cse0 .cse1 (not (= ~a28~0 9))) (not (= 3 ~c~0)) (and (<= 1 main_~input~0) (let ((.cse2 (<= ~a25~0 1))) (or (and (<= ~a28~0 10) (<= 7 ~a28~0) .cse2) (and (= ~a19~0 1) (<= 9 ~a28~0) .cse2))) (<= main_~input~0 6) (<= ~a28~0 11) (<= 0 ~a25~0) (= ~a11~0 0) (<= 0 ~a19~0) (<= ~a19~0 1) (= ~a17~0 8)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-11-12 17:15:22,112 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-12 17:15:22,112 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-12 17:15:22,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:15:22 BoogieIcfgContainer [2018-11-12 17:15:22,126 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 17:15:22,127 INFO L168 Benchmark]: Toolchain (without parser) took 112166.40 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.4 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-12 17:15:22,128 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 17:15:22,129 INFO L168 Benchmark]: CACSL2BoogieTranslator took 754.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-12 17:15:22,130 INFO L168 Benchmark]: Boogie Procedure Inliner took 135.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -824.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. [2018-11-12 17:15:22,131 INFO L168 Benchmark]: Boogie Preprocessor took 107.12 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 17:15:22,131 INFO L168 Benchmark]: RCFGBuilder took 3806.67 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: 101.5 MB). Peak memory consumption was 101.5 MB. Max. memory is 7.1 GB. [2018-11-12 17:15:22,135 INFO L168 Benchmark]: TraceAbstraction took 107357.19 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.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-12 17:15:22,140 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.21 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 754.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 135.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -824.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 107.12 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 3806.67 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: 101.5 MB). Peak memory consumption was 101.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 107357.19 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.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 514]: 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: ((((((((((((((((((((((((a11 == 0 && a25 == 0) && a19 == 1) && output + 1 == 0 && a17 == 8) && \old(a28) == a28) || !(a21 == 1)) || !(y == 25)) || ((1 == a11 && 7 == a17) && 1 == a25)) || !(1 == \old(a19))) || !(x == 24)) || !(e == 5)) || !(d == 4)) || !(21 == u)) || (1 == a11 && \old(a17) == a17)) || !(22 == v)) || !(\old(a11) == 0)) || !(z == 26)) || !(0 == \old(a25))) || ((1 == a11 && 7 == a17) && !(a28 == 9))) || !(3 == c)) || ((((((((1 <= input && (((a28 <= 10 && 7 <= a28) && a25 <= 1) || ((a19 == 1 && 9 <= a28) && a25 <= 1))) && input <= 6) && a28 <= 11) && 0 <= a25) && a11 == 0) && 0 <= a19) && a19 <= 1) && a17 == 8)) || !(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, 107.2s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 74.6s AutomataDifference, 0.0s DeadEndRemovalTime, 15.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1907 SDtfs, 11117 SDslu, 1513 SDs, 0 SdLazy, 12227 SolverSat, 2527 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.4s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 1352 GetRequests, 1137 SyntacticMatches, 56 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1569 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3425occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.7s AbstIntTime, 5 AbstIntIterations, 4 AbstIntStrong, 0.9977154846666026 AbsIntWeakeningRatio, 0.16901408450704225 AbsIntAvgWeakeningVarsNumRemoved, 20.156209987195904 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 817 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 117 PreInvPairs, 200 NumberOfFragments, 824 HoareAnnotationTreeSize, 117 FomulaSimplifications, 11894 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 7 FomulaSimplificationsInter, 18057 FormulaSimplificationTreeSizeReductionInter, 14.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1986 NumberOfCodeBlocks, 1986 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2191 ConstructedInterpolants, 0 QuantifiedInterpolants, 1232303 SizeOfPredicates, 1 NumberOfNonLiveVariables, 525 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 836/935 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...