java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_0920a_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 16:14:59,059 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 16:14:59,061 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 16:14:59,079 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 16:14:59,079 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 16:14:59,080 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 16:14:59,082 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 16:14:59,084 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 16:14:59,086 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 16:14:59,087 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 16:14:59,088 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 16:14:59,088 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 16:14:59,089 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 16:14:59,090 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 16:14:59,091 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 16:14:59,092 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 16:14:59,093 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 16:14:59,095 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 16:14:59,097 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 16:14:59,099 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 16:14:59,100 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 16:14:59,102 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 16:14:59,104 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 16:14:59,105 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 16:14:59,105 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 16:14:59,106 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 16:14:59,107 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 16:14:59,108 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 16:14:59,109 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 16:14:59,110 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 16:14:59,111 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 16:14:59,111 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 16:14:59,112 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 16:14:59,112 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 16:14:59,113 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 16:14:59,114 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 16:14:59,115 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-19 16:14:59,136 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 16:14:59,136 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 16:14:59,137 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 16:14:59,137 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 16:14:59,138 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 16:14:59,138 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 16:14:59,138 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 16:14:59,138 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 16:14:59,139 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 16:14:59,139 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 16:14:59,139 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 16:14:59,139 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 16:14:59,139 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 16:14:59,140 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 16:14:59,140 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 16:14:59,140 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 16:14:59,140 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 16:14:59,140 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 16:14:59,141 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 16:14:59,141 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 16:14:59,141 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 16:14:59,141 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 16:14:59,141 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 16:14:59,142 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 16:14:59,142 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 16:14:59,142 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 16:14:59,142 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 16:14:59,142 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 16:14:59,143 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 16:14:59,143 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 16:14:59,143 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 16:14:59,143 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 16:14:59,202 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 16:14:59,215 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 16:14:59,219 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 16:14:59,220 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 16:14:59,221 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 16:14:59,222 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_0920a_true-unreach-call.c [2018-09-19 16:14:59,574 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/908d3c8dd/4983d68f964e4589bd02105dac92ea39/FLAG8963f9e06 [2018-09-19 16:14:59,814 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 16:14:59,815 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_0920a_true-unreach-call.c [2018-09-19 16:14:59,824 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/908d3c8dd/4983d68f964e4589bd02105dac92ea39/FLAG8963f9e06 [2018-09-19 16:14:59,842 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/908d3c8dd/4983d68f964e4589bd02105dac92ea39 [2018-09-19 16:14:59,855 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 16:14:59,858 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 16:14:59,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 16:14:59,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 16:14:59,867 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 16:14:59,868 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:14:59" (1/1) ... [2018-09-19 16:14:59,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d5e2099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:14:59, skipping insertion in model container [2018-09-19 16:14:59,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:14:59" (1/1) ... [2018-09-19 16:14:59,883 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 16:15:00,233 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:15:00,254 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 16:15:00,303 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:15:00,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:15:00 WrapperNode [2018-09-19 16:15:00,366 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 16:15:00,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 16:15:00,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 16:15:00,367 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 16:15:00,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:15:00" (1/1) ... [2018-09-19 16:15:00,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:15:00" (1/1) ... [2018-09-19 16:15:00,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:15:00" (1/1) ... [2018-09-19 16:15:00,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:15:00" (1/1) ... [2018-09-19 16:15:00,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:15:00" (1/1) ... [2018-09-19 16:15:00,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:15:00" (1/1) ... [2018-09-19 16:15:00,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:15:00" (1/1) ... [2018-09-19 16:15:00,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 16:15:00,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 16:15:00,432 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 16:15:00,432 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 16:15:00,433 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:15:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 16:15:00,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 16:15:00,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 16:15:00,601 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2018-09-19 16:15:00,601 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_log [2018-09-19 16:15:00,601 INFO L138 BoogieDeclarations]: Found implementation of procedure isfinite_double [2018-09-19 16:15:00,602 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-09-19 16:15:00,602 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 16:15:00,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 16:15:00,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-19 16:15:00,602 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2018-09-19 16:15:00,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-19 16:15:00,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-19 16:15:00,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-19 16:15:00,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-19 16:15:00,603 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_log [2018-09-19 16:15:00,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-19 16:15:00,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-19 16:15:00,604 INFO L130 BoogieDeclarations]: Found specification of procedure isfinite_double [2018-09-19 16:15:00,604 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-09-19 16:15:00,604 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 16:15:00,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 16:15:00,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 16:15:00,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-19 16:15:00,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-19 16:15:00,861 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:15:00,906 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:15:14,944 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:15:14,962 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:15:14,991 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:15:20,132 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:15:20,152 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:15:20,304 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:15:24,741 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:15:24,779 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:15:24,834 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:15:25,010 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 16:15:25,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:15:25 BoogieIcfgContainer [2018-09-19 16:15:25,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 16:15:25,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 16:15:25,014 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 16:15:25,017 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 16:15:25,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 04:14:59" (1/3) ... [2018-09-19 16:15:25,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@680e6971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:15:25, skipping insertion in model container [2018-09-19 16:15:25,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:15:00" (2/3) ... [2018-09-19 16:15:25,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@680e6971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:15:25, skipping insertion in model container [2018-09-19 16:15:25,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:15:25" (3/3) ... [2018-09-19 16:15:25,021 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0920a_true-unreach-call.c [2018-09-19 16:15:25,030 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 16:15:25,037 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 16:15:25,081 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 16:15:25,082 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 16:15:25,082 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 16:15:25,082 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 16:15:25,082 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 16:15:25,082 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 16:15:25,082 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 16:15:25,082 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 16:15:25,082 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 16:15:25,102 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2018-09-19 16:15:25,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-19 16:15:25,111 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:15:25,113 INFO L376 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] [2018-09-19 16:15:25,115 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:15:25,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1324264884, now seen corresponding path program 1 times [2018-09-19 16:15:25,126 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:15:25,127 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-19 16:15:25,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:15:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:15:25,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:15:25,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:15:25,328 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:15:25,346 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:15:25,347 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-19 16:15:25,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-19 16:15:25,368 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-19 16:15:25,368 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 16:15:25,371 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 2 states. [2018-09-19 16:15:25,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:15:25,408 INFO L93 Difference]: Finished difference Result 171 states and 213 transitions. [2018-09-19 16:15:25,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-19 16:15:25,410 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-09-19 16:15:25,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:15:25,423 INFO L225 Difference]: With dead ends: 171 [2018-09-19 16:15:25,423 INFO L226 Difference]: Without dead ends: 85 [2018-09-19 16:15:25,428 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 16:15:25,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-19 16:15:25,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-19 16:15:25,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-19 16:15:25,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2018-09-19 16:15:25,477 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 23 [2018-09-19 16:15:25,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:15:25,477 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2018-09-19 16:15:25,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-19 16:15:25,478 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2018-09-19 16:15:25,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-19 16:15:25,480 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:15:25,480 INFO L376 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] [2018-09-19 16:15:25,481 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:15:25,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1802213880, now seen corresponding path program 1 times [2018-09-19 16:15:25,482 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:15:25,482 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-19 16:15:25,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:15:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:15:25,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:15:25,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:15:25,755 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:15:25,771 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:15:25,771 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-19 16:15:25,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-19 16:15:25,773 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-19 16:15:25,773 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-19 16:15:25,774 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand 3 states. [2018-09-19 16:15:25,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:15:25,817 INFO L93 Difference]: Finished difference Result 147 states and 168 transitions. [2018-09-19 16:15:25,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-19 16:15:25,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-09-19 16:15:25,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:15:25,820 INFO L225 Difference]: With dead ends: 147 [2018-09-19 16:15:25,820 INFO L226 Difference]: Without dead ends: 85 [2018-09-19 16:15:25,822 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-19 16:15:25,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-19 16:15:25,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-19 16:15:25,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-19 16:15:25,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-09-19 16:15:25,835 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 36 [2018-09-19 16:15:25,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:15:25,838 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-09-19 16:15:25,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-19 16:15:25,838 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-09-19 16:15:25,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-19 16:15:25,840 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:15:25,840 INFO L376 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] [2018-09-19 16:15:25,843 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:15:25,844 INFO L82 PathProgramCache]: Analyzing trace with hash 34075258, now seen corresponding path program 1 times [2018-09-19 16:15:25,845 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:15:25,845 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-19 16:15:25,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:15:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:15:26,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:15:26,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 16:15:26,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-19 16:15:26,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:15:26,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:15:26,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:15:26,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:15:26,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-19 16:15:26,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-19 16:15:26,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:15:26,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:15:26,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:15:26,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:15:26,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:15:26,935 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:15:26,953 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:15:26,953 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 16:15:26,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 16:15:26,954 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 16:15:26,954 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-19 16:15:26,955 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 9 states. [2018-09-19 16:15:27,359 WARN L178 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-09-19 16:15:27,931 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-19 16:15:46,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:15:46,139 INFO L93 Difference]: Finished difference Result 120 states and 137 transitions. [2018-09-19 16:15:46,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 16:15:46,932 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2018-09-19 16:15:46,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:15:46,936 INFO L225 Difference]: With dead ends: 120 [2018-09-19 16:15:46,937 INFO L226 Difference]: Without dead ends: 87 [2018-09-19 16:15:46,938 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-09-19 16:15:46,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-19 16:15:46,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-09-19 16:15:46,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-19 16:15:46,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2018-09-19 16:15:46,951 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 52 [2018-09-19 16:15:46,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:15:46,952 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2018-09-19 16:15:46,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 16:15:46,952 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2018-09-19 16:15:46,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-19 16:15:46,954 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:15:46,954 INFO L376 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] [2018-09-19 16:15:46,954 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:15:46,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1898457403, now seen corresponding path program 1 times [2018-09-19 16:15:46,955 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:15:46,955 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-09-19 16:15:46,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:15:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:15:48,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:15:48,139 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:15:48,140 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:15:48,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-19 16:15:48,152 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:15:48,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-19 16:15:48,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:15:48,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:15:48,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:15:48,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-19 16:15:48,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2018-09-19 16:15:48,483 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:15:48,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-09-19 16:15:48,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:15:48,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:15:48,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-19 16:15:48,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:32 [2018-09-19 16:15:50,721 WARN L178 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 27 [2018-09-19 16:15:50,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-09-19 16:15:50,775 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:15:50,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-09-19 16:15:50,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:15:50,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:15:50,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:15:50,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:18 [2018-09-19 16:15:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:15:51,084 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:15:51,111 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:15:51,111 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 16:15:51,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 16:15:51,112 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 16:15:51,112 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-09-19 16:15:51,112 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 12 states. [2018-09-19 16:15:52,580 WARN L178 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-19 16:15:52,921 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-09-19 16:16:10,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:16:10,084 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2018-09-19 16:16:10,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 16:16:10,085 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2018-09-19 16:16:10,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:16:10,088 INFO L225 Difference]: With dead ends: 95 [2018-09-19 16:16:10,088 INFO L226 Difference]: Without dead ends: 85 [2018-09-19 16:16:10,089 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2018-09-19 16:16:10,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-19 16:16:10,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-19 16:16:10,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-19 16:16:10,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2018-09-19 16:16:10,097 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 52 [2018-09-19 16:16:10,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:16:10,098 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2018-09-19 16:16:10,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 16:16:10,098 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2018-09-19 16:16:10,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-19 16:16:10,100 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:16:10,100 INFO L376 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] [2018-09-19 16:16:10,101 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:16:10,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1079117600, now seen corresponding path program 1 times [2018-09-19 16:16:10,101 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:16:10,102 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-19 16:16:10,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:16:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:16:11,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:16:15,788 WARN L178 SmtUtils]: Spent 4.23 s on a formula simplification that was a NOOP. DAG size: 11 [2018-09-19 16:16:17,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:16:17,149 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:16:17,178 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:16:17,179 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-19 16:16:17,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-19 16:16:17,179 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-19 16:16:17,179 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-19 16:16:17,180 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand 8 states. [2018-09-19 16:16:22,443 WARN L178 SmtUtils]: Spent 483.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-19 16:16:23,399 WARN L178 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-19 16:16:25,572 WARN L178 SmtUtils]: Spent 763.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-19 16:16:42,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:16:42,973 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2018-09-19 16:16:42,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-19 16:16:42,973 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-09-19 16:16:42,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:16:42,975 INFO L225 Difference]: With dead ends: 94 [2018-09-19 16:16:42,975 INFO L226 Difference]: Without dead ends: 87 [2018-09-19 16:16:42,976 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-09-19 16:16:42,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-19 16:16:42,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-09-19 16:16:42,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-19 16:16:42,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2018-09-19 16:16:42,994 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 53 [2018-09-19 16:16:42,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:16:42,995 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-09-19 16:16:42,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-19 16:16:42,995 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2018-09-19 16:16:42,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-19 16:16:42,997 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:16:42,997 INFO L376 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] [2018-09-19 16:16:42,998 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:16:42,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1106234599, now seen corresponding path program 1 times [2018-09-19 16:16:42,998 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:16:42,998 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-09-19 16:16:43,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:16:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:16:43,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:16:43,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 16:16:43,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-19 16:16:43,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:16:43,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:16:43,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:16:43,537 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:16:43,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-19 16:16:43,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-19 16:16:43,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:16:43,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:16:43,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:16:43,705 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:16:44,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:16:44,025 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:16:44,040 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:16:44,040 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 16:16:44,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 16:16:44,041 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 16:16:44,041 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-19 16:16:44,042 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 10 states. [2018-09-19 16:16:51,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:16:51,817 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-09-19 16:16:51,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 16:16:51,819 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2018-09-19 16:16:51,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:16:51,819 INFO L225 Difference]: With dead ends: 85 [2018-09-19 16:16:51,820 INFO L226 Difference]: Without dead ends: 0 [2018-09-19 16:16:51,821 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-09-19 16:16:51,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-19 16:16:51,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-19 16:16:51,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-19 16:16:51,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-19 16:16:51,822 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2018-09-19 16:16:51,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:16:51,823 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-19 16:16:51,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 16:16:51,823 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-19 16:16:51,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-19 16:16:51,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-19 16:16:52,204 WARN L178 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2018-09-19 16:16:52,392 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-09-19 16:16:53,324 WARN L178 SmtUtils]: Spent 931.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 17 [2018-09-19 16:16:53,432 INFO L426 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-09-19 16:16:53,432 INFO L426 ceAbstractionStarter]: For program point L131-2(line 131) no Hoare annotation was computed. [2018-09-19 16:16:53,433 INFO L426 ceAbstractionStarter]: For program point L129-1(line 129) no Hoare annotation was computed. [2018-09-19 16:16:53,433 INFO L426 ceAbstractionStarter]: For program point L129-2(line 129) no Hoare annotation was computed. [2018-09-19 16:16:53,433 INFO L426 ceAbstractionStarter]: For program point L128-1(lines 128 132) no Hoare annotation was computed. [2018-09-19 16:16:53,433 INFO L426 ceAbstractionStarter]: For program point L129-3(line 129) no Hoare annotation was computed. [2018-09-19 16:16:53,433 INFO L429 ceAbstractionStarter]: At program point L128-3(lines 128 132) the Hoare annotation is: true [2018-09-19 16:16:53,433 INFO L426 ceAbstractionStarter]: For program point L128-4(lines 128 132) no Hoare annotation was computed. [2018-09-19 16:16:53,433 INFO L426 ceAbstractionStarter]: For program point isfinite_doubleFINAL(lines 126 134) no Hoare annotation was computed. [2018-09-19 16:16:53,433 INFO L426 ceAbstractionStarter]: For program point isfinite_doubleEXIT(lines 126 134) no Hoare annotation was computed. [2018-09-19 16:16:53,434 INFO L429 ceAbstractionStarter]: At program point isfinite_doubleENTRY(lines 126 134) the Hoare annotation is: true [2018-09-19 16:16:53,434 INFO L426 ceAbstractionStarter]: For program point L131(line 131) no Hoare annotation was computed. [2018-09-19 16:16:53,434 INFO L426 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-09-19 16:16:53,434 INFO L426 ceAbstractionStarter]: For program point L131-1(line 131) no Hoare annotation was computed. [2018-09-19 16:16:53,434 INFO L429 ceAbstractionStarter]: At program point isnan_doubleENTRY(line 137) the Hoare annotation is: true [2018-09-19 16:16:53,434 INFO L426 ceAbstractionStarter]: For program point isnan_doubleEXIT(line 137) no Hoare annotation was computed. [2018-09-19 16:16:53,434 INFO L426 ceAbstractionStarter]: For program point isnan_doubleFINAL(line 137) no Hoare annotation was computed. [2018-09-19 16:16:53,434 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-19 16:16:53,434 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-09-19 16:16:53,435 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-19 16:16:53,435 INFO L426 ceAbstractionStarter]: For program point L85(lines 85 92) no Hoare annotation was computed. [2018-09-19 16:16:53,435 INFO L426 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-09-19 16:16:53,435 INFO L426 ceAbstractionStarter]: For program point __ieee754_logEXIT(lines 45 124) no Hoare annotation was computed. [2018-09-19 16:16:53,435 INFO L426 ceAbstractionStarter]: For program point L77(line 77) no Hoare annotation was computed. [2018-09-19 16:16:53,435 INFO L426 ceAbstractionStarter]: For program point L77-1(line 77) no Hoare annotation was computed. [2018-09-19 16:16:53,435 INFO L426 ceAbstractionStarter]: For program point L77-2(line 77) no Hoare annotation was computed. [2018-09-19 16:16:53,436 INFO L426 ceAbstractionStarter]: For program point L77-3(line 77) no Hoare annotation was computed. [2018-09-19 16:16:53,436 INFO L426 ceAbstractionStarter]: For program point L94(lines 94 99) no Hoare annotation was computed. [2018-09-19 16:16:53,436 INFO L426 ceAbstractionStarter]: For program point L61(lines 61 62) no Hoare annotation was computed. [2018-09-19 16:16:53,436 INFO L426 ceAbstractionStarter]: For program point L119(lines 119 122) no Hoare annotation was computed. [2018-09-19 16:16:53,436 INFO L426 ceAbstractionStarter]: For program point L86(lines 86 91) no Hoare annotation was computed. [2018-09-19 16:16:53,436 INFO L426 ceAbstractionStarter]: For program point L53(line 53) no Hoare annotation was computed. [2018-09-19 16:16:53,436 INFO L426 ceAbstractionStarter]: For program point L53-1(line 53) no Hoare annotation was computed. [2018-09-19 16:16:53,437 INFO L426 ceAbstractionStarter]: For program point L53-2(line 53) no Hoare annotation was computed. [2018-09-19 16:16:53,437 INFO L426 ceAbstractionStarter]: For program point L111(lines 111 123) no Hoare annotation was computed. [2018-09-19 16:16:53,437 INFO L426 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-09-19 16:16:53,437 INFO L426 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-09-19 16:16:53,437 INFO L426 ceAbstractionStarter]: For program point L54-1(line 54) no Hoare annotation was computed. [2018-09-19 16:16:53,437 INFO L426 ceAbstractionStarter]: For program point L54-2(line 54) no Hoare annotation was computed. [2018-09-19 16:16:53,437 INFO L426 ceAbstractionStarter]: For program point L54-3(line 54) no Hoare annotation was computed. [2018-09-19 16:16:53,437 INFO L426 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-09-19 16:16:53,437 INFO L429 ceAbstractionStarter]: At program point __ieee754_logENTRY(lines 45 124) the Hoare annotation is: true [2018-09-19 16:16:53,438 INFO L426 ceAbstractionStarter]: For program point __ieee754_logFINAL(lines 45 124) no Hoare annotation was computed. [2018-09-19 16:16:53,438 INFO L426 ceAbstractionStarter]: For program point L113(lines 113 117) no Hoare annotation was computed. [2018-09-19 16:16:53,438 INFO L426 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-09-19 16:16:53,438 INFO L426 ceAbstractionStarter]: For program point L80-1(line 80) no Hoare annotation was computed. [2018-09-19 16:16:53,438 INFO L426 ceAbstractionStarter]: For program point L80-2(line 80) no Hoare annotation was computed. [2018-09-19 16:16:53,438 INFO L426 ceAbstractionStarter]: For program point L80-3(line 80) no Hoare annotation was computed. [2018-09-19 16:16:53,439 INFO L426 ceAbstractionStarter]: For program point L65-1(lines 65 69) no Hoare annotation was computed. [2018-09-19 16:16:53,439 INFO L422 ceAbstractionStarter]: At program point L65-3(lines 65 69) the Hoare annotation is: (or (and (exists ((|v_q#valueAsBitvector_15| (_ BitVec 64))) (let ((.cse0 ((_ extract 63 32) |v_q#valueAsBitvector_15|))) (and (bvslt .cse0 (_ bv1048576 32)) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_15|) ((_ extract 62 52) |v_q#valueAsBitvector_15|) ((_ extract 51 0) |v_q#valueAsBitvector_15|)) |__ieee754_log_#in~x|) (not (bvslt .cse0 (_ bv0 32)))))) (exists ((|v_q#valueAsBitvector_13| (_ BitVec 64))) (and (= |__ieee754_log_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_13|) ((_ extract 62 52) |v_q#valueAsBitvector_13|) ((_ extract 51 0) |v_q#valueAsBitvector_13|))) (= ((_ extract 31 0) |v_q#valueAsBitvector_13|) __ieee754_log_~lx~1) (= ((_ extract 63 32) |v_q#valueAsBitvector_13|) __ieee754_log_~hx~1)))) (not (= (_ +zero 11 53) ~zero~0))) [2018-09-19 16:16:53,439 INFO L426 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-09-19 16:16:53,439 INFO L426 ceAbstractionStarter]: For program point L66-1(line 66) no Hoare annotation was computed. [2018-09-19 16:16:53,439 INFO L426 ceAbstractionStarter]: For program point L66-2(line 66) no Hoare annotation was computed. [2018-09-19 16:16:53,439 INFO L426 ceAbstractionStarter]: For program point L66-3(line 66) no Hoare annotation was computed. [2018-09-19 16:16:53,440 INFO L426 ceAbstractionStarter]: For program point L58(lines 58 70) no Hoare annotation was computed. [2018-09-19 16:16:53,440 INFO L426 ceAbstractionStarter]: For program point L58-1(lines 45 124) no Hoare annotation was computed. [2018-09-19 16:16:53,440 INFO L426 ceAbstractionStarter]: For program point L50-1(lines 50 55) no Hoare annotation was computed. [2018-09-19 16:16:53,440 INFO L422 ceAbstractionStarter]: At program point L50-3(lines 50 55) the Hoare annotation is: (or (= __ieee754_log_~x |__ieee754_log_#in~x|) (not (= (_ +zero 11 53) ~zero~0))) [2018-09-19 16:16:53,440 INFO L426 ceAbstractionStarter]: For program point L50-4(lines 50 55) no Hoare annotation was computed. [2018-09-19 16:16:53,440 INFO L426 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-09-19 16:16:53,440 INFO L426 ceAbstractionStarter]: For program point L59(lines 59 60) no Hoare annotation was computed. [2018-09-19 16:16:53,440 INFO L426 ceAbstractionStarter]: For program point L84(lines 84 100) no Hoare annotation was computed. [2018-09-19 16:16:53,440 INFO L426 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-09-19 16:16:53,441 INFO L426 ceAbstractionStarter]: For program point L51-1(line 51) no Hoare annotation was computed. [2018-09-19 16:16:53,441 INFO L426 ceAbstractionStarter]: For program point L51-2(line 51) no Hoare annotation was computed. [2018-09-19 16:16:53,441 INFO L426 ceAbstractionStarter]: For program point L51-3(line 51) no Hoare annotation was computed. [2018-09-19 16:16:53,441 INFO L426 ceAbstractionStarter]: For program point L76-1(lines 76 81) no Hoare annotation was computed. [2018-09-19 16:16:53,441 INFO L422 ceAbstractionStarter]: At program point L76-3(lines 76 81) the Hoare annotation is: (or (not (= (_ +zero 11 53) ~zero~0)) (exists ((|v_q#valueAsBitvector_15| (_ BitVec 64))) (let ((.cse0 ((_ extract 63 32) |v_q#valueAsBitvector_15|))) (and (bvslt .cse0 (_ bv1048576 32)) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_15|) ((_ extract 62 52) |v_q#valueAsBitvector_15|) ((_ extract 51 0) |v_q#valueAsBitvector_15|)) |__ieee754_log_#in~x|) (not (bvslt .cse0 (_ bv0 32)))))) (and (= __ieee754_log_~x |__ieee754_log_#in~x|) (exists ((|v_q#valueAsBitvector_12| (_ BitVec 64))) (and (= |__ieee754_log_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_12|) ((_ extract 62 52) |v_q#valueAsBitvector_12|) ((_ extract 51 0) |v_q#valueAsBitvector_12|))) (not (bvslt ((_ extract 63 32) |v_q#valueAsBitvector_12|) (_ bv1048576 32))))))) [2018-09-19 16:16:53,441 INFO L426 ceAbstractionStarter]: For program point L76-4(lines 76 81) no Hoare annotation was computed. [2018-09-19 16:16:53,441 INFO L426 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2018-09-19 16:16:53,441 INFO L426 ceAbstractionStarter]: For program point L68-1(line 68) no Hoare annotation was computed. [2018-09-19 16:16:53,442 INFO L426 ceAbstractionStarter]: For program point L68-2(line 68) no Hoare annotation was computed. [2018-09-19 16:16:53,442 INFO L426 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-09-19 16:16:53,442 INFO L426 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-09-19 16:16:53,442 INFO L426 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-09-19 16:16:53,442 INFO L426 ceAbstractionStarter]: For program point L23-2(line 23) no Hoare annotation was computed. [2018-09-19 16:16:53,442 INFO L426 ceAbstractionStarter]: For program point L21-1(line 21) no Hoare annotation was computed. [2018-09-19 16:16:53,442 INFO L426 ceAbstractionStarter]: For program point L21-2(line 21) no Hoare annotation was computed. [2018-09-19 16:16:53,443 INFO L426 ceAbstractionStarter]: For program point L21-3(line 21) no Hoare annotation was computed. [2018-09-19 16:16:53,443 INFO L426 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-09-19 16:16:53,443 INFO L426 ceAbstractionStarter]: For program point L24-1(line 24) no Hoare annotation was computed. [2018-09-19 16:16:53,443 INFO L426 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-09-19 16:16:53,443 INFO L426 ceAbstractionStarter]: For program point L24-2(line 24) no Hoare annotation was computed. [2018-09-19 16:16:53,443 INFO L426 ceAbstractionStarter]: For program point L24-3(line 24) no Hoare annotation was computed. [2018-09-19 16:16:53,444 INFO L426 ceAbstractionStarter]: For program point L20-1(lines 20 25) no Hoare annotation was computed. [2018-09-19 16:16:53,444 INFO L426 ceAbstractionStarter]: For program point L20-3(lines 20 25) no Hoare annotation was computed. [2018-09-19 16:16:53,444 INFO L426 ceAbstractionStarter]: For program point L20-4(lines 20 25) no Hoare annotation was computed. [2018-09-19 16:16:53,444 INFO L426 ceAbstractionStarter]: For program point isinf_doubleFINAL(lines 18 30) no Hoare annotation was computed. [2018-09-19 16:16:53,444 INFO L426 ceAbstractionStarter]: For program point isinf_doubleEXIT(lines 18 30) no Hoare annotation was computed. [2018-09-19 16:16:53,444 INFO L426 ceAbstractionStarter]: For program point isinf_doubleENTRY(lines 18 30) no Hoare annotation was computed. [2018-09-19 16:16:53,444 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-19 16:16:53,445 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (= (_ +zero 11 53) ~zero~0) [2018-09-19 16:16:53,445 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-19 16:16:53,445 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-19 16:16:53,445 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 139 160) the Hoare annotation is: true [2018-09-19 16:16:53,445 INFO L426 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-09-19 16:16:53,445 INFO L422 ceAbstractionStarter]: At program point L153(line 153) the Hoare annotation is: (or (not (= (_ +zero 11 53) ~zero~0)) (and (fp.lt main_~x~0 ((_ to_fp 11 53) RNE (_ bv0 32))) (exists ((__ieee754_log_~x (_ FloatingPoint 11 53))) (= (fp.div RNE (fp.sub RNE __ieee754_log_~x __ieee754_log_~x) (_ +zero 11 53)) main_~res~0)))) [2018-09-19 16:16:53,446 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 139 160) no Hoare annotation was computed. [2018-09-19 16:16:53,446 INFO L426 ceAbstractionStarter]: For program point L153-1(lines 153 156) no Hoare annotation was computed. [2018-09-19 16:16:53,446 INFO L422 ceAbstractionStarter]: At program point L150(line 150) the Hoare annotation is: (or (fp.lt main_~x~0 ((_ to_fp 11 53) RNE (_ bv0 32))) (not (= (_ +zero 11 53) ~zero~0))) [2018-09-19 16:16:53,446 INFO L426 ceAbstractionStarter]: For program point L150-1(line 150) no Hoare annotation was computed. [2018-09-19 16:16:53,446 INFO L426 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-09-19 16:16:53,446 INFO L422 ceAbstractionStarter]: At program point L148-1(line 148) the Hoare annotation is: (or (and |main_#t~short16| (fp.lt main_~x~0 ((_ to_fp 11 53) RNE (_ bv0 32)))) (not (= (_ +zero 11 53) ~zero~0))) [2018-09-19 16:16:53,447 INFO L426 ceAbstractionStarter]: For program point L148-2(line 148) no Hoare annotation was computed. [2018-09-19 16:16:53,447 INFO L426 ceAbstractionStarter]: For program point L148-4(lines 148 157) no Hoare annotation was computed. [2018-09-19 16:16:53,447 INFO L426 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 154) no Hoare annotation was computed. [2018-09-19 16:16:53,447 INFO L426 ceAbstractionStarter]: For program point L148-6(lines 148 157) no Hoare annotation was computed. [2018-09-19 16:16:53,447 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 139 160) no Hoare annotation was computed. [2018-09-19 16:16:53,454 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,456 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,456 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,456 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,457 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,457 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 16:16:53,457 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 16:16:53,458 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 16:16:53,458 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 16:16:53,458 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 16:16:53,465 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,465 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,466 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,466 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,466 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,467 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 16:16:53,467 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 16:16:53,467 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 16:16:53,467 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 16:16:53,468 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 16:16:53,469 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,469 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,470 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,470 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,470 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,471 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 16:16:53,471 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 16:16:53,471 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 16:16:53,471 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 16:16:53,472 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,472 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,473 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,473 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,473 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,473 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 16:16:53,474 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 16:16:53,474 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 16:16:53,474 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 16:16:53,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 04:16:53 BoogieIcfgContainer [2018-09-19 16:16:53,477 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 16:16:53,478 INFO L168 Benchmark]: Toolchain (without parser) took 113622.44 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.7 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -296.3 MB). Peak memory consumption was 441.3 MB. Max. memory is 7.1 GB. [2018-09-19 16:16:53,479 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-09-19 16:16:53,480 INFO L168 Benchmark]: CACSL2BoogieTranslator took 507.38 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 16:16:53,480 INFO L168 Benchmark]: Boogie Preprocessor took 61.64 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 16:16:53,481 INFO L168 Benchmark]: RCFGBuilder took 24581.06 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -753.3 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. [2018-09-19 16:16:53,482 INFO L168 Benchmark]: TraceAbstraction took 88463.53 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 435.8 MB). Peak memory consumption was 435.8 MB. Max. memory is 7.1 GB. [2018-09-19 16:16:53,486 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 507.38 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.64 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 24581.06 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -753.3 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 88463.53 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 435.8 MB). Peak memory consumption was 435.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 154]: 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: 128]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 65]: Loop Invariant [2018-09-19 16:16:53,497 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,497 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,497 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,497 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,498 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,498 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 16:16:53,498 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 16:16:53,498 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 16:16:53,498 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 16:16:53,499 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 16:16:53,500 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,500 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,500 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,500 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,501 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,501 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 16:16:53,501 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 16:16:53,501 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 16:16:53,501 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 16:16:53,502 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] Derived loop invariant: ((\exists v_q#valueAsBitvector_15 : bv64 :: (~bvslt32(v_q#valueAsBitvector_15[63:32], 1048576bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_15[63:63], v_q#valueAsBitvector_15[62:52], v_q#valueAsBitvector_15[51:0]) == \old(x)) && !~bvslt32(v_q#valueAsBitvector_15[63:32], 0bv32)) && (\exists v_q#valueAsBitvector_13 : bv64 :: (\old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_13[63:63], v_q#valueAsBitvector_13[62:52], v_q#valueAsBitvector_13[51:0]) && v_q#valueAsBitvector_13[31:0] == lx) && v_q#valueAsBitvector_13[63:32] == hx)) || !(~Pluszero~LONGDOUBLE() == zero) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: x == \old(x) || !(~Pluszero~LONGDOUBLE() == zero) - InvariantResult [Line: 76]: Loop Invariant [2018-09-19 16:16:53,503 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,503 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,503 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,503 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,504 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,504 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 16:16:53,504 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 16:16:53,504 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 16:16:53,504 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 16:16:53,505 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,505 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,505 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,506 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,506 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:16:53,506 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 16:16:53,506 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 16:16:53,506 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 16:16:53,507 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] Derived loop invariant: (!(~Pluszero~LONGDOUBLE() == zero) || (\exists v_q#valueAsBitvector_15 : bv64 :: (~bvslt32(v_q#valueAsBitvector_15[63:32], 1048576bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_15[63:63], v_q#valueAsBitvector_15[62:52], v_q#valueAsBitvector_15[51:0]) == \old(x)) && !~bvslt32(v_q#valueAsBitvector_15[63:32], 0bv32))) || (x == \old(x) && (\exists v_q#valueAsBitvector_12 : bv64 :: \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_12[63:63], v_q#valueAsBitvector_12[62:52], v_q#valueAsBitvector_12[51:0]) && !~bvslt32(v_q#valueAsBitvector_12[63:32], 1048576bv32))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 108 locations, 1 error locations. SAFE Result, 88.3s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 72.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 515 SDtfs, 220 SDslu, 1949 SDs, 0 SdLazy, 425 SolverSat, 33 SolverUnsat, 15 SolverUnknown, 0 SolverNotchecked, 59.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 304 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 15.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 27 PreInvPairs, 34 NumberOfFragments, 151 HoareAnnotationTreeSize, 27 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 86 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 280 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 274 ConstructedInterpolants, 64 QuantifiedInterpolants, 88945 SizeOfPredicates, 30 NumberOfNonLiveVariables, 756 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...