./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_0970a_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/float-newlib/double_req_bl_0970a_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cc541d75f5affce4b825454cfd79356341e493a9 ................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/float-newlib/double_req_bl_0970a_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cc541d75f5affce4b825454cfd79356341e493a9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:07:19,031 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:07:19,033 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:07:19,045 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:07:19,045 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:07:19,046 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:07:19,048 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:07:19,050 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:07:19,051 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:07:19,052 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:07:19,053 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:07:19,054 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:07:19,055 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:07:19,056 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:07:19,058 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:07:19,058 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:07:19,059 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:07:19,063 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:07:19,067 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:07:19,071 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:07:19,074 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:07:19,077 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:07:19,083 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:07:19,083 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:07:19,084 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:07:19,085 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:07:19,086 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:07:19,090 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:07:19,092 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:07:19,095 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:07:19,095 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:07:19,095 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:07:19,096 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:07:19,096 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:07:19,097 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:07:19,097 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:07:19,098 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 09:07:19,112 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:07:19,112 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:07:19,114 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:07:19,115 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:07:19,115 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:07:19,115 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:07:19,115 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:07:19,116 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:07:19,116 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:07:19,116 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:07:19,116 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:07:19,116 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:07:19,116 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:07:19,117 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:07:19,119 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:07:19,119 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:07:19,119 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:07:19,119 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:07:19,120 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:07:19,120 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:07:19,120 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:07:19,120 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:07:19,120 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:07:19,121 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:07:19,121 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:07:19,121 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:07:19,121 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:07:19,121 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:07:19,121 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cc541d75f5affce4b825454cfd79356341e493a9 [2019-01-12 09:07:19,183 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:07:19,202 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:07:19,208 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:07:19,210 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:07:19,211 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:07:19,213 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0970a_true-unreach-call.c [2019-01-12 09:07:19,272 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f4b6c2c5/dd05014f980641fc81f929b2f4559e56/FLAG329a30483 [2019-01-12 09:07:19,767 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:07:19,768 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0970a_true-unreach-call.c [2019-01-12 09:07:19,780 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f4b6c2c5/dd05014f980641fc81f929b2f4559e56/FLAG329a30483 [2019-01-12 09:07:20,072 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f4b6c2c5/dd05014f980641fc81f929b2f4559e56 [2019-01-12 09:07:20,076 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:07:20,077 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:07:20,078 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:07:20,078 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:07:20,082 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:07:20,083 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:07:20" (1/1) ... [2019-01-12 09:07:20,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@baf140b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:20, skipping insertion in model container [2019-01-12 09:07:20,086 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:07:20" (1/1) ... [2019-01-12 09:07:20,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:07:20,122 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:07:20,368 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:07:20,373 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:07:20,423 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:07:20,447 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:07:20,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:20 WrapperNode [2019-01-12 09:07:20,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:07:20,449 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:07:20,449 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:07:20,449 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:07:20,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:20" (1/1) ... [2019-01-12 09:07:20,532 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:20" (1/1) ... [2019-01-12 09:07:20,569 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:07:20,569 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:07:20,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:07:20,570 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:07:20,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:20" (1/1) ... [2019-01-12 09:07:20,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:20" (1/1) ... [2019-01-12 09:07:20,591 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:20" (1/1) ... [2019-01-12 09:07:20,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:20" (1/1) ... [2019-01-12 09:07:20,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:20" (1/1) ... [2019-01-12 09:07:20,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:20" (1/1) ... [2019-01-12 09:07:20,643 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:20" (1/1) ... [2019-01-12 09:07:20,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:07:20,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:07:20,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:07:20,655 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:07:20,656 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:20" (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 [2019-01-12 09:07:20,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:07:20,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-01-12 09:07:20,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 09:07:20,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-01-12 09:07:20,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:07:20,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:07:20,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 09:07:20,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:07:21,451 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:07:21,451 INFO L286 CfgBuilder]: Removed 26 assue(true) statements. [2019-01-12 09:07:21,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:07:21 BoogieIcfgContainer [2019-01-12 09:07:21,454 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:07:21,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:07:21,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:07:21,458 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:07:21,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:07:20" (1/3) ... [2019-01-12 09:07:21,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3811ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:07:21, skipping insertion in model container [2019-01-12 09:07:21,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:20" (2/3) ... [2019-01-12 09:07:21,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3811ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:07:21, skipping insertion in model container [2019-01-12 09:07:21,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:07:21" (3/3) ... [2019-01-12 09:07:21,462 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0970a_true-unreach-call.c [2019-01-12 09:07:21,471 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:07:21,479 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:07:21,494 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:07:21,521 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:07:21,522 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:07:21,522 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:07:21,522 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:07:21,523 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:07:21,523 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:07:21,523 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:07:21,523 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:07:21,523 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:07:21,537 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2019-01-12 09:07:21,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 09:07:21,543 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:07:21,544 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:07:21,546 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:07:21,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:07:21,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1392627184, now seen corresponding path program 1 times [2019-01-12 09:07:21,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:07:21,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:07:21,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:07:21,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:07:21,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:07:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:07:21,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:07:21,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:07:21,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:07:21,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:07:21,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:07:21,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:07:21,702 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2019-01-12 09:07:21,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:07:21,721 INFO L93 Difference]: Finished difference Result 95 states and 156 transitions. [2019-01-12 09:07:21,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:07:21,722 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-01-12 09:07:21,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:07:21,733 INFO L225 Difference]: With dead ends: 95 [2019-01-12 09:07:21,733 INFO L226 Difference]: Without dead ends: 45 [2019-01-12 09:07:21,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:07:21,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-12 09:07:21,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-12 09:07:21,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-12 09:07:21,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-01-12 09:07:21,767 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 12 [2019-01-12 09:07:21,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:07:21,768 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-01-12 09:07:21,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:07:21,768 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2019-01-12 09:07:21,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 09:07:21,769 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:07:21,769 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:07:21,769 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:07:21,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:07:21,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1009660131, now seen corresponding path program 1 times [2019-01-12 09:07:21,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:07:21,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:07:21,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:07:21,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:07:21,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:07:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:07:21,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:07:21,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:07:21,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:07:21,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:07:21,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:07:21,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:07:21,848 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 3 states. [2019-01-12 09:07:21,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:07:21,900 INFO L93 Difference]: Finished difference Result 83 states and 112 transitions. [2019-01-12 09:07:21,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:07:21,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-12 09:07:21,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:07:21,902 INFO L225 Difference]: With dead ends: 83 [2019-01-12 09:07:21,902 INFO L226 Difference]: Without dead ends: 45 [2019-01-12 09:07:21,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:07:21,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-12 09:07:21,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-12 09:07:21,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-12 09:07:21,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2019-01-12 09:07:21,910 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 13 [2019-01-12 09:07:21,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:07:21,910 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2019-01-12 09:07:21,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:07:21,910 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2019-01-12 09:07:21,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 09:07:21,911 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:07:21,911 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:07:21,911 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:07:21,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:07:21,912 INFO L82 PathProgramCache]: Analyzing trace with hash 34829304, now seen corresponding path program 1 times [2019-01-12 09:07:21,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:07:21,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:07:21,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:07:21,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:07:21,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:07:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:07:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:07:22,111 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 09:07:22,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:07:22 BoogieIcfgContainer [2019-01-12 09:07:22,161 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:07:22,161 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:07:22,161 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:07:22,162 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:07:22,162 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:07:21" (3/4) ... [2019-01-12 09:07:22,167 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-12 09:07:22,168 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:07:22,169 INFO L168 Benchmark]: Toolchain (without parser) took 2092.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 945.9 MB in the beginning and 1.0 GB in the end (delta: -79.0 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2019-01-12 09:07:22,171 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:07:22,172 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.29 ms. Allocated memory is still 1.0 GB. Free memory was 945.9 MB in the beginning and 929.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-12 09:07:22,173 INFO L168 Benchmark]: Boogie Procedure Inliner took 120.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 929.8 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-01-12 09:07:22,174 INFO L168 Benchmark]: Boogie Preprocessor took 85.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:07:22,175 INFO L168 Benchmark]: RCFGBuilder took 798.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:07:22,177 INFO L168 Benchmark]: TraceAbstraction took 706.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. [2019-01-12 09:07:22,178 INFO L168 Benchmark]: Witness Printer took 6.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 09:07:22,184 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.52 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 370.29 ms. Allocated memory is still 1.0 GB. Free memory was 945.9 MB in the beginning and 929.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 120.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 929.8 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 85.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 798.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 706.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. * Witness Printer took 6.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 188]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 161, overapproximation of bitwiseAnd at line 170, overapproximation of someBinaryArithmeticDOUBLEoperation at line 145. Possible FailurePath: [L17-L26] static const double ln2_hi_log = 6.93147180369123816490e-01, ln2_lo_log = 1.90821492927058770002e-10, two54_log = 1.80143985094819840000e+16, Lg1_log = 6.666666666666735130e-01, Lg2_log = 3.999999999940941908e-01, Lg3_log = 2.857142874366239149e-01, Lg4_log = 2.222219843214978396e-01, Lg5_log = 1.818357216161805012e-01, Lg6_log = 1.531383769920937332e-01, Lg7_log = 1.479819860511658591e-01; [L28] static const double zero = 0.0; [L111-L114] static const double two54_log10 = 1.80143985094819840000e+16, ivln10_log10 = 4.34294481903251816668e-01, log10_2hi_log10 = 3.01029995663611771306e-01, log10_2lo_log10 = 3.69423907715893078616e-13; [L116] static const double zero_log10 = 0.0; VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L180] double x = __VERIFIER_nondet_double(); [L182] x < 0 && isfinite_double(x) [L164] __int32_t hx; VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L166] ieee_double_shape_type gh_u; [L167] gh_u.value = (x) [L168] EXPR gh_u.parts.msw [L168] (hx) = gh_u.parts.msw [L170] return (int)((__uint32_t)((hx & 0x7fffffff) - 0x7ff00000) >> 31); VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L182] x < 0 && isfinite_double(x) VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L182] COND TRUE x < 0 && isfinite_double(x) [L119] double y, z; [L120] __int32_t i, k, hx; [L121] __uint32_t lx; VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L124] ieee_double_shape_type ew_u; [L125] ew_u.value = (x) [L126] EXPR ew_u.parts.msw [L126] (hx) = ew_u.parts.msw [L127] EXPR ew_u.parts.lsw [L127] (lx) = ew_u.parts.lsw [L130] k = 0 VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L131] COND FALSE !(hx < 0x00100000) VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L144] COND TRUE hx >= 0x7ff00000 [L145] return x + x; VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L184] double res = __ieee754_log10(x); [L161] return x != x; VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L187] COND TRUE !isnan_double(res) [L188] __VERIFIER_error() VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 49 locations, 1 error locations. UNSAFE Result, 0.6s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 125 SDtfs, 0 SDslu, 55 SDs, 0 SdLazy, 4 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 23 ConstructedInterpolants, 0 QuantifiedInterpolants, 277 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:07:24,370 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:07:24,371 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:07:24,391 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:07:24,391 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:07:24,393 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:07:24,395 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:07:24,397 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:07:24,400 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:07:24,401 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:07:24,401 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:07:24,402 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:07:24,403 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:07:24,405 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:07:24,406 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:07:24,407 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:07:24,408 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:07:24,411 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:07:24,413 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:07:24,415 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:07:24,416 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:07:24,417 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:07:24,420 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:07:24,420 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:07:24,420 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:07:24,422 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:07:24,423 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:07:24,424 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:07:24,425 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:07:24,426 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:07:24,427 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:07:24,427 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:07:24,427 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:07:24,428 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:07:24,429 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:07:24,430 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:07:24,431 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-01-12 09:07:24,449 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:07:24,450 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:07:24,451 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:07:24,451 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:07:24,451 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:07:24,452 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:07:24,452 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:07:24,452 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:07:24,452 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:07:24,452 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:07:24,453 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:07:24,453 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:07:24,453 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-12 09:07:24,453 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-12 09:07:24,453 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:07:24,453 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:07:24,454 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:07:24,455 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:07:24,456 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:07:24,456 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:07:24,456 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:07:24,456 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:07:24,456 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:07:24,457 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:07:24,457 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:07:24,458 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:07:24,458 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-12 09:07:24,458 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:07:24,458 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-12 09:07:24,458 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-12 09:07:24,458 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cc541d75f5affce4b825454cfd79356341e493a9 [2019-01-12 09:07:24,510 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:07:24,530 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:07:24,535 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:07:24,539 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:07:24,540 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:07:24,541 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0970a_true-unreach-call.c [2019-01-12 09:07:24,608 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/807dd5ce1/034797c1f50c4256bcbe8f8de6117285/FLAG641ddaaaa [2019-01-12 09:07:25,098 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:07:25,099 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0970a_true-unreach-call.c [2019-01-12 09:07:25,112 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/807dd5ce1/034797c1f50c4256bcbe8f8de6117285/FLAG641ddaaaa [2019-01-12 09:07:25,425 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/807dd5ce1/034797c1f50c4256bcbe8f8de6117285 [2019-01-12 09:07:25,428 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:07:25,430 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:07:25,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:07:25,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:07:25,434 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:07:25,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:07:25" (1/1) ... [2019-01-12 09:07:25,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@348d6f3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:25, skipping insertion in model container [2019-01-12 09:07:25,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:07:25" (1/1) ... [2019-01-12 09:07:25,446 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:07:25,480 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:07:25,705 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:07:25,713 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:07:25,788 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:07:25,831 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:07:25,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:25 WrapperNode [2019-01-12 09:07:25,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:07:25,833 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:07:25,833 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:07:25,833 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:07:25,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:25" (1/1) ... [2019-01-12 09:07:25,919 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:25" (1/1) ... [2019-01-12 09:07:25,954 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:07:25,955 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:07:25,955 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:07:25,955 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:07:25,970 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:25" (1/1) ... [2019-01-12 09:07:25,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:25" (1/1) ... [2019-01-12 09:07:25,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:25" (1/1) ... [2019-01-12 09:07:25,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:25" (1/1) ... [2019-01-12 09:07:26,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:25" (1/1) ... [2019-01-12 09:07:26,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:25" (1/1) ... [2019-01-12 09:07:26,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:25" (1/1) ... [2019-01-12 09:07:26,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:07:26,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:07:26,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:07:26,032 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:07:26,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:25" (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 [2019-01-12 09:07:26,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-01-12 09:07:26,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-01-12 09:07:26,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:07:26,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-12 09:07:26,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:07:26,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:07:26,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-12 09:07:26,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:07:26,480 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:07:26,516 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:07:30,898 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:07:52,985 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:07:53,358 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:07:53,467 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:07:58,444 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:07:58,504 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:07:58,505 INFO L286 CfgBuilder]: Removed 26 assue(true) statements. [2019-01-12 09:07:58,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:07:58 BoogieIcfgContainer [2019-01-12 09:07:58,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:07:58,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:07:58,508 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:07:58,511 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:07:58,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:07:25" (1/3) ... [2019-01-12 09:07:58,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57f40a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:07:58, skipping insertion in model container [2019-01-12 09:07:58,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:25" (2/3) ... [2019-01-12 09:07:58,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57f40a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:07:58, skipping insertion in model container [2019-01-12 09:07:58,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:07:58" (3/3) ... [2019-01-12 09:07:58,515 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0970a_true-unreach-call.c [2019-01-12 09:07:58,527 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:07:58,539 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:07:58,558 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:07:58,609 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:07:58,610 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:07:58,610 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:07:58,610 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:07:58,610 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:07:58,610 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:07:58,610 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:07:58,610 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:07:58,611 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:07:58,631 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2019-01-12 09:07:58,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 09:07:58,639 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:07:58,640 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:07:58,645 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:07:58,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:07:58,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1392627184, now seen corresponding path program 1 times [2019-01-12 09:07:58,659 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:07:58,661 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) [2019-01-12 09:07:58,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-01-12 09:07:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:07:58,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:07:58,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:07:58,789 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:07:58,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:07:58,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:07:58,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:07:58,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:07:58,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:07:58,818 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2019-01-12 09:07:58,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:07:58,840 INFO L93 Difference]: Finished difference Result 95 states and 156 transitions. [2019-01-12 09:07:58,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:07:58,842 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-01-12 09:07:58,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:07:58,855 INFO L225 Difference]: With dead ends: 95 [2019-01-12 09:07:58,855 INFO L226 Difference]: Without dead ends: 45 [2019-01-12 09:07:58,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:07:58,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-12 09:07:58,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-12 09:07:58,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-12 09:07:58,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-01-12 09:07:58,902 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 12 [2019-01-12 09:07:58,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:07:58,903 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-01-12 09:07:58,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:07:58,903 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2019-01-12 09:07:58,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 09:07:58,904 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:07:58,904 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:07:58,905 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:07:58,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:07:58,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1009660131, now seen corresponding path program 1 times [2019-01-12 09:07:58,906 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:07:58,906 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 [2019-01-12 09:07:58,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:07:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:07:59,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:07:59,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:07:59,083 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:07:59,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:07:59,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:07:59,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:07:59,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:07:59,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:07:59,097 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 3 states. [2019-01-12 09:07:59,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:07:59,253 INFO L93 Difference]: Finished difference Result 83 states and 112 transitions. [2019-01-12 09:07:59,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:07:59,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-12 09:07:59,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:07:59,256 INFO L225 Difference]: With dead ends: 83 [2019-01-12 09:07:59,257 INFO L226 Difference]: Without dead ends: 45 [2019-01-12 09:07:59,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:07:59,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-12 09:07:59,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-12 09:07:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-12 09:07:59,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2019-01-12 09:07:59,265 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 13 [2019-01-12 09:07:59,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:07:59,266 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2019-01-12 09:07:59,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:07:59,266 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2019-01-12 09:07:59,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 09:07:59,267 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:07:59,267 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:07:59,267 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:07:59,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:07:59,268 INFO L82 PathProgramCache]: Analyzing trace with hash 34829304, now seen corresponding path program 1 times [2019-01-12 09:07:59,268 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:07:59,269 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 [2019-01-12 09:07:59,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:07:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:07:59,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:07:59,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:07:59,690 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:07:59,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:07:59,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 09:07:59,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:07:59,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:07:59,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:07:59,703 INFO L87 Difference]: Start difference. First operand 45 states and 59 transitions. Second operand 6 states. [2019-01-12 09:08:07,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:08:07,057 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2019-01-12 09:08:07,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 09:08:07,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-01-12 09:08:07,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:08:07,091 INFO L225 Difference]: With dead ends: 50 [2019-01-12 09:08:07,092 INFO L226 Difference]: Without dead ends: 19 [2019-01-12 09:08:07,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:08:07,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-12 09:08:07,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-12 09:08:07,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-12 09:08:07,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-01-12 09:08:07,098 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-01-12 09:08:07,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:08:07,098 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-01-12 09:08:07,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:08:07,098 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-01-12 09:08:07,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 09:08:07,099 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:08:07,099 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:08:07,099 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:08:07,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:08:07,100 INFO L82 PathProgramCache]: Analyzing trace with hash -675358345, now seen corresponding path program 1 times [2019-01-12 09:08:07,101 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:08:07,101 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 [2019-01-12 09:08:07,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:08:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:08:08,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:08:08,318 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:08:08,334 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:08:08,344 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:08:08,359 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:08:08,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 85 [2019-01-12 09:08:08,589 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2019-01-12 09:08:08,606 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:08:08,621 INFO L478 Elim1Store]: Elim1 applied some 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 54 treesize of output 51 [2019-01-12 09:08:08,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:08:08,718 INFO L478 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 51 treesize of output 39 [2019-01-12 09:08:08,762 INFO L478 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 39 treesize of output 34 [2019-01-12 09:08:08,764 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:08:08,835 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:08:08,871 INFO L478 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 25 treesize of output 19 [2019-01-12 09:08:08,893 INFO L478 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 19 treesize of output 5 [2019-01-12 09:08:08,893 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-12 09:08:08,898 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:08:08,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:08:08,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-12 09:08:08,951 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:73, output treesize:30 [2019-01-12 09:08:09,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:08:09,011 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:08:09,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:08:09,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 09:08:09,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:08:09,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:08:09,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:08:09,035 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 6 states. [2019-01-12 09:08:11,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:08:11,498 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2019-01-12 09:08:11,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 09:08:11,874 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-01-12 09:08:11,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:08:11,875 INFO L225 Difference]: With dead ends: 24 [2019-01-12 09:08:11,875 INFO L226 Difference]: Without dead ends: 19 [2019-01-12 09:08:11,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:08:11,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-12 09:08:11,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-12 09:08:11,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-12 09:08:11,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2019-01-12 09:08:11,883 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 17 [2019-01-12 09:08:11,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:08:11,883 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2019-01-12 09:08:11,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:08:11,883 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2019-01-12 09:08:11,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 09:08:11,885 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:08:11,885 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:08:11,885 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:08:11,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:08:11,886 INFO L82 PathProgramCache]: Analyzing trace with hash 473095487, now seen corresponding path program 1 times [2019-01-12 09:08:11,887 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:08:11,887 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 [2019-01-12 09:08:11,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:08:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:08:13,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:08:13,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:08:13,444 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:08:13,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:08:13,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 09:08:13,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:08:13,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:08:13,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:08:13,473 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand 6 states. [2019-01-12 09:08:17,017 WARN L181 SmtUtils]: Spent 554.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-12 09:08:17,953 WARN L181 SmtUtils]: Spent 613.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-12 09:08:19,120 WARN L181 SmtUtils]: Spent 884.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-12 09:08:19,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:08:19,121 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2019-01-12 09:08:19,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 09:08:19,122 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-01-12 09:08:19,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:08:19,122 INFO L225 Difference]: With dead ends: 19 [2019-01-12 09:08:19,122 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 09:08:19,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:08:19,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 09:08:19,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 09:08:19,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 09:08:19,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 09:08:19,124 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-01-12 09:08:19,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:08:19,125 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 09:08:19,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:08:19,125 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 09:08:19,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 09:08:19,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 09:08:19,315 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-12 09:08:23,326 WARN L181 SmtUtils]: Spent 3.95 s on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-01-12 09:08:27,208 WARN L181 SmtUtils]: Spent 3.88 s on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2019-01-12 09:08:27,269 INFO L444 ceAbstractionStarter]: At program point L35-2(lines 35 40) the Hoare annotation is: false [2019-01-12 09:08:27,269 INFO L448 ceAbstractionStarter]: For program point L35-3(lines 35 40) no Hoare annotation was computed. [2019-01-12 09:08:27,269 INFO L448 ceAbstractionStarter]: For program point L44(lines 44 45) no Hoare annotation was computed. [2019-01-12 09:08:27,269 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 85) no Hoare annotation was computed. [2019-01-12 09:08:27,269 INFO L451 ceAbstractionStarter]: At program point L193(lines 173 194) the Hoare annotation is: true [2019-01-12 09:08:27,270 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 09:08:27,270 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 09:08:27,270 INFO L448 ceAbstractionStarter]: For program point L61-1(lines 61 66) no Hoare annotation was computed. [2019-01-12 09:08:27,270 INFO L444 ceAbstractionStarter]: At program point L61-2(lines 61 66) the Hoare annotation is: false [2019-01-12 09:08:27,270 INFO L448 ceAbstractionStarter]: For program point L61-3(lines 61 66) no Hoare annotation was computed. [2019-01-12 09:08:27,270 INFO L448 ceAbstractionStarter]: For program point L70(lines 70 77) no Hoare annotation was computed. [2019-01-12 09:08:27,271 INFO L444 ceAbstractionStarter]: At program point L161(line 161) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (= (bvadd |ULTIMATE.start_isnan_double_#res| (_ bv4294967295 32)) (_ bv0 32)) (fp.lt ULTIMATE.start_main_~x~0 .cse0) (fp.lt ULTIMATE.start___ieee754_log10_~x .cse0) (exists ((ULTIMATE.start___ieee754_log10_~x (_ FloatingPoint 11 53))) (= |ULTIMATE.start___ieee754_log10_#res| (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start___ieee754_log10_~x ULTIMATE.start___ieee754_log10_~x) (_ +zero 11 53)))) (exists ((v_prenex_16 (_ BitVec 64)) (v_prenex_17 (_ BitVec 64))) (let ((.cse2 ((_ extract 31 0) v_prenex_16)) (.cse1 ((_ extract 63 32) v_prenex_17))) (and (= ((_ extract 63 32) v_prenex_16) .cse1) (= .cse2 ((_ extract 31 0) v_prenex_17)) (fp.lt (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (= .cse2 ULTIMATE.start___ieee754_log10_~lx~1) (= ULTIMATE.start___ieee754_log10_~hx~1 .cse1)))) (= (_ +zero 11 53) ~zero_log10~0))) [2019-01-12 09:08:27,271 INFO L448 ceAbstractionStarter]: For program point L79(lines 79 84) no Hoare annotation was computed. [2019-01-12 09:08:27,271 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 47) no Hoare annotation was computed. [2019-01-12 09:08:27,271 INFO L444 ceAbstractionStarter]: At program point L170(lines 163 171) the Hoare annotation is: (and (fp.lt ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) |ULTIMATE.start_main_#t~short21| (= (_ +zero 11 53) ~zero_log10~0)) [2019-01-12 09:08:27,271 INFO L448 ceAbstractionStarter]: For program point L104(lines 104 107) no Hoare annotation was computed. [2019-01-12 09:08:27,271 INFO L448 ceAbstractionStarter]: For program point L71(lines 71 76) no Hoare annotation was computed. [2019-01-12 09:08:27,271 INFO L448 ceAbstractionStarter]: For program point L96(lines 96 108) no Hoare annotation was computed. [2019-01-12 09:08:27,271 INFO L448 ceAbstractionStarter]: For program point L187(lines 187 190) no Hoare annotation was computed. [2019-01-12 09:08:27,272 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 138 142) no Hoare annotation was computed. [2019-01-12 09:08:27,272 INFO L444 ceAbstractionStarter]: At program point L138-2(lines 138 142) the Hoare annotation is: false [2019-01-12 09:08:27,272 INFO L448 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-01-12 09:08:27,272 INFO L448 ceAbstractionStarter]: For program point L131(lines 131 143) no Hoare annotation was computed. [2019-01-12 09:08:27,272 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 118 158) no Hoare annotation was computed. [2019-01-12 09:08:27,272 INFO L448 ceAbstractionStarter]: For program point L98(lines 98 102) no Hoare annotation was computed. [2019-01-12 09:08:27,272 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 09:08:27,273 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 123 128) no Hoare annotation was computed. [2019-01-12 09:08:27,273 INFO L444 ceAbstractionStarter]: At program point L123-2(lines 123 128) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.lt ULTIMATE.start_main_~x~0 .cse0) (fp.lt ULTIMATE.start___ieee754_log10_~x .cse0) (= (_ +zero 11 53) ~zero_log10~0))) [2019-01-12 09:08:27,273 INFO L448 ceAbstractionStarter]: For program point L123-3(lines 123 128) no Hoare annotation was computed. [2019-01-12 09:08:27,273 INFO L444 ceAbstractionStarter]: At program point L107(lines 30 109) the Hoare annotation is: false [2019-01-12 09:08:27,273 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 165 169) no Hoare annotation was computed. [2019-01-12 09:08:27,273 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 133) no Hoare annotation was computed. [2019-01-12 09:08:27,273 INFO L444 ceAbstractionStarter]: At program point L165-2(lines 165 169) the Hoare annotation is: (and (fp.lt ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) |ULTIMATE.start_main_#t~short21| (= (_ +zero 11 53) ~zero_log10~0)) [2019-01-12 09:08:27,274 INFO L448 ceAbstractionStarter]: For program point L165-3(lines 165 169) no Hoare annotation was computed. [2019-01-12 09:08:27,274 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 09:08:27,274 INFO L444 ceAbstractionStarter]: At program point L157(lines 118 158) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.lt ULTIMATE.start_main_~x~0 .cse0) (fp.lt ULTIMATE.start___ieee754_log10_~x .cse0) (exists ((ULTIMATE.start___ieee754_log10_~x (_ FloatingPoint 11 53))) (= |ULTIMATE.start___ieee754_log10_#res| (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start___ieee754_log10_~x ULTIMATE.start___ieee754_log10_~x) (_ +zero 11 53)))) (exists ((v_prenex_16 (_ BitVec 64)) (v_prenex_17 (_ BitVec 64))) (let ((.cse2 ((_ extract 31 0) v_prenex_16)) (.cse1 ((_ extract 63 32) v_prenex_17))) (and (= ((_ extract 63 32) v_prenex_16) .cse1) (= .cse2 ((_ extract 31 0) v_prenex_17)) (fp.lt (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (= .cse2 ULTIMATE.start___ieee754_log10_~lx~1) (= ULTIMATE.start___ieee754_log10_~hx~1 .cse1)))) (= (_ +zero 11 53) ~zero_log10~0))) [2019-01-12 09:08:27,274 INFO L448 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2019-01-12 09:08:27,274 INFO L448 ceAbstractionStarter]: For program point L182-2(lines 182 191) no Hoare annotation was computed. [2019-01-12 09:08:27,274 INFO L448 ceAbstractionStarter]: For program point L182-4(lines 182 191) no Hoare annotation was computed. [2019-01-12 09:08:27,274 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 50 54) no Hoare annotation was computed. [2019-01-12 09:08:27,275 INFO L444 ceAbstractionStarter]: At program point L50-2(lines 50 54) the Hoare annotation is: false [2019-01-12 09:08:27,275 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 188) no Hoare annotation was computed. [2019-01-12 09:08:27,275 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 150 155) no Hoare annotation was computed. [2019-01-12 09:08:27,275 INFO L444 ceAbstractionStarter]: At program point L150-2(lines 150 155) the Hoare annotation is: false [2019-01-12 09:08:27,275 INFO L448 ceAbstractionStarter]: For program point L150-3(lines 150 155) no Hoare annotation was computed. [2019-01-12 09:08:27,275 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 55) no Hoare annotation was computed. [2019-01-12 09:08:27,276 INFO L448 ceAbstractionStarter]: For program point L43-1(lines 30 109) no Hoare annotation was computed. [2019-01-12 09:08:27,276 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 135) no Hoare annotation was computed. [2019-01-12 09:08:27,276 INFO L448 ceAbstractionStarter]: For program point L35-1(lines 35 40) no Hoare annotation was computed. [2019-01-12 09:08:27,284 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,289 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,292 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,292 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,292 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,293 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,293 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log10_~x,QUANTIFIED] [2019-01-12 09:08:27,293 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log10_~x,QUANTIFIED] [2019-01-12 09:08:27,294 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:08:27,294 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,294 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:08:27,294 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,294 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,295 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,295 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,295 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,295 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:08:27,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,297 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,297 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,297 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,297 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,298 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log10_~x,QUANTIFIED] [2019-01-12 09:08:27,298 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log10_~x,QUANTIFIED] [2019-01-12 09:08:27,298 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:08:27,298 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,298 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:08:27,299 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,299 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,299 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,299 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,300 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,300 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:08:27,300 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,301 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,301 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,302 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,302 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,302 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log10_~x,QUANTIFIED] [2019-01-12 09:08:27,302 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log10_~x,QUANTIFIED] [2019-01-12 09:08:27,302 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:08:27,303 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,303 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:08:27,303 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,303 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,304 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,304 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,304 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,304 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:08:27,305 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,305 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,306 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,306 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,306 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,306 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log10_~x,QUANTIFIED] [2019-01-12 09:08:27,307 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log10_~x,QUANTIFIED] [2019-01-12 09:08:27,307 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:08:27,307 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,307 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:08:27,308 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,308 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,308 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,308 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,308 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,309 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:08:27,309 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,310 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,310 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,311 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,311 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,311 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,311 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:08:27 BoogieIcfgContainer [2019-01-12 09:08:27,314 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:08:27,314 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:08:27,314 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:08:27,315 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:08:27,315 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:07:58" (3/4) ... [2019-01-12 09:08:27,319 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 09:08:27,342 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2019-01-12 09:08:27,344 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-01-12 09:08:27,344 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 09:08:27,374 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32)) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && (\exists ULTIMATE.start___ieee754_log10_~x : C_DOUBLE :: \result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.sub~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start___ieee754_log10_~x, ULTIMATE.start___ieee754_log10_~x), ~Pluszero~LONGDOUBLE()))) && (\exists v_prenex_16 : bv64, v_prenex_17 : bv64 :: (((v_prenex_16[63:32] == v_prenex_17[63:32] && v_prenex_16[31:0] == v_prenex_17[31:0]) && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && v_prenex_16[31:0] == lx) && hx == v_prenex_17[63:32])) && ~Pluszero~LONGDOUBLE() == zero_log10 [2019-01-12 09:08:27,375 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((~bvadd64(\result, 4294967295bv32) == 0bv32 && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && (\exists ULTIMATE.start___ieee754_log10_~x : C_DOUBLE :: \result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.sub~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start___ieee754_log10_~x, ULTIMATE.start___ieee754_log10_~x), ~Pluszero~LONGDOUBLE()))) && (\exists v_prenex_16 : bv64, v_prenex_17 : bv64 :: (((v_prenex_16[63:32] == v_prenex_17[63:32] && v_prenex_16[31:0] == v_prenex_17[31:0]) && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && v_prenex_16[31:0] == lx) && hx == v_prenex_17[63:32])) && ~Pluszero~LONGDOUBLE() == zero_log10 [2019-01-12 09:08:27,461 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 09:08:27,462 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:08:27,463 INFO L168 Benchmark]: Toolchain (without parser) took 62033.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 954.0 MB in the beginning and 903.4 MB in the end (delta: 50.7 MB). Peak memory consumption was 191.2 MB. Max. memory is 11.5 GB. [2019-01-12 09:08:27,463 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:08:27,464 INFO L168 Benchmark]: CACSL2BoogieTranslator took 401.80 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 937.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-12 09:08:27,465 INFO L168 Benchmark]: Boogie Procedure Inliner took 121.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -191.5 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-01-12 09:08:27,466 INFO L168 Benchmark]: Boogie Preprocessor took 76.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-12 09:08:27,467 INFO L168 Benchmark]: RCFGBuilder took 32475.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. [2019-01-12 09:08:27,467 INFO L168 Benchmark]: TraceAbstraction took 28806.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 910.0 MB in the end (delta: 172.9 MB). Peak memory consumption was 172.9 MB. Max. memory is 11.5 GB. [2019-01-12 09:08:27,467 INFO L168 Benchmark]: Witness Printer took 147.50 ms. Allocated memory is still 1.2 GB. Free memory was 910.0 MB in the beginning and 903.4 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-12 09:08:27,472 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 401.80 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 937.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 121.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -191.5 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 32475.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28806.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 910.0 MB in the end (delta: 172.9 MB). Peak memory consumption was 172.9 MB. Max. memory is 11.5 GB. * Witness Printer took 147.50 ms. Allocated memory is still 1.2 GB. Free memory was 910.0 MB in the beginning and 903.4 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log10_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log10_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log10_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log10_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log10_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log10_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log10_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log10_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 188]: 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: 163]: Loop Invariant [2019-01-12 09:08:27,486 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,486 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32)) && aux-x < 0 && isfinite_double(x)-aux) && ~Pluszero~LONGDOUBLE() == zero_log10 - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 161]: Loop Invariant [2019-01-12 09:08:27,487 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,487 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,487 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,488 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,488 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log10_~x,QUANTIFIED] [2019-01-12 09:08:27,488 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log10_~x,QUANTIFIED] [2019-01-12 09:08:27,488 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:08:27,488 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,489 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:08:27,489 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,489 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,489 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,489 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,490 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,490 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:08:27,490 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,491 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,491 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,491 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,491 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,492 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log10_~x,QUANTIFIED] [2019-01-12 09:08:27,492 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log10_~x,QUANTIFIED] [2019-01-12 09:08:27,492 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:08:27,492 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,492 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:08:27,493 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,493 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,493 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,493 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,493 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,494 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:08:27,494 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] Derived loop invariant: ((((~bvadd64(\result, 4294967295bv32) == 0bv32 && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && (\exists ULTIMATE.start___ieee754_log10_~x : C_DOUBLE :: \result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.sub~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start___ieee754_log10_~x, ULTIMATE.start___ieee754_log10_~x), ~Pluszero~LONGDOUBLE()))) && (\exists v_prenex_16 : bv64, v_prenex_17 : bv64 :: (((v_prenex_16[63:32] == v_prenex_17[63:32] && v_prenex_16[31:0] == v_prenex_17[31:0]) && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && v_prenex_16[31:0] == lx) && hx == v_prenex_17[63:32])) && ~Pluszero~LONGDOUBLE() == zero_log10 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 118]: Loop Invariant [2019-01-12 09:08:27,498 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,499 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,499 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,499 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,499 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log10_~x,QUANTIFIED] [2019-01-12 09:08:27,499 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log10_~x,QUANTIFIED] [2019-01-12 09:08:27,500 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:08:27,500 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,500 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:08:27,500 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,500 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,501 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,501 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,501 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,501 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:08:27,502 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,504 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,505 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,505 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,505 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,505 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log10_~x,QUANTIFIED] [2019-01-12 09:08:27,505 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log10_~x,QUANTIFIED] [2019-01-12 09:08:27,506 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:08:27,506 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,506 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:08:27,506 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,506 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,507 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,509 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:27,509 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,510 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:08:27,510 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] Derived loop invariant: (((~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32)) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && (\exists ULTIMATE.start___ieee754_log10_~x : C_DOUBLE :: \result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.sub~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start___ieee754_log10_~x, ULTIMATE.start___ieee754_log10_~x), ~Pluszero~LONGDOUBLE()))) && (\exists v_prenex_16 : bv64, v_prenex_17 : bv64 :: (((v_prenex_16[63:32] == v_prenex_17[63:32] && v_prenex_16[31:0] == v_prenex_17[31:0]) && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && v_prenex_16[31:0] == lx) && hx == v_prenex_17[63:32])) && ~Pluszero~LONGDOUBLE() == zero_log10 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 165]: Loop Invariant [2019-01-12 09:08:27,511 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,514 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32)) && aux-x < 0 && isfinite_double(x)-aux) && ~Pluszero~LONGDOUBLE() == zero_log10 - InvariantResult [Line: 123]: Loop Invariant [2019-01-12 09:08:27,515 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,515 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,515 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:27,515 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32)) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && ~Pluszero~LONGDOUBLE() == zero_log10 - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 49 locations, 1 error locations. SAFE Result, 28.6s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 16.0s AutomataDifference, 0.0s DeadEndRemovalTime, 8.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 162 SDtfs, 72 SDslu, 132 SDs, 0 SdLazy, 45 SolverSat, 1 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 11.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 18 NumberOfFragments, 156 HoareAnnotationTreeSize, 12 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 34 FormulaSimplificationTreeSizeReductionInter, 8.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 72 ConstructedInterpolants, 8 QuantifiedInterpolants, 5777 SizeOfPredicates, 18 NumberOfNonLiveVariables, 319 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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...