./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_0686b_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_0686b_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 f884ccf2da0c4c4f4df1be4e75875f554c398438 .................................................................................................................................................................................................................................................................................................................... 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_0686b_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 f884ccf2da0c4c4f4df1be4e75875f554c398438 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:04:27,155 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:04:27,157 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:04:27,175 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:04:27,177 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:04:27,178 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:04:27,180 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:04:27,183 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:04:27,187 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:04:27,195 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:04:27,196 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:04:27,196 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:04:27,200 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:04:27,201 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:04:27,202 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:04:27,205 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:04:27,207 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:04:27,209 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:04:27,215 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:04:27,218 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:04:27,221 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:04:27,224 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:04:27,230 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:04:27,231 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:04:27,231 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:04:27,232 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:04:27,234 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:04:27,237 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:04:27,238 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:04:27,240 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:04:27,242 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:04:27,243 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:04:27,243 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:04:27,243 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:04:27,246 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:04:27,247 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:04:27,247 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 09:04:27,275 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:04:27,276 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:04:27,278 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:04:27,279 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:04:27,280 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:04:27,280 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:04:27,280 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:04:27,280 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:04:27,280 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:04:27,281 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:04:27,282 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:04:27,282 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:04:27,282 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:04:27,282 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:04:27,282 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:04:27,283 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:04:27,283 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:04:27,284 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:04:27,284 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:04:27,284 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:04:27,284 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:04:27,284 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:04:27,284 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:04:27,285 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:04:27,285 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:04:27,285 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:04:27,285 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:04:27,285 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:04:27,285 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 -> f884ccf2da0c4c4f4df1be4e75875f554c398438 [2019-01-12 09:04:27,347 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:04:27,363 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:04:27,370 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:04:27,372 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:04:27,373 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:04:27,373 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0686b_true-unreach-call.c [2019-01-12 09:04:27,441 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d9fc4ad2/eaa1e677619046dc89fac2d462f71e4b/FLAGcac890b5d [2019-01-12 09:04:27,910 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:04:27,910 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0686b_true-unreach-call.c [2019-01-12 09:04:27,924 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d9fc4ad2/eaa1e677619046dc89fac2d462f71e4b/FLAGcac890b5d [2019-01-12 09:04:28,242 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d9fc4ad2/eaa1e677619046dc89fac2d462f71e4b [2019-01-12 09:04:28,246 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:04:28,248 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:04:28,249 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:04:28,249 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:04:28,253 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:04:28,254 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:04:28" (1/1) ... [2019-01-12 09:04:28,257 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c0aad85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:04:28, skipping insertion in model container [2019-01-12 09:04:28,257 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:04:28" (1/1) ... [2019-01-12 09:04:28,267 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:04:28,310 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:04:28,643 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:04:28,651 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:04:28,710 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:04:28,739 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:04:28,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:04:28 WrapperNode [2019-01-12 09:04:28,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:04:28,741 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:04:28,741 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:04:28,741 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:04:28,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:04:28" (1/1) ... [2019-01-12 09:04:28,837 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:04:28" (1/1) ... [2019-01-12 09:04:28,887 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:04:28,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:04:28,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:04:28,888 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:04:28,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:04:28" (1/1) ... [2019-01-12 09:04:28,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:04:28" (1/1) ... [2019-01-12 09:04:28,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:04:28" (1/1) ... [2019-01-12 09:04:28,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:04:28" (1/1) ... [2019-01-12 09:04:28,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:04:28" (1/1) ... [2019-01-12 09:04:28,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:04:28" (1/1) ... [2019-01-12 09:04:28,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:04:28" (1/1) ... [2019-01-12 09:04:28,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:04:28,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:04:28,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:04:28,958 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:04:28,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:04:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:04:29,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:04:29,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-01-12 09:04:29,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 09:04:29,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-01-12 09:04:29,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:04:29,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:04:29,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 09:04:29,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-01-12 09:04:29,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:04:30,327 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:04:30,328 INFO L286 CfgBuilder]: Removed 44 assue(true) statements. [2019-01-12 09:04:30,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:04:30 BoogieIcfgContainer [2019-01-12 09:04:30,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:04:30,331 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:04:30,331 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:04:30,335 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:04:30,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:04:28" (1/3) ... [2019-01-12 09:04:30,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5261173c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:04:30, skipping insertion in model container [2019-01-12 09:04:30,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:04:28" (2/3) ... [2019-01-12 09:04:30,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5261173c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:04:30, skipping insertion in model container [2019-01-12 09:04:30,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:04:30" (3/3) ... [2019-01-12 09:04:30,338 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0686b_true-unreach-call.c [2019-01-12 09:04:30,346 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:04:30,352 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:04:30,368 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:04:30,400 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:04:30,401 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:04:30,402 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:04:30,402 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:04:30,402 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:04:30,402 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:04:30,402 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:04:30,403 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:04:30,403 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:04:30,423 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-01-12 09:04:30,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 09:04:30,430 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:04:30,430 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:04:30,433 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:04:30,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:04:30,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1264059097, now seen corresponding path program 1 times [2019-01-12 09:04:30,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:04:30,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:04:30,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:04:30,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:04:30,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:04:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:04:30,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:04:30,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:04:30,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:04:30,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:04:30,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:04:30,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:04:30,620 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-01-12 09:04:30,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:04:30,652 INFO L93 Difference]: Finished difference Result 224 states and 378 transitions. [2019-01-12 09:04:30,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:04:30,653 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-01-12 09:04:30,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:04:30,667 INFO L225 Difference]: With dead ends: 224 [2019-01-12 09:04:30,667 INFO L226 Difference]: Without dead ends: 110 [2019-01-12 09:04:30,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:04:30,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-12 09:04:30,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-01-12 09:04:30,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-12 09:04:30,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2019-01-12 09:04:30,714 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 10 [2019-01-12 09:04:30,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:04:30,715 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2019-01-12 09:04:30,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:04:30,715 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2019-01-12 09:04:30,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 09:04:30,716 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:04:30,716 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:04:30,716 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:04:30,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:04:30,717 INFO L82 PathProgramCache]: Analyzing trace with hash -925329470, now seen corresponding path program 1 times [2019-01-12 09:04:30,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:04:30,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:04:30,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:04:30,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:04:30,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:04:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:04:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:04:30,995 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 09:04:31,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:04:31 BoogieIcfgContainer [2019-01-12 09:04:31,075 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:04:31,076 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:04:31,076 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:04:31,077 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:04:31,077 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:04:30" (3/4) ... [2019-01-12 09:04:31,084 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-12 09:04:31,084 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:04:31,085 INFO L168 Benchmark]: Toolchain (without parser) took 2838.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 947.3 MB in the beginning and 1.0 GB in the end (delta: -84.7 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. [2019-01-12 09:04:31,088 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:04:31,089 INFO L168 Benchmark]: CACSL2BoogieTranslator took 491.52 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.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 09:04:31,091 INFO L168 Benchmark]: Boogie Procedure Inliner took 146.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -197.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-12 09:04:31,092 INFO L168 Benchmark]: Boogie Preprocessor took 69.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-12 09:04:31,094 INFO L168 Benchmark]: RCFGBuilder took 1372.17 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: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:04:31,095 INFO L168 Benchmark]: TraceAbstraction took 744.73 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: 39.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:04:31,096 INFO L168 Benchmark]: Witness Printer took 7.99 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 09:04:31,104 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 491.52 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.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 146.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -197.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.76 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 1372.17 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: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 744.73 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: 39.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. * Witness Printer took 7.99 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: 256]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 162, overapproximation of someUnaryDOUBLEoperation at line 52, overapproximation of someBinaryArithmeticDOUBLEoperation at line 163, overapproximation of bitwiseAnd at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 255. Possible FailurePath: [L37-L42] static const double atanhi_atan[] = { 4.63647609000806093515e-01, 7.85398163397448278999e-01, 9.82793723247329054082e-01, 1.57079632679489655800e+00, }; [L44-L49] static const double atanlo_atan[] = { 2.26987774529616870924e-17, 3.06161699786838301793e-17, 1.39033110312309984516e-17, 6.12323399573676603587e-17, }; [L51-L58] static const double aT_atan[] = { 3.33333333333329318027e-01, -1.99999999998764832476e-01, 1.42857142725034663711e-01, -1.11111104054623557880e-01, 9.09088713343650656196e-02, -7.69187620504482999495e-02, 6.66107313738753120669e-02, -5.83357013379057348645e-02, 4.97687799461593236017e-02, -3.65315727442169155270e-02, 1.62858201153657823623e-02, }; [L60-L62] static const double one_atan = 1.0, pi_o_4 = 7.8539816339744827900E-01, pi_o_2 = 1.5707963267948965580E+00, pi = 3.1415926535897931160E+00, huge_atan = 1.0e300; [L139-L140] static const double tiny_atan2 = 1.0e-300, zero_atan2 = 0.0, pi_lo_atan2 = 1.2246467991473531772E-16; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L250] double x = 1.0 / 0.0; [L251] double y = -1.0 / 0.0; [L143] double z; [L144] __int32_t k, m, hx, hy, ix, iy; [L145] __uint32_t lx, ly; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L148] ieee_double_shape_type ew_u; [L149] ew_u.value = (x) [L150] EXPR ew_u.parts.msw [L150] (hx) = ew_u.parts.msw [L151] EXPR ew_u.parts.lsw [L151] (lx) = ew_u.parts.lsw [L153] ix = hx & 0x7fffffff VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L155] ieee_double_shape_type ew_u; [L156] ew_u.value = (y) [L157] EXPR ew_u.parts.msw [L157] (hy) = ew_u.parts.msw [L158] EXPR ew_u.parts.lsw [L158] (ly) = ew_u.parts.lsw [L160] iy = hy & 0x7fffffff VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L161-L162] COND TRUE ((ix | ((lx | -lx) >> 31)) > 0x7ff00000) || ((iy | ((ly | -ly) >> 31)) > 0x7ff00000) [L163] return x + y; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L253] double res = __ieee754_atan2(y, x); [L255] COND TRUE res != -pi_o_4 VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L256] __VERIFIER_error() VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 113 locations, 1 error locations. UNSAFE Result, 0.6s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 161 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=113occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 81 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 09:04:33,406 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:04:33,409 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:04:33,425 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:04:33,426 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:04:33,428 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:04:33,430 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:04:33,432 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:04:33,437 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:04:33,440 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:04:33,443 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:04:33,444 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:04:33,446 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:04:33,447 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:04:33,455 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:04:33,456 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:04:33,457 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:04:33,460 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:04:33,463 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:04:33,466 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:04:33,467 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:04:33,468 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:04:33,470 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:04:33,470 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:04:33,471 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:04:33,471 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:04:33,472 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:04:33,473 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:04:33,474 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:04:33,475 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:04:33,475 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:04:33,476 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:04:33,476 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:04:33,476 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:04:33,477 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:04:33,477 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:04:33,478 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-01-12 09:04:33,500 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:04:33,501 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:04:33,506 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:04:33,506 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:04:33,506 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:04:33,507 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:04:33,507 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:04:33,507 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:04:33,507 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:04:33,507 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:04:33,507 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:04:33,509 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:04:33,509 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-12 09:04:33,509 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-12 09:04:33,509 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:04:33,510 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:04:33,510 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:04:33,510 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:04:33,510 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:04:33,510 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:04:33,511 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:04:33,513 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:04:33,513 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:04:33,513 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:04:33,514 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:04:33,514 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:04:33,514 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-12 09:04:33,514 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:04:33,514 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-12 09:04:33,514 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-12 09:04:33,514 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 -> f884ccf2da0c4c4f4df1be4e75875f554c398438 [2019-01-12 09:04:33,570 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:04:33,592 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:04:33,599 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:04:33,601 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:04:33,601 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:04:33,602 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0686b_true-unreach-call.c [2019-01-12 09:04:33,658 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89851ff3f/6d449584b5b8433aad61fd1708605f04/FLAG51deeec2e [2019-01-12 09:04:34,094 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:04:34,095 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0686b_true-unreach-call.c [2019-01-12 09:04:34,102 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89851ff3f/6d449584b5b8433aad61fd1708605f04/FLAG51deeec2e [2019-01-12 09:04:34,445 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89851ff3f/6d449584b5b8433aad61fd1708605f04 [2019-01-12 09:04:34,449 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:04:34,451 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:04:34,452 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:04:34,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:04:34,456 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:04:34,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:04:34" (1/1) ... [2019-01-12 09:04:34,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c0aad85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:04:34, skipping insertion in model container [2019-01-12 09:04:34,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:04:34" (1/1) ... [2019-01-12 09:04:34,469 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:04:34,500 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:04:34,772 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:04:34,799 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:04:34,939 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:04:35,104 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:04:35,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:04:35 WrapperNode [2019-01-12 09:04:35,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:04:35,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:04:35,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:04:35,105 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:04:35,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:04:35" (1/1) ... [2019-01-12 09:04:35,134 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:04:35" (1/1) ... [2019-01-12 09:04:35,185 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:04:35,186 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:04:35,186 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:04:35,186 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:04:35,201 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:04:35" (1/1) ... [2019-01-12 09:04:35,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:04:35" (1/1) ... [2019-01-12 09:04:35,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:04:35" (1/1) ... [2019-01-12 09:04:35,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:04:35" (1/1) ... [2019-01-12 09:04:35,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:04:35" (1/1) ... [2019-01-12 09:04:35,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:04:35" (1/1) ... [2019-01-12 09:04:35,305 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:04:35" (1/1) ... [2019-01-12 09:04:35,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:04:35,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:04:35,324 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:04:35,324 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:04:35,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:04:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:04:35,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-01-12 09:04:35,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-01-12 09:04:35,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:04:35,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-01-12 09:04:35,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-12 09:04:35,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:04:35,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:04:35,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-12 09:04:35,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:04:35,985 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:04:36,342 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:04:39,058 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:04:39,091 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:04:39,230 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:04:39,306 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:04:39,391 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:04:39,476 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:04:39,510 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:04:41,513 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:04:41,610 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:04:41,630 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:04:41,675 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:14,786 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:15,275 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:16,968 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:05:16,968 INFO L286 CfgBuilder]: Removed 44 assue(true) statements. [2019-01-12 09:05:16,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:05:16 BoogieIcfgContainer [2019-01-12 09:05:16,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:05:16,971 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:05:16,971 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:05:16,974 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:05:16,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:04:34" (1/3) ... [2019-01-12 09:05:16,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b461b53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:05:16, skipping insertion in model container [2019-01-12 09:05:16,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:04:35" (2/3) ... [2019-01-12 09:05:16,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b461b53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:05:16, skipping insertion in model container [2019-01-12 09:05:16,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:05:16" (3/3) ... [2019-01-12 09:05:16,978 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0686b_true-unreach-call.c [2019-01-12 09:05:16,988 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:05:16,998 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:05:17,013 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:05:17,044 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:05:17,045 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:05:17,045 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:05:17,045 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:05:17,045 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:05:17,045 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:05:17,045 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:05:17,046 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:05:17,046 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:05:17,065 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-01-12 09:05:17,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 09:05:17,071 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:05:17,072 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:05:17,074 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:05:17,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:05:17,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1264059097, now seen corresponding path program 1 times [2019-01-12 09:05:17,086 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:05:17,087 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 09:05:17,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:05:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:05:17,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:05:17,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:05:17,392 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:05:17,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:05:17,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:05:17,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:05:17,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:05:17,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:05:17,425 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-01-12 09:05:17,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:05:17,455 INFO L93 Difference]: Finished difference Result 224 states and 378 transitions. [2019-01-12 09:05:17,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:05:17,457 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-01-12 09:05:17,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:05:17,473 INFO L225 Difference]: With dead ends: 224 [2019-01-12 09:05:17,473 INFO L226 Difference]: Without dead ends: 110 [2019-01-12 09:05:17,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:05:17,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-12 09:05:17,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-01-12 09:05:17,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-12 09:05:17,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2019-01-12 09:05:17,522 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 10 [2019-01-12 09:05:17,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:05:17,522 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2019-01-12 09:05:17,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:05:17,523 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2019-01-12 09:05:17,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 09:05:17,523 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:05:17,524 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:05:17,524 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:05:17,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:05:17,525 INFO L82 PathProgramCache]: Analyzing trace with hash -925329470, now seen corresponding path program 1 times [2019-01-12 09:05:17,527 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:05:17,527 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-01-12 09:05:17,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:05:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:05:18,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:05:18,123 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:05:18,128 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:05:18,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2019-01-12 09:05:18,341 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2019-01-12 09:05:18,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:05:18,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 36 [2019-01-12 09:05:18,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:05:18,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-01-12 09:05:18,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:05:18,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-01-12 09:05:18,409 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:05:18,427 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:05:18,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:05:18,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:05:18,468 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:32 [2019-01-12 09:05:18,632 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:05:18,634 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:05:18,636 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:05:18,637 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:05:18,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 85 [2019-01-12 09:05:18,908 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-01-12 09:05:18,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:05:18,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:05:18,971 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:05:18,972 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:05:18,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 74 [2019-01-12 09:05:18,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:05:19,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2019-01-12 09:05:19,102 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:05:19,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-01-12 09:05:19,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:05:19,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2019-01-12 09:05:19,216 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:05:19,222 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:05:19,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:05:19,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-12 09:05:19,289 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:101, output treesize:58 [2019-01-12 09:05:19,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:05:19,667 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:05:19,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:05:19,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 09:05:19,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 09:05:19,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 09:05:19,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:05:19,699 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand 7 states. [2019-01-12 09:05:20,159 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-12 09:05:20,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:05:20,848 INFO L93 Difference]: Finished difference Result 125 states and 181 transitions. [2019-01-12 09:05:20,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 09:05:20,859 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-12 09:05:20,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:05:20,860 INFO L225 Difference]: With dead ends: 125 [2019-01-12 09:05:20,860 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 09:05:20,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-12 09:05:20,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 09:05:20,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-12 09:05:20,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 09:05:20,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-01-12 09:05:20,869 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 12 [2019-01-12 09:05:20,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:05:20,870 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-01-12 09:05:20,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 09:05:20,870 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-01-12 09:05:20,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 09:05:20,871 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:05:20,871 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:05:20,872 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:05:20,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:05:20,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1043077923, now seen corresponding path program 1 times [2019-01-12 09:05:20,873 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:05:20,873 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-01-12 09:05:20,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:05:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:05:21,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:05:21,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:05:21,296 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:05:21,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:05:21,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 09:05:21,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:05:21,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:05:21,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:05:21,315 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 6 states. [2019-01-12 09:05:23,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:05:23,345 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-01-12 09:05:23,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 09:05:23,356 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-01-12 09:05:23,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:05:23,357 INFO L225 Difference]: With dead ends: 30 [2019-01-12 09:05:23,357 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 09:05:23,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:05:23,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 09:05:23,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-12 09:05:23,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 09:05:23,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-01-12 09:05:23,363 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 18 [2019-01-12 09:05:23,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:05:23,364 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-01-12 09:05:23,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:05:23,364 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-01-12 09:05:23,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 09:05:23,366 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:05:23,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:05:23,366 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:05:23,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:05:23,367 INFO L82 PathProgramCache]: Analyzing trace with hash 2018570646, now seen corresponding path program 1 times [2019-01-12 09:05:23,368 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:05:23,368 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-01-12 09:05:23,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:05:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:05:23,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:05:24,537 WARN L181 SmtUtils]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 09:05:24,981 WARN L181 SmtUtils]: Spent 392.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 09:05:24,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:05:24,986 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:05:24,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:05:24,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:05:24,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 09:05:24,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 09:05:24,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:05:25,000 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 5 states. [2019-01-12 09:05:25,658 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-12 09:05:26,246 WARN L181 SmtUtils]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-12 09:05:26,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:05:26,954 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-12 09:05:26,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 09:05:26,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-01-12 09:05:26,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:05:26,956 INFO L225 Difference]: With dead ends: 30 [2019-01-12 09:05:26,957 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 09:05:26,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:05:26,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 09:05:26,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-12 09:05:26,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 09:05:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-01-12 09:05:26,965 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 19 [2019-01-12 09:05:26,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:05:26,965 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-01-12 09:05:26,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 09:05:26,965 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-01-12 09:05:26,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 09:05:26,966 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:05:26,966 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:05:26,966 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:05:26,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:05:26,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1657978959, now seen corresponding path program 1 times [2019-01-12 09:05:26,967 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:05:26,967 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-01-12 09:05:26,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:05:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:05:27,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:05:27,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:05:27,585 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:05:27,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:05:27,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 09:05:27,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 09:05:27,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 09:05:27,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:05:27,605 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 7 states. [2019-01-12 09:05:28,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:05:28,161 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-01-12 09:05:28,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 09:05:28,162 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-01-12 09:05:28,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:05:28,162 INFO L225 Difference]: With dead ends: 26 [2019-01-12 09:05:28,163 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 09:05:28,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-12 09:05:28,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 09:05:28,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 09:05:28,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 09:05:28,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 09:05:28,164 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-01-12 09:05:28,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:05:28,165 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 09:05:28,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 09:05:28,165 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 09:05:28,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 09:05:28,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 09:05:28,557 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-01-12 09:05:29,447 WARN L181 SmtUtils]: Spent 888.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 88 [2019-01-12 09:05:29,450 INFO L448 ceAbstractionStarter]: For program point L68-3(lines 68 72) no Hoare annotation was computed. [2019-01-12 09:05:29,450 INFO L448 ceAbstractionStarter]: For program point L68-5(lines 68 72) no Hoare annotation was computed. [2019-01-12 09:05:29,450 INFO L444 ceAbstractionStarter]: At program point L68-6(lines 68 72) the Hoare annotation is: false [2019-01-12 09:05:29,451 INFO L448 ceAbstractionStarter]: For program point L68-7(lines 68 72) no Hoare annotation was computed. [2019-01-12 09:05:29,451 INFO L448 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-01-12 09:05:29,451 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 178) no Hoare annotation was computed. [2019-01-12 09:05:29,451 INFO L448 ceAbstractionStarter]: For program point L168-2(lines 142 242) no Hoare annotation was computed. [2019-01-12 09:05:29,451 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 177) no Hoare annotation was computed. [2019-01-12 09:05:29,451 INFO L448 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2019-01-12 09:05:29,451 INFO L448 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2019-01-12 09:05:29,451 INFO L448 ceAbstractionStarter]: For program point L170-2(line 170) no Hoare annotation was computed. [2019-01-12 09:05:29,451 INFO L448 ceAbstractionStarter]: For program point L237(line 237) no Hoare annotation was computed. [2019-01-12 09:05:29,452 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-01-12 09:05:29,452 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 111) no Hoare annotation was computed. [2019-01-12 09:05:29,452 INFO L448 ceAbstractionStarter]: For program point L105-2(lines 88 113) no Hoare annotation was computed. [2019-01-12 09:05:29,452 INFO L448 ceAbstractionStarter]: For program point L105-3(lines 105 111) no Hoare annotation was computed. [2019-01-12 09:05:29,452 INFO L448 ceAbstractionStarter]: For program point L105-5(lines 88 113) no Hoare annotation was computed. [2019-01-12 09:05:29,452 INFO L448 ceAbstractionStarter]: For program point L239(line 239) no Hoare annotation was computed. [2019-01-12 09:05:29,452 INFO L448 ceAbstractionStarter]: For program point L173(line 173) no Hoare annotation was computed. [2019-01-12 09:05:29,452 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 87) no Hoare annotation was computed. [2019-01-12 09:05:29,452 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 74 87) no Hoare annotation was computed. [2019-01-12 09:05:29,452 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 09:05:29,453 INFO L444 ceAbstractionStarter]: At program point L142(lines 142 242) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) (and (exists ((ULTIMATE.start___ieee754_atan2_~hx~1 (_ BitVec 32)) (|v_q#valueAsBitvector_18| (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~m~0 (bvor (bvand (_ bv1 32) (bvashr ((_ extract 63 32) |v_q#valueAsBitvector_18|) (_ bv31 32))) (bvand (_ bv2 32) (bvashr ULTIMATE.start___ieee754_atan2_~hx~1 (_ bv30 32))))) (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_18|) ((_ extract 62 52) |v_q#valueAsBitvector_18|) ((_ extract 51 0) |v_q#valueAsBitvector_18|))))) (= (fp.div roundNearestTiesToEven .cse0 (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x) (= |ULTIMATE.start___ieee754_atan2_#res| (fp.sub roundNearestTiesToEven (fp.neg ~pi_o_4~0) .cse1)) (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 1000000000000000000.0)) ~pi_o_4~0) (exists ((v_prenex_62 (_ BitVec 64)) (|v_q#valueAsBitvector_17| (_ BitVec 64))) (let ((.cse2 ((_ extract 63 32) |v_q#valueAsBitvector_17|)) (.cse3 ((_ extract 31 0) v_prenex_62))) (and (= (bvand (_ bv2147483647 32) .cse2) ULTIMATE.start___ieee754_atan2_~iy~0) (= ((_ extract 31 0) |v_q#valueAsBitvector_17|) .cse3) (= .cse2 ((_ extract 63 32) v_prenex_62)) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_17|) ((_ extract 62 52) |v_q#valueAsBitvector_17|) ((_ extract 51 0) |v_q#valueAsBitvector_17|)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (= .cse3 ULTIMATE.start___ieee754_atan2_~ly~0)))) (exists ((|v_q#valueAsBitvector_18| (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~hy~0 ((_ extract 63 32) |v_q#valueAsBitvector_18|)) (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_18|) ((_ extract 62 52) |v_q#valueAsBitvector_18|) ((_ extract 51 0) |v_q#valueAsBitvector_18|))))) (exists ((|v_q#valueAsBitvector_16| (_ BitVec 64))) (and (= ((_ extract 31 0) |v_q#valueAsBitvector_16|) ULTIMATE.start___ieee754_atan2_~lx~0) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_16|) ((_ extract 62 52) |v_q#valueAsBitvector_16|) ((_ extract 51 0) |v_q#valueAsBitvector_16|)) (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (_ +zero 11 53))) (= ((_ extract 63 32) |v_q#valueAsBitvector_16|) ULTIMATE.start___ieee754_atan2_~hx~1))) (= (fp.div roundNearestTiesToEven (fp.neg .cse0) (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~y) (= ~tiny_atan2~0 .cse1) (exists ((|v_q#valueAsBitvector_16| (_ BitVec 64))) (and (= (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_16|)) ULTIMATE.start___ieee754_atan2_~ix~1) (= ((_ extract 31 0) |v_q#valueAsBitvector_16|) ULTIMATE.start___ieee754_atan2_~lx~0) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_16|) ((_ extract 62 52) |v_q#valueAsBitvector_16|) ((_ extract 51 0) |v_q#valueAsBitvector_16|)) (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (_ +zero 11 53))))))) [2019-01-12 09:05:29,453 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 76 80) no Hoare annotation was computed. [2019-01-12 09:05:29,453 INFO L444 ceAbstractionStarter]: At program point L76-2(lines 76 80) the Hoare annotation is: false [2019-01-12 09:05:29,453 INFO L448 ceAbstractionStarter]: For program point L76-3(lines 74 87) no Hoare annotation was computed. [2019-01-12 09:05:29,453 INFO L448 ceAbstractionStarter]: For program point L76-5(lines 76 80) no Hoare annotation was computed. [2019-01-12 09:05:29,454 INFO L444 ceAbstractionStarter]: At program point L76-6(lines 76 80) the Hoare annotation is: false [2019-01-12 09:05:29,454 INFO L448 ceAbstractionStarter]: For program point L76-7(lines 74 87) no Hoare annotation was computed. [2019-01-12 09:05:29,454 INFO L448 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2019-01-12 09:05:29,454 INFO L448 ceAbstractionStarter]: For program point L210-2(line 210) no Hoare annotation was computed. [2019-01-12 09:05:29,457 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 256) no Hoare annotation was computed. [2019-01-12 09:05:29,457 INFO L448 ceAbstractionStarter]: For program point L213(lines 213 218) no Hoare annotation was computed. [2019-01-12 09:05:29,457 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 147 152) no Hoare annotation was computed. [2019-01-12 09:05:29,458 INFO L444 ceAbstractionStarter]: At program point L147-2(lines 147 152) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.div roundNearestTiesToEven .cse0 (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x) (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 1000000000000000000.0)) ~pi_o_4~0) (= (fp.div roundNearestTiesToEven (fp.neg .cse0) (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~y) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))))) [2019-01-12 09:05:29,458 INFO L448 ceAbstractionStarter]: For program point L147-3(lines 147 152) no Hoare annotation was computed. [2019-01-12 09:05:29,458 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 09:05:29,458 INFO L448 ceAbstractionStarter]: For program point L181-2(line 181) no Hoare annotation was computed. [2019-01-12 09:05:29,458 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2019-01-12 09:05:29,458 INFO L448 ceAbstractionStarter]: For program point L215-2(lines 213 218) no Hoare annotation was computed. [2019-01-12 09:05:29,458 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 86) no Hoare annotation was computed. [2019-01-12 09:05:29,458 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 83 86) no Hoare annotation was computed. [2019-01-12 09:05:29,458 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 207) no Hoare annotation was computed. [2019-01-12 09:05:29,458 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 142 242) no Hoare annotation was computed. [2019-01-12 09:05:29,458 INFO L448 ceAbstractionStarter]: For program point L184(lines 184 206) no Hoare annotation was computed. [2019-01-12 09:05:29,459 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2019-01-12 09:05:29,459 INFO L444 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2019-01-12 09:05:29,459 INFO L448 ceAbstractionStarter]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2019-01-12 09:05:29,459 INFO L444 ceAbstractionStarter]: At program point L19-6(lines 19 23) the Hoare annotation is: false [2019-01-12 09:05:29,459 INFO L448 ceAbstractionStarter]: For program point L19-9(lines 19 23) no Hoare annotation was computed. [2019-01-12 09:05:29,459 INFO L444 ceAbstractionStarter]: At program point L19-10(lines 19 23) the Hoare annotation is: false [2019-01-12 09:05:29,459 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 09:05:29,459 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 194) no Hoare annotation was computed. [2019-01-12 09:05:29,459 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 241) no Hoare annotation was computed. [2019-01-12 09:05:29,460 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-01-12 09:05:29,460 INFO L448 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2019-01-12 09:05:29,460 INFO L448 ceAbstractionStarter]: For program point L154-1(lines 154 159) no Hoare annotation was computed. [2019-01-12 09:05:29,460 INFO L444 ceAbstractionStarter]: At program point L154-2(lines 154 159) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.div roundNearestTiesToEven .cse0 (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x) (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 1000000000000000000.0)) ~pi_o_4~0) (exists ((|v_q#valueAsBitvector_16| (_ BitVec 64))) (and (= ((_ extract 31 0) |v_q#valueAsBitvector_16|) ULTIMATE.start___ieee754_atan2_~lx~0) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_16|) ((_ extract 62 52) |v_q#valueAsBitvector_16|) ((_ extract 51 0) |v_q#valueAsBitvector_16|)) (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (_ +zero 11 53))) (= ((_ extract 63 32) |v_q#valueAsBitvector_16|) ULTIMATE.start___ieee754_atan2_~hx~1))) (= (fp.div roundNearestTiesToEven (fp.neg .cse0) (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~y) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))) (exists ((|v_q#valueAsBitvector_16| (_ BitVec 64))) (and (= (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_16|)) ULTIMATE.start___ieee754_atan2_~ix~1) (= ((_ extract 31 0) |v_q#valueAsBitvector_16|) ULTIMATE.start___ieee754_atan2_~lx~0) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_16|) ((_ extract 62 52) |v_q#valueAsBitvector_16|) ((_ extract 51 0) |v_q#valueAsBitvector_16|)) (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (_ +zero 11 53))))))) [2019-01-12 09:05:29,460 INFO L448 ceAbstractionStarter]: For program point L88(lines 88 113) no Hoare annotation was computed. [2019-01-12 09:05:29,460 INFO L448 ceAbstractionStarter]: For program point L154-3(lines 154 159) no Hoare annotation was computed. [2019-01-12 09:05:29,460 INFO L448 ceAbstractionStarter]: For program point L88-2(lines 88 113) no Hoare annotation was computed. [2019-01-12 09:05:29,461 INFO L448 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-01-12 09:05:29,461 INFO L448 ceAbstractionStarter]: For program point L89(lines 89 92) no Hoare annotation was computed. [2019-01-12 09:05:29,461 INFO L448 ceAbstractionStarter]: For program point L89-2(lines 89 92) no Hoare annotation was computed. [2019-01-12 09:05:29,461 INFO L448 ceAbstractionStarter]: For program point L89-3(lines 89 92) no Hoare annotation was computed. [2019-01-12 09:05:29,461 INFO L448 ceAbstractionStarter]: For program point L89-5(lines 89 92) no Hoare annotation was computed. [2019-01-12 09:05:29,461 INFO L448 ceAbstractionStarter]: For program point L255(lines 255 258) no Hoare annotation was computed. [2019-01-12 09:05:29,461 INFO L448 ceAbstractionStarter]: For program point L222(line 222) no Hoare annotation was computed. [2019-01-12 09:05:29,461 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 91) no Hoare annotation was computed. [2019-01-12 09:05:29,461 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 90 91) no Hoare annotation was computed. [2019-01-12 09:05:29,461 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:05:29,461 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 17 31) no Hoare annotation was computed. [2019-01-12 09:05:29,462 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:05:29,462 INFO L448 ceAbstractionStarter]: For program point L24-3(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:05:29,462 INFO L448 ceAbstractionStarter]: For program point L24-4(lines 17 31) no Hoare annotation was computed. [2019-01-12 09:05:29,462 INFO L448 ceAbstractionStarter]: For program point L24-5(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:05:29,462 INFO L448 ceAbstractionStarter]: For program point L24-6(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:05:29,462 INFO L448 ceAbstractionStarter]: For program point L24-7(lines 17 31) no Hoare annotation was computed. [2019-01-12 09:05:29,462 INFO L448 ceAbstractionStarter]: For program point L24-8(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:05:29,462 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 09:05:29,462 INFO L448 ceAbstractionStarter]: For program point L256(line 256) no Hoare annotation was computed. [2019-01-12 09:05:29,462 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 09:05:29,463 INFO L448 ceAbstractionStarter]: For program point L224-1(lines 224 228) no Hoare annotation was computed. [2019-01-12 09:05:29,463 INFO L444 ceAbstractionStarter]: At program point L224-2(lines 224 228) the Hoare annotation is: false [2019-01-12 09:05:29,463 INFO L448 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-01-12 09:05:29,463 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 131) no Hoare annotation was computed. [2019-01-12 09:05:29,463 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 126 131) no Hoare annotation was computed. [2019-01-12 09:05:29,463 INFO L451 ceAbstractionStarter]: At program point L259(lines 244 260) the Hoare annotation is: true [2019-01-12 09:05:29,463 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 09:05:29,463 INFO L448 ceAbstractionStarter]: For program point L161(lines 161 163) no Hoare annotation was computed. [2019-01-12 09:05:29,463 INFO L448 ceAbstractionStarter]: For program point L96(lines 96 112) no Hoare annotation was computed. [2019-01-12 09:05:29,463 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 96 112) no Hoare annotation was computed. [2019-01-12 09:05:29,463 INFO L444 ceAbstractionStarter]: At program point L30(lines 17 31) the Hoare annotation is: false [2019-01-12 09:05:29,464 INFO L444 ceAbstractionStarter]: At program point L30-1(lines 17 31) the Hoare annotation is: false [2019-01-12 09:05:29,464 INFO L444 ceAbstractionStarter]: At program point L30-2(lines 17 31) the Hoare annotation is: false [2019-01-12 09:05:29,464 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 234) no Hoare annotation was computed. [2019-01-12 09:05:29,464 INFO L448 ceAbstractionStarter]: For program point L196(lines 196 205) no Hoare annotation was computed. [2019-01-12 09:05:29,464 INFO L448 ceAbstractionStarter]: For program point L229-1(lines 222 235) no Hoare annotation was computed. [2019-01-12 09:05:29,464 INFO L448 ceAbstractionStarter]: For program point L229-2(lines 229 234) no Hoare annotation was computed. [2019-01-12 09:05:29,464 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 09:05:29,464 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 103) no Hoare annotation was computed. [2019-01-12 09:05:29,464 INFO L448 ceAbstractionStarter]: For program point L130-2(line 130) no Hoare annotation was computed. [2019-01-12 09:05:29,464 INFO L444 ceAbstractionStarter]: At program point L130-3(lines 64 132) the Hoare annotation is: false [2019-01-12 09:05:29,465 INFO L448 ceAbstractionStarter]: For program point L97-3(lines 97 103) no Hoare annotation was computed. [2019-01-12 09:05:29,465 INFO L448 ceAbstractionStarter]: For program point L130-4(line 130) no Hoare annotation was computed. [2019-01-12 09:05:29,465 INFO L448 ceAbstractionStarter]: For program point L130-6(line 130) no Hoare annotation was computed. [2019-01-12 09:05:29,465 INFO L444 ceAbstractionStarter]: At program point L130-7(lines 64 132) the Hoare annotation is: false [2019-01-12 09:05:29,465 INFO L448 ceAbstractionStarter]: For program point L197(line 197) no Hoare annotation was computed. [2019-01-12 09:05:29,465 INFO L448 ceAbstractionStarter]: For program point L164(lines 164 165) no Hoare annotation was computed. [2019-01-12 09:05:29,465 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 09:05:29,465 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 09:05:29,465 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 68 72) no Hoare annotation was computed. [2019-01-12 09:05:29,465 INFO L444 ceAbstractionStarter]: At program point L68-2(lines 68 72) the Hoare annotation is: false [2019-01-12 09:05:29,479 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,480 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,480 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,480 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,481 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,481 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,484 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,484 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,484 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,484 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,484 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,485 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,488 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,489 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,489 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,489 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,490 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,490 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,490 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,490 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,490 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,491 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,491 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,491 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,491 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,491 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,492 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,494 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,494 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,494 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,494 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,494 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,495 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,496 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,499 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,499 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,499 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,500 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,501 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,501 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,501 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,501 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,502 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,502 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,503 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,504 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,504 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,509 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:05:29,509 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hx~1,QUANTIFIED] [2019-01-12 09:05:29,510 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,510 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,510 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:05:29,511 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:05:29,511 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:05:29,511 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,511 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,511 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,514 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,514 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,514 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:05:29,514 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:05:29,515 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_62,QUANTIFIED] [2019-01-12 09:05:29,516 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:05:29,516 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_62,QUANTIFIED] [2019-01-12 09:05:29,517 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:05:29,517 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:05:29,517 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:05:29,517 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,518 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,520 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_62,QUANTIFIED] [2019-01-12 09:05:29,520 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:05:29,520 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,520 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,522 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:05:29,522 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:05:29,522 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:05:29,522 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,524 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,524 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,524 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,524 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,525 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,525 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,525 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,525 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,525 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,526 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,529 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,529 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,529 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,529 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,530 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,530 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,534 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:05:29,534 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hx~1,QUANTIFIED] [2019-01-12 09:05:29,534 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,535 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,536 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:05:29,536 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:05:29,536 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:05:29,537 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,537 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,537 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,537 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,538 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,538 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:05:29,538 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:05:29,538 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_62,QUANTIFIED] [2019-01-12 09:05:29,538 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:05:29,541 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_62,QUANTIFIED] [2019-01-12 09:05:29,542 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:05:29,542 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:05:29,542 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:05:29,542 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,543 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_62,QUANTIFIED] [2019-01-12 09:05:29,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:05:29,543 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,543 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,547 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:05:29,547 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:05:29,547 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:05:29,547 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,547 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,548 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,548 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,549 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,552 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,552 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,552 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,553 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,553 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,553 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,553 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,553 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,553 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:05:29 BoogieIcfgContainer [2019-01-12 09:05:29,560 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:05:29,561 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:05:29,561 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:05:29,561 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:05:29,561 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:05:16" (3/4) ... [2019-01-12 09:05:29,568 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 09:05:29,609 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-01-12 09:05:29,610 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-01-12 09:05:29,610 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 09:05:29,650 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()) == x && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/1000000000000000000) == pi_o_4) && (\exists v_q#valueAsBitvector_16 : bv64 :: (v_q#valueAsBitvector_16[31:0] == lx && ~fp~LONGDOUBLE(v_q#valueAsBitvector_16[63:63], v_q#valueAsBitvector_16[62:52], v_q#valueAsBitvector_16[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())) && v_q#valueAsBitvector_16[63:32] == hx)) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == y) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && (\exists v_q#valueAsBitvector_16 : bv64 :: (~bvand32(2147483647bv32, v_q#valueAsBitvector_16[63:32]) == ix && v_q#valueAsBitvector_16[31:0] == lx) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_16[63:63], v_q#valueAsBitvector_16[62:52], v_q#valueAsBitvector_16[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())) [2019-01-12 09:05:29,651 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\exists ULTIMATE.start___ieee754_atan2_~hx~1 : bv32, v_q#valueAsBitvector_18 : bv64 :: m == ~bvor32(~bvand32(1bv32, ~bvashr32(v_q#valueAsBitvector_18[63:32], 31bv32)), ~bvand32(2bv32, ~bvashr32(ULTIMATE.start___ieee754_atan2_~hx~1, 30bv32))) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_18[63:63], v_q#valueAsBitvector_18[62:52], v_q#valueAsBitvector_18[51:0])) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()) == x) && \result == ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(pi_o_4), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000))) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/1000000000000000000) == pi_o_4) && (\exists v_prenex_62 : bv64, v_q#valueAsBitvector_17 : bv64 :: (((~bvand32(2147483647bv32, v_q#valueAsBitvector_17[63:32]) == iy && v_q#valueAsBitvector_17[31:0] == v_prenex_62[31:0]) && v_q#valueAsBitvector_17[63:32] == v_prenex_62[63:32]) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_17[63:63], v_q#valueAsBitvector_17[62:52], v_q#valueAsBitvector_17[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) && v_prenex_62[31:0] == ly)) && (\exists v_q#valueAsBitvector_18 : bv64 :: hy == v_q#valueAsBitvector_18[63:32] && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_18[63:63], v_q#valueAsBitvector_18[62:52], v_q#valueAsBitvector_18[51:0]))) && (\exists v_q#valueAsBitvector_16 : bv64 :: (v_q#valueAsBitvector_16[31:0] == lx && ~fp~LONGDOUBLE(v_q#valueAsBitvector_16[63:63], v_q#valueAsBitvector_16[62:52], v_q#valueAsBitvector_16[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())) && v_q#valueAsBitvector_16[63:32] == hx)) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == y) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && (\exists v_q#valueAsBitvector_16 : bv64 :: (~bvand32(2147483647bv32, v_q#valueAsBitvector_16[63:32]) == ix && v_q#valueAsBitvector_16[31:0] == lx) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_16[63:63], v_q#valueAsBitvector_16[62:52], v_q#valueAsBitvector_16[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())) [2019-01-12 09:05:29,761 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 09:05:29,761 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:05:29,764 INFO L168 Benchmark]: Toolchain (without parser) took 55314.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 216.0 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -202.7 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-12 09:05:29,765 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:05:29,765 INFO L168 Benchmark]: CACSL2BoogieTranslator took 652.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -189.4 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2019-01-12 09:05:29,766 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.42 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 09:05:29,767 INFO L168 Benchmark]: Boogie Preprocessor took 134.57 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 09:05:29,767 INFO L168 Benchmark]: RCFGBuilder took 41646.14 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: 68.5 MB). Peak memory consumption was 68.5 MB. Max. memory is 11.5 GB. [2019-01-12 09:05:29,768 INFO L168 Benchmark]: TraceAbstraction took 12589.43 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -96.0 MB). Peak memory consumption was 255.8 MB. Max. memory is 11.5 GB. [2019-01-12 09:05:29,771 INFO L168 Benchmark]: Witness Printer took 200.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2019-01-12 09:05:29,774 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.15 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 652.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -189.4 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.42 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. * Boogie Preprocessor took 134.57 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 41646.14 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: 68.5 MB). Peak memory consumption was 68.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12589.43 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -96.0 MB). Peak memory consumption was 255.8 MB. Max. memory is 11.5 GB. * Witness Printer took 200.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation 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_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,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_16,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,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_16,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,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_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hx~1,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_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_62,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_62,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_62,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,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_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,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_16,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,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_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hx~1,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_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_62,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_62,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_62,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,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_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,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_16,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,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: 256]: 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: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 147]: Loop Invariant [2019-01-12 09:05:29,793 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,793 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,793 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,796 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,796 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,796 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,797 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,797 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,797 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,797 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,797 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,797 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()) == x && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/1000000000000000000) == pi_o_4) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == y) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 154]: Loop Invariant [2019-01-12 09:05:29,800 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,800 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,800 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,801 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,805 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,805 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,805 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,805 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,805 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,805 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,805 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,809 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,809 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,809 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,809 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,809 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,810 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,810 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,811 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,811 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,811 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,811 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,812 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,812 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,812 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,812 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,812 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,812 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,813 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,813 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,813 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,813 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,813 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,813 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,813 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,813 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,814 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()) == x && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/1000000000000000000) == pi_o_4) && (\exists v_q#valueAsBitvector_16 : bv64 :: (v_q#valueAsBitvector_16[31:0] == lx && ~fp~LONGDOUBLE(v_q#valueAsBitvector_16[63:63], v_q#valueAsBitvector_16[62:52], v_q#valueAsBitvector_16[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())) && v_q#valueAsBitvector_16[63:32] == hx)) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == y) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && (\exists v_q#valueAsBitvector_16 : bv64 :: (~bvand32(2147483647bv32, v_q#valueAsBitvector_16[63:32]) == ix && v_q#valueAsBitvector_16[31:0] == lx) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_16[63:63], v_q#valueAsBitvector_16[62:52], v_q#valueAsBitvector_16[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 142]: Loop Invariant [2019-01-12 09:05:29,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:05:29,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hx~1,QUANTIFIED] [2019-01-12 09:05:29,820 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,820 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:05:29,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:05:29,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:05:29,822 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,822 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,822 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,822 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,822 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:05:29,823 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:05:29,823 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_62,QUANTIFIED] [2019-01-12 09:05:29,823 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:05:29,823 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_62,QUANTIFIED] [2019-01-12 09:05:29,823 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:05:29,823 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:05:29,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:05:29,827 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,827 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,827 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_62,QUANTIFIED] [2019-01-12 09:05:29,829 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:05:29,829 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,829 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,829 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:05:29,829 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:05:29,830 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:05:29,830 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,830 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,830 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,830 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,830 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,831 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,831 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,831 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,831 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,831 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,831 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,832 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,836 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,836 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,836 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,836 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,837 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,843 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:05:29,843 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hx~1,QUANTIFIED] [2019-01-12 09:05:29,843 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,844 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:05:29,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:05:29,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:05:29,844 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,845 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,847 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,847 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,847 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,847 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:05:29,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:05:29,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_62,QUANTIFIED] [2019-01-12 09:05:29,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:05:29,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_62,QUANTIFIED] [2019-01-12 09:05:29,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:05:29,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:05:29,849 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:05:29,849 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,849 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,849 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_62,QUANTIFIED] [2019-01-12 09:05:29,849 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:05:29,849 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,850 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:05:29,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:05:29,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:05:29,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,851 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,851 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,851 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,851 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,852 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,854 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,854 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,854 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,854 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,854 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:05:29,854 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:29,855 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((((((\exists ULTIMATE.start___ieee754_atan2_~hx~1 : bv32, v_q#valueAsBitvector_18 : bv64 :: m == ~bvor32(~bvand32(1bv32, ~bvashr32(v_q#valueAsBitvector_18[63:32], 31bv32)), ~bvand32(2bv32, ~bvashr32(ULTIMATE.start___ieee754_atan2_~hx~1, 30bv32))) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_18[63:63], v_q#valueAsBitvector_18[62:52], v_q#valueAsBitvector_18[51:0])) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()) == x) && \result == ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(pi_o_4), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000))) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/1000000000000000000) == pi_o_4) && (\exists v_prenex_62 : bv64, v_q#valueAsBitvector_17 : bv64 :: (((~bvand32(2147483647bv32, v_q#valueAsBitvector_17[63:32]) == iy && v_q#valueAsBitvector_17[31:0] == v_prenex_62[31:0]) && v_q#valueAsBitvector_17[63:32] == v_prenex_62[63:32]) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_17[63:63], v_q#valueAsBitvector_17[62:52], v_q#valueAsBitvector_17[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) && v_prenex_62[31:0] == ly)) && (\exists v_q#valueAsBitvector_18 : bv64 :: hy == v_q#valueAsBitvector_18[63:32] && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_18[63:63], v_q#valueAsBitvector_18[62:52], v_q#valueAsBitvector_18[51:0]))) && (\exists v_q#valueAsBitvector_16 : bv64 :: (v_q#valueAsBitvector_16[31:0] == lx && ~fp~LONGDOUBLE(v_q#valueAsBitvector_16[63:63], v_q#valueAsBitvector_16[62:52], v_q#valueAsBitvector_16[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())) && v_q#valueAsBitvector_16[63:32] == hx)) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == y) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && (\exists v_q#valueAsBitvector_16 : bv64 :: (~bvand32(2147483647bv32, v_q#valueAsBitvector_16[63:32]) == ix && v_q#valueAsBitvector_16[31:0] == lx) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_16[63:63], v_q#valueAsBitvector_16[62:52], v_q#valueAsBitvector_16[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 113 locations, 1 error locations. SAFE Result, 12.4s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 227 SDtfs, 211 SDslu, 88 SDs, 0 SdLazy, 86 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 21 NumberOfFragments, 296 HoareAnnotationTreeSize, 17 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 55 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 75 ConstructedInterpolants, 26 QuantifiedInterpolants, 21573 SizeOfPredicates, 31 NumberOfNonLiveVariables, 658 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...