./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_1131b_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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_1131b_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 c6d763742402f5574758af03df7d1953644b4c87 ....................................................................................................................................................................................................................................................................................................... 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_1131b_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 c6d763742402f5574758af03df7d1953644b4c87 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 03:58:30,723 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:58:30,725 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:58:30,737 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:58:30,738 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:58:30,739 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:58:30,740 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:58:30,743 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:58:30,744 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:58:30,746 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:58:30,746 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:58:30,747 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:58:30,748 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:58:30,749 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:58:30,751 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:58:30,751 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:58:30,752 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:58:30,755 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:58:30,757 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:58:30,759 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:58:30,760 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:58:30,761 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:58:30,764 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:58:30,764 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:58:30,765 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:58:30,766 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:58:30,767 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:58:30,768 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:58:30,769 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:58:30,771 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:58:30,771 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:58:30,772 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:58:30,772 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:58:30,772 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:58:30,774 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:58:30,775 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:58:30,775 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 03:58:30,800 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:58:30,800 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:58:30,802 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:58:30,802 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:58:30,802 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:58:30,802 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:58:30,804 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:58:30,804 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 03:58:30,804 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:58:30,805 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:58:30,805 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:58:30,805 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:58:30,805 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:58:30,805 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:58:30,805 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:58:30,806 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:58:30,806 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:58:30,807 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:58:30,807 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:58:30,807 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:58:30,807 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:58:30,807 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:58:30,808 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:58:30,808 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:58:30,808 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:58:30,808 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 03:58:30,808 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:58:30,808 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 03:58:30,810 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 -> c6d763742402f5574758af03df7d1953644b4c87 [2018-12-31 03:58:30,863 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:58:30,880 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:58:30,888 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:58:30,889 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:58:30,890 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:58:30,891 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_1131b_true-unreach-call.c [2018-12-31 03:58:30,968 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/334a2a6fd/38130b98a34b493e86429dc08e0c013a/FLAGa947cf64e [2018-12-31 03:58:31,415 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:58:31,416 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_1131b_true-unreach-call.c [2018-12-31 03:58:31,425 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/334a2a6fd/38130b98a34b493e86429dc08e0c013a/FLAGa947cf64e [2018-12-31 03:58:31,773 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/334a2a6fd/38130b98a34b493e86429dc08e0c013a [2018-12-31 03:58:31,778 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:58:31,783 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:58:31,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:58:31,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:58:31,793 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:58:31,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:58:31" (1/1) ... [2018-12-31 03:58:31,798 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a3059e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:31, skipping insertion in model container [2018-12-31 03:58:31,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:58:31" (1/1) ... [2018-12-31 03:58:31,809 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:58:31,852 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:58:32,147 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:58:32,155 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:58:32,218 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:58:32,260 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:58:32,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:32 WrapperNode [2018-12-31 03:58:32,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:58:32,262 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:58:32,262 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:58:32,262 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:58:32,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:32" (1/1) ... [2018-12-31 03:58:32,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:32" (1/1) ... [2018-12-31 03:58:32,409 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:58:32,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:58:32,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:58:32,410 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:58:32,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:32" (1/1) ... [2018-12-31 03:58:32,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:32" (1/1) ... [2018-12-31 03:58:32,425 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:32" (1/1) ... [2018-12-31 03:58:32,425 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:32" (1/1) ... [2018-12-31 03:58:32,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:32" (1/1) ... [2018-12-31 03:58:32,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:32" (1/1) ... [2018-12-31 03:58:32,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:32" (1/1) ... [2018-12-31 03:58:32,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:58:32,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:58:32,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:58:32,456 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:58:32,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:58:32,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 03:58:32,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 03:58:32,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-12-31 03:58:32,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-12-31 03:58:32,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:58:32,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:58:32,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 03:58:32,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2018-12-31 03:58:32,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 03:58:33,544 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:58:33,544 INFO L280 CfgBuilder]: Removed 24 assue(true) statements. [2018-12-31 03:58:33,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:33 BoogieIcfgContainer [2018-12-31 03:58:33,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:58:33,547 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:58:33,547 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:58:33,550 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:58:33,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:58:31" (1/3) ... [2018-12-31 03:58:33,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d02246f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:58:33, skipping insertion in model container [2018-12-31 03:58:33,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:32" (2/3) ... [2018-12-31 03:58:33,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d02246f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:58:33, skipping insertion in model container [2018-12-31 03:58:33,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:33" (3/3) ... [2018-12-31 03:58:33,555 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1131b_true-unreach-call.c [2018-12-31 03:58:33,565 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:58:33,574 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:58:33,593 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:58:33,623 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:58:33,624 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:58:33,624 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:58:33,624 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:58:33,624 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:58:33,624 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:58:33,625 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:58:33,625 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:58:33,625 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:58:33,643 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-12-31 03:58:33,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-31 03:58:33,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:33,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:33,652 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:33,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:33,658 INFO L82 PathProgramCache]: Analyzing trace with hash 2036387893, now seen corresponding path program 1 times [2018-12-31 03:58:33,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:58:33,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:58:33,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:33,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:33,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:33,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:33,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:33,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 03:58:33,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 03:58:33,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 03:58:33,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:58:33,810 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-12-31 03:58:33,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:33,833 INFO L93 Difference]: Finished difference Result 118 states and 206 transitions. [2018-12-31 03:58:33,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 03:58:33,834 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-12-31 03:58:33,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:33,845 INFO L225 Difference]: With dead ends: 118 [2018-12-31 03:58:33,846 INFO L226 Difference]: Without dead ends: 56 [2018-12-31 03:58:33,849 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 [2018-12-31 03:58:33,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-31 03:58:33,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-31 03:58:33,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-31 03:58:33,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 82 transitions. [2018-12-31 03:58:33,887 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 82 transitions. Word has length 13 [2018-12-31 03:58:33,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:33,887 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 82 transitions. [2018-12-31 03:58:33,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 03:58:33,887 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 82 transitions. [2018-12-31 03:58:33,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 03:58:33,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:33,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:33,889 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:33,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:33,889 INFO L82 PathProgramCache]: Analyzing trace with hash -794890891, now seen corresponding path program 1 times [2018-12-31 03:58:33,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:58:33,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:58:33,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:33,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:33,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:58:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:58:34,152 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 03:58:34,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:58:34 BoogieIcfgContainer [2018-12-31 03:58:34,209 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:58:34,209 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:58:34,209 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:58:34,211 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:58:34,211 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:33" (3/4) ... [2018-12-31 03:58:34,217 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-31 03:58:34,217 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:58:34,218 INFO L168 Benchmark]: Toolchain (without parser) took 2438.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -109.5 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:34,221 INFO L168 Benchmark]: CDTParser took 0.18 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. [2018-12-31 03:58:34,222 INFO L168 Benchmark]: CACSL2BoogieTranslator took 477.37 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:34,222 INFO L168 Benchmark]: Boogie Procedure Inliner took 147.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -197.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:34,224 INFO L168 Benchmark]: Boogie Preprocessor took 46.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:58:34,225 INFO L168 Benchmark]: RCFGBuilder took 1088.94 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: 38.4 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:34,227 INFO L168 Benchmark]: TraceAbstraction took 662.24 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: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:34,228 INFO L168 Benchmark]: Witness Printer took 8.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:58:34,234 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.18 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 477.37 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.6 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 147.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -197.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1088.94 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: 38.4 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 662.24 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: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * Witness Printer took 8.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 186]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 41, overapproximation of someUnaryDOUBLEoperation at line 17, overapproximation of someBinaryArithmeticDOUBLEoperation at line 42, overapproximation of bitwiseAnd at line 36, overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of bitwiseXor at line 37. Possible FailurePath: [L15-L18] static const double one_fmod = 1.0, Zero_fmod[] = { 0.0, -0.0, }; VAL [one_fmod=1, Zero_fmod={1:0}] [L177] double y = -1.0 / 0.0; [L178] double x = __VERIFIER_nondet_double(); [L161] __int32_t hx; VAL [one_fmod=1, Zero_fmod={1:0}] [L163] ieee_double_shape_type gh_u; [L164] gh_u.value = (x) [L165] EXPR gh_u.parts.msw [L165] (hx) = gh_u.parts.msw [L167] return (int)((__uint32_t)((hx & 0x7fffffff) - 0x7ff00000) >> 31); VAL [one_fmod=1, Zero_fmod={1:0}] [L180] COND TRUE isfinite_double(x) [L21] __int32_t n, hx, hy, hz, ix, iy, sx, i; [L22] __uint32_t lx, ly, lz; VAL [one_fmod=1, Zero_fmod={1:0}] [L25] ieee_double_shape_type ew_u; [L26] ew_u.value = (x) [L27] EXPR ew_u.parts.msw [L27] (hx) = ew_u.parts.msw [L28] EXPR ew_u.parts.lsw [L28] (lx) = ew_u.parts.lsw [L31] ieee_double_shape_type ew_u; [L32] ew_u.value = (y) [L33] EXPR ew_u.parts.msw [L33] (hy) = ew_u.parts.msw [L34] EXPR ew_u.parts.lsw [L34] (ly) = ew_u.parts.lsw [L36] sx = hx & 0x80000000 [L37] hx ^= sx [L38] hy &= 0x7fffffff VAL [one_fmod=1, Zero_fmod={1:0}] [L40-L41] COND TRUE (hy | ly) == 0 || (hx >= 0x7ff00000) || ((hy | ((ly | -ly) >> 31)) > 0x7ff00000) [L42] return (x * y) / (x * y); VAL [one_fmod=1, Zero_fmod={1:0}] [L182] double res = fmod_double(x, y); [L185] COND TRUE res != x VAL [one_fmod=1, Zero_fmod={1:0}] [L186] __VERIFIER_error() VAL [one_fmod=1, Zero_fmod={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 60 locations, 1 error locations. UNSAFE Result, 0.5s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 87 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 144 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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-2e94e6a [2018-12-31 03:58:36,627 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:58:36,629 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:58:36,654 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:58:36,654 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:58:36,655 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:58:36,659 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:58:36,669 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:58:36,681 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:58:36,682 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:58:36,683 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:58:36,684 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:58:36,685 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:58:36,686 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:58:36,687 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:58:36,688 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:58:36,689 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:58:36,691 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:58:36,693 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:58:36,695 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:58:36,696 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:58:36,698 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:58:36,700 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:58:36,700 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:58:36,701 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:58:36,702 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:58:36,703 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:58:36,704 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:58:36,705 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:58:36,706 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:58:36,706 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:58:36,707 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:58:36,708 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:58:36,708 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:58:36,709 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:58:36,709 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:58:36,710 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-31 03:58:36,726 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:58:36,726 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:58:36,727 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:58:36,728 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:58:36,728 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:58:36,728 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:58:36,728 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:58:36,728 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:58:36,729 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:58:36,730 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:58:36,730 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:58:36,730 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:58:36,730 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-31 03:58:36,730 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-31 03:58:36,731 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:58:36,731 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:58:36,732 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:58:36,732 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:58:36,732 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:58:36,732 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:58:36,732 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:58:36,732 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:58:36,734 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:58:36,734 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:58:36,734 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:58:36,734 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:58:36,734 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-31 03:58:36,735 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:58:36,735 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-31 03:58:36,735 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-31 03:58:36,735 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 -> c6d763742402f5574758af03df7d1953644b4c87 [2018-12-31 03:58:36,798 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:58:36,818 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:58:36,825 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:58:36,827 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:58:36,828 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:58:36,829 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_1131b_true-unreach-call.c [2018-12-31 03:58:36,887 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e41bbf9e/64730498386140a68849dc5722b5d16e/FLAG0fb4e65d4 [2018-12-31 03:58:37,419 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:58:37,419 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_1131b_true-unreach-call.c [2018-12-31 03:58:37,428 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e41bbf9e/64730498386140a68849dc5722b5d16e/FLAG0fb4e65d4 [2018-12-31 03:58:37,739 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e41bbf9e/64730498386140a68849dc5722b5d16e [2018-12-31 03:58:37,742 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:58:37,743 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:58:37,744 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:58:37,744 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:58:37,748 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:58:37,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:58:37" (1/1) ... [2018-12-31 03:58:37,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46451202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:37, skipping insertion in model container [2018-12-31 03:58:37,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:58:37" (1/1) ... [2018-12-31 03:58:37,759 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:58:37,787 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:58:38,076 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:58:38,084 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:58:38,147 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:58:38,264 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:58:38,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:38 WrapperNode [2018-12-31 03:58:38,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:58:38,266 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:58:38,266 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:58:38,266 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:58:38,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:38" (1/1) ... [2018-12-31 03:58:38,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:38" (1/1) ... [2018-12-31 03:58:38,327 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:58:38,327 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:58:38,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:58:38,327 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:58:38,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:38" (1/1) ... [2018-12-31 03:58:38,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:38" (1/1) ... [2018-12-31 03:58:38,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:38" (1/1) ... [2018-12-31 03:58:38,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:38" (1/1) ... [2018-12-31 03:58:38,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:38" (1/1) ... [2018-12-31 03:58:38,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:38" (1/1) ... [2018-12-31 03:58:38,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:38" (1/1) ... [2018-12-31 03:58:38,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:58:38,395 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:58:38,398 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:58:38,398 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:58:38,399 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:58:38,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-12-31 03:58:38,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-12-31 03:58:38,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 03:58:38,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2018-12-31 03:58:38,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-31 03:58:38,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:58:38,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:58:38,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-31 03:58:38,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 03:58:38,675 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:58:38,768 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:58:39,380 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:58:39,470 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:58:42,393 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:58:42,393 INFO L280 CfgBuilder]: Removed 24 assue(true) statements. [2018-12-31 03:58:42,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:42 BoogieIcfgContainer [2018-12-31 03:58:42,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:58:42,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:58:42,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:58:42,400 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:58:42,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:58:37" (1/3) ... [2018-12-31 03:58:42,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645519ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:58:42, skipping insertion in model container [2018-12-31 03:58:42,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:38" (2/3) ... [2018-12-31 03:58:42,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645519ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:58:42, skipping insertion in model container [2018-12-31 03:58:42,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:42" (3/3) ... [2018-12-31 03:58:42,405 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1131b_true-unreach-call.c [2018-12-31 03:58:42,417 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:58:42,426 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:58:42,447 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:58:42,484 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:58:42,485 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:58:42,485 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:58:42,485 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:58:42,485 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:58:42,485 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:58:42,486 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:58:42,487 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:58:42,487 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:58:42,505 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-12-31 03:58:42,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-31 03:58:42,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:42,514 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:42,517 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:42,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:42,524 INFO L82 PathProgramCache]: Analyzing trace with hash 2036387893, now seen corresponding path program 1 times [2018-12-31 03:58:42,528 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:42,529 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) [2018-12-31 03:58:42,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-12-31 03:58:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:43,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:43,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:43,550 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:43,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:43,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 03:58:43,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 03:58:43,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 03:58:43,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:58:43,596 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-12-31 03:58:43,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:43,624 INFO L93 Difference]: Finished difference Result 118 states and 206 transitions. [2018-12-31 03:58:43,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 03:58:43,626 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-12-31 03:58:43,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:43,637 INFO L225 Difference]: With dead ends: 118 [2018-12-31 03:58:43,638 INFO L226 Difference]: Without dead ends: 56 [2018-12-31 03:58:43,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:58:43,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-31 03:58:43,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-31 03:58:43,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-31 03:58:43,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 82 transitions. [2018-12-31 03:58:43,680 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 82 transitions. Word has length 13 [2018-12-31 03:58:43,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:43,681 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 82 transitions. [2018-12-31 03:58:43,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 03:58:43,681 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 82 transitions. [2018-12-31 03:58:43,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 03:58:43,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:43,682 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:43,683 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:43,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:43,683 INFO L82 PathProgramCache]: Analyzing trace with hash -794890891, now seen corresponding path program 1 times [2018-12-31 03:58:43,685 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:43,685 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-12-31 03:58:43,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:45,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:49,855 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 35 [2018-12-31 03:58:49,896 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:58:49,898 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:58:49,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2018-12-31 03:58:50,024 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2018-12-31 03:58:50,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 03:58:50,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 53 [2018-12-31 03:58:50,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 03:58:50,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-12-31 03:58:50,112 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 03:58:50,150 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:58:50,186 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 17 treesize of output 13 [2018-12-31 03:58:50,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 03:58:50,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-12-31 03:58:50,225 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-31 03:58:50,231 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:58:50,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:58:50,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-31 03:58:50,300 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:93, output treesize:54 [2018-12-31 03:58:52,420 WARN L181 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 47 [2018-12-31 03:58:52,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:52,763 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:52,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:52,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 03:58:52,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 03:58:52,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 03:58:52,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=72, Unknown=1, NotChecked=0, Total=90 [2018-12-31 03:58:52,806 INFO L87 Difference]: Start difference. First operand 56 states and 82 transitions. Second operand 10 states. [2018-12-31 03:58:53,635 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-12-31 03:58:57,877 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-12-31 03:59:02,464 WARN L181 SmtUtils]: Spent 2.17 s on a formula simplification that was a NOOP. DAG size: 53 [2018-12-31 03:59:04,862 WARN L181 SmtUtils]: Spent 2.17 s on a formula simplification that was a NOOP. DAG size: 67 [2018-12-31 03:59:13,395 WARN L181 SmtUtils]: Spent 2.20 s on a formula simplification that was a NOOP. DAG size: 71 [2018-12-31 03:59:25,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:25,694 INFO L93 Difference]: Finished difference Result 60 states and 85 transitions. [2018-12-31 03:59:25,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 03:59:25,698 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-12-31 03:59:25,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:25,699 INFO L225 Difference]: With dead ends: 60 [2018-12-31 03:59:25,699 INFO L226 Difference]: Without dead ends: 19 [2018-12-31 03:59:25,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=75, Invalid=192, Unknown=5, NotChecked=0, Total=272 [2018-12-31 03:59:25,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-31 03:59:25,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-31 03:59:25,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-31 03:59:25,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2018-12-31 03:59:25,710 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 16 [2018-12-31 03:59:25,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:25,710 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2018-12-31 03:59:25,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 03:59:25,711 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2018-12-31 03:59:25,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 03:59:25,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:25,712 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:25,712 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:25,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:25,713 INFO L82 PathProgramCache]: Analyzing trace with hash 467286736, now seen corresponding path program 1 times [2018-12-31 03:59:25,713 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:25,713 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-12-31 03:59:25,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:59:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:25,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:26,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:26,207 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:26,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:26,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 03:59:26,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 03:59:26,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 03:59:26,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-31 03:59:26,227 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand 9 states. [2018-12-31 03:59:27,625 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-12-31 03:59:27,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:27,628 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2018-12-31 03:59:27,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 03:59:27,628 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-12-31 03:59:27,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:27,630 INFO L225 Difference]: With dead ends: 19 [2018-12-31 03:59:27,630 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 03:59:27,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-12-31 03:59:27,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 03:59:27,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 03:59:27,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 03:59:27,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 03:59:27,633 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-12-31 03:59:27,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:27,633 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 03:59:27,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 03:59:27,633 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 03:59:27,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 03:59:27,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 03:59:28,134 WARN L181 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2018-12-31 03:59:28,279 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 33 [2018-12-31 03:59:31,224 WARN L181 SmtUtils]: Spent 2.94 s on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2018-12-31 03:59:31,229 INFO L448 ceAbstractionStarter]: For program point L52-2(lines 52 53) no Hoare annotation was computed. [2018-12-31 03:59:31,229 INFO L444 ceAbstractionStarter]: At program point L52-3(lines 52 53) the Hoare annotation is: false [2018-12-31 03:59:31,229 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 03:59:31,229 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 188) no Hoare annotation was computed. [2018-12-31 03:59:31,229 INFO L444 ceAbstractionStarter]: At program point L103-1(lines 98 112) the Hoare annotation is: false [2018-12-31 03:59:31,230 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-12-31 03:59:31,230 INFO L448 ceAbstractionStarter]: For program point L88(lines 88 94) no Hoare annotation was computed. [2018-12-31 03:59:31,230 INFO L448 ceAbstractionStarter]: For program point L88-2(lines 84 95) no Hoare annotation was computed. [2018-12-31 03:59:31,230 INFO L448 ceAbstractionStarter]: For program point L55-2(lines 55 56) no Hoare annotation was computed. [2018-12-31 03:59:31,230 INFO L444 ceAbstractionStarter]: At program point L55-3(lines 55 56) the Hoare annotation is: false [2018-12-31 03:59:31,230 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 148) no Hoare annotation was computed. [2018-12-31 03:59:31,230 INFO L448 ceAbstractionStarter]: For program point L40(lines 40 42) no Hoare annotation was computed. [2018-12-31 03:59:31,230 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 24 29) no Hoare annotation was computed. [2018-12-31 03:59:31,231 INFO L444 ceAbstractionStarter]: At program point L24-2(lines 24 29) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)))) (and (= .cse0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_isfinite_double_~x ULTIMATE.start_main_~x~0) (exists ((|v_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_7|) ((_ extract 62 52) |v_q#valueAsBitvector_7|) ((_ extract 51 0) |v_q#valueAsBitvector_7|)) ULTIMATE.start_main_~x~0) (= |ULTIMATE.start_isfinite_double_#res| (bvlshr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_7|)) (_ bv2148532224 32)) (_ bv31 32))))) (exists ((|v_q#valueAsBitvector_5| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_5|) ((_ extract 62 52) |v_q#valueAsBitvector_5|) ((_ extract 51 0) |v_q#valueAsBitvector_5|)) ULTIMATE.start_fmod_double_~x) (not (= (bvlshr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_5|)) (_ bv2148532224 32)) (_ bv31 32)) (_ bv0 32))))) (= .cse0 ULTIMATE.start_fmod_double_~y) (exists ((|v_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_7|) ((_ extract 62 52) |v_q#valueAsBitvector_7|) ((_ extract 51 0) |v_q#valueAsBitvector_7|)) ULTIMATE.start_main_~x~0) (= ((_ extract 63 32) |v_q#valueAsBitvector_7|) ULTIMATE.start_isfinite_double_~hx~1))) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmod_double_~x))) [2018-12-31 03:59:31,231 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 108) no Hoare annotation was computed. [2018-12-31 03:59:31,231 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 03:59:31,231 INFO L444 ceAbstractionStarter]: At program point L157(lines 20 158) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)))) (and (= .cse0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_isfinite_double_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~x~0 |ULTIMATE.start_fmod_double_#res|) (exists ((|v_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_7|) ((_ extract 62 52) |v_q#valueAsBitvector_7|) ((_ extract 51 0) |v_q#valueAsBitvector_7|)) ULTIMATE.start_main_~x~0) (= |ULTIMATE.start_isfinite_double_#res| (bvlshr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_7|)) (_ bv2148532224 32)) (_ bv31 32))))) (exists ((|v_q#valueAsBitvector_5| (_ BitVec 64)) (v_prenex_13 (_ BitVec 64))) (and (not (= (bvlshr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_5|)) (_ bv2148532224 32)) (_ bv31 32)) (_ bv0 32))) (= (fp ((_ extract 63 63) v_prenex_13) ((_ extract 62 52) v_prenex_13) ((_ extract 51 0) v_prenex_13)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_5|) ((_ extract 62 52) |v_q#valueAsBitvector_5|) ((_ extract 51 0) |v_q#valueAsBitvector_5|))) (= ULTIMATE.start_fmod_double_~hx~0 (let ((.cse1 ((_ extract 63 32) v_prenex_13))) (bvxor .cse1 (bvand (_ bv2147483648 32) .cse1)))))) (exists ((v_prenex_14 (_ BitVec 64))) (and (= (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_14)) ULTIMATE.start_fmod_double_~hy~0) (= (fp ((_ extract 63 63) v_prenex_14) ((_ extract 62 52) v_prenex_14) ((_ extract 51 0) v_prenex_14)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (= ((_ extract 31 0) v_prenex_14) ULTIMATE.start_fmod_double_~ly~0))) (exists ((|v_q#valueAsBitvector_5| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_5|) ((_ extract 62 52) |v_q#valueAsBitvector_5|) ((_ extract 51 0) |v_q#valueAsBitvector_5|)) ULTIMATE.start_fmod_double_~x) (not (= (bvlshr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_5|)) (_ bv2148532224 32)) (_ bv31 32)) (_ bv0 32))))) (= .cse0 ULTIMATE.start_fmod_double_~y) (exists ((|v_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_7|) ((_ extract 62 52) |v_q#valueAsBitvector_7|) ((_ extract 51 0) |v_q#valueAsBitvector_7|)) ULTIMATE.start_main_~x~0) (= ((_ extract 63 32) |v_q#valueAsBitvector_7|) ULTIMATE.start_isfinite_double_~hx~1))) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmod_double_~x))) [2018-12-31 03:59:31,232 INFO L444 ceAbstractionStarter]: At program point L124-2(lines 124 128) the Hoare annotation is: false [2018-12-31 03:59:31,232 INFO L448 ceAbstractionStarter]: For program point L124-3(lines 20 158) no Hoare annotation was computed. [2018-12-31 03:59:31,232 INFO L451 ceAbstractionStarter]: At program point L191(lines 170 192) the Hoare annotation is: true [2018-12-31 03:59:31,232 INFO L448 ceAbstractionStarter]: For program point L142(lines 142 148) no Hoare annotation was computed. [2018-12-31 03:59:31,232 INFO L448 ceAbstractionStarter]: For program point L76(lines 76 82) no Hoare annotation was computed. [2018-12-31 03:59:31,232 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 48) no Hoare annotation was computed. [2018-12-31 03:59:31,232 INFO L448 ceAbstractionStarter]: For program point L76-2(lines 20 158) no Hoare annotation was computed. [2018-12-31 03:59:31,232 INFO L448 ceAbstractionStarter]: For program point L43-2(lines 20 158) no Hoare annotation was computed. [2018-12-31 03:59:31,232 INFO L448 ceAbstractionStarter]: For program point L44(lines 44 45) no Hoare annotation was computed. [2018-12-31 03:59:31,233 INFO L448 ceAbstractionStarter]: For program point L61(lines 20 158) no Hoare annotation was computed. [2018-12-31 03:59:31,233 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 03:59:31,233 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 68) no Hoare annotation was computed. [2018-12-31 03:59:31,233 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 47) no Hoare annotation was computed. [2018-12-31 03:59:31,233 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 162 166) no Hoare annotation was computed. [2018-12-31 03:59:31,233 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 156) no Hoare annotation was computed. [2018-12-31 03:59:31,233 INFO L444 ceAbstractionStarter]: At program point L162-2(lines 162 166) the Hoare annotation is: (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) ULTIMATE.start_main_~y~0) (= ULTIMATE.start_isfinite_double_~x ULTIMATE.start_main_~x~0)) [2018-12-31 03:59:31,233 INFO L448 ceAbstractionStarter]: For program point L162-3(lines 162 166) no Hoare annotation was computed. [2018-12-31 03:59:31,233 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 35) no Hoare annotation was computed. [2018-12-31 03:59:31,233 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 20 158) no Hoare annotation was computed. [2018-12-31 03:59:31,234 INFO L448 ceAbstractionStarter]: For program point L63-2(lines 63 64) no Hoare annotation was computed. [2018-12-31 03:59:31,234 INFO L448 ceAbstractionStarter]: For program point L30-2(lines 30 35) no Hoare annotation was computed. [2018-12-31 03:59:31,234 INFO L444 ceAbstractionStarter]: At program point L63-3(lines 63 64) the Hoare annotation is: false [2018-12-31 03:59:31,234 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 189) no Hoare annotation was computed. [2018-12-31 03:59:31,234 INFO L448 ceAbstractionStarter]: For program point L180-2(lines 180 189) no Hoare annotation was computed. [2018-12-31 03:59:31,234 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 131 136) no Hoare annotation was computed. [2018-12-31 03:59:31,234 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 98 112) no Hoare annotation was computed. [2018-12-31 03:59:31,234 INFO L444 ceAbstractionStarter]: At program point L131-2(lines 131 136) the Hoare annotation is: false [2018-12-31 03:59:31,234 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 03:59:31,234 INFO L448 ceAbstractionStarter]: For program point L98-3(lines 98 112) no Hoare annotation was computed. [2018-12-31 03:59:31,235 INFO L448 ceAbstractionStarter]: For program point L115(lines 115 116) no Hoare annotation was computed. [2018-12-31 03:59:31,235 INFO L448 ceAbstractionStarter]: For program point L115-2(lines 20 158) no Hoare annotation was computed. [2018-12-31 03:59:31,235 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 186) no Hoare annotation was computed. [2018-12-31 03:59:31,235 INFO L448 ceAbstractionStarter]: For program point L66-2(lines 66 67) no Hoare annotation was computed. [2018-12-31 03:59:31,235 INFO L444 ceAbstractionStarter]: At program point L66-3(lines 66 67) the Hoare annotation is: false [2018-12-31 03:59:31,235 INFO L448 ceAbstractionStarter]: For program point L149(lines 149 154) no Hoare annotation was computed. [2018-12-31 03:59:31,235 INFO L448 ceAbstractionStarter]: For program point L149-1(lines 137 156) no Hoare annotation was computed. [2018-12-31 03:59:31,235 INFO L448 ceAbstractionStarter]: For program point L149-2(lines 149 154) no Hoare annotation was computed. [2018-12-31 03:59:31,236 INFO L448 ceAbstractionStarter]: For program point L50(lines 20 158) no Hoare annotation was computed. [2018-12-31 03:59:31,236 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 20 158) no Hoare annotation was computed. [2018-12-31 03:59:31,236 INFO L448 ceAbstractionStarter]: For program point L51(lines 51 57) no Hoare annotation was computed. [2018-12-31 03:59:31,236 INFO L444 ceAbstractionStarter]: At program point L167(lines 160 168) the Hoare annotation is: (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) ULTIMATE.start_main_~y~0) (= ULTIMATE.start_isfinite_double_~x ULTIMATE.start_main_~x~0) (exists ((|v_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_7|) ((_ extract 62 52) |v_q#valueAsBitvector_7|) ((_ extract 51 0) |v_q#valueAsBitvector_7|)) ULTIMATE.start_main_~x~0) (= |ULTIMATE.start_isfinite_double_#res| (bvlshr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_7|)) (_ bv2148532224 32)) (_ bv31 32))))) (exists ((|v_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_7|) ((_ extract 62 52) |v_q#valueAsBitvector_7|) ((_ extract 51 0) |v_q#valueAsBitvector_7|)) ULTIMATE.start_main_~x~0) (= ((_ extract 63 32) |v_q#valueAsBitvector_7|) ULTIMATE.start_isfinite_double_~hx~1)))) [2018-12-31 03:59:31,236 INFO L448 ceAbstractionStarter]: For program point L101(lines 101 102) no Hoare annotation was computed. [2018-12-31 03:59:31,236 INFO L448 ceAbstractionStarter]: For program point L101-2(lines 98 112) no Hoare annotation was computed. [2018-12-31 03:59:31,249 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,250 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,252 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,253 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,255 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,255 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,255 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,256 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,256 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,256 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,256 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,256 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,257 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,257 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,257 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,257 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,257 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,260 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,260 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,260 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,262 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,262 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,262 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,262 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,263 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,263 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,263 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,263 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,263 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,265 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,265 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,266 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,266 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,266 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,266 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,269 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,269 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,270 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,270 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,270 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,270 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,270 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,271 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,271 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,271 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,271 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,273 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,274 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,275 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,277 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,278 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,278 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,278 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,278 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,279 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,279 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,279 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-31 03:59:31,279 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-31 03:59:31,280 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-31 03:59:31,280 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,280 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,280 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,280 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-31 03:59:31,280 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-31 03:59:31,281 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:31,281 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:31,281 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:31,281 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:31,282 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,282 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,282 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:31,282 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,282 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,283 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,283 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,283 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,283 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,283 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,283 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,284 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,284 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,285 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,285 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,286 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,286 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,286 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,286 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,286 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,287 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-31 03:59:31,287 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-31 03:59:31,287 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-31 03:59:31,287 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,287 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,288 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,288 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-31 03:59:31,288 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-31 03:59:31,288 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:31,288 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:31,289 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:31,289 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:31,289 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,289 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,290 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:31,290 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,290 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,290 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,290 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,291 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,291 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,291 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,291 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,292 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,292 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:59:31 BoogieIcfgContainer [2018-12-31 03:59:31,295 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:59:31,296 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:59:31,296 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:59:31,306 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:59:31,307 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:42" (3/4) ... [2018-12-31 03:59:31,313 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 03:59:31,330 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-12-31 03:59:31,330 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-31 03:59:31,357 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == y && x == x) && (\exists v_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_q#valueAsBitvector_7[63:63], v_q#valueAsBitvector_7[62:52], v_q#valueAsBitvector_7[51:0]) == x && \result == ~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_q#valueAsBitvector_7[63:32]), 2148532224bv32), 31bv32))) && (\exists v_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_q#valueAsBitvector_7[63:63], v_q#valueAsBitvector_7[62:52], v_q#valueAsBitvector_7[51:0]) == x && v_q#valueAsBitvector_7[63:32] == hx) [2018-12-31 03:59:31,358 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == y && x == x) && (\exists v_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_q#valueAsBitvector_7[63:63], v_q#valueAsBitvector_7[62:52], v_q#valueAsBitvector_7[51:0]) == x && \result == ~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_q#valueAsBitvector_7[63:32]), 2148532224bv32), 31bv32))) && (\exists v_q#valueAsBitvector_5 : bv64 :: ~fp~LONGDOUBLE(v_q#valueAsBitvector_5[63:63], v_q#valueAsBitvector_5[62:52], v_q#valueAsBitvector_5[51:0]) == x && !(~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_q#valueAsBitvector_5[63:32]), 2148532224bv32), 31bv32) == 0bv32))) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == y) && (\exists v_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_q#valueAsBitvector_7[63:63], v_q#valueAsBitvector_7[62:52], v_q#valueAsBitvector_7[51:0]) == x && v_q#valueAsBitvector_7[63:32] == hx)) && x == x [2018-12-31 03:59:31,396 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 03:59:31,397 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:59:31,398 INFO L168 Benchmark]: Toolchain (without parser) took 53655.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 952.7 MB in the beginning and 817.9 MB in the end (delta: 134.8 MB). Peak memory consumption was 242.3 MB. Max. memory is 11.5 GB. [2018-12-31 03:59:31,399 INFO L168 Benchmark]: CDTParser took 0.47 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. [2018-12-31 03:59:31,400 INFO L168 Benchmark]: CACSL2BoogieTranslator took 521.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2018-12-31 03:59:31,400 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.97 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-31 03:59:31,402 INFO L168 Benchmark]: Boogie Preprocessor took 67.49 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:59:31,403 INFO L168 Benchmark]: RCFGBuilder took 3999.31 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: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. [2018-12-31 03:59:31,403 INFO L168 Benchmark]: TraceAbstraction took 48899.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 824.9 MB in the end (delta: 229.6 MB). Peak memory consumption was 229.6 MB. Max. memory is 11.5 GB. [2018-12-31 03:59:31,405 INFO L168 Benchmark]: Witness Printer took 100.90 ms. Allocated memory is still 1.1 GB. Free memory was 824.9 MB in the beginning and 817.9 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-31 03:59:31,410 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.47 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 521.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.97 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.49 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 3999.31 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: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 48899.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 824.9 MB in the end (delta: 229.6 MB). Peak memory consumption was 229.6 MB. Max. memory is 11.5 GB. * Witness Printer took 100.90 ms. Allocated memory is still 1.1 GB. Free memory was 824.9 MB in the beginning and 817.9 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 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[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 186]: 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: 170]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 162]: Loop Invariant [2018-12-31 03:59:31,431 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,431 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,432 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,432 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == y && x == x - InvariantResult [Line: 24]: Loop Invariant [2018-12-31 03:59:31,436 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,436 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,436 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,437 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,437 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,437 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,437 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,437 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,438 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,438 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,438 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,438 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,438 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,441 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,441 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,441 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,442 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,442 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,443 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,443 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,443 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,443 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,443 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,449 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,449 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,449 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,449 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,450 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: (((((~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == y && x == x) && (\exists v_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_q#valueAsBitvector_7[63:63], v_q#valueAsBitvector_7[62:52], v_q#valueAsBitvector_7[51:0]) == x && \result == ~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_q#valueAsBitvector_7[63:32]), 2148532224bv32), 31bv32))) && (\exists v_q#valueAsBitvector_5 : bv64 :: ~fp~LONGDOUBLE(v_q#valueAsBitvector_5[63:63], v_q#valueAsBitvector_5[62:52], v_q#valueAsBitvector_5[51:0]) == x && !(~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_q#valueAsBitvector_5[63:32]), 2148532224bv32), 31bv32) == 0bv32))) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == y) && (\exists v_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_q#valueAsBitvector_7[63:63], v_q#valueAsBitvector_7[62:52], v_q#valueAsBitvector_7[51:0]) == x && v_q#valueAsBitvector_7[63:32] == hx)) && x == x - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 63]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 160]: Loop Invariant [2018-12-31 03:59:31,455 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,455 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,455 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,456 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,456 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,456 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,456 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,456 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,457 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,457 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,457 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,457 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,458 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,458 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,458 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,458 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,458 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,459 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,459 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,459 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: ((~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == y && x == x) && (\exists v_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_q#valueAsBitvector_7[63:63], v_q#valueAsBitvector_7[62:52], v_q#valueAsBitvector_7[51:0]) == x && \result == ~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_q#valueAsBitvector_7[63:32]), 2148532224bv32), 31bv32))) && (\exists v_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_q#valueAsBitvector_7[63:63], v_q#valueAsBitvector_7[62:52], v_q#valueAsBitvector_7[51:0]) == x && v_q#valueAsBitvector_7[63:32] == hx) - InvariantResult [Line: 20]: Loop Invariant [2018-12-31 03:59:31,460 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,460 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,460 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,460 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,460 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,461 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,461 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,461 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-31 03:59:31,461 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-31 03:59:31,462 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-31 03:59:31,462 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,462 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,462 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,462 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-31 03:59:31,463 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-31 03:59:31,463 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:31,463 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:31,463 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:31,464 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:31,464 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,464 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,464 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:31,464 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,465 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,465 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,465 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,465 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,465 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,466 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,466 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,466 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,466 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,467 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,467 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,468 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,468 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,468 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,468 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,468 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,469 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-31 03:59:31,469 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-31 03:59:31,469 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-31 03:59:31,469 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,470 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,470 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,470 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-31 03:59:31,470 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-31 03:59:31,470 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:31,471 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:31,471 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:31,471 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:31,471 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,472 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:31,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,473 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:31,473 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,473 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:31,473 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,473 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,474 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-12-31 03:59:31,474 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: ((((((((~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == y && x == x) && x == \result) && (\exists v_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_q#valueAsBitvector_7[63:63], v_q#valueAsBitvector_7[62:52], v_q#valueAsBitvector_7[51:0]) == x && \result == ~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_q#valueAsBitvector_7[63:32]), 2148532224bv32), 31bv32))) && (\exists v_q#valueAsBitvector_5 : bv64, v_prenex_13 : bv64 :: (!(~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_q#valueAsBitvector_5[63:32]), 2148532224bv32), 31bv32) == 0bv32) && ~fp~LONGDOUBLE(v_prenex_13[63:63], v_prenex_13[62:52], v_prenex_13[51:0]) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_5[63:63], v_q#valueAsBitvector_5[62:52], v_q#valueAsBitvector_5[51:0])) && hx == ~bvxor32(v_prenex_13[63:32], ~bvand32(2147483648bv32, v_prenex_13[63:32])))) && (\exists v_prenex_14 : bv64 :: (~bvand32(2147483647bv32, v_prenex_14[63:32]) == hy && ~fp~LONGDOUBLE(v_prenex_14[63:63], v_prenex_14[62:52], v_prenex_14[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) && v_prenex_14[31:0] == ly)) && (\exists v_q#valueAsBitvector_5 : bv64 :: ~fp~LONGDOUBLE(v_q#valueAsBitvector_5[63:63], v_q#valueAsBitvector_5[62:52], v_q#valueAsBitvector_5[51:0]) == x && !(~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_q#valueAsBitvector_5[63:32]), 2148532224bv32), 31bv32) == 0bv32))) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == y) && (\exists v_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_q#valueAsBitvector_7[63:63], v_q#valueAsBitvector_7[62:52], v_q#valueAsBitvector_7[51:0]) == x && v_q#valueAsBitvector_7[63:32] == hx)) && x == x - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 60 locations, 1 error locations. SAFE Result, 48.7s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 34.3s AutomataDifference, 0.0s DeadEndRemovalTime, 3.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 103 SDtfs, 92 SDslu, 57 SDs, 0 SdLazy, 81 SolverSat, 12 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 18.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 23.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 17 NumberOfFragments, 303 HoareAnnotationTreeSize, 12 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 152 FormulaSimplificationTreeSizeReductionInter, 3.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 44 ConstructedInterpolants, 24 QuantifiedInterpolants, 12263 SizeOfPredicates, 23 NumberOfNonLiveVariables, 209 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...