./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1211a_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1211a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/bin-2019/uautomizer --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 0186804fc9e8cef09b3a1cefd7c260de08abc9c3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1211a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/bin-2019/uautomizer --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 0186804fc9e8cef09b3a1cefd7c260de08abc9c3 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 21:23:09,609 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:23:09,610 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:23:09,617 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:23:09,617 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:23:09,618 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:23:09,619 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:23:09,620 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:23:09,621 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:23:09,621 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:23:09,622 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:23:09,622 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:23:09,623 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:23:09,623 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:23:09,624 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:23:09,625 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:23:09,625 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:23:09,627 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:23:09,628 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:23:09,629 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:23:09,630 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:23:09,630 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:23:09,632 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:23:09,632 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:23:09,632 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:23:09,633 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:23:09,634 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:23:09,634 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:23:09,635 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:23:09,636 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:23:09,636 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:23:09,636 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:23:09,636 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:23:09,637 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:23:09,637 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:23:09,638 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:23:09,638 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-22 21:23:09,647 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:23:09,647 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:23:09,648 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 21:23:09,648 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 21:23:09,649 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 21:23:09,649 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 21:23:09,649 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 21:23:09,649 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:23:09,649 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 21:23:09,649 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 21:23:09,650 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 21:23:09,650 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:23:09,650 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 21:23:09,650 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 21:23:09,650 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 21:23:09,650 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 21:23:09,650 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:23:09,650 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:23:09,650 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 21:23:09,651 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:23:09,651 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 21:23:09,651 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 21:23:09,651 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 21:23:09,651 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:23:09,651 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:23:09,651 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 21:23:09,651 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 21:23:09,651 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 21:23:09,651 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 21:23:09,652 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 21:23:09,652 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/bin-2019/uautomizer 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 -> 0186804fc9e8cef09b3a1cefd7c260de08abc9c3 [2018-11-22 21:23:09,673 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:23:09,680 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:23:09,682 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:23:09,683 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:23:09,683 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:23:09,684 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1211a_true-unreach-call.c [2018-11-22 21:23:09,719 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/bin-2019/uautomizer/data/26e71c7f6/f99174f5d15f46e39f5731a6c5eee4f4/FLAG35bdb6021 [2018-11-22 21:23:10,120 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:23:10,120 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/sv-benchmarks/c/float-newlib/float_req_bl_1211a_true-unreach-call.c [2018-11-22 21:23:10,125 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/bin-2019/uautomizer/data/26e71c7f6/f99174f5d15f46e39f5731a6c5eee4f4/FLAG35bdb6021 [2018-11-22 21:23:10,137 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/bin-2019/uautomizer/data/26e71c7f6/f99174f5d15f46e39f5731a6c5eee4f4 [2018-11-22 21:23:10,140 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:23:10,141 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:23:10,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:23:10,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:23:10,148 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:23:10,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:23:10" (1/1) ... [2018-11-22 21:23:10,151 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3438b8ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:23:10, skipping insertion in model container [2018-11-22 21:23:10,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:23:10" (1/1) ... [2018-11-22 21:23:10,160 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:23:10,179 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:23:10,310 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:23:10,317 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:23:10,337 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:23:10,346 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:23:10,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:23:10 WrapperNode [2018-11-22 21:23:10,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:23:10,347 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:23:10,347 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:23:10,347 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:23:10,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:23:10" (1/1) ... [2018-11-22 21:23:10,361 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:23:10" (1/1) ... [2018-11-22 21:23:10,402 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:23:10,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:23:10,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:23:10,402 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:23:10,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:23:10" (1/1) ... [2018-11-22 21:23:10,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:23:10" (1/1) ... [2018-11-22 21:23:10,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:23:10" (1/1) ... [2018-11-22 21:23:10,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:23:10" (1/1) ... [2018-11-22 21:23:10,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:23:10" (1/1) ... [2018-11-22 21:23:10,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:23:10" (1/1) ... [2018-11-22 21:23:10,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:23:10" (1/1) ... [2018-11-22 21:23:10,427 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:23:10,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:23:10,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:23:10,427 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:23:10,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:23:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:23:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 21:23:10,459 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 21:23:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure modf_float [2018-11-22 21:23:10,459 INFO L138 BoogieDeclarations]: Found implementation of procedure modf_float [2018-11-22 21:23:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-22 21:23:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 21:23:10,460 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_float [2018-11-22 21:23:10,460 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_float [2018-11-22 21:23:10,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 21:23:10,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 21:23:10,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-22 21:23:10,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 21:23:10,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:23:10,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:23:10,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2018-11-22 21:23:10,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 21:23:10,461 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_float [2018-11-22 21:23:10,461 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_float [2018-11-22 21:23:10,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 21:23:10,709 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:23:10,709 INFO L280 CfgBuilder]: Removed 18 assue(true) statements. [2018-11-22 21:23:10,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:23:10 BoogieIcfgContainer [2018-11-22 21:23:10,709 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:23:10,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 21:23:10,710 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 21:23:10,712 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 21:23:10,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:23:10" (1/3) ... [2018-11-22 21:23:10,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8012b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:23:10, skipping insertion in model container [2018-11-22 21:23:10,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:23:10" (2/3) ... [2018-11-22 21:23:10,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8012b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:23:10, skipping insertion in model container [2018-11-22 21:23:10,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:23:10" (3/3) ... [2018-11-22 21:23:10,715 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1211a_true-unreach-call.c [2018-11-22 21:23:10,723 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 21:23:10,729 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 21:23:10,744 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 21:23:10,767 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 21:23:10,767 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 21:23:10,767 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 21:23:10,767 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 21:23:10,768 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 21:23:10,768 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 21:23:10,768 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 21:23:10,768 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 21:23:10,768 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 21:23:10,778 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-11-22 21:23:10,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-22 21:23:10,782 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:23:10,782 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, 1, 1, 1, 1, 1, 1] [2018-11-22 21:23:10,784 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:23:10,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:23:10,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1328912444, now seen corresponding path program 1 times [2018-11-22 21:23:10,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:23:10,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:23:10,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:23:10,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:23:10,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:23:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:23:10,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:23:10,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:23:10,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 21:23:10,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-22 21:23:10,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-22 21:23:10,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 21:23:10,899 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 2 states. [2018-11-22 21:23:10,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:23:10,917 INFO L93 Difference]: Finished difference Result 110 states and 158 transitions. [2018-11-22 21:23:10,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-22 21:23:10,917 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-11-22 21:23:10,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:23:10,925 INFO L225 Difference]: With dead ends: 110 [2018-11-22 21:23:10,926 INFO L226 Difference]: Without dead ends: 55 [2018-11-22 21:23:10,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 21:23:10,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-22 21:23:10,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-22 21:23:10,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-22 21:23:10,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-11-22 21:23:10,953 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 27 [2018-11-22 21:23:10,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:23:10,953 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-22 21:23:10,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-22 21:23:10,953 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-11-22 21:23:10,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-22 21:23:10,954 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:23:10,954 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:23:10,955 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:23:10,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:23:10,955 INFO L82 PathProgramCache]: Analyzing trace with hash -2017954314, now seen corresponding path program 1 times [2018-11-22 21:23:10,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:23:10,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:23:10,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:23:10,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:23:10,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:23:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:23:11,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:23:11,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:23:11,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:23:11,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:23:11,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:23:11,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:23:11,023 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 3 states. [2018-11-22 21:23:11,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:23:11,038 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-11-22 21:23:11,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:23:11,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-22 21:23:11,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:23:11,039 INFO L225 Difference]: With dead ends: 58 [2018-11-22 21:23:11,039 INFO L226 Difference]: Without dead ends: 55 [2018-11-22 21:23:11,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:23:11,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-22 21:23:11,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-22 21:23:11,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-22 21:23:11,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-11-22 21:23:11,044 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 30 [2018-11-22 21:23:11,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:23:11,044 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-11-22 21:23:11,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:23:11,044 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-11-22 21:23:11,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-22 21:23:11,045 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:23:11,045 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:23:11,045 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:23:11,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:23:11,046 INFO L82 PathProgramCache]: Analyzing trace with hash 2060718957, now seen corresponding path program 1 times [2018-11-22 21:23:11,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:23:11,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:23:11,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:23:11,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:23:11,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:23:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:23:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:23:11,114 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=11, |#NULL.offset|=6, |old(#NULL.base)|=11, |old(#NULL.offset)|=6, |old(~one_modf~0)|=9.0, ~one_modf~0=9.0] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~one_modf~0 := 1.0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=11, |old(#NULL.offset)|=6, |old(~one_modf~0)|=9.0, ~one_modf~0=1.0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=11, |old(#NULL.offset)|=6, |old(~one_modf~0)|=9.0, ~one_modf~0=1.0] [?] RET #170#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~one_modf~0=1.0] [?] CALL call #t~ret24 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, ~one_modf~0=1.0] [?] ~x~0 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0);call ~#iptr~0.base, ~#iptr~0.offset := #Ultimate.alloc(4);call write~init~real(#t~nondet17, ~#iptr~0.base, ~#iptr~0.offset, 4);havoc #t~nondet17; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#iptr~0.base|=21, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] CALL call #t~ret18 := modf_float(~x~0, ~#iptr~0.base, ~#iptr~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |modf_float_#in~iptr.base|=21, |modf_float_#in~iptr.offset|=0, |modf_float_#in~x|=7.0, ~one_modf~0=1.0] [?] ~x := #in~x;~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset;havoc ~i0~0;havoc ~j0~0;havoc ~i~0; VAL [modf_float_~iptr.base=21, modf_float_~iptr.offset=0, modf_float_~x=7.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_float_#in~iptr.base|=21, |modf_float_#in~iptr.offset|=0, |modf_float_#in~x|=7.0, ~one_modf~0=1.0] [?] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~mem0;havoc #t~union1;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [modf_float_~i0~0=5, modf_float_~iptr.base=21, modf_float_~iptr.offset=0, modf_float_~x=7.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_float_#in~iptr.base|=21, |modf_float_#in~iptr.offset|=0, |modf_float_#in~x|=7.0, ~one_modf~0=1.0] [?] goto; VAL [modf_float_~i0~0=5, modf_float_~iptr.base=21, modf_float_~iptr.offset=0, modf_float_~x=7.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_float_#in~iptr.base|=21, |modf_float_#in~iptr.offset|=0, |modf_float_#in~x|=7.0, ~one_modf~0=1.0] [?] ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; VAL [modf_float_~i0~0=5, modf_float_~iptr.base=21, modf_float_~iptr.offset=0, modf_float_~x=7.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_float_#in~iptr.base|=21, |modf_float_#in~iptr.offset|=0, |modf_float_#in~x|=7.0, ~one_modf~0=1.0] [?] assume ~j0~0 < 23; VAL [modf_float_~i0~0=5, modf_float_~iptr.base=21, modf_float_~iptr.offset=0, modf_float_~j0~0=(- 1), modf_float_~x=7.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_float_#in~iptr.base|=21, |modf_float_#in~iptr.offset|=0, |modf_float_#in~x|=7.0, ~one_modf~0=1.0] [?] assume ~j0~0 < 0; VAL [modf_float_~i0~0=5, modf_float_~iptr.base=21, modf_float_~iptr.offset=0, modf_float_~j0~0=(- 1), modf_float_~x=7.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_float_#in~iptr.base|=21, |modf_float_#in~iptr.offset|=0, |modf_float_#in~x|=7.0, ~one_modf~0=1.0] [?] call ~#sf_u~0.base, ~#sf_u~0.offset := #Ultimate.alloc(4);call write~int(~bitwiseAnd(~i0~0, 2147483648), ~#sf_u~0.base, ~#sf_u~0.offset, 4);call #t~mem2 := read~real(~#sf_u~0.base, ~#sf_u~0.offset, 4);call write~real(#t~mem2, ~iptr.base, ~iptr.offset, 4);havoc #t~mem2;call ULTIMATE.dealloc(~#sf_u~0.base, ~#sf_u~0.offset);havoc ~#sf_u~0.base, ~#sf_u~0.offset; VAL [modf_float_~i0~0=5, modf_float_~iptr.base=21, modf_float_~iptr.offset=0, modf_float_~j0~0=(- 1), modf_float_~x=7.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_float_#in~iptr.base|=21, |modf_float_#in~iptr.offset|=0, |modf_float_#in~x|=7.0, ~one_modf~0=1.0] [?] goto; VAL [modf_float_~i0~0=5, modf_float_~iptr.base=21, modf_float_~iptr.offset=0, modf_float_~j0~0=(- 1), modf_float_~x=7.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_float_#in~iptr.base|=21, |modf_float_#in~iptr.offset|=0, |modf_float_#in~x|=7.0, ~one_modf~0=1.0] [?] #res := ~x; VAL [modf_float_~i0~0=5, modf_float_~iptr.base=21, modf_float_~iptr.offset=0, modf_float_~j0~0=(- 1), modf_float_~x=7.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_float_#in~iptr.base|=21, |modf_float_#in~iptr.offset|=0, |modf_float_#in~x|=7.0, |modf_float_#res|=7.0, ~one_modf~0=1.0] [?] assume true; VAL [modf_float_~i0~0=5, modf_float_~iptr.base=21, modf_float_~iptr.offset=0, modf_float_~j0~0=(- 1), modf_float_~x=7.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_float_#in~iptr.base|=21, |modf_float_#in~iptr.offset|=0, |modf_float_#in~x|=7.0, |modf_float_#res|=7.0, ~one_modf~0=1.0] [?] RET #164#return; VAL [main_~x~0=7.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret18|=7.0, |main_~#iptr~0.base|=21, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] ~res~0 := #t~ret18;havoc #t~ret18;call #t~mem19 := read~real(~#iptr~0.base, ~#iptr~0.offset, 4); VAL [main_~res~0=7.0, main_~x~0=7.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem19|=19.0, |main_~#iptr~0.base|=21, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] CALL call #t~ret20 := isinf_float(#t~mem19); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=19.0, ~one_modf~0=1.0] [?] ~x := #in~x;havoc ~ix~2; VAL [isinf_float_~x=19.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=19.0, ~one_modf~0=1.0] [?] call ~#gf_u~4.base, ~#gf_u~4.offset := #Ultimate.alloc(4);call write~real(~x, ~#gf_u~4.base, ~#gf_u~4.offset, 4);call #t~mem15 := read~int(~#gf_u~4.base, ~#gf_u~4.offset, 4);~ix~2 := (if #t~mem15 % 4294967296 % 4294967296 <= 2147483647 then #t~mem15 % 4294967296 % 4294967296 else #t~mem15 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union16, ~#gf_u~4.base, ~#gf_u~4.offset, 4);havoc #t~mem15;havoc #t~union16;call ULTIMATE.dealloc(~#gf_u~4.base, ~#gf_u~4.offset);havoc ~#gf_u~4.base, ~#gf_u~4.offset; VAL [isinf_float_~ix~2=2, isinf_float_~x=19.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=19.0, ~one_modf~0=1.0] [?] goto; VAL [isinf_float_~ix~2=2, isinf_float_~x=19.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=19.0, ~one_modf~0=1.0] [?] ~ix~2 := ~bitwiseAnd(~ix~2, 2147483647);#res := (if 2139095040 == ~ix~2 then 1 else 0); VAL [isinf_float_~ix~2=2139095040, isinf_float_~x=19.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=19.0, |isinf_float_#res|=1, ~one_modf~0=1.0] [?] assume true; VAL [isinf_float_~ix~2=2139095040, isinf_float_~x=19.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=19.0, |isinf_float_#res|=1, ~one_modf~0=1.0] [?] RET #166#return; VAL [main_~res~0=7.0, main_~x~0=7.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem19|=19.0, |main_#t~ret20|=1, |main_~#iptr~0.base|=21, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647;#t~short23 := 0 != #t~ret20; VAL [main_~res~0=7.0, main_~x~0=7.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem19|=19.0, |main_#t~ret20|=1, |main_#t~short23|=true, |main_~#iptr~0.base|=21, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] assume #t~short23;#t~short22 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); VAL [main_~res~0=7.0, main_~x~0=7.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem19|=19.0, |main_#t~ret20|=1, |main_#t~short22|=false, |main_#t~short23|=true, |main_~#iptr~0.base|=21, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] assume !#t~short22; VAL [main_~res~0=7.0, main_~x~0=7.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem19|=19.0, |main_#t~ret20|=1, |main_#t~short22|=false, |main_#t~short23|=true, |main_~#iptr~0.base|=21, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] #t~short23 := !#t~short22; VAL [main_~res~0=7.0, main_~x~0=7.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem19|=19.0, |main_#t~ret20|=1, |main_#t~short22|=false, |main_#t~short23|=true, |main_~#iptr~0.base|=21, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] assume #t~short23;havoc #t~mem19;havoc #t~short23;havoc #t~ret21;havoc #t~ret20;havoc #t~short22; VAL [main_~res~0=7.0, main_~x~0=7.0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#iptr~0.base|=21, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] assume !false; VAL [main_~res~0=7.0, main_~x~0=7.0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#iptr~0.base|=21, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=11, #NULL.offset=6, old(#NULL.base)=11, old(#NULL.offset)=6, old(~one_modf~0)=9.0, ~one_modf~0=9.0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L12] ~one_modf~0 := 1.0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=11, old(#NULL.offset)=6, old(~one_modf~0)=9.0, ~one_modf~0=1.0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=11, old(#NULL.offset)=6, old(~one_modf~0)=9.0, ~one_modf~0=1.0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0] [?] CALL call #t~ret24 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0] [L104] ~x~0 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0); [L105] call ~#iptr~0.base, ~#iptr~0.offset := #Ultimate.alloc(4); [L105] call write~init~real(#t~nondet17, ~#iptr~0.base, ~#iptr~0.offset, 4); [L105] havoc #t~nondet17; VAL [#NULL.base=0, #NULL.offset=0, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0] [L106] CALL call #t~ret18 := modf_float(~x~0, ~#iptr~0.base, ~#iptr~0.offset); VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0] [L14-L71] ~x := #in~x; [L14-L71] ~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset; [L15] havoc ~i0~0; [L15] havoc ~j0~0; [L16] havoc ~i~0; VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, ~iptr.base=21, ~iptr.offset=0, ~one_modf~0=1.0, ~x=7.0] [L18] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L19] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L20] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L20] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L20] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L20] havoc #t~mem0; [L20] havoc #t~union1; [L18] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L18] havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~iptr.base=21, ~iptr.offset=0, ~one_modf~0=1.0, ~x=7.0] [L22] ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~iptr.base=21, ~iptr.offset=0, ~one_modf~0=1.0, ~x=7.0] [L23-L70] assume ~j0~0 < 23; VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~iptr.base=21, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L24-L55] assume ~j0~0 < 0; VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~iptr.base=21, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L26] call ~#sf_u~0.base, ~#sf_u~0.offset := #Ultimate.alloc(4); [L27] call write~int(~bitwiseAnd(~i0~0, 2147483648), ~#sf_u~0.base, ~#sf_u~0.offset, 4); [L28] call #t~mem2 := read~real(~#sf_u~0.base, ~#sf_u~0.offset, 4); [L28] call write~real(#t~mem2, ~iptr.base, ~iptr.offset, 4); [L28] havoc #t~mem2; [L26] call ULTIMATE.dealloc(~#sf_u~0.base, ~#sf_u~0.offset); [L26] havoc ~#sf_u~0.base, ~#sf_u~0.offset; VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~iptr.base=21, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L30] #res := ~x; VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, #res=7.0, ~i0~0=5, ~iptr.base=21, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L14-L71] ensures true; VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, #res=7.0, ~i0~0=5, ~iptr.base=21, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L106] RET call #t~ret18 := modf_float(~x~0, ~#iptr~0.base, ~#iptr~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret18=7.0, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~x~0=7.0] [L106] ~res~0 := #t~ret18; [L106] havoc #t~ret18; [L109] call #t~mem19 := read~real(~#iptr~0.base, ~#iptr~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem19=19.0, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] CALL call #t~ret20 := isinf_float(#t~mem19); VAL [#in~x=19.0, #NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0] [L86-L95] ~x := #in~x; [L87] havoc ~ix~2; VAL [#in~x=19.0, #NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0, ~x=19.0] [L89] call ~#gf_u~4.base, ~#gf_u~4.offset := #Ultimate.alloc(4); [L90] call write~real(~x, ~#gf_u~4.base, ~#gf_u~4.offset, 4); [L91] call #t~mem15 := read~int(~#gf_u~4.base, ~#gf_u~4.offset, 4); [L91] ~ix~2 := (if #t~mem15 % 4294967296 % 4294967296 <= 2147483647 then #t~mem15 % 4294967296 % 4294967296 else #t~mem15 % 4294967296 % 4294967296 - 4294967296); [L91] call write~real(#t~union16, ~#gf_u~4.base, ~#gf_u~4.offset, 4); [L91] havoc #t~mem15; [L91] havoc #t~union16; [L89] call ULTIMATE.dealloc(~#gf_u~4.base, ~#gf_u~4.offset); [L89] havoc ~#gf_u~4.base, ~#gf_u~4.offset; VAL [#in~x=19.0, #NULL.base=0, #NULL.offset=0, ~ix~2=2, ~one_modf~0=1.0, ~x=19.0] [L93] ~ix~2 := ~bitwiseAnd(~ix~2, 2147483647); [L94] #res := (if 2139095040 == ~ix~2 then 1 else 0); VAL [#in~x=19.0, #NULL.base=0, #NULL.offset=0, #res=1, ~ix~2=2139095040, ~one_modf~0=1.0, ~x=19.0] [L86-L95] ensures true; VAL [#in~x=19.0, #NULL.base=0, #NULL.offset=0, #res=1, ~ix~2=2139095040, ~one_modf~0=1.0, ~x=19.0] [L109] RET call #t~ret20 := isinf_float(#t~mem19); VAL [#NULL.base=0, #NULL.offset=0, #t~mem19=19.0, #t~ret20=1, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647; [L109] #t~short23 := 0 != #t~ret20; VAL [#NULL.base=0, #NULL.offset=0, #t~mem19=19.0, #t~ret20=1, #t~short23=true, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] assume #t~short23; [L109] #t~short22 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] assume !#t~short22; VAL [#NULL.base=0, #NULL.offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] #t~short23 := !#t~short22; VAL [#NULL.base=0, #NULL.offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109-L112] assume #t~short23; [L109] havoc #t~mem19; [L109] havoc #t~short23; [L109] havoc #t~ret21; [L109] havoc #t~ret20; [L109] havoc #t~short22; VAL [#NULL.base=0, #NULL.offset=0, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L110] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=11, #NULL.offset=6, old(#NULL.base)=11, old(#NULL.offset)=6, old(~one_modf~0)=9.0, ~one_modf~0=9.0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L12] ~one_modf~0 := 1.0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=11, old(#NULL.offset)=6, old(~one_modf~0)=9.0, ~one_modf~0=1.0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=11, old(#NULL.offset)=6, old(~one_modf~0)=9.0, ~one_modf~0=1.0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0] [?] CALL call #t~ret24 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0] [L104] ~x~0 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0); [L105] call ~#iptr~0.base, ~#iptr~0.offset := #Ultimate.alloc(4); [L105] call write~init~real(#t~nondet17, ~#iptr~0.base, ~#iptr~0.offset, 4); [L105] havoc #t~nondet17; VAL [#NULL.base=0, #NULL.offset=0, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0] [L106] CALL call #t~ret18 := modf_float(~x~0, ~#iptr~0.base, ~#iptr~0.offset); VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0] [L14-L71] ~x := #in~x; [L14-L71] ~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset; [L15] havoc ~i0~0; [L15] havoc ~j0~0; [L16] havoc ~i~0; VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, ~iptr.base=21, ~iptr.offset=0, ~one_modf~0=1.0, ~x=7.0] [L18] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L19] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L20] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L20] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L20] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L20] havoc #t~mem0; [L20] havoc #t~union1; [L18] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L18] havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~iptr.base=21, ~iptr.offset=0, ~one_modf~0=1.0, ~x=7.0] [L22] ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~iptr.base=21, ~iptr.offset=0, ~one_modf~0=1.0, ~x=7.0] [L23-L70] assume ~j0~0 < 23; VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~iptr.base=21, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L24-L55] assume ~j0~0 < 0; VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~iptr.base=21, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L26] call ~#sf_u~0.base, ~#sf_u~0.offset := #Ultimate.alloc(4); [L27] call write~int(~bitwiseAnd(~i0~0, 2147483648), ~#sf_u~0.base, ~#sf_u~0.offset, 4); [L28] call #t~mem2 := read~real(~#sf_u~0.base, ~#sf_u~0.offset, 4); [L28] call write~real(#t~mem2, ~iptr.base, ~iptr.offset, 4); [L28] havoc #t~mem2; [L26] call ULTIMATE.dealloc(~#sf_u~0.base, ~#sf_u~0.offset); [L26] havoc ~#sf_u~0.base, ~#sf_u~0.offset; VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~iptr.base=21, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L30] #res := ~x; VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, #res=7.0, ~i0~0=5, ~iptr.base=21, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L14-L71] ensures true; VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, #res=7.0, ~i0~0=5, ~iptr.base=21, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L106] RET call #t~ret18 := modf_float(~x~0, ~#iptr~0.base, ~#iptr~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret18=7.0, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~x~0=7.0] [L106] ~res~0 := #t~ret18; [L106] havoc #t~ret18; [L109] call #t~mem19 := read~real(~#iptr~0.base, ~#iptr~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem19=19.0, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] CALL call #t~ret20 := isinf_float(#t~mem19); VAL [#in~x=19.0, #NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0] [L86-L95] ~x := #in~x; [L87] havoc ~ix~2; VAL [#in~x=19.0, #NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0, ~x=19.0] [L89] call ~#gf_u~4.base, ~#gf_u~4.offset := #Ultimate.alloc(4); [L90] call write~real(~x, ~#gf_u~4.base, ~#gf_u~4.offset, 4); [L91] call #t~mem15 := read~int(~#gf_u~4.base, ~#gf_u~4.offset, 4); [L91] ~ix~2 := (if #t~mem15 % 4294967296 % 4294967296 <= 2147483647 then #t~mem15 % 4294967296 % 4294967296 else #t~mem15 % 4294967296 % 4294967296 - 4294967296); [L91] call write~real(#t~union16, ~#gf_u~4.base, ~#gf_u~4.offset, 4); [L91] havoc #t~mem15; [L91] havoc #t~union16; [L89] call ULTIMATE.dealloc(~#gf_u~4.base, ~#gf_u~4.offset); [L89] havoc ~#gf_u~4.base, ~#gf_u~4.offset; VAL [#in~x=19.0, #NULL.base=0, #NULL.offset=0, ~ix~2=2, ~one_modf~0=1.0, ~x=19.0] [L93] ~ix~2 := ~bitwiseAnd(~ix~2, 2147483647); [L94] #res := (if 2139095040 == ~ix~2 then 1 else 0); VAL [#in~x=19.0, #NULL.base=0, #NULL.offset=0, #res=1, ~ix~2=2139095040, ~one_modf~0=1.0, ~x=19.0] [L86-L95] ensures true; VAL [#in~x=19.0, #NULL.base=0, #NULL.offset=0, #res=1, ~ix~2=2139095040, ~one_modf~0=1.0, ~x=19.0] [L109] RET call #t~ret20 := isinf_float(#t~mem19); VAL [#NULL.base=0, #NULL.offset=0, #t~mem19=19.0, #t~ret20=1, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647; [L109] #t~short23 := 0 != #t~ret20; VAL [#NULL.base=0, #NULL.offset=0, #t~mem19=19.0, #t~ret20=1, #t~short23=true, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] assume #t~short23; [L109] #t~short22 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] assume !#t~short22; VAL [#NULL.base=0, #NULL.offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] #t~short23 := !#t~short22; VAL [#NULL.base=0, #NULL.offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109-L112] assume #t~short23; [L109] havoc #t~mem19; [L109] havoc #t~short23; [L109] havoc #t~ret21; [L109] havoc #t~ret20; [L109] havoc #t~short22; VAL [#NULL.base=0, #NULL.offset=0, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L110] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=11, #NULL!offset=6, old(#NULL!base)=11, old(#NULL!offset)=6, old(~one_modf~0)=9.0, ~one_modf~0=9.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L12] ~one_modf~0 := 1.0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=11, old(#NULL!offset)=6, old(~one_modf~0)=9.0, ~one_modf~0=1.0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [?] CALL call #t~ret24 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L104] ~x~0 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0); [L105] FCALL call ~#iptr~0 := #Ultimate.alloc(4); [L105] FCALL call write~init~real(#t~nondet17, ~#iptr~0, 4); [L105] havoc #t~nondet17; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0] [L106] CALL call #t~ret18 := modf_float(~x~0, ~#iptr~0); VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L14-L71] ~x := #in~x; [L14-L71] ~iptr := #in~iptr; [L15] havoc ~i0~0; [L15] havoc ~j0~0; [L16] havoc ~i~0; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~iptr!base=21, ~iptr!offset=0, ~one_modf~0=1.0, ~x=7.0] [L18] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L19] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L20] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] havoc #t~mem0; [L20] havoc #t~union1; [L18] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L18] havoc ~#gf_u~0; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~one_modf~0=1.0, ~x=7.0] [L22] ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~one_modf~0=1.0, ~x=7.0] [L23] COND TRUE ~j0~0 < 23 VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L24] COND TRUE ~j0~0 < 0 VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L26] FCALL call ~#sf_u~0 := #Ultimate.alloc(4); [L27] FCALL call write~int(~bitwiseAnd(~i0~0, 2147483648), { base: ~#sf_u~0!base, offset: ~#sf_u~0!offset }, 4); [L28] FCALL call #t~mem2 := read~real({ base: ~#sf_u~0!base, offset: ~#sf_u~0!offset }, 4); [L28] FCALL call write~real(#t~mem2, ~iptr, 4); [L28] havoc #t~mem2; [L26] FCALL call ULTIMATE.dealloc(~#sf_u~0); [L26] havoc ~#sf_u~0; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L30] #res := ~x; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, #res=7.0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L106] RET call #t~ret18 := modf_float(~x~0, ~#iptr~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret18=7.0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~x~0=7.0] [L106] ~res~0 := #t~ret18; [L106] havoc #t~ret18; [L109] FCALL call #t~mem19 := read~real(~#iptr~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] CALL call #t~ret20 := isinf_float(#t~mem19); VAL [#in~x=19.0, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L86-L95] ~x := #in~x; [L87] havoc ~ix~2; VAL [#in~x=19.0, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0, ~x=19.0] [L89] FCALL call ~#gf_u~4 := #Ultimate.alloc(4); [L90] FCALL call write~real(~x, { base: ~#gf_u~4!base, offset: ~#gf_u~4!offset }, 4); [L91] FCALL call #t~mem15 := read~int({ base: ~#gf_u~4!base, offset: ~#gf_u~4!offset }, 4); [L91] ~ix~2 := (if #t~mem15 % 4294967296 % 4294967296 <= 2147483647 then #t~mem15 % 4294967296 % 4294967296 else #t~mem15 % 4294967296 % 4294967296 - 4294967296); [L91] FCALL call write~real(#t~union16, { base: ~#gf_u~4!base, offset: ~#gf_u~4!offset }, 4); [L91] havoc #t~mem15; [L91] havoc #t~union16; [L89] FCALL call ULTIMATE.dealloc(~#gf_u~4); [L89] havoc ~#gf_u~4; VAL [#in~x=19.0, #NULL!base=0, #NULL!offset=0, ~ix~2=2, ~one_modf~0=1.0, ~x=19.0] [L93] ~ix~2 := ~bitwiseAnd(~ix~2, 2147483647); [L94] #res := (if 2139095040 == ~ix~2 then 1 else 0); VAL [#in~x=19.0, #NULL!base=0, #NULL!offset=0, #res=1, ~ix~2=2139095040, ~one_modf~0=1.0, ~x=19.0] [L109] RET call #t~ret20 := isinf_float(#t~mem19); VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647; [L109] #t~short23 := 0 != #t~ret20; VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, #t~short23=true, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] COND TRUE #t~short23 [L109] #t~short22 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] COND FALSE !(#t~short22) VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] #t~short23 := !#t~short22; VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] COND TRUE #t~short23 [L109] havoc #t~mem19; [L109] havoc #t~short23; [L109] havoc #t~ret21; [L109] havoc #t~ret20; [L109] havoc #t~short22; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L110] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=11, #NULL!offset=6, old(#NULL!base)=11, old(#NULL!offset)=6, old(~one_modf~0)=9.0, ~one_modf~0=9.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L12] ~one_modf~0 := 1.0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=11, old(#NULL!offset)=6, old(~one_modf~0)=9.0, ~one_modf~0=1.0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [?] CALL call #t~ret24 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L104] ~x~0 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0); [L105] FCALL call ~#iptr~0 := #Ultimate.alloc(4); [L105] FCALL call write~init~real(#t~nondet17, ~#iptr~0, 4); [L105] havoc #t~nondet17; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0] [L106] CALL call #t~ret18 := modf_float(~x~0, ~#iptr~0); VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L14-L71] ~x := #in~x; [L14-L71] ~iptr := #in~iptr; [L15] havoc ~i0~0; [L15] havoc ~j0~0; [L16] havoc ~i~0; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~iptr!base=21, ~iptr!offset=0, ~one_modf~0=1.0, ~x=7.0] [L18] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L19] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L20] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] havoc #t~mem0; [L20] havoc #t~union1; [L18] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L18] havoc ~#gf_u~0; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~one_modf~0=1.0, ~x=7.0] [L22] ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~one_modf~0=1.0, ~x=7.0] [L23] COND TRUE ~j0~0 < 23 VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L24] COND TRUE ~j0~0 < 0 VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L26] FCALL call ~#sf_u~0 := #Ultimate.alloc(4); [L27] FCALL call write~int(~bitwiseAnd(~i0~0, 2147483648), { base: ~#sf_u~0!base, offset: ~#sf_u~0!offset }, 4); [L28] FCALL call #t~mem2 := read~real({ base: ~#sf_u~0!base, offset: ~#sf_u~0!offset }, 4); [L28] FCALL call write~real(#t~mem2, ~iptr, 4); [L28] havoc #t~mem2; [L26] FCALL call ULTIMATE.dealloc(~#sf_u~0); [L26] havoc ~#sf_u~0; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L30] #res := ~x; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, #res=7.0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L106] RET call #t~ret18 := modf_float(~x~0, ~#iptr~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret18=7.0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~x~0=7.0] [L106] ~res~0 := #t~ret18; [L106] havoc #t~ret18; [L109] FCALL call #t~mem19 := read~real(~#iptr~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] CALL call #t~ret20 := isinf_float(#t~mem19); VAL [#in~x=19.0, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L86-L95] ~x := #in~x; [L87] havoc ~ix~2; VAL [#in~x=19.0, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0, ~x=19.0] [L89] FCALL call ~#gf_u~4 := #Ultimate.alloc(4); [L90] FCALL call write~real(~x, { base: ~#gf_u~4!base, offset: ~#gf_u~4!offset }, 4); [L91] FCALL call #t~mem15 := read~int({ base: ~#gf_u~4!base, offset: ~#gf_u~4!offset }, 4); [L91] ~ix~2 := (if #t~mem15 % 4294967296 % 4294967296 <= 2147483647 then #t~mem15 % 4294967296 % 4294967296 else #t~mem15 % 4294967296 % 4294967296 - 4294967296); [L91] FCALL call write~real(#t~union16, { base: ~#gf_u~4!base, offset: ~#gf_u~4!offset }, 4); [L91] havoc #t~mem15; [L91] havoc #t~union16; [L89] FCALL call ULTIMATE.dealloc(~#gf_u~4); [L89] havoc ~#gf_u~4; VAL [#in~x=19.0, #NULL!base=0, #NULL!offset=0, ~ix~2=2, ~one_modf~0=1.0, ~x=19.0] [L93] ~ix~2 := ~bitwiseAnd(~ix~2, 2147483647); [L94] #res := (if 2139095040 == ~ix~2 then 1 else 0); VAL [#in~x=19.0, #NULL!base=0, #NULL!offset=0, #res=1, ~ix~2=2139095040, ~one_modf~0=1.0, ~x=19.0] [L109] RET call #t~ret20 := isinf_float(#t~mem19); VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647; [L109] #t~short23 := 0 != #t~ret20; VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, #t~short23=true, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] COND TRUE #t~short23 [L109] #t~short22 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] COND FALSE !(#t~short22) VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] #t~short23 := !#t~short22; VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] COND TRUE #t~short23 [L109] havoc #t~mem19; [L109] havoc #t~short23; [L109] havoc #t~ret21; [L109] havoc #t~ret20; [L109] havoc #t~short22; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L110] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=11, #NULL!offset=6, old(#NULL!base)=11, old(#NULL!offset)=6, old(~one_modf~0)=9.0, ~one_modf~0=9.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L12] ~one_modf~0 := 1.0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=11, old(#NULL!offset)=6, old(~one_modf~0)=9.0, ~one_modf~0=1.0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [?] CALL call #t~ret24 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L104] ~x~0 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0); [L105] FCALL call ~#iptr~0 := #Ultimate.alloc(4); [L105] FCALL call write~init~real(#t~nondet17, ~#iptr~0, 4); [L105] havoc #t~nondet17; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0] [L106] CALL call #t~ret18 := modf_float(~x~0, ~#iptr~0); VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L14-L71] ~x := #in~x; [L14-L71] ~iptr := #in~iptr; [L15] havoc ~i0~0; [L15] havoc ~j0~0; [L16] havoc ~i~0; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~iptr!base=21, ~iptr!offset=0, ~one_modf~0=1.0, ~x=7.0] [L18] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L19] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L20] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] havoc #t~mem0; [L20] havoc #t~union1; [L18] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L18] havoc ~#gf_u~0; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~one_modf~0=1.0, ~x=7.0] [L22] ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~one_modf~0=1.0, ~x=7.0] [L23] COND TRUE ~j0~0 < 23 VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L24] COND TRUE ~j0~0 < 0 VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L26] FCALL call ~#sf_u~0 := #Ultimate.alloc(4); [L27] FCALL call write~int(~bitwiseAnd(~i0~0, 2147483648), { base: ~#sf_u~0!base, offset: ~#sf_u~0!offset }, 4); [L28] FCALL call #t~mem2 := read~real({ base: ~#sf_u~0!base, offset: ~#sf_u~0!offset }, 4); [L28] FCALL call write~real(#t~mem2, ~iptr, 4); [L28] havoc #t~mem2; [L26] FCALL call ULTIMATE.dealloc(~#sf_u~0); [L26] havoc ~#sf_u~0; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L30] #res := ~x; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, #res=7.0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L106] RET call #t~ret18 := modf_float(~x~0, ~#iptr~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret18=7.0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~x~0=7.0] [L106] ~res~0 := #t~ret18; [L106] havoc #t~ret18; [L109] FCALL call #t~mem19 := read~real(~#iptr~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] CALL call #t~ret20 := isinf_float(#t~mem19); VAL [#in~x=19.0, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L86-L95] ~x := #in~x; [L87] havoc ~ix~2; VAL [#in~x=19.0, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0, ~x=19.0] [L89] FCALL call ~#gf_u~4 := #Ultimate.alloc(4); [L90] FCALL call write~real(~x, { base: ~#gf_u~4!base, offset: ~#gf_u~4!offset }, 4); [L91] FCALL call #t~mem15 := read~int({ base: ~#gf_u~4!base, offset: ~#gf_u~4!offset }, 4); [L91] ~ix~2 := (if #t~mem15 % 4294967296 % 4294967296 <= 2147483647 then #t~mem15 % 4294967296 % 4294967296 else #t~mem15 % 4294967296 % 4294967296 - 4294967296); [L91] FCALL call write~real(#t~union16, { base: ~#gf_u~4!base, offset: ~#gf_u~4!offset }, 4); [L91] havoc #t~mem15; [L91] havoc #t~union16; [L89] FCALL call ULTIMATE.dealloc(~#gf_u~4); [L89] havoc ~#gf_u~4; VAL [#in~x=19.0, #NULL!base=0, #NULL!offset=0, ~ix~2=2, ~one_modf~0=1.0, ~x=19.0] [L93] ~ix~2 := ~bitwiseAnd(~ix~2, 2147483647); [L94] #res := (if 2139095040 == ~ix~2 then 1 else 0); VAL [#in~x=19.0, #NULL!base=0, #NULL!offset=0, #res=1, ~ix~2=2139095040, ~one_modf~0=1.0, ~x=19.0] [L109] RET call #t~ret20 := isinf_float(#t~mem19); VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647; [L109] #t~short23 := 0 != #t~ret20; VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, #t~short23=true, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] COND TRUE #t~short23 [L109] #t~short22 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] COND FALSE !(#t~short22) VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] #t~short23 := !#t~short22; VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] COND TRUE #t~short23 [L109] havoc #t~mem19; [L109] havoc #t~short23; [L109] havoc #t~ret21; [L109] havoc #t~ret20; [L109] havoc #t~short22; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L110] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=11, #NULL!offset=6, old(#NULL!base)=11, old(#NULL!offset)=6, old(~one_modf~0)=9.0, ~one_modf~0=9.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L12] ~one_modf~0 := 1.0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=11, old(#NULL!offset)=6, old(~one_modf~0)=9.0, ~one_modf~0=1.0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [?] CALL call #t~ret24 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L104] ~x~0 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0); [L105] FCALL call ~#iptr~0 := #Ultimate.alloc(4); [L105] FCALL call write~init~real(#t~nondet17, ~#iptr~0, 4); [L105] havoc #t~nondet17; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0] [L106] CALL call #t~ret18 := modf_float(~x~0, ~#iptr~0); VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L14-L71] ~x := #in~x; [L14-L71] ~iptr := #in~iptr; [L15] havoc ~i0~0; [L15] havoc ~j0~0; [L16] havoc ~i~0; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~iptr!base=21, ~iptr!offset=0, ~one_modf~0=1.0, ~x=7.0] [L18] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L19] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L20] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] havoc #t~mem0; [L20] havoc #t~union1; [L18] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L18] havoc ~#gf_u~0; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~one_modf~0=1.0, ~x=7.0] [L22] ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~one_modf~0=1.0, ~x=7.0] [L23] COND TRUE ~j0~0 < 23 VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L24] COND TRUE ~j0~0 < 0 VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L26] FCALL call ~#sf_u~0 := #Ultimate.alloc(4); [L27] FCALL call write~int(~bitwiseAnd(~i0~0, 2147483648), { base: ~#sf_u~0!base, offset: ~#sf_u~0!offset }, 4); [L28] FCALL call #t~mem2 := read~real({ base: ~#sf_u~0!base, offset: ~#sf_u~0!offset }, 4); [L28] FCALL call write~real(#t~mem2, ~iptr, 4); [L28] havoc #t~mem2; [L26] FCALL call ULTIMATE.dealloc(~#sf_u~0); [L26] havoc ~#sf_u~0; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L30] #res := ~x; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, #res=7.0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L106] RET call #t~ret18 := modf_float(~x~0, ~#iptr~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret18=7.0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~x~0=7.0] [L106] ~res~0 := #t~ret18; [L106] havoc #t~ret18; [L109] FCALL call #t~mem19 := read~real(~#iptr~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] CALL call #t~ret20 := isinf_float(#t~mem19); VAL [#in~x=19.0, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L86-L95] ~x := #in~x; [L87] havoc ~ix~2; VAL [#in~x=19.0, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0, ~x=19.0] [L89] FCALL call ~#gf_u~4 := #Ultimate.alloc(4); [L90] FCALL call write~real(~x, { base: ~#gf_u~4!base, offset: ~#gf_u~4!offset }, 4); [L91] FCALL call #t~mem15 := read~int({ base: ~#gf_u~4!base, offset: ~#gf_u~4!offset }, 4); [L91] ~ix~2 := (if #t~mem15 % 4294967296 % 4294967296 <= 2147483647 then #t~mem15 % 4294967296 % 4294967296 else #t~mem15 % 4294967296 % 4294967296 - 4294967296); [L91] FCALL call write~real(#t~union16, { base: ~#gf_u~4!base, offset: ~#gf_u~4!offset }, 4); [L91] havoc #t~mem15; [L91] havoc #t~union16; [L89] FCALL call ULTIMATE.dealloc(~#gf_u~4); [L89] havoc ~#gf_u~4; VAL [#in~x=19.0, #NULL!base=0, #NULL!offset=0, ~ix~2=2, ~one_modf~0=1.0, ~x=19.0] [L93] ~ix~2 := ~bitwiseAnd(~ix~2, 2147483647); [L94] #res := (if 2139095040 == ~ix~2 then 1 else 0); VAL [#in~x=19.0, #NULL!base=0, #NULL!offset=0, #res=1, ~ix~2=2139095040, ~one_modf~0=1.0, ~x=19.0] [L109] RET call #t~ret20 := isinf_float(#t~mem19); VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647; [L109] #t~short23 := 0 != #t~ret20; VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, #t~short23=true, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] COND TRUE #t~short23 [L109] #t~short22 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] COND FALSE !(#t~short22) VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] #t~short23 := !#t~short22; VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] COND TRUE #t~short23 [L109] havoc #t~mem19; [L109] havoc #t~short23; [L109] havoc #t~ret21; [L109] havoc #t~ret20; [L109] havoc #t~short22; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L110] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L12] static const float one_modf = 1.0; VAL [\old(one_modf)=9, one_modf=1] [L104] float x = 1.0f / 0.0f; [L105] float iptr = __VERIFIER_nondet_float(); [L106] CALL, EXPR modf_float(x, &iptr) VAL [\old(x)=7, iptr={21:0}, one_modf=1] [L15] __int32_t i0, j0; [L16] __uint32_t i; VAL [\old(x)=7, iptr={21:0}, iptr={21:0}, one_modf=1, x=7] [L18] ieee_float_shape_type gf_u; [L19] gf_u.value = (x) [L20] EXPR gf_u.word [L20] (i0) = gf_u.word [L22] j0 = ((i0 >> 23) & 0xff) - 0x7f VAL [\old(x)=7, i0=5, iptr={21:0}, iptr={21:0}, one_modf=1, x=7] [L23] COND TRUE j0 < 23 VAL [\old(x)=7, i0=5, iptr={21:0}, iptr={21:0}, j0=-1, one_modf=1, x=7] [L24] COND TRUE j0 < 0 VAL [\old(x)=7, i0=5, iptr={21:0}, iptr={21:0}, j0=-1, one_modf=1, x=7] [L26] ieee_float_shape_type sf_u; [L27] sf_u.word = (i0 & 0x80000000) [L28] EXPR sf_u.value [L28] (*iptr) = sf_u.value [L30] return x; VAL [\old(x)=7, \result=7, i0=5, iptr={21:0}, iptr={21:0}, j0=-1, one_modf=1, x=7] [L106] RET, EXPR modf_float(x, &iptr) VAL [iptr={21:0}, modf_float(x, &iptr)=7, one_modf=1, x=7] [L106] float res = modf_float(x, &iptr); [L109] EXPR \read(iptr) VAL [\read(iptr)=19, iptr={21:0}, one_modf=1, res=7, x=7] [L109] CALL, EXPR isinf_float(iptr) VAL [\old(x)=19, one_modf=1] [L87] __int32_t ix; VAL [\old(x)=19, one_modf=1, x=19] [L89] ieee_float_shape_type gf_u; [L90] gf_u.value = (x) [L91] EXPR gf_u.word [L91] (ix) = gf_u.word [L93] ix &= 0x7fffffff [L94] return ((ix) == 0x7f800000L); VAL [\old(x)=19, \result=1, ix=2139095040, one_modf=1, x=19] [L109] RET, EXPR isinf_float(iptr) VAL [\read(iptr)=19, iptr={21:0}, isinf_float(iptr)=1, one_modf=1, res=7, x=7] [L109] isinf_float(iptr) && !(res == 0.0f && __signbit_float(res) == 0) [L109] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [\read(iptr)=19, iptr={21:0}, isinf_float(iptr)=1, isinf_float(iptr) && !(res == 0.0f && __signbit_float(res) == 0)=1, one_modf=1, res=7, res == 0.0f && __signbit_float(res) == 0=0, x=7] [L109] isinf_float(iptr) && !(res == 0.0f && __signbit_float(res) == 0) VAL [\read(iptr)=19, iptr={21:0}, isinf_float(iptr)=1, isinf_float(iptr) && !(res == 0.0f && __signbit_float(res) == 0)=1, one_modf=1, res=7, res == 0.0f && __signbit_float(res) == 0=0, x=7] [L109] COND TRUE isinf_float(iptr) && !(res == 0.0f && __signbit_float(res) == 0) [L110] __VERIFIER_error() VAL [iptr={21:0}, one_modf=1, res=7, x=7] ----- [2018-11-22 21:23:11,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:23:11 BoogieIcfgContainer [2018-11-22 21:23:11,159 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 21:23:11,160 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 21:23:11,160 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 21:23:11,160 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 21:23:11,161 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:23:10" (3/4) ... [2018-11-22 21:23:11,164 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 21:23:11,164 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 21:23:11,164 INFO L168 Benchmark]: Toolchain (without parser) took 1024.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -93.1 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. [2018-11-22 21:23:11,166 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:23:11,166 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.55 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 944.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-22 21:23:11,167 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -185.6 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-22 21:23:11,167 INFO L168 Benchmark]: Boogie Preprocessor took 24.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:23:11,168 INFO L168 Benchmark]: RCFGBuilder took 282.45 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: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2018-11-22 21:23:11,168 INFO L168 Benchmark]: TraceAbstraction took 449.66 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: 48.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 11.5 GB. [2018-11-22 21:23:11,168 INFO L168 Benchmark]: Witness Printer took 3.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:23:11,171 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 201.55 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 944.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -185.6 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 282.45 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: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 449.66 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: 48.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 110]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryArithmeticFLOAToperation at line 104, overapproximation of bitwiseAnd at line 93. Possible FailurePath: [L12] static const float one_modf = 1.0; VAL [\old(one_modf)=9, one_modf=1] [L104] float x = 1.0f / 0.0f; [L105] float iptr = __VERIFIER_nondet_float(); [L106] CALL, EXPR modf_float(x, &iptr) VAL [\old(x)=7, iptr={21:0}, one_modf=1] [L15] __int32_t i0, j0; [L16] __uint32_t i; VAL [\old(x)=7, iptr={21:0}, iptr={21:0}, one_modf=1, x=7] [L18] ieee_float_shape_type gf_u; [L19] gf_u.value = (x) [L20] EXPR gf_u.word [L20] (i0) = gf_u.word [L22] j0 = ((i0 >> 23) & 0xff) - 0x7f VAL [\old(x)=7, i0=5, iptr={21:0}, iptr={21:0}, one_modf=1, x=7] [L23] COND TRUE j0 < 23 VAL [\old(x)=7, i0=5, iptr={21:0}, iptr={21:0}, j0=-1, one_modf=1, x=7] [L24] COND TRUE j0 < 0 VAL [\old(x)=7, i0=5, iptr={21:0}, iptr={21:0}, j0=-1, one_modf=1, x=7] [L26] ieee_float_shape_type sf_u; [L27] sf_u.word = (i0 & 0x80000000) [L28] EXPR sf_u.value [L28] (*iptr) = sf_u.value [L30] return x; VAL [\old(x)=7, \result=7, i0=5, iptr={21:0}, iptr={21:0}, j0=-1, one_modf=1, x=7] [L106] RET, EXPR modf_float(x, &iptr) VAL [iptr={21:0}, modf_float(x, &iptr)=7, one_modf=1, x=7] [L106] float res = modf_float(x, &iptr); [L109] EXPR \read(iptr) VAL [\read(iptr)=19, iptr={21:0}, one_modf=1, res=7, x=7] [L109] CALL, EXPR isinf_float(iptr) VAL [\old(x)=19, one_modf=1] [L87] __int32_t ix; VAL [\old(x)=19, one_modf=1, x=19] [L89] ieee_float_shape_type gf_u; [L90] gf_u.value = (x) [L91] EXPR gf_u.word [L91] (ix) = gf_u.word [L93] ix &= 0x7fffffff [L94] return ((ix) == 0x7f800000L); VAL [\old(x)=19, \result=1, ix=2139095040, one_modf=1, x=19] [L109] RET, EXPR isinf_float(iptr) VAL [\read(iptr)=19, iptr={21:0}, isinf_float(iptr)=1, one_modf=1, res=7, x=7] [L109] isinf_float(iptr) && !(res == 0.0f && __signbit_float(res) == 0) [L109] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [\read(iptr)=19, iptr={21:0}, isinf_float(iptr)=1, isinf_float(iptr) && !(res == 0.0f && __signbit_float(res) == 0)=1, one_modf=1, res=7, res == 0.0f && __signbit_float(res) == 0=0, x=7] [L109] isinf_float(iptr) && !(res == 0.0f && __signbit_float(res) == 0) VAL [\read(iptr)=19, iptr={21:0}, isinf_float(iptr)=1, isinf_float(iptr) && !(res == 0.0f && __signbit_float(res) == 0)=1, one_modf=1, res=7, res == 0.0f && __signbit_float(res) == 0=0, x=7] [L109] COND TRUE isinf_float(iptr) && !(res == 0.0f && __signbit_float(res) == 0) [L110] __VERIFIER_error() VAL [iptr={21:0}, one_modf=1, res=7, x=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 59 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 122 SDtfs, 0 SDslu, 54 SDs, 0 SdLazy, 4 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 1546 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-22 21:23:12,613 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:23:12,615 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:23:12,623 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:23:12,623 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:23:12,624 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:23:12,625 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:23:12,626 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:23:12,627 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:23:12,627 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:23:12,628 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:23:12,628 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:23:12,629 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:23:12,629 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:23:12,630 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:23:12,630 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:23:12,631 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:23:12,632 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:23:12,633 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:23:12,634 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:23:12,635 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:23:12,636 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:23:12,637 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:23:12,637 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:23:12,638 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:23:12,638 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:23:12,639 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:23:12,639 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:23:12,640 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:23:12,641 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:23:12,641 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:23:12,641 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:23:12,641 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:23:12,641 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:23:12,642 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:23:12,642 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:23:12,643 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-22 21:23:12,652 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:23:12,653 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:23:12,653 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 21:23:12,653 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 21:23:12,654 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 21:23:12,654 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 21:23:12,654 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 21:23:12,654 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:23:12,654 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 21:23:12,654 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 21:23:12,655 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:23:12,655 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 21:23:12,655 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 21:23:12,655 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 21:23:12,655 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-22 21:23:12,655 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-22 21:23:12,655 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 21:23:12,655 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:23:12,655 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:23:12,656 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 21:23:12,656 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:23:12,656 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 21:23:12,656 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 21:23:12,656 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 21:23:12,656 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:23:12,656 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:23:12,657 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 21:23:12,657 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 21:23:12,657 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-22 21:23:12,657 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 21:23:12,657 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-22 21:23:12,657 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-22 21:23:12,657 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/bin-2019/uautomizer 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 -> 0186804fc9e8cef09b3a1cefd7c260de08abc9c3 [2018-11-22 21:23:12,688 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:23:12,697 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:23:12,700 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:23:12,701 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:23:12,701 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:23:12,702 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1211a_true-unreach-call.c [2018-11-22 21:23:12,736 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/bin-2019/uautomizer/data/6b65785a8/a709d4bf77444ebaac523861127f40b5/FLAG98aca78c8 [2018-11-22 21:23:13,138 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:23:13,139 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/sv-benchmarks/c/float-newlib/float_req_bl_1211a_true-unreach-call.c [2018-11-22 21:23:13,142 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/bin-2019/uautomizer/data/6b65785a8/a709d4bf77444ebaac523861127f40b5/FLAG98aca78c8 [2018-11-22 21:23:13,152 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/bin-2019/uautomizer/data/6b65785a8/a709d4bf77444ebaac523861127f40b5 [2018-11-22 21:23:13,155 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:23:13,156 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:23:13,157 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:23:13,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:23:13,160 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:23:13,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:23:13" (1/1) ... [2018-11-22 21:23:13,163 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f089c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:23:13, skipping insertion in model container [2018-11-22 21:23:13,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:23:13" (1/1) ... [2018-11-22 21:23:13,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:23:13,187 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:23:13,331 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:23:13,342 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:23:13,365 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:23:13,376 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:23:13,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:23:13 WrapperNode [2018-11-22 21:23:13,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:23:13,377 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:23:13,377 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:23:13,377 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:23:13,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:23:13" (1/1) ... [2018-11-22 21:23:13,390 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:23:13" (1/1) ... [2018-11-22 21:23:13,394 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:23:13,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:23:13,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:23:13,395 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:23:13,400 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:23:13" (1/1) ... [2018-11-22 21:23:13,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:23:13" (1/1) ... [2018-11-22 21:23:13,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:23:13" (1/1) ... [2018-11-22 21:23:13,405 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:23:13" (1/1) ... [2018-11-22 21:23:13,454 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:23:13" (1/1) ... [2018-11-22 21:23:13,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:23:13" (1/1) ... [2018-11-22 21:23:13,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:23:13" (1/1) ... [2018-11-22 21:23:13,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:23:13,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:23:13,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:23:13,462 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:23:13,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:23:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:23:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2018-11-22 21:23:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 21:23:13,494 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 21:23:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-11-22 21:23:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure modf_float [2018-11-22 21:23:13,494 INFO L138 BoogieDeclarations]: Found implementation of procedure modf_float [2018-11-22 21:23:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_float [2018-11-22 21:23:13,494 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_float [2018-11-22 21:23:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 21:23:13,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 21:23:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 21:23:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-22 21:23:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:23:13,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:23:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-11-22 21:23:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_float [2018-11-22 21:23:13,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_float [2018-11-22 21:23:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-22 21:23:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 21:23:13,649 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-22 21:23:13,683 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-22 21:23:13,690 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-22 21:23:13,766 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-22 21:23:13,791 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-22 21:23:13,807 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-22 21:23:13,815 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-22 21:23:13,845 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-22 21:23:13,849 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:23:13,849 INFO L280 CfgBuilder]: Removed 18 assue(true) statements. [2018-11-22 21:23:13,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:23:13 BoogieIcfgContainer [2018-11-22 21:23:13,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:23:13,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 21:23:13,851 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 21:23:13,853 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 21:23:13,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:23:13" (1/3) ... [2018-11-22 21:23:13,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53cfe0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:23:13, skipping insertion in model container [2018-11-22 21:23:13,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:23:13" (2/3) ... [2018-11-22 21:23:13,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53cfe0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:23:13, skipping insertion in model container [2018-11-22 21:23:13,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:23:13" (3/3) ... [2018-11-22 21:23:13,856 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1211a_true-unreach-call.c [2018-11-22 21:23:13,864 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 21:23:13,874 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 21:23:13,883 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 21:23:13,902 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 21:23:13,902 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 21:23:13,902 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 21:23:13,902 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 21:23:13,902 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 21:23:13,902 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 21:23:13,902 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 21:23:13,902 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 21:23:13,903 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 21:23:13,914 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-11-22 21:23:13,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-22 21:23:13,918 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:23:13,919 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, 1, 1, 1, 1, 1, 1] [2018-11-22 21:23:13,920 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:23:13,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:23:13,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1328912444, now seen corresponding path program 1 times [2018-11-22 21:23:13,926 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:23:13,926 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/bin-2019/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-22 21:23:13,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:23:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:23:14,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:23:14,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:23:14,036 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:23:14,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:23:14,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 21:23:14,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-22 21:23:14,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-22 21:23:14,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 21:23:14,061 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 2 states. [2018-11-22 21:23:14,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:23:14,081 INFO L93 Difference]: Finished difference Result 110 states and 158 transitions. [2018-11-22 21:23:14,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-22 21:23:14,082 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-11-22 21:23:14,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:23:14,088 INFO L225 Difference]: With dead ends: 110 [2018-11-22 21:23:14,088 INFO L226 Difference]: Without dead ends: 55 [2018-11-22 21:23:14,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 21:23:14,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-22 21:23:14,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-22 21:23:14,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-22 21:23:14,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-11-22 21:23:14,117 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 27 [2018-11-22 21:23:14,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:23:14,117 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-22 21:23:14,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-22 21:23:14,117 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-11-22 21:23:14,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-22 21:23:14,118 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:23:14,118 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:23:14,119 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:23:14,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:23:14,119 INFO L82 PathProgramCache]: Analyzing trace with hash -2017954314, now seen corresponding path program 1 times [2018-11-22 21:23:14,120 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:23:14,120 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/bin-2019/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-22 21:23:14,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:23:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:23:14,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:23:14,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:23:14,309 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:23:14,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:23:14,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-22 21:23:14,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-22 21:23:14,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-22 21:23:14,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-22 21:23:14,323 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 7 states. [2018-11-22 21:23:15,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:23:15,030 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-11-22 21:23:15,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-22 21:23:15,031 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-11-22 21:23:15,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:23:15,032 INFO L225 Difference]: With dead ends: 82 [2018-11-22 21:23:15,032 INFO L226 Difference]: Without dead ends: 42 [2018-11-22 21:23:15,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-22 21:23:15,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-22 21:23:15,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-22 21:23:15,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-22 21:23:15,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-11-22 21:23:15,037 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 30 [2018-11-22 21:23:15,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:23:15,037 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-22 21:23:15,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-22 21:23:15,038 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-22 21:23:15,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-22 21:23:15,038 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:23:15,038 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:23:15,039 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:23:15,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:23:15,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1555916386, now seen corresponding path program 1 times [2018-11-22 21:23:15,039 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:23:15,039 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/bin-2019/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-11-22 21:23:15,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:23:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:23:15,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:23:15,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:23:15,146 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:23:15,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:23:15,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:23:15,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:23:15,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:23:15,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:23:15,155 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 3 states. [2018-11-22 21:23:15,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:23:15,162 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-22 21:23:15,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:23:15,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-22 21:23:15,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:23:15,163 INFO L225 Difference]: With dead ends: 45 [2018-11-22 21:23:15,163 INFO L226 Difference]: Without dead ends: 42 [2018-11-22 21:23:15,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:23:15,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-22 21:23:15,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-22 21:23:15,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-22 21:23:15,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-22 21:23:15,167 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 31 [2018-11-22 21:23:15,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:23:15,168 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-22 21:23:15,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:23:15,168 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-22 21:23:15,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-22 21:23:15,168 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:23:15,168 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:23:15,169 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:23:15,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:23:15,169 INFO L82 PathProgramCache]: Analyzing trace with hash -597431019, now seen corresponding path program 1 times [2018-11-22 21:23:15,169 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:23:15,169 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/bin-2019/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-11-22 21:23:15,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:23:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:23:15,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:23:15,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:23:15,414 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:23:15,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:23:15,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-22 21:23:15,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-22 21:23:15,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-22 21:23:15,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-22 21:23:15,426 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 10 states. [2018-11-22 21:23:16,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:23:16,173 INFO L93 Difference]: Finished difference Result 46 states and 45 transitions. [2018-11-22 21:23:16,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-22 21:23:16,173 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-11-22 21:23:16,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:23:16,174 INFO L225 Difference]: With dead ends: 46 [2018-11-22 21:23:16,174 INFO L226 Difference]: Without dead ends: 42 [2018-11-22 21:23:16,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-11-22 21:23:16,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-22 21:23:16,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-22 21:23:16,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-22 21:23:16,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 41 transitions. [2018-11-22 21:23:16,179 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 41 transitions. Word has length 33 [2018-11-22 21:23:16,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:23:16,179 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 41 transitions. [2018-11-22 21:23:16,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-22 21:23:16,180 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 41 transitions. [2018-11-22 21:23:16,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-22 21:23:16,181 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:23:16,181 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:23:16,181 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:23:16,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:23:16,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1539485821, now seen corresponding path program 1 times [2018-11-22 21:23:16,182 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:23:16,182 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/bin-2019/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-11-22 21:23:16,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:23:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:23:16,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:23:16,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:23:16,572 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:23:16,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:23:16,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-22 21:23:16,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-22 21:23:16,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-22 21:23:16,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-22 21:23:16,581 INFO L87 Difference]: Start difference. First operand 42 states and 41 transitions. Second operand 15 states. [2018-11-22 21:23:18,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:23:18,617 INFO L93 Difference]: Finished difference Result 42 states and 41 transitions. [2018-11-22 21:23:18,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-22 21:23:18,618 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-11-22 21:23:18,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:23:18,618 INFO L225 Difference]: With dead ends: 42 [2018-11-22 21:23:18,618 INFO L226 Difference]: Without dead ends: 0 [2018-11-22 21:23:18,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2018-11-22 21:23:18,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-22 21:23:18,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-22 21:23:18,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-22 21:23:18,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-22 21:23:18,620 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2018-11-22 21:23:18,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:23:18,620 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 21:23:18,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-22 21:23:18,620 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-22 21:23:18,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-22 21:23:18,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-22 21:23:18,821 INFO L448 ceAbstractionStarter]: For program point L88-1(lines 88 92) no Hoare annotation was computed. [2018-11-22 21:23:18,821 INFO L451 ceAbstractionStarter]: At program point L88-2(lines 88 92) the Hoare annotation is: true [2018-11-22 21:23:18,822 INFO L448 ceAbstractionStarter]: For program point L88-3(lines 88 92) no Hoare annotation was computed. [2018-11-22 21:23:18,822 INFO L451 ceAbstractionStarter]: At program point isinf_floatENTRY(lines 86 95) the Hoare annotation is: true [2018-11-22 21:23:18,822 INFO L448 ceAbstractionStarter]: For program point isinf_floatEXIT(lines 86 95) no Hoare annotation was computed. [2018-11-22 21:23:18,822 INFO L448 ceAbstractionStarter]: For program point isinf_floatFINAL(lines 86 95) no Hoare annotation was computed. [2018-11-22 21:23:18,822 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-22 21:23:18,822 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-22 21:23:18,822 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-22 21:23:18,822 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-22 21:23:18,822 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-22 21:23:18,822 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-22 21:23:18,822 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-22 21:23:18,822 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 97 115) no Hoare annotation was computed. [2018-11-22 21:23:18,822 INFO L448 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2018-11-22 21:23:18,822 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 97 115) no Hoare annotation was computed. [2018-11-22 21:23:18,823 INFO L444 ceAbstractionStarter]: At program point L106(line 106) the Hoare annotation is: (= main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) [2018-11-22 21:23:18,823 INFO L448 ceAbstractionStarter]: For program point L106-1(line 106) no Hoare annotation was computed. [2018-11-22 21:23:18,823 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 97 115) the Hoare annotation is: true [2018-11-22 21:23:18,823 INFO L444 ceAbstractionStarter]: At program point L109(line 109) the Hoare annotation is: (and (exists ((modf_float_~ix~1 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) modf_float_~ix~1) ((_ extract 30 23) modf_float_~ix~1) ((_ extract 22 0) modf_float_~ix~1)) (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (= (let ((.cse0 (bvand (_ bv2147483648 32) modf_float_~ix~1))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) main_~res~0))) (= main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))) [2018-11-22 21:23:18,823 INFO L448 ceAbstractionStarter]: For program point L109-1(line 109) no Hoare annotation was computed. [2018-11-22 21:23:18,823 INFO L448 ceAbstractionStarter]: For program point L109-2(line 109) no Hoare annotation was computed. [2018-11-22 21:23:18,823 INFO L448 ceAbstractionStarter]: For program point L109-3(line 109) no Hoare annotation was computed. [2018-11-22 21:23:18,823 INFO L444 ceAbstractionStarter]: At program point L109-4(line 109) the Hoare annotation is: (and (exists ((modf_float_~ix~1 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) modf_float_~ix~1) ((_ extract 30 23) modf_float_~ix~1) ((_ extract 22 0) modf_float_~ix~1)) (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (= (let ((.cse0 (bvand (_ bv2147483648 32) modf_float_~ix~1))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) main_~res~0))) (= main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) |main_#t~short22|) [2018-11-22 21:23:18,823 INFO L448 ceAbstractionStarter]: For program point L109-5(line 109) no Hoare annotation was computed. [2018-11-22 21:23:18,823 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2018-11-22 21:23:18,823 INFO L448 ceAbstractionStarter]: For program point L109-7(line 109) no Hoare annotation was computed. [2018-11-22 21:23:18,824 INFO L448 ceAbstractionStarter]: For program point L109-9(lines 109 112) no Hoare annotation was computed. [2018-11-22 21:23:18,824 INFO L448 ceAbstractionStarter]: For program point L64(lines 64 68) no Hoare annotation was computed. [2018-11-22 21:23:18,824 INFO L448 ceAbstractionStarter]: For program point L64-1(lines 56 70) no Hoare annotation was computed. [2018-11-22 21:23:18,824 INFO L448 ceAbstractionStarter]: For program point L64-2(lines 64 68) no Hoare annotation was computed. [2018-11-22 21:23:18,824 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 70) no Hoare annotation was computed. [2018-11-22 21:23:18,824 INFO L448 ceAbstractionStarter]: For program point modf_floatEXIT(lines 14 71) no Hoare annotation was computed. [2018-11-22 21:23:18,824 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 48 52) no Hoare annotation was computed. [2018-11-22 21:23:18,824 INFO L444 ceAbstractionStarter]: At program point L48-2(lines 48 52) the Hoare annotation is: (and (= modf_float_~x |modf_float_#in~x|) (exists ((modf_float_~i0~0 (_ BitVec 32))) (and (= (bvadd modf_float_~j0~0 (_ bv127 32)) (bvand (_ bv255 32) (bvashr modf_float_~i0~0 (_ bv23 32)))) (= (fp ((_ extract 31 31) modf_float_~i0~0) ((_ extract 30 23) modf_float_~i0~0) ((_ extract 22 0) modf_float_~i0~0)) |modf_float_#in~x|))) (= (fp ((_ extract 31 31) modf_float_~i0~0) ((_ extract 30 23) modf_float_~i0~0) ((_ extract 22 0) modf_float_~i0~0)) |modf_float_#in~x|) (exists ((modf_float_~i0~0 (_ BitVec 32))) (and (bvslt (bvadd (bvand (_ bv255 32) (bvashr modf_float_~i0~0 (_ bv23 32))) (_ bv4294967169 32)) (_ bv23 32)) (= (fp ((_ extract 31 31) modf_float_~i0~0) ((_ extract 30 23) modf_float_~i0~0) ((_ extract 22 0) modf_float_~i0~0)) |modf_float_#in~x|)))) [2018-11-22 21:23:18,824 INFO L448 ceAbstractionStarter]: For program point L48-3(lines 48 52) no Hoare annotation was computed. [2018-11-22 21:23:18,824 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 36 40) no Hoare annotation was computed. [2018-11-22 21:23:18,825 INFO L444 ceAbstractionStarter]: At program point L36-2(lines 36 40) the Hoare annotation is: (and (= modf_float_~x |modf_float_#in~x|) (exists ((modf_float_~i0~0 (_ BitVec 32))) (and (= (bvadd modf_float_~j0~0 (_ bv127 32)) (bvand (_ bv255 32) (bvashr modf_float_~i0~0 (_ bv23 32)))) (= (fp ((_ extract 31 31) modf_float_~i0~0) ((_ extract 30 23) modf_float_~i0~0) ((_ extract 22 0) modf_float_~i0~0)) |modf_float_#in~x|))) (= (fp ((_ extract 31 31) modf_float_~i0~0) ((_ extract 30 23) modf_float_~i0~0) ((_ extract 22 0) modf_float_~i0~0)) |modf_float_#in~x|) (exists ((modf_float_~i0~0 (_ BitVec 32))) (and (bvslt (bvadd (bvand (_ bv255 32) (bvashr modf_float_~i0~0 (_ bv23 32))) (_ bv4294967169 32)) (_ bv23 32)) (= (fp ((_ extract 31 31) modf_float_~i0~0) ((_ extract 30 23) modf_float_~i0~0) ((_ extract 22 0) modf_float_~i0~0)) |modf_float_#in~x|)))) [2018-11-22 21:23:18,825 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 55) no Hoare annotation was computed. [2018-11-22 21:23:18,825 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 45) no Hoare annotation was computed. [2018-11-22 21:23:18,825 INFO L448 ceAbstractionStarter]: For program point L41-1(lines 33 47) no Hoare annotation was computed. [2018-11-22 21:23:18,825 INFO L448 ceAbstractionStarter]: For program point L41-2(lines 41 45) no Hoare annotation was computed. [2018-11-22 21:23:18,825 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 54) no Hoare annotation was computed. [2018-11-22 21:23:18,825 INFO L448 ceAbstractionStarter]: For program point L25-1(lines 25 29) no Hoare annotation was computed. [2018-11-22 21:23:18,825 INFO L444 ceAbstractionStarter]: At program point L25-2(lines 25 29) the Hoare annotation is: (and (= modf_float_~x |modf_float_#in~x|) (exists ((modf_float_~i0~0 (_ BitVec 32))) (and (= (bvadd modf_float_~j0~0 (_ bv127 32)) (bvand (_ bv255 32) (bvashr modf_float_~i0~0 (_ bv23 32)))) (= (fp ((_ extract 31 31) modf_float_~i0~0) ((_ extract 30 23) modf_float_~i0~0) ((_ extract 22 0) modf_float_~i0~0)) |modf_float_#in~x|))) (= (fp ((_ extract 31 31) modf_float_~i0~0) ((_ extract 30 23) modf_float_~i0~0) ((_ extract 22 0) modf_float_~i0~0)) |modf_float_#in~x|) (exists ((modf_float_~i0~0 (_ BitVec 32))) (and (bvslt (bvadd (bvand (_ bv255 32) (bvashr modf_float_~i0~0 (_ bv23 32))) (_ bv4294967169 32)) (_ bv23 32)) (= (fp ((_ extract 31 31) modf_float_~i0~0) ((_ extract 30 23) modf_float_~i0~0) ((_ extract 22 0) modf_float_~i0~0)) |modf_float_#in~x|)))) [2018-11-22 21:23:18,825 INFO L448 ceAbstractionStarter]: For program point L25-3(lines 25 29) no Hoare annotation was computed. [2018-11-22 21:23:18,825 INFO L448 ceAbstractionStarter]: For program point L17-1(lines 17 21) no Hoare annotation was computed. [2018-11-22 21:23:18,825 INFO L444 ceAbstractionStarter]: At program point L17-2(lines 17 21) the Hoare annotation is: (= modf_float_~x |modf_float_#in~x|) [2018-11-22 21:23:18,825 INFO L448 ceAbstractionStarter]: For program point L17-3(lines 17 21) no Hoare annotation was computed. [2018-11-22 21:23:18,825 INFO L448 ceAbstractionStarter]: For program point L59-1(lines 59 63) no Hoare annotation was computed. [2018-11-22 21:23:18,826 INFO L444 ceAbstractionStarter]: At program point L59-2(lines 59 63) the Hoare annotation is: (and (= modf_float_~x |modf_float_#in~x|) (exists ((modf_float_~i0~0 (_ BitVec 32))) (and (= (bvadd modf_float_~j0~0 (_ bv127 32)) (bvand (_ bv255 32) (bvashr modf_float_~i0~0 (_ bv23 32)))) (= (fp ((_ extract 31 31) modf_float_~i0~0) ((_ extract 30 23) modf_float_~i0~0) ((_ extract 22 0) modf_float_~i0~0)) |modf_float_#in~x|))) (= (fp ((_ extract 31 31) modf_float_~i0~0) ((_ extract 30 23) modf_float_~i0~0) ((_ extract 22 0) modf_float_~i0~0)) |modf_float_#in~x|)) [2018-11-22 21:23:18,826 INFO L451 ceAbstractionStarter]: At program point modf_floatENTRY(lines 14 71) the Hoare annotation is: true [2018-11-22 21:23:18,826 INFO L448 ceAbstractionStarter]: For program point modf_floatFINAL(lines 14 71) no Hoare annotation was computed. [2018-11-22 21:23:18,826 INFO L448 ceAbstractionStarter]: For program point __signbit_floatFINAL(lines 73 83) no Hoare annotation was computed. [2018-11-22 21:23:18,826 INFO L451 ceAbstractionStarter]: At program point __signbit_floatENTRY(lines 73 83) the Hoare annotation is: true [2018-11-22 21:23:18,826 INFO L448 ceAbstractionStarter]: For program point __signbit_floatEXIT(lines 73 83) no Hoare annotation was computed. [2018-11-22 21:23:18,826 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 76 80) no Hoare annotation was computed. [2018-11-22 21:23:18,826 INFO L444 ceAbstractionStarter]: At program point L76-2(lines 76 80) the Hoare annotation is: (= |__signbit_float_#in~x| __signbit_float_~x) [2018-11-22 21:23:18,826 INFO L448 ceAbstractionStarter]: For program point L76-3(lines 76 80) no Hoare annotation was computed. [2018-11-22 21:23:18,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,836 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,836 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,836 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,837 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,837 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,837 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,837 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,837 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,843 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,843 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,843 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,843 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,843 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:23:18 BoogieIcfgContainer [2018-11-22 21:23:18,847 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 21:23:18,847 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 21:23:18,847 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 21:23:18,847 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 21:23:18,848 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:23:13" (3/4) ... [2018-11-22 21:23:18,851 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-22 21:23:18,857 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isinf_float [2018-11-22 21:23:18,857 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-22 21:23:18,857 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-22 21:23:18,857 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure modf_float [2018-11-22 21:23:18,857 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __signbit_float [2018-11-22 21:23:18,862 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2018-11-22 21:23:18,862 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-22 21:23:18,862 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-22 21:23:18,880 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: x == \old(x) [2018-11-22 21:23:18,880 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-11-22 21:23:18,880 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((x == \old(x) && (\exists modf_float_~i0~0 : bv32 :: ~bvadd64(j0, 127bv32) == ~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)) && ~fp~LONGDOUBLE(modf_float_~i0~0[31:31], modf_float_~i0~0[30:23], modf_float_~i0~0[22:0]) == \old(x))) && ~fp~LONGDOUBLE(i0[31:31], i0[30:23], i0[22:0]) == \old(x)) && (\exists modf_float_~i0~0 : bv32 :: ~bvslt32(~bvadd64(~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)), 4294967169bv32), 23bv32) && ~fp~LONGDOUBLE(modf_float_~i0~0[31:31], modf_float_~i0~0[30:23], modf_float_~i0~0[22:0]) == \old(x)) [2018-11-22 21:23:18,880 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (x == \old(x) && (\exists modf_float_~i0~0 : bv32 :: ~bvadd64(j0, 127bv32) == ~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)) && ~fp~LONGDOUBLE(modf_float_~i0~0[31:31], modf_float_~i0~0[30:23], modf_float_~i0~0[22:0]) == \old(x))) && ~fp~LONGDOUBLE(i0[31:31], i0[30:23], i0[22:0]) == \old(x) [2018-11-22 21:23:18,881 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((x == \old(x) && (\exists modf_float_~i0~0 : bv32 :: ~bvadd64(j0, 127bv32) == ~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)) && ~fp~LONGDOUBLE(modf_float_~i0~0[31:31], modf_float_~i0~0[30:23], modf_float_~i0~0[22:0]) == \old(x))) && ~fp~LONGDOUBLE(i0[31:31], i0[30:23], i0[22:0]) == \old(x)) && (\exists modf_float_~i0~0 : bv32 :: ~bvslt32(~bvadd64(~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)), 4294967169bv32), 23bv32) && ~fp~LONGDOUBLE(modf_float_~i0~0[31:31], modf_float_~i0~0[30:23], modf_float_~i0~0[22:0]) == \old(x)) [2018-11-22 21:23:18,881 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((x == \old(x) && (\exists modf_float_~i0~0 : bv32 :: ~bvadd64(j0, 127bv32) == ~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)) && ~fp~LONGDOUBLE(modf_float_~i0~0[31:31], modf_float_~i0~0[30:23], modf_float_~i0~0[22:0]) == \old(x))) && ~fp~LONGDOUBLE(i0[31:31], i0[30:23], i0[22:0]) == \old(x)) && (\exists modf_float_~i0~0 : bv32 :: ~bvslt32(~bvadd64(~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)), 4294967169bv32), 23bv32) && ~fp~LONGDOUBLE(modf_float_~i0~0[31:31], modf_float_~i0~0[30:23], modf_float_~i0~0[22:0]) == \old(x)) [2018-11-22 21:23:18,906 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8ccc2a21-fbea-4dc6-b9d2-d93ba9ff998a/bin-2019/uautomizer/witness.graphml [2018-11-22 21:23:18,906 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 21:23:18,906 INFO L168 Benchmark]: Toolchain (without parser) took 5751.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 949.7 MB in the beginning and 796.3 MB in the end (delta: 153.5 MB). Peak memory consumption was 277.2 MB. Max. memory is 11.5 GB. [2018-11-22 21:23:18,908 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:23:18,908 INFO L168 Benchmark]: CACSL2BoogieTranslator took 219.99 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-22 21:23:18,908 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.35 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:23:18,908 INFO L168 Benchmark]: Boogie Preprocessor took 66.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -177.7 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-11-22 21:23:18,909 INFO L168 Benchmark]: RCFGBuilder took 388.30 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2018-11-22 21:23:18,909 INFO L168 Benchmark]: TraceAbstraction took 4996.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 803.1 MB in the end (delta: 276.5 MB). Peak memory consumption was 276.5 MB. Max. memory is 11.5 GB. [2018-11-22 21:23:18,909 INFO L168 Benchmark]: Witness Printer took 58.55 ms. Allocated memory is still 1.2 GB. Free memory was 803.1 MB in the beginning and 796.3 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-22 21:23:18,911 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 219.99 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.35 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -177.7 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 388.30 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4996.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 803.1 MB in the end (delta: 276.5 MB). Peak memory consumption was 276.5 MB. Max. memory is 11.5 GB. * Witness Printer took 58.55 ms. Allocated memory is still 1.2 GB. Free memory was 803.1 MB in the beginning and 796.3 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 110]: 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: 17]: Loop Invariant Derived loop invariant: x == \old(x) - InvariantResult [Line: 48]: Loop Invariant [2018-11-22 21:23:18,915 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,916 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,916 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,916 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,916 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,916 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,916 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,917 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,921 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,922 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,922 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,922 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,922 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,922 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,922 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,922 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] Derived loop invariant: ((x == \old(x) && (\exists modf_float_~i0~0 : bv32 :: ~bvadd64(j0, 127bv32) == ~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)) && ~fp~LONGDOUBLE(modf_float_~i0~0[31:31], modf_float_~i0~0[30:23], modf_float_~i0~0[22:0]) == \old(x))) && ~fp~LONGDOUBLE(i0[31:31], i0[30:23], i0[22:0]) == \old(x)) && (\exists modf_float_~i0~0 : bv32 :: ~bvslt32(~bvadd64(~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)), 4294967169bv32), 23bv32) && ~fp~LONGDOUBLE(modf_float_~i0~0[31:31], modf_float_~i0~0[30:23], modf_float_~i0~0[22:0]) == \old(x)) - InvariantResult [Line: 59]: Loop Invariant [2018-11-22 21:23:18,923 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,923 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,923 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,923 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,924 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,924 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,924 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,924 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] Derived loop invariant: (x == \old(x) && (\exists modf_float_~i0~0 : bv32 :: ~bvadd64(j0, 127bv32) == ~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)) && ~fp~LONGDOUBLE(modf_float_~i0~0[31:31], modf_float_~i0~0[30:23], modf_float_~i0~0[22:0]) == \old(x))) && ~fp~LONGDOUBLE(i0[31:31], i0[30:23], i0[22:0]) == \old(x) - InvariantResult [Line: 36]: Loop Invariant [2018-11-22 21:23:18,924 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,925 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,925 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,925 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,925 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,925 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,925 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,926 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,926 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,926 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,926 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,926 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,927 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,927 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,927 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,927 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] Derived loop invariant: ((x == \old(x) && (\exists modf_float_~i0~0 : bv32 :: ~bvadd64(j0, 127bv32) == ~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)) && ~fp~LONGDOUBLE(modf_float_~i0~0[31:31], modf_float_~i0~0[30:23], modf_float_~i0~0[22:0]) == \old(x))) && ~fp~LONGDOUBLE(i0[31:31], i0[30:23], i0[22:0]) == \old(x)) && (\exists modf_float_~i0~0 : bv32 :: ~bvslt32(~bvadd64(~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)), 4294967169bv32), 23bv32) && ~fp~LONGDOUBLE(modf_float_~i0~0[31:31], modf_float_~i0~0[30:23], modf_float_~i0~0[22:0]) == \old(x)) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: \old(x) == x - InvariantResult [Line: 25]: Loop Invariant [2018-11-22 21:23:18,928 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,928 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,928 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,928 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,928 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,928 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,928 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,929 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,929 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,929 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,929 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,929 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,930 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,930 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,930 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-22 21:23:18,930 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] Derived loop invariant: ((x == \old(x) && (\exists modf_float_~i0~0 : bv32 :: ~bvadd64(j0, 127bv32) == ~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)) && ~fp~LONGDOUBLE(modf_float_~i0~0[31:31], modf_float_~i0~0[30:23], modf_float_~i0~0[22:0]) == \old(x))) && ~fp~LONGDOUBLE(i0[31:31], i0[30:23], i0[22:0]) == \old(x)) && (\exists modf_float_~i0~0 : bv32 :: ~bvslt32(~bvadd64(~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)), 4294967169bv32), 23bv32) && ~fp~LONGDOUBLE(modf_float_~i0~0[31:31], modf_float_~i0~0[30:23], modf_float_~i0~0[22:0]) == \old(x)) - InvariantResult [Line: 88]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 59 locations, 1 error locations. SAFE Result, 4.9s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 207 SDtfs, 132 SDslu, 711 SDs, 0 SdLazy, 297 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred 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, 25 PreInvPairs, 34 NumberOfFragments, 295 HoareAnnotationTreeSize, 25 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 157 ConstructedInterpolants, 27 QuantifiedInterpolants, 34549 SizeOfPredicates, 18 NumberOfNonLiveVariables, 485 ConjunctsInSsa, 35 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! Received shutdown request...