java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label25_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:01:54,991 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:01:54,993 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:01:55,009 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:01:55,010 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:01:55,011 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:01:55,012 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:01:55,014 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:01:55,015 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:01:55,016 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:01:55,017 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:01:55,017 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:01:55,018 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:01:55,019 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:01:55,020 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:01:55,021 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:01:55,022 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:01:55,024 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:01:55,026 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:01:55,027 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:01:55,028 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:01:55,030 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:01:55,032 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:01:55,032 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:01:55,032 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:01:55,033 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:01:55,034 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:01:55,035 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:01:55,036 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:01:55,037 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:01:55,037 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:01:55,038 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:01:55,038 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:01:55,038 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:01:55,039 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:01:55,040 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:01:55,041 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 00:01:55,064 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:01:55,064 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:01:55,066 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:01:55,066 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:01:55,066 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:01:55,066 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:01:55,066 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:01:55,067 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:01:55,067 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:01:55,068 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:01:55,068 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:01:55,068 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:01:55,068 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:01:55,068 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:01:55,069 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:01:55,069 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:01:55,069 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:01:55,069 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:01:55,070 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:01:55,070 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:01:55,070 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:01:55,070 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:01:55,071 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:01:55,071 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:01:55,071 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:01:55,071 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:01:55,071 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:01:55,072 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:01:55,073 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:01:55,073 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:01:55,073 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:01:55,073 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:01:55,074 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:01:55,074 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:01:55,074 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:01:55,074 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:01:55,124 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:01:55,141 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:01:55,146 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:01:55,148 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:01:55,148 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:01:55,149 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label25_true-unreach-call_false-termination.c [2018-10-25 00:01:55,217 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/356b79c92/2447fed3d7404ba295213d7bfc7b509b/FLAGb8a3dfc57 [2018-10-25 00:01:55,840 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:01:55,842 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label25_true-unreach-call_false-termination.c [2018-10-25 00:01:55,858 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/356b79c92/2447fed3d7404ba295213d7bfc7b509b/FLAGb8a3dfc57 [2018-10-25 00:01:55,873 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/356b79c92/2447fed3d7404ba295213d7bfc7b509b [2018-10-25 00:01:55,884 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:01:55,885 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:01:55,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:01:55,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:01:55,890 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:01:55,891 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:01:55" (1/1) ... [2018-10-25 00:01:55,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e7d78d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:55, skipping insertion in model container [2018-10-25 00:01:55,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:01:55" (1/1) ... [2018-10-25 00:01:55,905 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:01:55,982 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:01:56,501 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:01:56,508 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:01:56,603 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:01:56,620 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:01:56,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:56 WrapperNode [2018-10-25 00:01:56,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:01:56,622 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:01:56,622 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:01:56,622 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:01:56,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:56" (1/1) ... [2018-10-25 00:01:56,660 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:56" (1/1) ... [2018-10-25 00:01:56,812 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:01:56,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:01:56,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:01:56,813 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:01:56,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:56" (1/1) ... [2018-10-25 00:01:56,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:56" (1/1) ... [2018-10-25 00:01:56,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:56" (1/1) ... [2018-10-25 00:01:56,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:56" (1/1) ... [2018-10-25 00:01:56,848 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:56" (1/1) ... [2018-10-25 00:01:56,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:56" (1/1) ... [2018-10-25 00:01:56,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:56" (1/1) ... [2018-10-25 00:01:56,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:01:56,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:01:56,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:01:56,876 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:01:56,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:01:56,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:01:56,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:01:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:01:56,957 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:01:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:01:56,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:01:56,957 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:01:56,958 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:02:00,037 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:02:00,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:02:00 BoogieIcfgContainer [2018-10-25 00:02:00,042 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:02:00,043 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:02:00,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:02:00,047 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:02:00,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:01:55" (1/3) ... [2018-10-25 00:02:00,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@536ba06d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:02:00, skipping insertion in model container [2018-10-25 00:02:00,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:56" (2/3) ... [2018-10-25 00:02:00,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@536ba06d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:02:00, skipping insertion in model container [2018-10-25 00:02:00,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:02:00" (3/3) ... [2018-10-25 00:02:00,052 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label25_true-unreach-call_false-termination.c [2018-10-25 00:02:00,064 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:02:00,076 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:02:00,096 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:02:00,156 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:02:00,156 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:02:00,156 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:02:00,156 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:02:00,157 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:02:00,157 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:02:00,157 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:02:00,157 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:02:00,190 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-10-25 00:02:00,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-25 00:02:00,207 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:00,208 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:00,211 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:00,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:00,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1106686112, now seen corresponding path program 1 times [2018-10-25 00:02:00,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:00,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:00,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:00,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:00,282 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:00,902 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:02:01,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:01,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:02:01,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:02:01,023 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:01,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:02:01,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:02:01,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:02:01,053 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-10-25 00:02:02,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:02,653 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-10-25 00:02:02,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:02:02,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2018-10-25 00:02:02,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:02,677 INFO L225 Difference]: With dead ends: 550 [2018-10-25 00:02:02,678 INFO L226 Difference]: Without dead ends: 340 [2018-10-25 00:02:02,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:02:02,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-25 00:02:02,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-10-25 00:02:02,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-25 00:02:02,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 569 transitions. [2018-10-25 00:02:02,768 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 569 transitions. Word has length 126 [2018-10-25 00:02:02,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:02,769 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 569 transitions. [2018-10-25 00:02:02,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:02:02,769 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 569 transitions. [2018-10-25 00:02:02,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-25 00:02:02,776 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:02,776 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:02,777 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:02,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:02,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1635455447, now seen corresponding path program 1 times [2018-10-25 00:02:02,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:02,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:02,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:02,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:02,779 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:02,988 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:02,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:02:02,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:02:02,989 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:02,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:02:02,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:02:02,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:02:02,992 INFO L87 Difference]: Start difference. First operand 340 states and 569 transitions. Second operand 5 states. [2018-10-25 00:02:05,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:05,313 INFO L93 Difference]: Finished difference Result 1079 states and 1888 transitions. [2018-10-25 00:02:05,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:02:05,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2018-10-25 00:02:05,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:05,326 INFO L225 Difference]: With dead ends: 1079 [2018-10-25 00:02:05,326 INFO L226 Difference]: Without dead ends: 745 [2018-10-25 00:02:05,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 00:02:05,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2018-10-25 00:02:05,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 733. [2018-10-25 00:02:05,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2018-10-25 00:02:05,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1163 transitions. [2018-10-25 00:02:05,379 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1163 transitions. Word has length 136 [2018-10-25 00:02:05,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:05,381 INFO L481 AbstractCegarLoop]: Abstraction has 733 states and 1163 transitions. [2018-10-25 00:02:05,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:02:05,381 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1163 transitions. [2018-10-25 00:02:05,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-25 00:02:05,392 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:05,393 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:05,393 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:05,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:05,393 INFO L82 PathProgramCache]: Analyzing trace with hash 852389443, now seen corresponding path program 1 times [2018-10-25 00:02:05,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:05,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:05,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:05,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:05,397 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:05,755 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:05,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:05,755 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:05,757 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 147 with the following transitions: [2018-10-25 00:02:05,759 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [645], [647], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:05,810 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:05,810 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:06,469 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:02:06,471 INFO L272 AbstractInterpreter]: Visited 126 different actions 126 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-10-25 00:02:06,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:06,515 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:02:07,143 INFO L232 lantSequenceWeakener]: Weakened 140 states. On average, predicates are now at 80.59% of their original sizes. [2018-10-25 00:02:07,144 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:02:07,410 INFO L413 sIntCurrentIteration]: We have 145 unified AI predicates [2018-10-25 00:02:07,410 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:02:07,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:02:07,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2018-10-25 00:02:07,412 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:07,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:02:07,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:02:07,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:02:07,415 INFO L87 Difference]: Start difference. First operand 733 states and 1163 transitions. Second operand 6 states. [2018-10-25 00:02:17,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:17,676 INFO L93 Difference]: Finished difference Result 1598 states and 2531 transitions. [2018-10-25 00:02:17,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 00:02:17,677 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2018-10-25 00:02:17,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:17,683 INFO L225 Difference]: With dead ends: 1598 [2018-10-25 00:02:17,683 INFO L226 Difference]: Without dead ends: 871 [2018-10-25 00:02:17,686 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 146 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-25 00:02:17,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-10-25 00:02:17,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 869. [2018-10-25 00:02:17,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2018-10-25 00:02:17,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1308 transitions. [2018-10-25 00:02:17,720 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1308 transitions. Word has length 146 [2018-10-25 00:02:17,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:17,721 INFO L481 AbstractCegarLoop]: Abstraction has 869 states and 1308 transitions. [2018-10-25 00:02:17,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:02:17,721 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1308 transitions. [2018-10-25 00:02:17,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-25 00:02:17,725 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:17,726 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:17,726 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:17,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:17,727 INFO L82 PathProgramCache]: Analyzing trace with hash -768658678, now seen corresponding path program 1 times [2018-10-25 00:02:17,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:17,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:17,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:17,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:17,728 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:18,228 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:18,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:18,229 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:18,229 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2018-10-25 00:02:18,230 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [645], [647], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:18,240 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:18,241 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:18,695 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:02:18,695 INFO L272 AbstractInterpreter]: Visited 131 different actions 254 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:02:18,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:18,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:02:18,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:18,727 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:02:18,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:18,739 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:02:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:18,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:02:19,077 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-25 00:02:19,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:02:19,569 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-25 00:02:19,601 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:02:19,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-10-25 00:02:19,602 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:19,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:02:19,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:02:19,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-25 00:02:19,603 INFO L87 Difference]: Start difference. First operand 869 states and 1308 transitions. Second operand 3 states. [2018-10-25 00:02:22,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:22,103 INFO L93 Difference]: Finished difference Result 2085 states and 3262 transitions. [2018-10-25 00:02:22,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:02:22,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2018-10-25 00:02:22,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:22,113 INFO L225 Difference]: With dead ends: 2085 [2018-10-25 00:02:22,114 INFO L226 Difference]: Without dead ends: 1358 [2018-10-25 00:02:22,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 294 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-25 00:02:22,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2018-10-25 00:02:22,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1358. [2018-10-25 00:02:22,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2018-10-25 00:02:22,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1985 transitions. [2018-10-25 00:02:22,165 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1985 transitions. Word has length 148 [2018-10-25 00:02:22,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:22,166 INFO L481 AbstractCegarLoop]: Abstraction has 1358 states and 1985 transitions. [2018-10-25 00:02:22,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:02:22,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1985 transitions. [2018-10-25 00:02:22,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-25 00:02:22,174 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:22,174 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:22,174 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:22,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:22,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1323457638, now seen corresponding path program 1 times [2018-10-25 00:02:22,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:22,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:22,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:22,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:22,179 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:22,614 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:22,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:22,615 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:22,615 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 156 with the following transitions: [2018-10-25 00:02:22,615 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [645], [647], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:22,620 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:22,621 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:23,108 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:02:23,108 INFO L272 AbstractInterpreter]: Visited 130 different actions 254 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:02:23,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:23,149 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:02:23,777 INFO L232 lantSequenceWeakener]: Weakened 152 states. On average, predicates are now at 80.66% of their original sizes. [2018-10-25 00:02:23,778 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:02:24,620 INFO L413 sIntCurrentIteration]: We have 154 unified AI predicates [2018-10-25 00:02:24,620 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:02:24,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:02:24,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2018-10-25 00:02:24,621 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:24,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-25 00:02:24,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-25 00:02:24,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:02:24,622 INFO L87 Difference]: Start difference. First operand 1358 states and 1985 transitions. Second operand 10 states. [2018-10-25 00:02:29,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:29,505 INFO L93 Difference]: Finished difference Result 2715 states and 4008 transitions. [2018-10-25 00:02:29,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-25 00:02:29,505 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 155 [2018-10-25 00:02:29,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:29,514 INFO L225 Difference]: With dead ends: 2715 [2018-10-25 00:02:29,515 INFO L226 Difference]: Without dead ends: 1499 [2018-10-25 00:02:29,519 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 162 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:02:29,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2018-10-25 00:02:29,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1496. [2018-10-25 00:02:29,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-10-25 00:02:29,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 2131 transitions. [2018-10-25 00:02:29,568 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 2131 transitions. Word has length 155 [2018-10-25 00:02:29,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:29,568 INFO L481 AbstractCegarLoop]: Abstraction has 1496 states and 2131 transitions. [2018-10-25 00:02:29,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-25 00:02:29,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2131 transitions. [2018-10-25 00:02:29,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-25 00:02:29,583 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:29,583 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:29,583 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:29,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:29,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1998384054, now seen corresponding path program 1 times [2018-10-25 00:02:29,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:29,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:29,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:29,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:29,587 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:30,035 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 36 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:30,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:30,036 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:30,036 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 159 with the following transitions: [2018-10-25 00:02:30,036 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [645], [647], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:30,042 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:30,042 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:30,377 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:02:30,378 INFO L272 AbstractInterpreter]: Visited 131 different actions 254 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:02:30,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:30,383 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:02:30,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:30,384 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:02:30,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:30,394 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:02:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:30,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:02:30,576 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 36 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:30,577 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:02:30,833 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 36 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:30,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:02:30,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2018-10-25 00:02:30,855 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:02:30,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 00:02:30,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 00:02:30,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-10-25 00:02:30,857 INFO L87 Difference]: Start difference. First operand 1496 states and 2131 transitions. Second operand 9 states. [2018-10-25 00:02:35,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:35,550 INFO L93 Difference]: Finished difference Result 5966 states and 9201 transitions. [2018-10-25 00:02:35,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-25 00:02:35,556 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 158 [2018-10-25 00:02:35,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:35,581 INFO L225 Difference]: With dead ends: 5966 [2018-10-25 00:02:35,581 INFO L226 Difference]: Without dead ends: 4235 [2018-10-25 00:02:35,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=235, Invalid=821, Unknown=0, NotChecked=0, Total=1056 [2018-10-25 00:02:35,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4235 states. [2018-10-25 00:02:35,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4235 to 4168. [2018-10-25 00:02:35,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4168 states. [2018-10-25 00:02:35,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 5369 transitions. [2018-10-25 00:02:35,734 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 5369 transitions. Word has length 158 [2018-10-25 00:02:35,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:35,734 INFO L481 AbstractCegarLoop]: Abstraction has 4168 states and 5369 transitions. [2018-10-25 00:02:35,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-25 00:02:35,734 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 5369 transitions. [2018-10-25 00:02:35,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-25 00:02:35,747 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:35,747 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:35,748 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:35,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:35,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1044915987, now seen corresponding path program 1 times [2018-10-25 00:02:35,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:35,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:35,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:35,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:35,749 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:35,883 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 46 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-25 00:02:35,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:35,883 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:35,883 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 169 with the following transitions: [2018-10-25 00:02:35,884 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [645], [647], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:35,889 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:35,889 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:36,172 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:02:36,173 INFO L272 AbstractInterpreter]: Visited 132 different actions 256 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:02:36,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:36,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:02:36,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:36,179 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:02:36,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:36,188 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:02:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:36,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:02:36,386 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-25 00:02:36,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:02:36,470 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-25 00:02:36,495 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:02:36,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-10-25 00:02:36,496 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:36,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:02:36,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:02:36,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-25 00:02:36,497 INFO L87 Difference]: Start difference. First operand 4168 states and 5369 transitions. Second operand 3 states. [2018-10-25 00:02:37,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:37,446 INFO L93 Difference]: Finished difference Result 11620 states and 15302 transitions. [2018-10-25 00:02:37,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:02:37,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2018-10-25 00:02:37,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:37,485 INFO L225 Difference]: With dead ends: 11620 [2018-10-25 00:02:37,485 INFO L226 Difference]: Without dead ends: 7638 [2018-10-25 00:02:37,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 334 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-25 00:02:37,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7638 states. [2018-10-25 00:02:37,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7638 to 7599. [2018-10-25 00:02:37,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7599 states. [2018-10-25 00:02:37,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7599 states to 7599 states and 9663 transitions. [2018-10-25 00:02:37,740 INFO L78 Accepts]: Start accepts. Automaton has 7599 states and 9663 transitions. Word has length 168 [2018-10-25 00:02:37,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:37,741 INFO L481 AbstractCegarLoop]: Abstraction has 7599 states and 9663 transitions. [2018-10-25 00:02:37,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:02:37,742 INFO L276 IsEmpty]: Start isEmpty. Operand 7599 states and 9663 transitions. [2018-10-25 00:02:37,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-25 00:02:37,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:37,766 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:37,766 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:37,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:37,767 INFO L82 PathProgramCache]: Analyzing trace with hash -28989870, now seen corresponding path program 1 times [2018-10-25 00:02:37,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:37,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:37,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:37,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:37,769 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:38,159 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 74 proven. 16 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-10-25 00:02:38,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:38,159 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:38,160 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 195 with the following transitions: [2018-10-25 00:02:38,160 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [17], [18], [22], [26], [30], [34], [37], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [85], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [645], [647], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:38,163 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:38,163 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:38,431 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:02:38,431 INFO L272 AbstractInterpreter]: Visited 133 different actions 258 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:02:38,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:38,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:02:38,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:38,437 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:02:38,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:38,446 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:02:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:38,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:02:38,814 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 91 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-25 00:02:38,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:02:38,983 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 89 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-25 00:02:39,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:02:39,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-10-25 00:02:39,004 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:02:39,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 00:02:39,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 00:02:39,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-10-25 00:02:39,006 INFO L87 Difference]: Start difference. First operand 7599 states and 9663 transitions. Second operand 9 states. [2018-10-25 00:02:42,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:42,006 INFO L93 Difference]: Finished difference Result 16578 states and 21415 transitions. [2018-10-25 00:02:42,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-25 00:02:42,008 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 194 [2018-10-25 00:02:42,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:42,052 INFO L225 Difference]: With dead ends: 16578 [2018-10-25 00:02:42,052 INFO L226 Difference]: Without dead ends: 9259 [2018-10-25 00:02:42,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 395 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2018-10-25 00:02:42,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9259 states. [2018-10-25 00:02:42,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9259 to 8081. [2018-10-25 00:02:42,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8081 states. [2018-10-25 00:02:42,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8081 states to 8081 states and 9684 transitions. [2018-10-25 00:02:42,309 INFO L78 Accepts]: Start accepts. Automaton has 8081 states and 9684 transitions. Word has length 194 [2018-10-25 00:02:42,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:42,309 INFO L481 AbstractCegarLoop]: Abstraction has 8081 states and 9684 transitions. [2018-10-25 00:02:42,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-25 00:02:42,309 INFO L276 IsEmpty]: Start isEmpty. Operand 8081 states and 9684 transitions. [2018-10-25 00:02:42,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-25 00:02:42,330 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:42,331 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:42,331 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:42,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:42,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1647638206, now seen corresponding path program 1 times [2018-10-25 00:02:42,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:42,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:42,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:42,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:42,333 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:42,639 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 104 proven. 16 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-25 00:02:42,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:42,640 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:42,640 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 203 with the following transitions: [2018-10-25 00:02:42,640 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [37], [38], [41], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [85], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [645], [647], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:42,643 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:42,643 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:42,942 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:02:42,942 INFO L272 AbstractInterpreter]: Visited 133 different actions 258 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:02:42,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:42,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:02:42,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:42,948 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:02:42,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:42,955 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:02:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:43,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:02:43,123 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 114 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-25 00:02:43,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:02:43,408 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 104 proven. 16 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-25 00:02:43,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:02:43,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-10-25 00:02:43,432 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:02:43,432 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 00:02:43,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 00:02:43,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-25 00:02:43,433 INFO L87 Difference]: Start difference. First operand 8081 states and 9684 transitions. Second operand 9 states. [2018-10-25 00:02:47,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:47,691 INFO L93 Difference]: Finished difference Result 16865 states and 20651 transitions. [2018-10-25 00:02:47,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-25 00:02:47,694 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 202 [2018-10-25 00:02:47,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:47,743 INFO L225 Difference]: With dead ends: 16865 [2018-10-25 00:02:47,743 INFO L226 Difference]: Without dead ends: 9064 [2018-10-25 00:02:47,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 415 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=527, Unknown=0, NotChecked=0, Total=702 [2018-10-25 00:02:47,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9064 states. [2018-10-25 00:02:48,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9064 to 8813. [2018-10-25 00:02:48,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8813 states. [2018-10-25 00:02:48,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8813 states to 8813 states and 9979 transitions. [2018-10-25 00:02:48,268 INFO L78 Accepts]: Start accepts. Automaton has 8813 states and 9979 transitions. Word has length 202 [2018-10-25 00:02:48,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:48,268 INFO L481 AbstractCegarLoop]: Abstraction has 8813 states and 9979 transitions. [2018-10-25 00:02:48,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-25 00:02:48,269 INFO L276 IsEmpty]: Start isEmpty. Operand 8813 states and 9979 transitions. [2018-10-25 00:02:48,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-25 00:02:48,290 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:48,290 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:48,290 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:48,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:48,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1787333195, now seen corresponding path program 1 times [2018-10-25 00:02:48,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:48,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:48,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:48,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:48,292 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:48,776 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-25 00:02:48,958 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 117 proven. 35 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-10-25 00:02:48,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:48,959 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:48,959 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 234 with the following transitions: [2018-10-25 00:02:48,960 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [17], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [85], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [129], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [645], [647], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:48,963 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:48,963 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:49,371 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:02:49,371 INFO L272 AbstractInterpreter]: Visited 134 different actions 260 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:02:49,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:49,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:02:49,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:49,407 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:02:49,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:49,422 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:02:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:49,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:02:49,653 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 105 proven. 59 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-25 00:02:49,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:02:49,871 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 160 proven. 4 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-25 00:02:49,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:02:49,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2018-10-25 00:02:49,893 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:02:49,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-25 00:02:49,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-25 00:02:49,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:02:49,894 INFO L87 Difference]: Start difference. First operand 8813 states and 9979 transitions. Second operand 8 states. [2018-10-25 00:02:51,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:51,071 INFO L93 Difference]: Finished difference Result 13994 states and 15903 transitions. [2018-10-25 00:02:51,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-25 00:02:51,081 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 233 [2018-10-25 00:02:51,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:51,081 INFO L225 Difference]: With dead ends: 13994 [2018-10-25 00:02:51,082 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 00:02:51,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 467 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-10-25 00:02:51,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 00:02:51,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 00:02:51,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 00:02:51,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 00:02:51,113 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 233 [2018-10-25 00:02:51,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:51,113 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 00:02:51,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-25 00:02:51,114 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 00:02:51,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 00:02:51,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 00:02:51,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,440 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 260 DAG size of output: 114 [2018-10-25 00:02:51,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:51,609 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 115 [2018-10-25 00:02:52,083 WARN L179 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 20 [2018-10-25 00:02:52,869 WARN L179 SmtUtils]: Spent 783.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2018-10-25 00:02:56,399 WARN L179 SmtUtils]: Spent 3.52 s on a formula simplification. DAG size of input: 188 DAG size of output: 110 [2018-10-25 00:02:57,070 WARN L179 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 70 [2018-10-25 00:02:57,920 WARN L179 SmtUtils]: Spent 848.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 73 [2018-10-25 00:02:57,923 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:02:57,924 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (= |old(~a8~0)| ~a8~0) (<= |old(~a16~0)| ~a16~0) (= ~a20~0 |old(~a20~0)|) (= ~a21~0 |old(~a21~0)|)) [2018-10-25 00:02:57,924 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:02:57,924 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-25 00:02:57,924 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-25 00:02:57,924 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,924 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,925 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,925 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,925 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,925 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,925 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-25 00:02:57,925 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 533) no Hoare annotation was computed. [2018-10-25 00:02:57,925 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-25 00:02:57,925 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-25 00:02:57,926 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-25 00:02:57,926 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-25 00:02:57,926 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-25 00:02:57,926 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-25 00:02:57,926 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-25 00:02:57,926 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-25 00:02:57,926 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-25 00:02:57,926 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,926 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,926 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,926 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,927 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,927 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,927 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-25 00:02:57,927 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-25 00:02:57,927 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-25 00:02:57,927 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-25 00:02:57,927 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-25 00:02:57,927 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-25 00:02:57,927 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-25 00:02:57,928 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-25 00:02:57,928 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-25 00:02:57,928 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-25 00:02:57,928 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-25 00:02:57,928 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-25 00:02:57,928 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-25 00:02:57,928 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-25 00:02:57,928 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-10-25 00:02:57,928 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,928 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,928 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,928 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,929 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,929 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-25 00:02:57,929 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-25 00:02:57,929 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-25 00:02:57,929 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-25 00:02:57,929 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-25 00:02:57,929 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-25 00:02:57,929 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-25 00:02:57,929 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-25 00:02:57,929 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-25 00:02:57,929 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,929 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,930 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,930 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,930 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,930 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-25 00:02:57,930 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-25 00:02:57,930 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-25 00:02:57,930 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-25 00:02:57,930 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-25 00:02:57,930 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-25 00:02:57,930 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-25 00:02:57,931 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-25 00:02:57,931 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-25 00:02:57,931 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-25 00:02:57,931 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-25 00:02:57,931 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-25 00:02:57,931 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-25 00:02:57,931 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,931 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,931 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,932 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,932 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,932 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-25 00:02:57,932 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-25 00:02:57,932 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-25 00:02:57,932 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-25 00:02:57,932 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-25 00:02:57,932 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-25 00:02:57,932 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-25 00:02:57,932 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-25 00:02:57,932 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-25 00:02:57,932 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,933 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,933 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,933 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,933 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,933 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,933 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-25 00:02:57,933 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,933 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-25 00:02:57,933 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-25 00:02:57,933 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-25 00:02:57,933 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-25 00:02:57,933 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-25 00:02:57,933 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-25 00:02:57,933 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-25 00:02:57,934 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-25 00:02:57,934 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-25 00:02:57,934 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-25 00:02:57,934 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-25 00:02:57,934 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-25 00:02:57,934 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-25 00:02:57,934 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,934 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,934 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,934 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,934 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,935 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-25 00:02:57,935 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-25 00:02:57,935 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-25 00:02:57,935 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-25 00:02:57,935 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-25 00:02:57,935 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-25 00:02:57,935 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-25 00:02:57,935 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-25 00:02:57,935 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,936 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,936 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,936 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,936 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,936 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-25 00:02:57,936 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-25 00:02:57,936 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-25 00:02:57,936 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-25 00:02:57,936 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-25 00:02:57,936 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-25 00:02:57,937 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-25 00:02:57,937 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-25 00:02:57,937 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-25 00:02:57,937 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-25 00:02:57,937 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse14 (<= 6 ~a16~0)) (.cse5 (not (= 1 |old(~a21~0)|))) (.cse9 (<= ~a17~0 0)) (.cse20 (= ~a7~0 |old(~a7~0)|)) (.cse23 (= 1 ~a21~0)) (.cse11 (= 1 ~a7~0)) (.cse12 (= |old(~a8~0)| ~a8~0)) (.cse21 (<= |old(~a16~0)| ~a16~0)) (.cse22 (not (= ~a16~0 6))) (.cse13 (= ~a20~0 |old(~a20~0)|)) (.cse15 (= ~a21~0 |old(~a21~0)|))) (let ((.cse3 (and .cse11 .cse12 .cse21 .cse22 .cse13 .cse15)) (.cse24 (and .cse9 .cse20 .cse12 .cse21 .cse22 .cse23 .cse13)) (.cse18 (and .cse20 .cse12 .cse22)) (.cse26 (= ~a17~0 1)) (.cse27 (= ~a16~0 5)) (.cse25 (or (not (= 0 |old(~a7~0)|)) .cse5 (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|)) (not (= 8 ~a12~0)) (= |calculate_output_#in~input| 0) (not (= 1 |old(~a17~0)|)))) (.cse2 (not (= 1 |old(~a20~0)|))) (.cse19 (< 14 |old(~a8~0)|)) (.cse28 (and .cse20 .cse12 .cse13 .cse14 .cse15)) (.cse6 (= 13 |old(~a8~0)|)) (.cse16 (< |old(~a16~0)| 6)) (.cse4 (not (= 1 |old(~a7~0)|))) (.cse17 (< |old(~a8~0)| 15)) (.cse1 (< 13 |old(~a8~0)|)) (.cse29 (<= ~a20~0 0)) (.cse0 (= 6 |old(~a16~0)|)) (.cse7 (< 0 |old(~a7~0)|)) (.cse8 (< 0 |old(~a17~0)|)) (.cse10 (< 0 |old(~a20~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse2 .cse4 .cse8 (and .cse11 .cse12 .cse13 .cse14 .cse15) .cse16) (or (and .cse11 .cse12 .cse9) .cse4 .cse8 .cse17) (or .cse0 .cse5 .cse2 .cse18 .cse19 .cse7) (or .cse0 .cse5 (and .cse20 .cse12 .cse21 .cse22 .cse23 .cse13) .cse7 .cse10) (or .cse0 .cse3 .cse1 .cse4 .cse10) (or .cse0 .cse5 .cse2 .cse24 .cse7 .cse8) (or .cse0 (and .cse11 .cse12 .cse22) .cse4 .cse17) (or .cse0 .cse5 .cse2 .cse4 .cse19 .cse24 .cse8) (or .cse5 .cse2 .cse7 .cse21 .cse16) (or .cse5 .cse2 .cse6 .cse7 .cse8 .cse9) (or .cse25 (not (= 0 |old(~a20~0)|)) (and .cse26 .cse27)) (or .cse5 .cse28 .cse2 .cse7 .cse16) (or .cse0 (= |old(~a7~0)| 1) .cse1 .cse18) (or (and .cse26 .cse20 .cse12 .cse23 .cse13 .cse27) .cse25 .cse2) (or .cse0 .cse5 .cse6 .cse4 (and .cse11 .cse12 .cse21 .cse22 .cse9 .cse13 .cse15) .cse8 .cse10) (or .cse1 .cse2 .cse4 .cse8 .cse9) (or .cse5 (and .cse21 .cse13 .cse15) .cse2 .cse19 .cse7) (or .cse5 .cse28 .cse6 .cse7 .cse16 .cse10) (or (and .cse11 .cse12 .cse29) .cse4 .cse17 .cse10) (or .cse0 .cse1 .cse29 .cse10) (or .cse0 .cse5 .cse7 .cse8 .cse10 .cse9)))) [2018-10-25 00:02:57,937 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-25 00:02:57,938 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,938 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,938 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,938 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,938 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-25 00:02:57,938 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,938 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,938 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-25 00:02:57,938 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-25 00:02:57,939 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-25 00:02:57,939 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-25 00:02:57,939 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-25 00:02:57,939 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-25 00:02:57,939 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-25 00:02:57,939 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-25 00:02:57,939 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-25 00:02:57,939 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-25 00:02:57,939 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-25 00:02:57,940 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-25 00:02:57,940 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,940 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,940 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,940 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,940 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,940 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-25 00:02:57,940 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,940 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-25 00:02:57,941 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-25 00:02:57,941 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-25 00:02:57,941 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-25 00:02:57,941 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-25 00:02:57,941 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-25 00:02:57,941 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-25 00:02:57,941 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-25 00:02:57,941 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-25 00:02:57,941 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-25 00:02:57,941 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-25 00:02:57,941 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-25 00:02:57,942 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-25 00:02:57,942 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-25 00:02:57,942 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,942 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,942 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,942 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,942 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,942 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:02:57,942 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-25 00:02:57,942 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-25 00:02:57,943 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-25 00:02:57,943 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-25 00:02:57,943 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-25 00:02:57,943 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-25 00:02:57,943 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-25 00:02:57,943 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-25 00:02:57,943 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-25 00:02:57,943 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-25 00:02:57,943 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:02:57,943 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a7~0 0) (= ~a8~0 15) (= ~a17~0 1) (= ~a12~0 8) (= ~a21~0 1) (= ~a20~0 1) (= ~a16~0 5)) [2018-10-25 00:02:57,944 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 00:02:57,944 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:02:57,944 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a21~0)|)) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|)) (not (= 8 ~a12~0)) (and (= ~a17~0 1) (= ~a7~0 |old(~a7~0)|) (= |old(~a8~0)| ~a8~0) (= 1 ~a21~0) (= ~a20~0 |old(~a20~0)|) (= ~a16~0 5)) (not (= 1 |old(~a17~0)|))) [2018-10-25 00:02:57,944 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-10-25 00:02:57,944 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse2 (<= ~a8~0 14)) (.cse3 (<= ~a7~0 0)) (.cse0 (= 1 ~a20~0)) (.cse1 (= 1 ~a21~0)) (.cse5 (= ~a7~0 |old(~a7~0)|)) (.cse4 (<= ~a8~0 |old(~a8~0)|)) (.cse10 (<= 15 ~a8~0)) (.cse8 (<= ~a17~0 0)) (.cse9 (<= ~a8~0 13)) (.cse6 (= 1 ~a7~0)) (.cse7 (not (= ~a16~0 6))) (.cse11 (<= ~a20~0 0))) (or (not (= 1 |old(~a21~0)|)) (and .cse0 .cse1 .cse2 .cse3) (not (= 8 ~a12~0)) (and (not (= main_~input~0 0)) (= ~a17~0 1) .cse4 .cse5 .cse1 (= ~a20~0 |old(~a20~0)|) (= ~a16~0 5)) (and .cse6 .cse0 .cse7 .cse8 .cse1 .cse2) (not (= 1 |old(~a20~0)|)) (and .cse0 .cse1 (<= 6 ~a16~0) .cse3) (not (= 5 |old(~a16~0)|)) (and .cse9 .cse6 .cse0 .cse7) (and .cse0 .cse1 .cse8 .cse3) (and .cse4 .cse6 .cse10 .cse7) (and .cse1 (not (= ~a8~0 13)) .cse11 .cse3) (not (= 0 |old(~a7~0)|)) (and .cse7 .cse1 .cse11 .cse3) (and .cse9 .cse6 .cse0 .cse8) (and .cse6 .cse7 .cse8 .cse1 .cse11) (and .cse9 .cse5 .cse7) (and .cse4 .cse6 .cse10 .cse11) (not (= 1 |old(~a17~0)|)) (not (= 15 |old(~a8~0)|)) (and .cse4 .cse6 .cse10 .cse8) (and .cse9 .cse6 .cse7 .cse11))) [2018-10-25 00:02:57,944 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-10-25 00:02:57,944 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-25 00:02:57,944 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-25 00:02:57,945 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse2 (<= ~a8~0 14)) (.cse3 (<= ~a7~0 0)) (.cse0 (= 1 ~a20~0)) (.cse1 (= 1 ~a21~0)) (.cse5 (= ~a7~0 |old(~a7~0)|)) (.cse4 (<= ~a8~0 |old(~a8~0)|)) (.cse10 (<= 15 ~a8~0)) (.cse8 (<= ~a17~0 0)) (.cse9 (<= ~a8~0 13)) (.cse6 (= 1 ~a7~0)) (.cse7 (not (= ~a16~0 6))) (.cse11 (<= ~a20~0 0))) (or (not (= 1 |old(~a21~0)|)) (and .cse0 .cse1 .cse2 .cse3) (and (= ~a17~0 1) .cse4 .cse5 .cse1 (= ~a20~0 |old(~a20~0)|) (= ~a16~0 5)) (not (= 8 ~a12~0)) (and .cse6 .cse0 .cse7 .cse8 .cse1 .cse2) (not (= 1 |old(~a20~0)|)) (and .cse0 .cse1 (<= 6 ~a16~0) .cse3) (not (= 5 |old(~a16~0)|)) (and .cse9 .cse6 .cse0 .cse7) (and .cse0 .cse1 .cse8 .cse3) (and .cse4 .cse6 .cse10 .cse7) (and .cse1 (not (= ~a8~0 13)) .cse11 .cse3) (not (= 0 |old(~a7~0)|)) (and .cse7 .cse1 .cse11 .cse3) (and .cse9 .cse6 .cse0 .cse8) (and .cse6 .cse7 .cse8 .cse1 .cse11) (and .cse9 .cse5 .cse7) (and .cse4 .cse6 .cse10 .cse11) (not (= 1 |old(~a17~0)|)) (not (= 15 |old(~a8~0)|)) (and .cse4 .cse6 .cse10 .cse8) (and .cse9 .cse6 .cse7 .cse11))) [2018-10-25 00:02:57,945 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-10-25 00:02:57,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:02:57 BoogieIcfgContainer [2018-10-25 00:02:57,962 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:02:57,963 INFO L168 Benchmark]: Toolchain (without parser) took 62078.48 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 3.2 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-25 00:02:57,964 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:02:57,964 INFO L168 Benchmark]: CACSL2BoogieTranslator took 735.33 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-25 00:02:57,965 INFO L168 Benchmark]: Boogie Procedure Inliner took 190.44 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -806.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-10-25 00:02:57,966 INFO L168 Benchmark]: Boogie Preprocessor took 62.66 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:02:57,966 INFO L168 Benchmark]: RCFGBuilder took 3166.26 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 116.5 MB). Peak memory consumption was 116.5 MB. Max. memory is 7.1 GB. [2018-10-25 00:02:57,967 INFO L168 Benchmark]: TraceAbstraction took 57918.83 ms. Allocated memory was 2.3 GB in the beginning and 3.4 GB in the end (delta: 1.2 GB). Free memory was 2.1 GB in the beginning and 3.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-10-25 00:02:57,972 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 735.33 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 190.44 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -806.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.66 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 3166.26 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 116.5 MB). Peak memory consumption was 116.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 57918.83 ms. Allocated memory was 2.3 GB in the beginning and 3.4 GB in the end (delta: 1.2 GB). Free memory was 2.1 GB in the beginning and 3.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 533]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(1 == \old(a21)) || (((1 == a20 && 1 == a21) && a8 <= 14) && a7 <= 0)) || (((((a17 == 1 && a8 <= \old(a8)) && a7 == \old(a7)) && 1 == a21) && a20 == \old(a20)) && a16 == 5)) || !(8 == a12)) || (((((1 == a7 && 1 == a20) && !(a16 == 6)) && a17 <= 0) && 1 == a21) && a8 <= 14)) || !(1 == \old(a20))) || (((1 == a20 && 1 == a21) && 6 <= a16) && a7 <= 0)) || !(5 == \old(a16))) || (((a8 <= 13 && 1 == a7) && 1 == a20) && !(a16 == 6))) || (((1 == a20 && 1 == a21) && a17 <= 0) && a7 <= 0)) || (((a8 <= \old(a8) && 1 == a7) && 15 <= a8) && !(a16 == 6))) || (((1 == a21 && !(a8 == 13)) && a20 <= 0) && a7 <= 0)) || !(0 == \old(a7))) || (((!(a16 == 6) && 1 == a21) && a20 <= 0) && a7 <= 0)) || (((a8 <= 13 && 1 == a7) && 1 == a20) && a17 <= 0)) || ((((1 == a7 && !(a16 == 6)) && a17 <= 0) && 1 == a21) && a20 <= 0)) || ((a8 <= 13 && a7 == \old(a7)) && !(a16 == 6))) || (((a8 <= \old(a8) && 1 == a7) && 15 <= a8) && a20 <= 0)) || !(1 == \old(a17))) || !(15 == \old(a8))) || (((a8 <= \old(a8) && 1 == a7) && 15 <= a8) && a17 <= 0)) || (((a8 <= 13 && 1 == a7) && !(a16 == 6)) && a20 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 57.8s OverallTime, 10 OverallIterations, 6 TraceHistogramMax, 36.0s AutomataDifference, 0.0s DeadEndRemovalTime, 6.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1582 SDtfs, 8513 SDslu, 1706 SDs, 0 SdLazy, 13200 SolverSat, 2397 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.6s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 2668 GetRequests, 2524 SyntacticMatches, 13 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8813occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.4s AbstIntTime, 8 AbstIntIterations, 2 AbstIntStrong, 0.9979712280569655 AbsIntWeakeningRatio, 0.2140468227424749 AbsIntAvgWeakeningVarsNumRemoved, 15.33779264214047 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 1552 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 246 PreInvPairs, 338 NumberOfFragments, 1295 HoareAnnotationTreeSize, 246 FomulaSimplifications, 9735 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 7 FomulaSimplificationsInter, 3625 FormulaSimplificationTreeSizeReductionInter, 6.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 2769 NumberOfCodeBlocks, 2769 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3850 ConstructedInterpolants, 0 QuantifiedInterpolants, 1394784 SizeOfPredicates, 8 NumberOfNonLiveVariables, 3258 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 1765/1967 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...