./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_0470_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/float-newlib/double_req_bl_0470_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 d187cecab1a284a27f7c64e71455cab847eaa514 ................................................................................................................................................................................................................................................................................................. 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_0470_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 d187cecab1a284a27f7c64e71455cab847eaa514 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 08:56:35,623 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 08:56:35,626 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 08:56:35,642 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 08:56:35,644 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 08:56:35,645 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 08:56:35,649 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 08:56:35,652 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 08:56:35,655 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 08:56:35,658 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 08:56:35,661 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 08:56:35,662 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 08:56:35,663 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 08:56:35,666 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 08:56:35,672 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 08:56:35,677 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 08:56:35,678 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 08:56:35,684 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 08:56:35,688 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 08:56:35,690 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 08:56:35,692 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 08:56:35,695 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 08:56:35,703 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 08:56:35,703 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 08:56:35,704 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 08:56:35,705 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 08:56:35,705 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 08:56:35,706 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 08:56:35,707 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 08:56:35,708 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 08:56:35,708 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 08:56:35,712 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 08:56:35,712 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 08:56:35,712 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 08:56:35,713 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 08:56:35,715 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 08:56:35,716 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 08:56:35,737 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 08:56:35,737 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 08:56:35,738 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 08:56:35,740 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 08:56:35,740 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 08:56:35,740 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 08:56:35,740 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 08:56:35,740 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 08:56:35,741 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 08:56:35,741 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 08:56:35,741 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 08:56:35,741 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 08:56:35,741 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 08:56:35,741 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 08:56:35,742 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 08:56:35,742 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 08:56:35,742 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 08:56:35,743 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 08:56:35,743 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 08:56:35,743 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 08:56:35,743 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 08:56:35,743 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 08:56:35,743 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 08:56:35,744 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 08:56:35,744 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 08:56:35,744 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 08:56:35,744 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 08:56:35,744 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 08:56:35,744 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 -> d187cecab1a284a27f7c64e71455cab847eaa514 [2019-01-12 08:56:35,804 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 08:56:35,820 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 08:56:35,828 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 08:56:35,830 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 08:56:35,831 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 08:56:35,832 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0470_true-unreach-call.c [2019-01-12 08:56:35,897 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01b9f3401/c37997f694d9437a9ab8d161df11a860/FLAG08156bf8d [2019-01-12 08:56:36,421 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 08:56:36,422 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0470_true-unreach-call.c [2019-01-12 08:56:36,433 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01b9f3401/c37997f694d9437a9ab8d161df11a860/FLAG08156bf8d [2019-01-12 08:56:36,768 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01b9f3401/c37997f694d9437a9ab8d161df11a860 [2019-01-12 08:56:36,771 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 08:56:36,773 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 08:56:36,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 08:56:36,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 08:56:36,779 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 08:56:36,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:56:36" (1/1) ... [2019-01-12 08:56:36,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65b41bf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:56:36, skipping insertion in model container [2019-01-12 08:56:36,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:56:36" (1/1) ... [2019-01-12 08:56:36,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 08:56:36,830 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 08:56:37,057 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 08:56:37,069 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 08:56:37,145 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 08:56:37,171 INFO L195 MainTranslator]: Completed translation [2019-01-12 08:56:37,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:56:37 WrapperNode [2019-01-12 08:56:37,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 08:56:37,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 08:56:37,173 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 08:56:37,173 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 08:56:37,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:56:37" (1/1) ... [2019-01-12 08:56:37,209 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:56:37" (1/1) ... [2019-01-12 08:56:37,326 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 08:56:37,327 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 08:56:37,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 08:56:37,327 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 08:56:37,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:56:37" (1/1) ... [2019-01-12 08:56:37,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:56:37" (1/1) ... [2019-01-12 08:56:37,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:56:37" (1/1) ... [2019-01-12 08:56:37,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:56:37" (1/1) ... [2019-01-12 08:56:37,364 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:56:37" (1/1) ... [2019-01-12 08:56:37,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:56:37" (1/1) ... [2019-01-12 08:56:37,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:56:37" (1/1) ... [2019-01-12 08:56:37,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 08:56:37,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 08:56:37,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 08:56:37,387 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 08:56:37,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:56:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 08:56:37,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 08:56:37,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-01-12 08:56:37,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 08:56:37,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-01-12 08:56:37,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 08:56:37,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 08:56:37,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 08:56:37,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 08:56:38,797 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 08:56:38,798 INFO L286 CfgBuilder]: Removed 34 assue(true) statements. [2019-01-12 08:56:38,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:56:38 BoogieIcfgContainer [2019-01-12 08:56:38,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 08:56:38,801 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 08:56:38,801 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 08:56:38,804 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 08:56:38,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 08:56:36" (1/3) ... [2019-01-12 08:56:38,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776cbd81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:56:38, skipping insertion in model container [2019-01-12 08:56:38,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:56:37" (2/3) ... [2019-01-12 08:56:38,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776cbd81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:56:38, skipping insertion in model container [2019-01-12 08:56:38,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:56:38" (3/3) ... [2019-01-12 08:56:38,808 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0470_true-unreach-call.c [2019-01-12 08:56:38,819 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 08:56:38,829 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 08:56:38,849 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 08:56:38,883 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 08:56:38,884 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 08:56:38,884 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 08:56:38,885 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 08:56:38,885 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 08:56:38,885 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 08:56:38,885 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 08:56:38,886 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 08:56:38,886 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 08:56:38,913 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states. [2019-01-12 08:56:38,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 08:56:38,921 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:56:38,921 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 08:56:38,924 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:56:38,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:56:38,928 INFO L82 PathProgramCache]: Analyzing trace with hash 2057048347, now seen corresponding path program 1 times [2019-01-12 08:56:38,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 08:56:38,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 08:56:38,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 08:56:38,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 08:56:38,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 08:56:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 08:56:39,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 08:56:39,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 08:56:39,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 08:56:39,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 08:56:39,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 08:56:39,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 08:56:39,067 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 2 states. [2019-01-12 08:56:39,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:56:39,101 INFO L93 Difference]: Finished difference Result 206 states and 342 transitions. [2019-01-12 08:56:39,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 08:56:39,103 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-01-12 08:56:39,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:56:39,127 INFO L225 Difference]: With dead ends: 206 [2019-01-12 08:56:39,127 INFO L226 Difference]: Without dead ends: 101 [2019-01-12 08:56:39,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 08:56:39,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-12 08:56:39,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-12 08:56:39,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-12 08:56:39,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 146 transitions. [2019-01-12 08:56:39,209 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 146 transitions. Word has length 11 [2019-01-12 08:56:39,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:56:39,209 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 146 transitions. [2019-01-12 08:56:39,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 08:56:39,210 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 146 transitions. [2019-01-12 08:56:39,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 08:56:39,212 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:56:39,212 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 08:56:39,213 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:56:39,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:56:39,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1327291576, now seen corresponding path program 1 times [2019-01-12 08:56:39,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 08:56:39,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 08:56:39,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 08:56:39,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 08:56:39,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 08:56:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 08:56:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 08:56:39,377 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 08:56:39,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 08:56:39 BoogieIcfgContainer [2019-01-12 08:56:39,440 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 08:56:39,441 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 08:56:39,441 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 08:56:39,441 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 08:56:39,442 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:56:38" (3/4) ... [2019-01-12 08:56:39,448 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-12 08:56:39,448 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 08:56:39,452 INFO L168 Benchmark]: Toolchain (without parser) took 2679.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 951.3 MB in the beginning and 1.0 GB in the end (delta: -97.3 MB). Peak memory consumption was 47.4 MB. Max. memory is 11.5 GB. [2019-01-12 08:56:39,455 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 08:56:39,455 INFO L168 Benchmark]: CACSL2BoogieTranslator took 397.84 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 935.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-12 08:56:39,456 INFO L168 Benchmark]: Boogie Procedure Inliner took 154.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -198.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-12 08:56:39,457 INFO L168 Benchmark]: Boogie Preprocessor took 59.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-12 08:56:39,458 INFO L168 Benchmark]: RCFGBuilder took 1412.84 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: 51.7 MB). Peak memory consumption was 51.7 MB. Max. memory is 11.5 GB. [2019-01-12 08:56:39,459 INFO L168 Benchmark]: TraceAbstraction took 639.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2019-01-12 08:56:39,461 INFO L168 Benchmark]: Witness Printer took 7.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 08:56:39,468 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.20 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 397.84 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 935.2 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 154.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -198.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1412.84 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: 51.7 MB). Peak memory consumption was 51.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 639.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * Witness Printer took 7.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 229]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someUnaryDOUBLEoperation at line 136, overapproximation of someBinaryArithmeticDOUBLEoperation at line 172, overapproximation of bitwiseAnd at line 154, overapproximation of someBinaryDOUBLEComparisonOperation at line 17. Possible FailurePath: [L19] static const double one_sqrt = 1.0, tiny_sqrt = 1.0e-300; [L131-L144] static const double one_acos = 1.00000000000000000000e+00, pi = 3.14159265358979311600e+00, pio2_hi_acos = 1.57079632679489655800e+00, pio2_lo_acos = 6.12323399573676603587e-17, pS0_acos = 1.66666666666666657415e-01, pS1_acos = -3.25565818622400915405e-01, pS2_acos = 2.01212532134862925881e-01, pS3_acos = -4.00555345006794114027e-02, pS4_acos = 7.91534994289814532176e-04, pS5_acos = 3.47933107596021167570e-05, qS1_acos = -2.40339491173441421878e+00, qS2_acos = 2.02094576023350569471e+00, qS3_acos = -6.88283971605453293030e-01, qS4_acos = 7.70381505559019352791e-02; VAL [one_acos=1, one_sqrt=1, pi=612323399573676603587/10000000000000000000000000000000000000, pi=785398163397448279/250000000000000000, pi=785398163397448279/500000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L224] double x = 0.0 / 0.0; [L147] double z, p, q, r, w, s, c, df; [L148] __int32_t hx, ix; VAL [one_acos=1, one_sqrt=1, pi=785398163397448279/500000000000000000, pi=785398163397448279/250000000000000000, pi=612323399573676603587/10000000000000000000000000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L150] ieee_double_shape_type gh_u; [L151] gh_u.value = (x) [L152] EXPR gh_u.parts.msw [L152] (hx) = gh_u.parts.msw [L154] ix = hx & 0x7fffffff VAL [one_acos=1, one_sqrt=1, pi=612323399573676603587/10000000000000000000000000000000000000, pi=785398163397448279/500000000000000000, pi=785398163397448279/250000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L155] COND FALSE !(ix >= 0x3ff00000) VAL [one_acos=1, one_sqrt=1, pi=785398163397448279/500000000000000000, pi=612323399573676603587/10000000000000000000000000000000000000, pi=785398163397448279/250000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L170] COND TRUE ix < 0x3fe00000 VAL [one_acos=1, one_sqrt=1, pi=612323399573676603587/10000000000000000000000000000000000000, pi=785398163397448279/250000000000000000, pi=785398163397448279/500000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L171] COND TRUE ix <= 0x3c600000 [L172] return pio2_hi_acos + pio2_lo_acos; VAL [one_acos=1, one_sqrt=1, pi=612323399573676603587/10000000000000000000000000000000000000, pi=785398163397448279/500000000000000000, pi=785398163397448279/250000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L225] double res = __ieee754_acos(x); [L17] return x != x; VAL [one_acos=1, one_sqrt=1, pi=785398163397448279/250000000000000000, pi=612323399573676603587/10000000000000000000000000000000000000, pi=785398163397448279/500000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L228] COND TRUE !isnan_double(res) [L229] __VERIFIER_error() VAL [one_acos=1, one_sqrt=1, pi=612323399573676603587/10000000000000000000000000000000000000, pi=785398163397448279/250000000000000000, pi=785398163397448279/500000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 104 locations, 1 error locations. UNSAFE Result, 0.5s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 149 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=104occurred 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 100 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-0ed9222-m [2019-01-12 08:56:41,726 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 08:56:41,728 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 08:56:41,741 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 08:56:41,743 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 08:56:41,744 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 08:56:41,746 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 08:56:41,748 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 08:56:41,750 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 08:56:41,751 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 08:56:41,752 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 08:56:41,752 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 08:56:41,753 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 08:56:41,754 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 08:56:41,755 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 08:56:41,756 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 08:56:41,757 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 08:56:41,759 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 08:56:41,761 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 08:56:41,763 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 08:56:41,764 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 08:56:41,765 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 08:56:41,768 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 08:56:41,768 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 08:56:41,768 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 08:56:41,769 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 08:56:41,770 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 08:56:41,771 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 08:56:41,772 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 08:56:41,773 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 08:56:41,774 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 08:56:41,774 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 08:56:41,775 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 08:56:41,775 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 08:56:41,776 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 08:56:41,777 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 08:56:41,777 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-01-12 08:56:41,794 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 08:56:41,794 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 08:56:41,796 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 08:56:41,796 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 08:56:41,796 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 08:56:41,796 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 08:56:41,797 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 08:56:41,797 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 08:56:41,797 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 08:56:41,797 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 08:56:41,797 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 08:56:41,797 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 08:56:41,798 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-12 08:56:41,798 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-12 08:56:41,798 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 08:56:41,798 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 08:56:41,798 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 08:56:41,798 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 08:56:41,799 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 08:56:41,799 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 08:56:41,799 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 08:56:41,799 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 08:56:41,799 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 08:56:41,800 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 08:56:41,800 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 08:56:41,800 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 08:56:41,800 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-12 08:56:41,800 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 08:56:41,800 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-12 08:56:41,801 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-12 08:56:41,801 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 -> d187cecab1a284a27f7c64e71455cab847eaa514 [2019-01-12 08:56:41,869 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 08:56:41,887 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 08:56:41,895 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 08:56:41,897 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 08:56:41,897 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 08:56:41,898 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0470_true-unreach-call.c [2019-01-12 08:56:41,963 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c16876d7/cf63f910ff304749b754dabb893c41aa/FLAG61b94e222 [2019-01-12 08:56:42,428 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 08:56:42,429 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0470_true-unreach-call.c [2019-01-12 08:56:42,439 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c16876d7/cf63f910ff304749b754dabb893c41aa/FLAG61b94e222 [2019-01-12 08:56:42,756 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c16876d7/cf63f910ff304749b754dabb893c41aa [2019-01-12 08:56:42,759 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 08:56:42,761 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 08:56:42,762 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 08:56:42,762 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 08:56:42,766 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 08:56:42,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:56:42" (1/1) ... [2019-01-12 08:56:42,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46f94406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:56:42, skipping insertion in model container [2019-01-12 08:56:42,771 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:56:42" (1/1) ... [2019-01-12 08:56:42,781 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 08:56:42,818 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 08:56:43,168 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 08:56:43,176 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 08:56:43,243 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 08:56:43,294 INFO L195 MainTranslator]: Completed translation [2019-01-12 08:56:43,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:56:43 WrapperNode [2019-01-12 08:56:43,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 08:56:43,295 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 08:56:43,296 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 08:56:43,296 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 08:56:43,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:56:43" (1/1) ... [2019-01-12 08:56:43,401 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:56:43" (1/1) ... [2019-01-12 08:56:43,458 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 08:56:43,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 08:56:43,462 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 08:56:43,462 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 08:56:43,478 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:56:43" (1/1) ... [2019-01-12 08:56:43,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:56:43" (1/1) ... [2019-01-12 08:56:43,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:56:43" (1/1) ... [2019-01-12 08:56:43,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:56:43" (1/1) ... [2019-01-12 08:56:43,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:56:43" (1/1) ... [2019-01-12 08:56:43,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:56:43" (1/1) ... [2019-01-12 08:56:43,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:56:43" (1/1) ... [2019-01-12 08:56:43,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 08:56:43,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 08:56:43,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 08:56:43,574 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 08:56:43,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:56:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 08:56:43,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-01-12 08:56:43,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-01-12 08:56:43,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 08:56:43,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-12 08:56:43,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 08:56:43,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 08:56:43,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-12 08:56:43,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 08:56:44,064 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 08:56:45,932 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 08:56:53,965 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 08:56:57,710 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 08:57:04,643 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 08:57:05,348 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 08:57:05,349 INFO L286 CfgBuilder]: Removed 34 assue(true) statements. [2019-01-12 08:57:05,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:57:05 BoogieIcfgContainer [2019-01-12 08:57:05,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 08:57:05,352 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 08:57:05,352 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 08:57:05,355 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 08:57:05,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 08:56:42" (1/3) ... [2019-01-12 08:57:05,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bdfe162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:57:05, skipping insertion in model container [2019-01-12 08:57:05,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:56:43" (2/3) ... [2019-01-12 08:57:05,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bdfe162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:57:05, skipping insertion in model container [2019-01-12 08:57:05,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:57:05" (3/3) ... [2019-01-12 08:57:05,360 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0470_true-unreach-call.c [2019-01-12 08:57:05,367 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 08:57:05,376 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 08:57:05,394 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 08:57:05,433 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 08:57:05,434 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 08:57:05,434 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 08:57:05,434 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 08:57:05,434 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 08:57:05,434 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 08:57:05,434 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 08:57:05,435 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 08:57:05,435 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 08:57:05,453 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states. [2019-01-12 08:57:05,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 08:57:05,459 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:57:05,460 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 08:57:05,462 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:57:05,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:57:05,467 INFO L82 PathProgramCache]: Analyzing trace with hash 2057048347, now seen corresponding path program 1 times [2019-01-12 08:57:05,471 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:57:05,472 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-01-12 08:57:05,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 08:57:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 08:57:06,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:57:06,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 08:57:06,375 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 08:57:06,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 08:57:06,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 08:57:06,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 08:57:06,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 08:57:06,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 08:57:06,423 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 2 states. [2019-01-12 08:57:06,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:57:06,452 INFO L93 Difference]: Finished difference Result 206 states and 342 transitions. [2019-01-12 08:57:06,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 08:57:06,454 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-01-12 08:57:06,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:57:06,468 INFO L225 Difference]: With dead ends: 206 [2019-01-12 08:57:06,469 INFO L226 Difference]: Without dead ends: 101 [2019-01-12 08:57:06,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 08:57:06,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-12 08:57:06,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-12 08:57:06,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-12 08:57:06,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 146 transitions. [2019-01-12 08:57:06,529 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 146 transitions. Word has length 11 [2019-01-12 08:57:06,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:57:06,530 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 146 transitions. [2019-01-12 08:57:06,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 08:57:06,530 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 146 transitions. [2019-01-12 08:57:06,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 08:57:06,531 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:57:06,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 08:57:06,532 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:57:06,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:57:06,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1327291576, now seen corresponding path program 1 times [2019-01-12 08:57:06,533 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:57:06,533 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-01-12 08:57:06,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 08:57:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 08:57:06,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:57:06,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 08:57:06,878 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 08:57:06,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 08:57:06,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 08:57:06,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 08:57:06,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 08:57:06,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 08:57:06,895 INFO L87 Difference]: Start difference. First operand 101 states and 146 transitions. Second operand 5 states. [2019-01-12 08:57:07,295 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-12 08:57:08,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:57:08,502 INFO L93 Difference]: Finished difference Result 106 states and 150 transitions. [2019-01-12 08:57:08,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 08:57:08,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-01-12 08:57:08,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:57:08,889 INFO L225 Difference]: With dead ends: 106 [2019-01-12 08:57:08,890 INFO L226 Difference]: Without dead ends: 14 [2019-01-12 08:57:08,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 08:57:08,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-12 08:57:08,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-12 08:57:08,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-12 08:57:08,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2019-01-12 08:57:08,899 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 12 [2019-01-12 08:57:08,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:57:08,900 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2019-01-12 08:57:08,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 08:57:08,901 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2019-01-12 08:57:08,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 08:57:08,901 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:57:08,901 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 08:57:08,902 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:57:08,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:57:08,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1300627107, now seen corresponding path program 1 times [2019-01-12 08:57:08,904 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:57:08,904 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) [2019-01-12 08:57:08,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-01-12 08:57:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 08:57:09,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:57:09,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 08:57:09,946 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 08:57:09,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 08:57:09,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 08:57:09,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 08:57:09,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 08:57:09,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 08:57:09,982 INFO L87 Difference]: Start difference. First operand 14 states and 13 transitions. Second operand 6 states. [2019-01-12 08:57:12,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:57:12,598 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2019-01-12 08:57:12,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 08:57:12,598 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-01-12 08:57:12,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:57:12,599 INFO L225 Difference]: With dead ends: 14 [2019-01-12 08:57:12,599 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 08:57:12,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 08:57:12,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 08:57:12,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 08:57:12,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 08:57:12,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 08:57:12,602 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2019-01-12 08:57:12,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:57:12,602 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 08:57:12,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 08:57:12,603 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 08:57:12,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 08:57:12,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 08:57:12,916 INFO L448 ceAbstractionStarter]: For program point L52-2(lines 52 53) no Hoare annotation was computed. [2019-01-12 08:57:12,916 INFO L444 ceAbstractionStarter]: At program point L52-3(lines 52 53) the Hoare annotation is: false [2019-01-12 08:57:12,916 INFO L448 ceAbstractionStarter]: For program point L52-4(lines 52 53) no Hoare annotation was computed. [2019-01-12 08:57:12,916 INFO L448 ceAbstractionStarter]: For program point L52-7(lines 52 53) no Hoare annotation was computed. [2019-01-12 08:57:12,917 INFO L444 ceAbstractionStarter]: At program point L52-8(lines 52 53) the Hoare annotation is: false [2019-01-12 08:57:12,917 INFO L448 ceAbstractionStarter]: For program point L52-9(lines 52 53) no Hoare annotation was computed. [2019-01-12 08:57:12,917 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 116) no Hoare annotation was computed. [2019-01-12 08:57:12,917 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 102 116) no Hoare annotation was computed. [2019-01-12 08:57:12,917 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 08:57:12,917 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 120) no Hoare annotation was computed. [2019-01-12 08:57:12,917 INFO L448 ceAbstractionStarter]: For program point L119-2(lines 119 120) no Hoare annotation was computed. [2019-01-12 08:57:12,918 INFO L448 ceAbstractionStarter]: For program point L119-3(lines 119 120) no Hoare annotation was computed. [2019-01-12 08:57:12,918 INFO L448 ceAbstractionStarter]: For program point L119-5(lines 119 120) no Hoare annotation was computed. [2019-01-12 08:57:12,918 INFO L448 ceAbstractionStarter]: For program point L87(lines 87 96) no Hoare annotation was computed. [2019-01-12 08:57:12,918 INFO L448 ceAbstractionStarter]: For program point L87-2(lines 87 96) no Hoare annotation was computed. [2019-01-12 08:57:12,918 INFO L448 ceAbstractionStarter]: For program point L87-3(lines 87 96) no Hoare annotation was computed. [2019-01-12 08:57:12,918 INFO L448 ceAbstractionStarter]: For program point L87-5(lines 87 96) no Hoare annotation was computed. [2019-01-12 08:57:12,918 INFO L448 ceAbstractionStarter]: For program point L170(lines 170 214) no Hoare annotation was computed. [2019-01-12 08:57:12,919 INFO L448 ceAbstractionStarter]: For program point L104(lines 104 115) no Hoare annotation was computed. [2019-01-12 08:57:12,919 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 43) no Hoare annotation was computed. [2019-01-12 08:57:12,919 INFO L448 ceAbstractionStarter]: For program point L104-2(lines 104 115) no Hoare annotation was computed. [2019-01-12 08:57:12,919 INFO L444 ceAbstractionStarter]: At program point L71-2(lines 71 81) the Hoare annotation is: false [2019-01-12 08:57:12,919 INFO L448 ceAbstractionStarter]: For program point L38-2(lines 38 43) no Hoare annotation was computed. [2019-01-12 08:57:12,919 INFO L448 ceAbstractionStarter]: For program point L71-3(lines 71 81) no Hoare annotation was computed. [2019-01-12 08:57:12,919 INFO L448 ceAbstractionStarter]: For program point L38-3(lines 38 43) no Hoare annotation was computed. [2019-01-12 08:57:12,920 INFO L448 ceAbstractionStarter]: For program point L38-5(lines 38 43) no Hoare annotation was computed. [2019-01-12 08:57:12,920 INFO L444 ceAbstractionStarter]: At program point L71-6(lines 71 81) the Hoare annotation is: false [2019-01-12 08:57:12,920 INFO L448 ceAbstractionStarter]: For program point L71-7(lines 71 81) no Hoare annotation was computed. [2019-01-12 08:57:12,920 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 172) no Hoare annotation was computed. [2019-01-12 08:57:12,920 INFO L448 ceAbstractionStarter]: For program point L39(lines 39 42) no Hoare annotation was computed. [2019-01-12 08:57:12,920 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 39 42) no Hoare annotation was computed. [2019-01-12 08:57:12,920 INFO L448 ceAbstractionStarter]: For program point L155(lines 155 169) no Hoare annotation was computed. [2019-01-12 08:57:12,920 INFO L448 ceAbstractionStarter]: For program point L89(lines 89 90) no Hoare annotation was computed. [2019-01-12 08:57:12,921 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 122 127) no Hoare annotation was computed. [2019-01-12 08:57:12,921 INFO L444 ceAbstractionStarter]: At program point L122-2(lines 122 127) the Hoare annotation is: false [2019-01-12 08:57:12,921 INFO L448 ceAbstractionStarter]: For program point L89-2(lines 89 90) no Hoare annotation was computed. [2019-01-12 08:57:12,921 INFO L448 ceAbstractionStarter]: For program point L122-3(lines 122 127) no Hoare annotation was computed. [2019-01-12 08:57:12,921 INFO L448 ceAbstractionStarter]: For program point L89-3(lines 89 90) no Hoare annotation was computed. [2019-01-12 08:57:12,921 INFO L448 ceAbstractionStarter]: For program point L122-5(lines 122 127) no Hoare annotation was computed. [2019-01-12 08:57:12,922 INFO L448 ceAbstractionStarter]: For program point L89-5(lines 89 90) no Hoare annotation was computed. [2019-01-12 08:57:12,922 INFO L444 ceAbstractionStarter]: At program point L122-6(lines 122 127) the Hoare annotation is: false [2019-01-12 08:57:12,922 INFO L448 ceAbstractionStarter]: For program point L122-7(lines 122 127) no Hoare annotation was computed. [2019-01-12 08:57:12,922 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 114) no Hoare annotation was computed. [2019-01-12 08:57:12,922 INFO L448 ceAbstractionStarter]: For program point L73(lines 73 77) no Hoare annotation was computed. [2019-01-12 08:57:12,922 INFO L448 ceAbstractionStarter]: For program point L106-2(lines 106 114) no Hoare annotation was computed. [2019-01-12 08:57:12,922 INFO L448 ceAbstractionStarter]: For program point L73-2(lines 73 77) no Hoare annotation was computed. [2019-01-12 08:57:12,922 INFO L448 ceAbstractionStarter]: For program point L73-3(lines 73 77) no Hoare annotation was computed. [2019-01-12 08:57:12,923 INFO L448 ceAbstractionStarter]: For program point L73-5(lines 73 77) no Hoare annotation was computed. [2019-01-12 08:57:12,923 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 42) no Hoare annotation was computed. [2019-01-12 08:57:12,923 INFO L448 ceAbstractionStarter]: For program point L41-1(lines 41 42) no Hoare annotation was computed. [2019-01-12 08:57:12,923 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 08:57:12,923 INFO L448 ceAbstractionStarter]: For program point L157-1(lines 157 161) no Hoare annotation was computed. [2019-01-12 08:57:12,923 INFO L444 ceAbstractionStarter]: At program point L157-2(lines 157 161) the Hoare annotation is: (and (exists ((|v_q#valueAsBitvector_6| (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_acos_~ix~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_6|))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_6|) ((_ extract 62 52) |v_q#valueAsBitvector_6|) ((_ extract 51 0) |v_q#valueAsBitvector_6|)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))))) (exists ((|v_q#valueAsBitvector_6| (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_acos_~hx~0 ((_ extract 63 32) |v_q#valueAsBitvector_6|)) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_6|) ((_ extract 62 52) |v_q#valueAsBitvector_6|) ((_ extract 51 0) |v_q#valueAsBitvector_6|)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))))) (= ULTIMATE.start___ieee754_acos_~x (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) [2019-01-12 08:57:12,924 INFO L448 ceAbstractionStarter]: For program point L157-3(lines 155 169) no Hoare annotation was computed. [2019-01-12 08:57:12,924 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 93) no Hoare annotation was computed. [2019-01-12 08:57:12,924 INFO L448 ceAbstractionStarter]: For program point L92-2(lines 92 93) no Hoare annotation was computed. [2019-01-12 08:57:12,924 INFO L448 ceAbstractionStarter]: For program point L92-3(lines 92 93) no Hoare annotation was computed. [2019-01-12 08:57:12,924 INFO L448 ceAbstractionStarter]: For program point L92-5(lines 92 93) no Hoare annotation was computed. [2019-01-12 08:57:12,924 INFO L448 ceAbstractionStarter]: For program point L109(lines 109 114) no Hoare annotation was computed. [2019-01-12 08:57:12,924 INFO L448 ceAbstractionStarter]: For program point L109-3(lines 109 114) no Hoare annotation was computed. [2019-01-12 08:57:12,925 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 229) no Hoare annotation was computed. [2019-01-12 08:57:12,925 INFO L448 ceAbstractionStarter]: For program point L60(lines 60 63) no Hoare annotation was computed. [2019-01-12 08:57:12,925 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 27 32) no Hoare annotation was computed. [2019-01-12 08:57:12,925 INFO L448 ceAbstractionStarter]: For program point L60-2(lines 60 63) no Hoare annotation was computed. [2019-01-12 08:57:12,925 INFO L444 ceAbstractionStarter]: At program point L27-2(lines 27 32) the Hoare annotation is: false [2019-01-12 08:57:12,925 INFO L448 ceAbstractionStarter]: For program point L60-3(lines 60 63) no Hoare annotation was computed. [2019-01-12 08:57:12,925 INFO L448 ceAbstractionStarter]: For program point L27-3(lines 21 129) no Hoare annotation was computed. [2019-01-12 08:57:12,926 INFO L448 ceAbstractionStarter]: For program point L60-5(lines 60 63) no Hoare annotation was computed. [2019-01-12 08:57:12,926 INFO L448 ceAbstractionStarter]: For program point L27-5(lines 27 32) no Hoare annotation was computed. [2019-01-12 08:57:12,926 INFO L444 ceAbstractionStarter]: At program point L27-6(lines 27 32) the Hoare annotation is: false [2019-01-12 08:57:12,926 INFO L448 ceAbstractionStarter]: For program point L27-7(lines 21 129) no Hoare annotation was computed. [2019-01-12 08:57:12,926 INFO L448 ceAbstractionStarter]: For program point L110(lines 110 111) no Hoare annotation was computed. [2019-01-12 08:57:12,926 INFO L448 ceAbstractionStarter]: For program point L110-2(lines 110 111) no Hoare annotation was computed. [2019-01-12 08:57:12,926 INFO L448 ceAbstractionStarter]: For program point L110-3(lines 110 111) no Hoare annotation was computed. [2019-01-12 08:57:12,927 INFO L448 ceAbstractionStarter]: For program point L110-5(lines 110 111) no Hoare annotation was computed. [2019-01-12 08:57:12,927 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 08:57:12,927 INFO L444 ceAbstractionStarter]: At program point L128(lines 21 129) the Hoare annotation is: false [2019-01-12 08:57:12,927 INFO L444 ceAbstractionStarter]: At program point L128-1(lines 21 129) the Hoare annotation is: false [2019-01-12 08:57:12,927 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 57) no Hoare annotation was computed. [2019-01-12 08:57:12,927 INFO L448 ceAbstractionStarter]: For program point L46-2(lines 46 57) no Hoare annotation was computed. [2019-01-12 08:57:12,928 INFO L448 ceAbstractionStarter]: For program point L46-3(lines 46 57) no Hoare annotation was computed. [2019-01-12 08:57:12,933 INFO L448 ceAbstractionStarter]: For program point L46-5(lines 46 57) no Hoare annotation was computed. [2019-01-12 08:57:12,933 INFO L448 ceAbstractionStarter]: For program point L228(lines 228 231) no Hoare annotation was computed. [2019-01-12 08:57:12,933 INFO L444 ceAbstractionStarter]: At program point L47-2(lines 47 51) the Hoare annotation is: false [2019-01-12 08:57:12,933 INFO L448 ceAbstractionStarter]: For program point L47-3(lines 47 51) no Hoare annotation was computed. [2019-01-12 08:57:12,933 INFO L444 ceAbstractionStarter]: At program point L47-6(lines 47 51) the Hoare annotation is: false [2019-01-12 08:57:12,934 INFO L448 ceAbstractionStarter]: For program point L47-7(lines 47 51) no Hoare annotation was computed. [2019-01-12 08:57:12,934 INFO L448 ceAbstractionStarter]: For program point L229(line 229) no Hoare annotation was computed. [2019-01-12 08:57:12,934 INFO L448 ceAbstractionStarter]: For program point L163(lines 163 166) no Hoare annotation was computed. [2019-01-12 08:57:12,934 INFO L444 ceAbstractionStarter]: At program point L213(lines 146 215) the Hoare annotation is: (let ((.cse1 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= (let ((.cse0 (fp.sub roundNearestTiesToEven .cse1 .cse1))) (fp.div roundNearestTiesToEven .cse0 .cse0)) |ULTIMATE.start___ieee754_acos_#res|) (exists ((|v_q#valueAsBitvector_6| (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_acos_~ix~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_6|))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_6|) ((_ extract 62 52) |v_q#valueAsBitvector_6|) ((_ extract 51 0) |v_q#valueAsBitvector_6|)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))))) (exists ((|v_q#valueAsBitvector_6| (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_acos_~hx~0 ((_ extract 63 32) |v_q#valueAsBitvector_6|)) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_6|) ((_ extract 62 52) |v_q#valueAsBitvector_6|) ((_ extract 51 0) |v_q#valueAsBitvector_6|)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))))) (= ULTIMATE.start___ieee754_acos_~x .cse1))) [2019-01-12 08:57:12,934 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 08:57:12,935 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 198 203) no Hoare annotation was computed. [2019-01-12 08:57:12,935 INFO L444 ceAbstractionStarter]: At program point L198-2(lines 198 203) the Hoare annotation is: false [2019-01-12 08:57:12,935 INFO L448 ceAbstractionStarter]: For program point L198-3(lines 198 203) no Hoare annotation was computed. [2019-01-12 08:57:12,935 INFO L448 ceAbstractionStarter]: For program point L182(lines 182 214) no Hoare annotation was computed. [2019-01-12 08:57:12,935 INFO L448 ceAbstractionStarter]: For program point L149-1(lines 149 153) no Hoare annotation was computed. [2019-01-12 08:57:12,935 INFO L444 ceAbstractionStarter]: At program point L149-2(lines 149 153) the Hoare annotation is: (= ULTIMATE.start___ieee754_acos_~x (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))) [2019-01-12 08:57:12,935 INFO L448 ceAbstractionStarter]: For program point L149-3(lines 149 153) no Hoare annotation was computed. [2019-01-12 08:57:12,942 INFO L444 ceAbstractionStarter]: At program point L17(line 17) the Hoare annotation is: (let ((.cse1 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= (let ((.cse0 (fp.sub roundNearestTiesToEven .cse1 .cse1))) (fp.div roundNearestTiesToEven .cse0 .cse0)) |ULTIMATE.start___ieee754_acos_#res|) (= (bvadd |ULTIMATE.start_isnan_double_#res| (_ bv4294967295 32)) (_ bv0 32)) (exists ((|v_q#valueAsBitvector_6| (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_acos_~ix~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_6|))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_6|) ((_ extract 62 52) |v_q#valueAsBitvector_6|) ((_ extract 51 0) |v_q#valueAsBitvector_6|)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))))) (exists ((|v_q#valueAsBitvector_6| (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_acos_~hx~0 ((_ extract 63 32) |v_q#valueAsBitvector_6|)) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_6|) ((_ extract 62 52) |v_q#valueAsBitvector_6|) ((_ extract 51 0) |v_q#valueAsBitvector_6|)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))))) (= ULTIMATE.start___ieee754_acos_~x .cse1))) [2019-01-12 08:57:12,942 INFO L444 ceAbstractionStarter]: At program point L84-2(lines 84 100) the Hoare annotation is: false [2019-01-12 08:57:12,942 INFO L448 ceAbstractionStarter]: For program point L84-3(lines 21 129) no Hoare annotation was computed. [2019-01-12 08:57:12,943 INFO L444 ceAbstractionStarter]: At program point L84-6(lines 84 100) the Hoare annotation is: false [2019-01-12 08:57:12,943 INFO L448 ceAbstractionStarter]: For program point L84-7(lines 21 129) no Hoare annotation was computed. [2019-01-12 08:57:12,943 INFO L451 ceAbstractionStarter]: At program point L233(lines 217 234) the Hoare annotation is: true [2019-01-12 08:57:12,956 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,957 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,958 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,958 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,960 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,961 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,961 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,961 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,961 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,962 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,962 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,965 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,965 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,965 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,965 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,966 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,966 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,966 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,966 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,966 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,967 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,967 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,968 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,968 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,968 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,969 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,969 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,969 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,970 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,970 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,970 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,970 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,971 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,971 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,971 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,971 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,972 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,972 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,972 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,972 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,973 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,973 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,974 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,974 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,974 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,974 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,975 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,976 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,976 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,976 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,976 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,976 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,977 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,977 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,977 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,978 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,978 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,979 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,979 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,979 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,980 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,980 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,980 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,980 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,981 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,981 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,981 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,981 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,982 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,982 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,982 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,982 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,983 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,983 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,983 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,984 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,984 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,984 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,985 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,985 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,985 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,985 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,986 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,986 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,986 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,986 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,987 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,987 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,987 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,987 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,987 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:12,988 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,988 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:12,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 08:57:12 BoogieIcfgContainer [2019-01-12 08:57:12,991 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 08:57:12,999 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 08:57:12,999 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 08:57:12,999 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 08:57:13,000 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:57:05" (3/4) ... [2019-01-12 08:57:13,008 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 08:57:13,029 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2019-01-12 08:57:13,030 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-01-12 08:57:13,031 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 08:57:13,060 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\exists v_q#valueAsBitvector_6 : bv64 :: ix == ~bvand32(2147483647bv32, v_q#valueAsBitvector_6[63:32]) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_6[63:63], v_q#valueAsBitvector_6[62:52], v_q#valueAsBitvector_6[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && (\exists v_q#valueAsBitvector_6 : bv64 :: hx == v_q#valueAsBitvector_6[63:32] && ~fp~LONGDOUBLE(v_q#valueAsBitvector_6[63:63], v_q#valueAsBitvector_6[62:52], v_q#valueAsBitvector_6[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2019-01-12 08:57:13,061 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())), ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) == \result && (\exists v_q#valueAsBitvector_6 : bv64 :: ix == ~bvand32(2147483647bv32, v_q#valueAsBitvector_6[63:32]) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_6[63:63], v_q#valueAsBitvector_6[62:52], v_q#valueAsBitvector_6[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && (\exists v_q#valueAsBitvector_6 : bv64 :: hx == v_q#valueAsBitvector_6[63:32] && ~fp~LONGDOUBLE(v_q#valueAsBitvector_6[63:63], v_q#valueAsBitvector_6[62:52], v_q#valueAsBitvector_6[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2019-01-12 08:57:13,061 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())), ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) == \result && ~bvadd64(\result, 4294967295bv32) == 0bv32) && (\exists v_q#valueAsBitvector_6 : bv64 :: ix == ~bvand32(2147483647bv32, v_q#valueAsBitvector_6[63:32]) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_6[63:63], v_q#valueAsBitvector_6[62:52], v_q#valueAsBitvector_6[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && (\exists v_q#valueAsBitvector_6 : bv64 :: hx == v_q#valueAsBitvector_6[63:32] && ~fp~LONGDOUBLE(v_q#valueAsBitvector_6[63:63], v_q#valueAsBitvector_6[62:52], v_q#valueAsBitvector_6[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2019-01-12 08:57:13,191 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 08:57:13,194 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 08:57:13,196 INFO L168 Benchmark]: Toolchain (without parser) took 30435.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 952.7 MB in the beginning and 929.3 MB in the end (delta: 23.4 MB). Peak memory consumption was 144.5 MB. Max. memory is 11.5 GB. [2019-01-12 08:57:13,197 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 08:57:13,197 INFO L168 Benchmark]: CACSL2BoogieTranslator took 533.09 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-12 08:57:13,197 INFO L168 Benchmark]: Boogie Procedure Inliner took 162.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -176.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-12 08:57:13,199 INFO L168 Benchmark]: Boogie Preprocessor took 110.81 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. [2019-01-12 08:57:13,199 INFO L168 Benchmark]: RCFGBuilder took 21777.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. [2019-01-12 08:57:13,200 INFO L168 Benchmark]: TraceAbstraction took 7639.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 936.1 MB in the end (delta: 112.2 MB). Peak memory consumption was 112.2 MB. Max. memory is 11.5 GB. [2019-01-12 08:57:13,201 INFO L168 Benchmark]: Witness Printer took 195.78 ms. Allocated memory is still 1.2 GB. Free memory was 936.1 MB in the beginning and 929.3 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 08:57:13,204 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 533.09 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.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 162.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -176.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 110.81 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 21777.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7639.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 936.1 MB in the end (delta: 112.2 MB). Peak memory consumption was 112.2 MB. Max. memory is 11.5 GB. * Witness Printer took 195.78 ms. Allocated memory is still 1.2 GB. Free memory was 936.1 MB in the beginning and 929.3 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,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_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - 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_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - 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_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - 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_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - 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_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 229]: 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: 71]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 157]: Loop Invariant [2019-01-12 08:57:13,219 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,219 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,219 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,219 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,220 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,220 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,220 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,220 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,220 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,220 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,221 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,222 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,222 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,223 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,223 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,223 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,223 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,223 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,223 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,224 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,224 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((\exists v_q#valueAsBitvector_6 : bv64 :: ix == ~bvand32(2147483647bv32, v_q#valueAsBitvector_6[63:32]) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_6[63:63], v_q#valueAsBitvector_6[62:52], v_q#valueAsBitvector_6[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && (\exists v_q#valueAsBitvector_6 : bv64 :: hx == v_q#valueAsBitvector_6[63:32] && ~fp~LONGDOUBLE(v_q#valueAsBitvector_6[63:63], v_q#valueAsBitvector_6[62:52], v_q#valueAsBitvector_6[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 17]: Loop Invariant [2019-01-12 08:57:13,225 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,225 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,225 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,226 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,234 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,234 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,234 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,235 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,235 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,235 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,235 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,236 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,236 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,236 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,236 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,236 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,236 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,237 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,237 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,238 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,243 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,243 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,243 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,244 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,244 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,244 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,244 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,245 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,245 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,245 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,245 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,245 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,246 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,246 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,246 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,246 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())), ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) == \result && ~bvadd64(\result, 4294967295bv32) == 0bv32) && (\exists v_q#valueAsBitvector_6 : bv64 :: ix == ~bvand32(2147483647bv32, v_q#valueAsBitvector_6[63:32]) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_6[63:63], v_q#valueAsBitvector_6[62:52], v_q#valueAsBitvector_6[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && (\exists v_q#valueAsBitvector_6 : bv64 :: hx == v_q#valueAsBitvector_6[63:32] && ~fp~LONGDOUBLE(v_q#valueAsBitvector_6[63:63], v_q#valueAsBitvector_6[62:52], v_q#valueAsBitvector_6[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 149]: Loop Invariant [2019-01-12 08:57:13,247 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,251 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 146]: Loop Invariant [2019-01-12 08:57:13,252 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,252 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,252 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,252 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,253 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,256 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,256 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,256 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,256 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,257 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,257 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,257 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,257 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,257 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,258 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,258 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,258 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,258 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,262 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,262 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,262 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,263 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,263 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,263 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,263 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,263 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,264 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,267 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,267 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 08:57:13,267 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 08:57:13,268 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())), ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) == \result && (\exists v_q#valueAsBitvector_6 : bv64 :: ix == ~bvand32(2147483647bv32, v_q#valueAsBitvector_6[63:32]) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_6[63:63], v_q#valueAsBitvector_6[62:52], v_q#valueAsBitvector_6[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && (\exists v_q#valueAsBitvector_6 : bv64 :: hx == v_q#valueAsBitvector_6[63:32] && ~fp~LONGDOUBLE(v_q#valueAsBitvector_6[63:63], v_q#valueAsBitvector_6[62:52], v_q#valueAsBitvector_6[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 104 locations, 1 error locations. SAFE Result, 7.5s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 4.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 163 SDtfs, 34 SDslu, 21 SDs, 0 SdLazy, 24 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred 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, 20 LocationsWithAnnotation, 20 PreInvPairs, 25 NumberOfFragments, 210 HoareAnnotationTreeSize, 20 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 33 ConstructedInterpolants, 3 QuantifiedInterpolants, 1795 SizeOfPredicates, 13 NumberOfNonLiveVariables, 150 ConjunctsInSsa, 19 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! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...