./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1270d_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_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1270d_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5fe31b16a9cb808afe0897c04a27b4a4516ff173 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1270d_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5fe31b16a9cb808afe0897c04a27b4a4516ff173 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 02:30:38,492 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:30:38,493 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:30:38,500 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:30:38,501 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:30:38,501 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:30:38,502 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:30:38,504 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:30:38,505 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:30:38,506 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:30:38,506 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:30:38,507 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:30:38,507 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:30:38,508 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:30:38,509 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:30:38,509 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:30:38,510 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:30:38,511 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:30:38,513 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:30:38,514 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:30:38,515 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:30:38,516 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:30:38,518 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:30:38,518 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:30:38,518 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:30:38,519 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:30:38,520 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:30:38,520 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:30:38,521 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:30:38,522 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:30:38,522 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:30:38,522 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:30:38,522 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:30:38,522 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:30:38,523 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:30:38,523 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:30:38,523 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 02:30:38,531 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:30:38,531 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:30:38,532 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:30:38,532 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:30:38,532 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 02:30:38,532 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 02:30:38,532 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 02:30:38,532 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 02:30:38,532 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 02:30:38,533 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 02:30:38,533 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 02:30:38,533 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 02:30:38,533 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 02:30:38,534 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:30:38,534 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:30:38,534 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:30:38,534 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:30:38,534 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:30:38,534 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:30:38,535 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:30:38,535 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:30:38,535 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:30:38,535 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:30:38,535 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:30:38,535 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:30:38,536 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:30:38,536 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:30:38,536 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:30:38,536 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:30:38,536 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:30:38,536 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:30:38,537 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:30:38,537 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:30:38,537 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 02:30:38,537 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:30:38,537 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 02:30:38,537 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 02:30:38,537 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan 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 -> Taipan 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 -> 5fe31b16a9cb808afe0897c04a27b4a4516ff173 [2018-11-23 02:30:38,562 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:30:38,573 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:30:38,576 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:30:38,578 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:30:38,578 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:30:38,578 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_1270d_true-unreach-call.c [2018-11-23 02:30:38,622 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/data/2f92778e7/26edfcdd3ea3418ea2e335785b850ea4/FLAG3abe9632e [2018-11-23 02:30:38,956 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:30:38,957 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/sv-benchmarks/c/float-newlib/float_req_bl_1270d_true-unreach-call.c [2018-11-23 02:30:38,963 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/data/2f92778e7/26edfcdd3ea3418ea2e335785b850ea4/FLAG3abe9632e [2018-11-23 02:30:38,974 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/data/2f92778e7/26edfcdd3ea3418ea2e335785b850ea4 [2018-11-23 02:30:38,976 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:30:38,977 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:30:38,978 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:30:38,978 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:30:38,980 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:30:38,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:30:38" (1/1) ... [2018-11-23 02:30:38,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc74d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:38, skipping insertion in model container [2018-11-23 02:30:38,983 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:30:38" (1/1) ... [2018-11-23 02:30:38,989 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:30:39,008 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:30:39,154 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:30:39,157 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:30:39,188 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:30:39,248 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:30:39,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:39 WrapperNode [2018-11-23 02:30:39,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:30:39,250 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:30:39,250 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:30:39,250 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:30:39,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:39" (1/1) ... [2018-11-23 02:30:39,271 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:39" (1/1) ... [2018-11-23 02:30:39,278 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:30:39,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:30:39,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:30:39,279 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:30:39,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:39" (1/1) ... [2018-11-23 02:30:39,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:39" (1/1) ... [2018-11-23 02:30:39,292 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:39" (1/1) ... [2018-11-23 02:30:39,292 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:39" (1/1) ... [2018-11-23 02:30:39,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:39" (1/1) ... [2018-11-23 02:30:39,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:39" (1/1) ... [2018-11-23 02:30:39,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:39" (1/1) ... [2018-11-23 02:30:39,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:30:39,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:30:39,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:30:39,326 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:30:39,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/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-23 02:30:39,371 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:30:39,371 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:30:39,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 02:30:39,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 02:30:39,372 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_float [2018-11-23 02:30:39,372 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_float [2018-11-23 02:30:39,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:30:39,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:30:39,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 02:30:39,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:30:39,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:30:39,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:30:39,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 02:30:39,373 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_hypotf [2018-11-23 02:30:39,373 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_hypotf [2018-11-23 02:30:39,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 02:30:39,373 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrtf [2018-11-23 02:30:39,374 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrtf [2018-11-23 02:30:39,788 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:30:39,788 INFO L280 CfgBuilder]: Removed 34 assue(true) statements. [2018-11-23 02:30:39,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:30:39 BoogieIcfgContainer [2018-11-23 02:30:39,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:30:39,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:30:39,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:30:39,792 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:30:39,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:30:38" (1/3) ... [2018-11-23 02:30:39,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ddb426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:30:39, skipping insertion in model container [2018-11-23 02:30:39,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:39" (2/3) ... [2018-11-23 02:30:39,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ddb426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:30:39, skipping insertion in model container [2018-11-23 02:30:39,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:30:39" (3/3) ... [2018-11-23 02:30:39,794 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270d_true-unreach-call.c [2018-11-23 02:30:39,801 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:30:39,807 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 02:30:39,819 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 02:30:39,846 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:30:39,846 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:30:39,846 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:30:39,846 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:30:39,846 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:30:39,846 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:30:39,846 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:30:39,846 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:30:39,862 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states. [2018-11-23 02:30:39,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 02:30:39,868 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:30:39,869 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] [2018-11-23 02:30:39,871 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:30:39,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:30:39,876 INFO L82 PathProgramCache]: Analyzing trace with hash 872759118, now seen corresponding path program 1 times [2018-11-23 02:30:39,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:30:39,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:39,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:30:39,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:39,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:30:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:30:39,992 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-23 02:30:39,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:30:39,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:30:39,995 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:30:40,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 02:30:40,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 02:30:40,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 02:30:40,012 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 2 states. [2018-11-23 02:30:40,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:30:40,035 INFO L93 Difference]: Finished difference Result 196 states and 313 transitions. [2018-11-23 02:30:40,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 02:30:40,037 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 28 [2018-11-23 02:30:40,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:30:40,047 INFO L225 Difference]: With dead ends: 196 [2018-11-23 02:30:40,047 INFO L226 Difference]: Without dead ends: 98 [2018-11-23 02:30:40,051 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-23 02:30:40,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-23 02:30:40,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-11-23 02:30:40,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-23 02:30:40,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 120 transitions. [2018-11-23 02:30:40,090 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 120 transitions. Word has length 28 [2018-11-23 02:30:40,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:30:40,090 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 120 transitions. [2018-11-23 02:30:40,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 02:30:40,090 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2018-11-23 02:30:40,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 02:30:40,091 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:30:40,091 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-23 02:30:40,091 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:30:40,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:30:40,092 INFO L82 PathProgramCache]: Analyzing trace with hash -863403993, now seen corresponding path program 1 times [2018-11-23 02:30:40,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:30:40,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:40,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:30:40,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:30:40,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:30:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:30:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:30:40,195 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=10737418251, |#NULL.offset|=10737418241, |old(#NULL.base)|=10737418251, |old(#NULL.offset)|=10737418241, |old(~one_sqrt~0)|=10737418249.0, |old(~tiny_sqrt~0)|=10737418259.0, ~one_sqrt~0=10737418249.0, ~tiny_sqrt~0=10737418259.0] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~one_sqrt~0 := 1.0;~tiny_sqrt~0 := 1.0E-30; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=10737418251, |old(#NULL.offset)|=10737418241, |old(~one_sqrt~0)|=10737418249.0, |old(~tiny_sqrt~0)|=10737418259.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=10737418251, |old(#NULL.offset)|=10737418241, |old(~one_sqrt~0)|=10737418249.0, |old(~tiny_sqrt~0)|=10737418259.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] RET #363#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] CALL call #t~ret38 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] ~x~0 := #t~nondet35;havoc #t~nondet35;~y~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0); VAL [main_~x~0=10737418247.0, |#NULL.base|=0, |#NULL.offset|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] CALL call #t~ret36 := __ieee754_hypotf(~x~0, ~y~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418247.0, |__ieee754_hypotf_#in~y|=10737418248.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] ~x := #in~x;~y := #in~y;~a~0 := ~x;~b~0 := ~y;havoc ~t1~0;havoc ~t2~0;havoc ~y1~0;havoc ~y2~0;havoc ~w~0;havoc ~j~0;havoc ~k~0;havoc ~ha~0;havoc ~hb~0; VAL [__ieee754_hypotf_~a~0=10737418247.0, __ieee754_hypotf_~b~0=10737418248.0, __ieee754_hypotf_~x=10737418247.0, __ieee754_hypotf_~y=10737418248.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418247.0, |__ieee754_hypotf_#in~y|=10737418248.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] call ~#gf_u~1.base, ~#gf_u~1.offset := #Ultimate.alloc(4);call write~real(~x, ~#gf_u~1.base, ~#gf_u~1.offset, 4);call #t~mem5 := read~int(~#gf_u~1.base, ~#gf_u~1.offset, 4);~ha~0 := (if #t~mem5 % 4294967296 % 4294967296 <= 2147483647 then #t~mem5 % 4294967296 % 4294967296 else #t~mem5 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union6, ~#gf_u~1.base, ~#gf_u~1.offset, 4);havoc #t~mem5;havoc #t~union6;call ULTIMATE.dealloc(~#gf_u~1.base, ~#gf_u~1.offset);havoc ~#gf_u~1.base, ~#gf_u~1.offset; VAL [__ieee754_hypotf_~a~0=10737418247.0, __ieee754_hypotf_~b~0=10737418248.0, __ieee754_hypotf_~ha~0=2147483647, __ieee754_hypotf_~x=10737418247.0, __ieee754_hypotf_~y=10737418248.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418247.0, |__ieee754_hypotf_#in~y|=10737418248.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] goto; VAL [__ieee754_hypotf_~a~0=10737418247.0, __ieee754_hypotf_~b~0=10737418248.0, __ieee754_hypotf_~ha~0=2147483647, __ieee754_hypotf_~x=10737418247.0, __ieee754_hypotf_~y=10737418248.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418247.0, |__ieee754_hypotf_#in~y|=10737418248.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] ~ha~0 := ~bitwiseAnd(~ha~0, 2147483647); VAL [__ieee754_hypotf_~a~0=10737418247.0, __ieee754_hypotf_~b~0=10737418248.0, __ieee754_hypotf_~x=10737418247.0, __ieee754_hypotf_~y=10737418248.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418247.0, |__ieee754_hypotf_#in~y|=10737418248.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] call ~#gf_u~2.base, ~#gf_u~2.offset := #Ultimate.alloc(4);call write~real(~y, ~#gf_u~2.base, ~#gf_u~2.offset, 4);call #t~mem7 := read~int(~#gf_u~2.base, ~#gf_u~2.offset, 4);~hb~0 := (if #t~mem7 % 4294967296 % 4294967296 <= 2147483647 then #t~mem7 % 4294967296 % 4294967296 else #t~mem7 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union8, ~#gf_u~2.base, ~#gf_u~2.offset, 4);havoc #t~mem7;havoc #t~union8;call ULTIMATE.dealloc(~#gf_u~2.base, ~#gf_u~2.offset);havoc ~#gf_u~2.base, ~#gf_u~2.offset; VAL [__ieee754_hypotf_~a~0=10737418247.0, __ieee754_hypotf_~b~0=10737418248.0, __ieee754_hypotf_~hb~0=(- 2147483648), __ieee754_hypotf_~x=10737418247.0, __ieee754_hypotf_~y=10737418248.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418247.0, |__ieee754_hypotf_#in~y|=10737418248.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] goto; VAL [__ieee754_hypotf_~a~0=10737418247.0, __ieee754_hypotf_~b~0=10737418248.0, __ieee754_hypotf_~hb~0=(- 2147483648), __ieee754_hypotf_~x=10737418247.0, __ieee754_hypotf_~y=10737418248.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418247.0, |__ieee754_hypotf_#in~y|=10737418248.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] ~hb~0 := ~bitwiseAnd(~hb~0, 2147483647); VAL [__ieee754_hypotf_~a~0=10737418247.0, __ieee754_hypotf_~b~0=10737418248.0, __ieee754_hypotf_~x=10737418247.0, __ieee754_hypotf_~y=10737418248.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418247.0, |__ieee754_hypotf_#in~y|=10737418248.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] assume ~hb~0 > ~ha~0;~a~0 := ~y;~b~0 := ~x;~j~0 := ~ha~0;~ha~0 := ~hb~0;~hb~0 := ~j~0; VAL [__ieee754_hypotf_~a~0=10737418248.0, __ieee754_hypotf_~b~0=10737418247.0, __ieee754_hypotf_~ha~0=251658239, __ieee754_hypotf_~hb~0=(- 2), __ieee754_hypotf_~j~0=(- 2), __ieee754_hypotf_~x=10737418247.0, __ieee754_hypotf_~y=10737418248.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418247.0, |__ieee754_hypotf_#in~y|=10737418248.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] call ~#sf_u~1.base, ~#sf_u~1.offset := #Ultimate.alloc(4);call write~int(~ha~0, ~#sf_u~1.base, ~#sf_u~1.offset, 4);call #t~mem9 := read~real(~#sf_u~1.base, ~#sf_u~1.offset, 4);~a~0 := #t~mem9;call write~int(#t~union10, ~#sf_u~1.base, ~#sf_u~1.offset, 4);havoc #t~mem9;havoc #t~union10;call ULTIMATE.dealloc(~#sf_u~1.base, ~#sf_u~1.offset);havoc ~#sf_u~1.base, ~#sf_u~1.offset; VAL [__ieee754_hypotf_~a~0=10737418263.0, __ieee754_hypotf_~b~0=10737418247.0, __ieee754_hypotf_~ha~0=251658239, __ieee754_hypotf_~hb~0=(- 2), __ieee754_hypotf_~j~0=(- 2), __ieee754_hypotf_~x=10737418247.0, __ieee754_hypotf_~y=10737418248.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418247.0, |__ieee754_hypotf_#in~y|=10737418248.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] goto; VAL [__ieee754_hypotf_~a~0=10737418263.0, __ieee754_hypotf_~b~0=10737418247.0, __ieee754_hypotf_~ha~0=251658239, __ieee754_hypotf_~hb~0=(- 2), __ieee754_hypotf_~j~0=(- 2), __ieee754_hypotf_~x=10737418247.0, __ieee754_hypotf_~y=10737418248.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418247.0, |__ieee754_hypotf_#in~y|=10737418248.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] call ~#sf_u~2.base, ~#sf_u~2.offset := #Ultimate.alloc(4);call write~int(~hb~0, ~#sf_u~2.base, ~#sf_u~2.offset, 4);call #t~mem11 := read~real(~#sf_u~2.base, ~#sf_u~2.offset, 4);~b~0 := #t~mem11;call write~int(#t~union12, ~#sf_u~2.base, ~#sf_u~2.offset, 4);havoc #t~mem11;havoc #t~union12;call ULTIMATE.dealloc(~#sf_u~2.base, ~#sf_u~2.offset);havoc ~#sf_u~2.base, ~#sf_u~2.offset; VAL [__ieee754_hypotf_~a~0=10737418263.0, __ieee754_hypotf_~b~0=10737418264.0, __ieee754_hypotf_~ha~0=251658239, __ieee754_hypotf_~hb~0=(- 2), __ieee754_hypotf_~j~0=(- 2), __ieee754_hypotf_~x=10737418247.0, __ieee754_hypotf_~y=10737418248.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418247.0, |__ieee754_hypotf_#in~y|=10737418248.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] goto; VAL [__ieee754_hypotf_~a~0=10737418263.0, __ieee754_hypotf_~b~0=10737418264.0, __ieee754_hypotf_~ha~0=251658239, __ieee754_hypotf_~hb~0=(- 2), __ieee754_hypotf_~j~0=(- 2), __ieee754_hypotf_~x=10737418247.0, __ieee754_hypotf_~y=10737418248.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418247.0, |__ieee754_hypotf_#in~y|=10737418248.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] assume ~ha~0 - ~hb~0 > 251658240;#res := ~someBinaryArithmeticFLOAToperation(~a~0, ~b~0); VAL [__ieee754_hypotf_~a~0=10737418263.0, __ieee754_hypotf_~b~0=10737418264.0, __ieee754_hypotf_~ha~0=251658239, __ieee754_hypotf_~hb~0=(- 2), __ieee754_hypotf_~j~0=(- 2), __ieee754_hypotf_~x=10737418247.0, __ieee754_hypotf_~y=10737418248.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418247.0, |__ieee754_hypotf_#in~y|=10737418248.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] assume true; VAL [__ieee754_hypotf_~a~0=10737418263.0, __ieee754_hypotf_~b~0=10737418264.0, __ieee754_hypotf_~ha~0=251658239, __ieee754_hypotf_~hb~0=(- 2), __ieee754_hypotf_~j~0=(- 2), __ieee754_hypotf_~x=10737418247.0, __ieee754_hypotf_~y=10737418248.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418247.0, |__ieee754_hypotf_#in~y|=10737418248.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] RET #367#return; VAL [main_~x~0=10737418247.0, main_~y~0=10737418248.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret36|=10737418243.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] ~res~0 := #t~ret36;havoc #t~ret36; VAL [main_~res~0=10737418243.0, main_~x~0=10737418247.0, main_~y~0=10737418248.0, |#NULL.base|=0, |#NULL.offset|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] CALL call #t~ret37 := isinf_float(~res~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=10737418243.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] ~x := #in~x;havoc ~ix~1; VAL [isinf_float_~x=10737418243.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=10737418243.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] call ~#gf_u~3.base, ~#gf_u~3.offset := #Ultimate.alloc(4);call write~real(~x, ~#gf_u~3.base, ~#gf_u~3.offset, 4);call #t~mem33 := read~int(~#gf_u~3.base, ~#gf_u~3.offset, 4);~ix~1 := (if #t~mem33 % 4294967296 % 4294967296 <= 2147483647 then #t~mem33 % 4294967296 % 4294967296 else #t~mem33 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union34, ~#gf_u~3.base, ~#gf_u~3.offset, 4);havoc #t~union34;havoc #t~mem33;call ULTIMATE.dealloc(~#gf_u~3.base, ~#gf_u~3.offset);havoc ~#gf_u~3.base, ~#gf_u~3.offset; VAL [isinf_float_~ix~1=(- 2147483648), isinf_float_~x=10737418243.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=10737418243.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] goto; VAL [isinf_float_~ix~1=(- 2147483648), isinf_float_~x=10737418243.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=10737418243.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647);#res := (if 2139095040 == ~ix~1 then 1 else 0); VAL [isinf_float_~ix~1=0, isinf_float_~x=10737418243.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=10737418243.0, |isinf_float_#res|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] assume true; VAL [isinf_float_~ix~1=0, isinf_float_~x=10737418243.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=10737418243.0, |isinf_float_#res|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] RET #369#return; VAL [main_~res~0=10737418243.0, main_~x~0=10737418247.0, main_~y~0=10737418248.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret37|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647; VAL [main_~res~0=10737418243.0, main_~x~0=10737418247.0, main_~y~0=10737418248.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret37|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] assume 0 == #t~ret37;havoc #t~ret37; VAL [main_~res~0=10737418243.0, main_~x~0=10737418247.0, main_~y~0=10737418248.0, |#NULL.base|=0, |#NULL.offset|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] assume !false; VAL [main_~res~0=10737418243.0, main_~x~0=10737418247.0, main_~y~0=10737418248.0, |#NULL.base|=0, |#NULL.offset|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=10737418251, #NULL.offset=10737418241, old(#NULL.base)=10737418251, old(#NULL.offset)=10737418241, old(~one_sqrt~0)=1.0737418249E10, old(~tiny_sqrt~0)=1.0737418259E10, ~one_sqrt~0=1.0737418249E10, ~tiny_sqrt~0=1.0737418259E10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L12] ~one_sqrt~0 := 1.0; [L12] ~tiny_sqrt~0 := 1.0E-30; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=10737418251, old(#NULL.offset)=10737418241, old(~one_sqrt~0)=1.0737418249E10, old(~tiny_sqrt~0)=1.0737418259E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=10737418251, old(#NULL.offset)=10737418241, old(~one_sqrt~0)=1.0737418249E10, old(~tiny_sqrt~0)=1.0737418259E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [?] CALL call #t~ret38 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L229] ~x~0 := #t~nondet35; [L229] havoc #t~nondet35; [L230] ~y~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0); VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10] [L231] CALL call #t~ret36 := __ieee754_hypotf(~x~0, ~y~0); VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L81-L208] ~x := #in~x; [L81-L208] ~y := #in~y; [L82] ~a~0 := ~x; [L82] ~b~0 := ~y; [L82] havoc ~t1~0; [L82] havoc ~t2~0; [L82] havoc ~y1~0; [L82] havoc ~y2~0; [L82] havoc ~w~0; [L83] havoc ~j~0; [L83] havoc ~k~0; [L83] havoc ~ha~0; [L83] havoc ~hb~0; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418247E10, ~b~0=1.0737418248E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L86] call ~#gf_u~1.base, ~#gf_u~1.offset := #Ultimate.alloc(4); [L87] call write~real(~x, ~#gf_u~1.base, ~#gf_u~1.offset, 4); [L88] call #t~mem5 := read~int(~#gf_u~1.base, ~#gf_u~1.offset, 4); [L88] ~ha~0 := (if #t~mem5 % 4294967296 % 4294967296 <= 2147483647 then #t~mem5 % 4294967296 % 4294967296 else #t~mem5 % 4294967296 % 4294967296 - 4294967296); [L88] call write~real(#t~union6, ~#gf_u~1.base, ~#gf_u~1.offset, 4); [L88] havoc #t~mem5; [L88] havoc #t~union6; [L86] call ULTIMATE.dealloc(~#gf_u~1.base, ~#gf_u~1.offset); [L86] havoc ~#gf_u~1.base, ~#gf_u~1.offset; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418247E10, ~b~0=1.0737418248E10, ~ha~0=2147483647, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L90] ~ha~0 := ~bitwiseAnd(~ha~0, 2147483647); VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418247E10, ~b~0=1.0737418248E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L92] call ~#gf_u~2.base, ~#gf_u~2.offset := #Ultimate.alloc(4); [L93] call write~real(~y, ~#gf_u~2.base, ~#gf_u~2.offset, 4); [L94] call #t~mem7 := read~int(~#gf_u~2.base, ~#gf_u~2.offset, 4); [L94] ~hb~0 := (if #t~mem7 % 4294967296 % 4294967296 <= 2147483647 then #t~mem7 % 4294967296 % 4294967296 else #t~mem7 % 4294967296 % 4294967296 - 4294967296); [L94] call write~real(#t~union8, ~#gf_u~2.base, ~#gf_u~2.offset, 4); [L94] havoc #t~mem7; [L94] havoc #t~union8; [L92] call ULTIMATE.dealloc(~#gf_u~2.base, ~#gf_u~2.offset); [L92] havoc ~#gf_u~2.base, ~#gf_u~2.offset; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418247E10, ~b~0=1.0737418248E10, ~hb~0=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L96] ~hb~0 := ~bitwiseAnd(~hb~0, 2147483647); VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418247E10, ~b~0=1.0737418248E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L97-L106] assume ~hb~0 > ~ha~0; [L98] ~a~0 := ~y; [L99] ~b~0 := ~x; [L100] ~j~0 := ~ha~0; [L101] ~ha~0 := ~hb~0; [L102] ~hb~0 := ~j~0; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418248E10, ~b~0=1.0737418247E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L108] call ~#sf_u~1.base, ~#sf_u~1.offset := #Ultimate.alloc(4); [L109] call write~int(~ha~0, ~#sf_u~1.base, ~#sf_u~1.offset, 4); [L110] call #t~mem9 := read~real(~#sf_u~1.base, ~#sf_u~1.offset, 4); [L110] ~a~0 := #t~mem9; [L110] call write~int(#t~union10, ~#sf_u~1.base, ~#sf_u~1.offset, 4); [L110] havoc #t~mem9; [L110] havoc #t~union10; [L108] call ULTIMATE.dealloc(~#sf_u~1.base, ~#sf_u~1.offset); [L108] havoc ~#sf_u~1.base, ~#sf_u~1.offset; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418247E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L113] call ~#sf_u~2.base, ~#sf_u~2.offset := #Ultimate.alloc(4); [L114] call write~int(~hb~0, ~#sf_u~2.base, ~#sf_u~2.offset, 4); [L115] call #t~mem11 := read~real(~#sf_u~2.base, ~#sf_u~2.offset, 4); [L115] ~b~0 := #t~mem11; [L115] call write~int(#t~union12, ~#sf_u~2.base, ~#sf_u~2.offset, 4); [L115] havoc #t~mem11; [L115] havoc #t~union12; [L113] call ULTIMATE.dealloc(~#sf_u~2.base, ~#sf_u~2.offset); [L113] havoc ~#sf_u~2.base, ~#sf_u~2.offset; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418264E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L117-L119] assume ~ha~0 - ~hb~0 > 251658240; [L118] #res := ~someBinaryArithmeticFLOAToperation(~a~0, ~b~0); VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418264E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L81-L208] ensures true; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418264E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L231] RET call #t~ret36 := __ieee754_hypotf(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret36=1.0737418243E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [L231] ~res~0 := #t~ret36; [L231] havoc #t~ret36; VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [L233] CALL call #t~ret37 := isinf_float(~res~0); VAL [#in~x=1.0737418243E10, #NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L211-L220] ~x := #in~x; [L212] havoc ~ix~1; VAL [#in~x=1.0737418243E10, #NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L214] call ~#gf_u~3.base, ~#gf_u~3.offset := #Ultimate.alloc(4); [L215] call write~real(~x, ~#gf_u~3.base, ~#gf_u~3.offset, 4); [L216] call #t~mem33 := read~int(~#gf_u~3.base, ~#gf_u~3.offset, 4); [L216] ~ix~1 := (if #t~mem33 % 4294967296 % 4294967296 <= 2147483647 then #t~mem33 % 4294967296 % 4294967296 else #t~mem33 % 4294967296 % 4294967296 - 4294967296); [L216] call write~real(#t~union34, ~#gf_u~3.base, ~#gf_u~3.offset, 4); [L216] havoc #t~union34; [L216] havoc #t~mem33; [L214] call ULTIMATE.dealloc(~#gf_u~3.base, ~#gf_u~3.offset); [L214] havoc ~#gf_u~3.base, ~#gf_u~3.offset; VAL [#in~x=1.0737418243E10, #NULL.base=0, #NULL.offset=0, ~ix~1=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L218] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647); [L219] #res := (if 2139095040 == ~ix~1 then 1 else 0); VAL [#in~x=1.0737418243E10, #NULL.base=0, #NULL.offset=0, #res=0, ~ix~1=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L211-L220] ensures true; VAL [#in~x=1.0737418243E10, #NULL.base=0, #NULL.offset=0, #res=0, ~ix~1=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L233] RET call #t~ret37 := isinf_float(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret37=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [L233] assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret37=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [L233-L236] assume 0 == #t~ret37; [L233] havoc #t~ret37; VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [L234] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=10737418251, #NULL.offset=10737418241, old(#NULL.base)=10737418251, old(#NULL.offset)=10737418241, old(~one_sqrt~0)=1.0737418249E10, old(~tiny_sqrt~0)=1.0737418259E10, ~one_sqrt~0=1.0737418249E10, ~tiny_sqrt~0=1.0737418259E10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L12] ~one_sqrt~0 := 1.0; [L12] ~tiny_sqrt~0 := 1.0E-30; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=10737418251, old(#NULL.offset)=10737418241, old(~one_sqrt~0)=1.0737418249E10, old(~tiny_sqrt~0)=1.0737418259E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=10737418251, old(#NULL.offset)=10737418241, old(~one_sqrt~0)=1.0737418249E10, old(~tiny_sqrt~0)=1.0737418259E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [?] CALL call #t~ret38 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L229] ~x~0 := #t~nondet35; [L229] havoc #t~nondet35; [L230] ~y~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0); VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10] [L231] CALL call #t~ret36 := __ieee754_hypotf(~x~0, ~y~0); VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L81-L208] ~x := #in~x; [L81-L208] ~y := #in~y; [L82] ~a~0 := ~x; [L82] ~b~0 := ~y; [L82] havoc ~t1~0; [L82] havoc ~t2~0; [L82] havoc ~y1~0; [L82] havoc ~y2~0; [L82] havoc ~w~0; [L83] havoc ~j~0; [L83] havoc ~k~0; [L83] havoc ~ha~0; [L83] havoc ~hb~0; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418247E10, ~b~0=1.0737418248E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L86] call ~#gf_u~1.base, ~#gf_u~1.offset := #Ultimate.alloc(4); [L87] call write~real(~x, ~#gf_u~1.base, ~#gf_u~1.offset, 4); [L88] call #t~mem5 := read~int(~#gf_u~1.base, ~#gf_u~1.offset, 4); [L88] ~ha~0 := (if #t~mem5 % 4294967296 % 4294967296 <= 2147483647 then #t~mem5 % 4294967296 % 4294967296 else #t~mem5 % 4294967296 % 4294967296 - 4294967296); [L88] call write~real(#t~union6, ~#gf_u~1.base, ~#gf_u~1.offset, 4); [L88] havoc #t~mem5; [L88] havoc #t~union6; [L86] call ULTIMATE.dealloc(~#gf_u~1.base, ~#gf_u~1.offset); [L86] havoc ~#gf_u~1.base, ~#gf_u~1.offset; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418247E10, ~b~0=1.0737418248E10, ~ha~0=2147483647, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L90] ~ha~0 := ~bitwiseAnd(~ha~0, 2147483647); VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418247E10, ~b~0=1.0737418248E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L92] call ~#gf_u~2.base, ~#gf_u~2.offset := #Ultimate.alloc(4); [L93] call write~real(~y, ~#gf_u~2.base, ~#gf_u~2.offset, 4); [L94] call #t~mem7 := read~int(~#gf_u~2.base, ~#gf_u~2.offset, 4); [L94] ~hb~0 := (if #t~mem7 % 4294967296 % 4294967296 <= 2147483647 then #t~mem7 % 4294967296 % 4294967296 else #t~mem7 % 4294967296 % 4294967296 - 4294967296); [L94] call write~real(#t~union8, ~#gf_u~2.base, ~#gf_u~2.offset, 4); [L94] havoc #t~mem7; [L94] havoc #t~union8; [L92] call ULTIMATE.dealloc(~#gf_u~2.base, ~#gf_u~2.offset); [L92] havoc ~#gf_u~2.base, ~#gf_u~2.offset; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418247E10, ~b~0=1.0737418248E10, ~hb~0=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L96] ~hb~0 := ~bitwiseAnd(~hb~0, 2147483647); VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418247E10, ~b~0=1.0737418248E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L97-L106] assume ~hb~0 > ~ha~0; [L98] ~a~0 := ~y; [L99] ~b~0 := ~x; [L100] ~j~0 := ~ha~0; [L101] ~ha~0 := ~hb~0; [L102] ~hb~0 := ~j~0; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418248E10, ~b~0=1.0737418247E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L108] call ~#sf_u~1.base, ~#sf_u~1.offset := #Ultimate.alloc(4); [L109] call write~int(~ha~0, ~#sf_u~1.base, ~#sf_u~1.offset, 4); [L110] call #t~mem9 := read~real(~#sf_u~1.base, ~#sf_u~1.offset, 4); [L110] ~a~0 := #t~mem9; [L110] call write~int(#t~union10, ~#sf_u~1.base, ~#sf_u~1.offset, 4); [L110] havoc #t~mem9; [L110] havoc #t~union10; [L108] call ULTIMATE.dealloc(~#sf_u~1.base, ~#sf_u~1.offset); [L108] havoc ~#sf_u~1.base, ~#sf_u~1.offset; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418247E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L113] call ~#sf_u~2.base, ~#sf_u~2.offset := #Ultimate.alloc(4); [L114] call write~int(~hb~0, ~#sf_u~2.base, ~#sf_u~2.offset, 4); [L115] call #t~mem11 := read~real(~#sf_u~2.base, ~#sf_u~2.offset, 4); [L115] ~b~0 := #t~mem11; [L115] call write~int(#t~union12, ~#sf_u~2.base, ~#sf_u~2.offset, 4); [L115] havoc #t~mem11; [L115] havoc #t~union12; [L113] call ULTIMATE.dealloc(~#sf_u~2.base, ~#sf_u~2.offset); [L113] havoc ~#sf_u~2.base, ~#sf_u~2.offset; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418264E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L117-L119] assume ~ha~0 - ~hb~0 > 251658240; [L118] #res := ~someBinaryArithmeticFLOAToperation(~a~0, ~b~0); VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418264E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L81-L208] ensures true; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418264E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L231] RET call #t~ret36 := __ieee754_hypotf(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret36=1.0737418243E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [L231] ~res~0 := #t~ret36; [L231] havoc #t~ret36; VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [L233] CALL call #t~ret37 := isinf_float(~res~0); VAL [#in~x=1.0737418243E10, #NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L211-L220] ~x := #in~x; [L212] havoc ~ix~1; VAL [#in~x=1.0737418243E10, #NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L214] call ~#gf_u~3.base, ~#gf_u~3.offset := #Ultimate.alloc(4); [L215] call write~real(~x, ~#gf_u~3.base, ~#gf_u~3.offset, 4); [L216] call #t~mem33 := read~int(~#gf_u~3.base, ~#gf_u~3.offset, 4); [L216] ~ix~1 := (if #t~mem33 % 4294967296 % 4294967296 <= 2147483647 then #t~mem33 % 4294967296 % 4294967296 else #t~mem33 % 4294967296 % 4294967296 - 4294967296); [L216] call write~real(#t~union34, ~#gf_u~3.base, ~#gf_u~3.offset, 4); [L216] havoc #t~union34; [L216] havoc #t~mem33; [L214] call ULTIMATE.dealloc(~#gf_u~3.base, ~#gf_u~3.offset); [L214] havoc ~#gf_u~3.base, ~#gf_u~3.offset; VAL [#in~x=1.0737418243E10, #NULL.base=0, #NULL.offset=0, ~ix~1=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L218] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647); [L219] #res := (if 2139095040 == ~ix~1 then 1 else 0); VAL [#in~x=1.0737418243E10, #NULL.base=0, #NULL.offset=0, #res=0, ~ix~1=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L211-L220] ensures true; VAL [#in~x=1.0737418243E10, #NULL.base=0, #NULL.offset=0, #res=0, ~ix~1=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L233] RET call #t~ret37 := isinf_float(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret37=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [L233] assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret37=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [L233-L236] assume 0 == #t~ret37; [L233] havoc #t~ret37; VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [L234] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=10737418251, #NULL!offset=10737418241, old(#NULL!base)=10737418251, old(#NULL!offset)=10737418241, old(~one_sqrt~0)=1.0737418249E10, old(~tiny_sqrt~0)=1.0737418259E10, ~one_sqrt~0=1.0737418249E10, ~tiny_sqrt~0=1.0737418259E10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L12] ~one_sqrt~0 := 1.0; [L12] ~tiny_sqrt~0 := 1.0E-30; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=10737418251, old(#NULL!offset)=10737418241, old(~one_sqrt~0)=1.0737418249E10, old(~tiny_sqrt~0)=1.0737418259E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [?] CALL call #t~ret38 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L229] ~x~0 := #t~nondet35; [L229] havoc #t~nondet35; [L230] ~y~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10] [L231] CALL call #t~ret36 := __ieee754_hypotf(~x~0, ~y~0); VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L81-L208] ~x := #in~x; [L81-L208] ~y := #in~y; [L82] ~a~0 := ~x; [L82] ~b~0 := ~y; [L82] havoc ~t1~0; [L82] havoc ~t2~0; [L82] havoc ~y1~0; [L82] havoc ~y2~0; [L82] havoc ~w~0; [L83] havoc ~j~0; [L83] havoc ~k~0; [L83] havoc ~ha~0; [L83] havoc ~hb~0; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418247E10, ~b~0=1.0737418248E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L86] FCALL call ~#gf_u~1 := #Ultimate.alloc(4); [L87] FCALL call write~real(~x, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L88] FCALL call #t~mem5 := read~int({ base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L88] ~ha~0 := (if #t~mem5 % 4294967296 % 4294967296 <= 2147483647 then #t~mem5 % 4294967296 % 4294967296 else #t~mem5 % 4294967296 % 4294967296 - 4294967296); [L88] FCALL call write~real(#t~union6, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L88] havoc #t~mem5; [L88] havoc #t~union6; [L86] FCALL call ULTIMATE.dealloc(~#gf_u~1); [L86] havoc ~#gf_u~1; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418247E10, ~b~0=1.0737418248E10, ~ha~0=2147483647, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L90] ~ha~0 := ~bitwiseAnd(~ha~0, 2147483647); VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418247E10, ~b~0=1.0737418248E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L92] FCALL call ~#gf_u~2 := #Ultimate.alloc(4); [L93] FCALL call write~real(~y, { base: ~#gf_u~2!base, offset: ~#gf_u~2!offset }, 4); [L94] FCALL call #t~mem7 := read~int({ base: ~#gf_u~2!base, offset: ~#gf_u~2!offset }, 4); [L94] ~hb~0 := (if #t~mem7 % 4294967296 % 4294967296 <= 2147483647 then #t~mem7 % 4294967296 % 4294967296 else #t~mem7 % 4294967296 % 4294967296 - 4294967296); [L94] FCALL call write~real(#t~union8, { base: ~#gf_u~2!base, offset: ~#gf_u~2!offset }, 4); [L94] havoc #t~mem7; [L94] havoc #t~union8; [L92] FCALL call ULTIMATE.dealloc(~#gf_u~2); [L92] havoc ~#gf_u~2; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418247E10, ~b~0=1.0737418248E10, ~hb~0=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L96] ~hb~0 := ~bitwiseAnd(~hb~0, 2147483647); VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418247E10, ~b~0=1.0737418248E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L97] COND TRUE ~hb~0 > ~ha~0 [L98] ~a~0 := ~y; [L99] ~b~0 := ~x; [L100] ~j~0 := ~ha~0; [L101] ~ha~0 := ~hb~0; [L102] ~hb~0 := ~j~0; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418248E10, ~b~0=1.0737418247E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L108] FCALL call ~#sf_u~1 := #Ultimate.alloc(4); [L109] FCALL call write~int(~ha~0, { base: ~#sf_u~1!base, offset: ~#sf_u~1!offset }, 4); [L110] FCALL call #t~mem9 := read~real({ base: ~#sf_u~1!base, offset: ~#sf_u~1!offset }, 4); [L110] ~a~0 := #t~mem9; [L110] FCALL call write~int(#t~union10, { base: ~#sf_u~1!base, offset: ~#sf_u~1!offset }, 4); [L110] havoc #t~mem9; [L110] havoc #t~union10; [L108] FCALL call ULTIMATE.dealloc(~#sf_u~1); [L108] havoc ~#sf_u~1; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418247E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L113] FCALL call ~#sf_u~2 := #Ultimate.alloc(4); [L114] FCALL call write~int(~hb~0, { base: ~#sf_u~2!base, offset: ~#sf_u~2!offset }, 4); [L115] FCALL call #t~mem11 := read~real({ base: ~#sf_u~2!base, offset: ~#sf_u~2!offset }, 4); [L115] ~b~0 := #t~mem11; [L115] FCALL call write~int(#t~union12, { base: ~#sf_u~2!base, offset: ~#sf_u~2!offset }, 4); [L115] havoc #t~mem11; [L115] havoc #t~union12; [L113] FCALL call ULTIMATE.dealloc(~#sf_u~2); [L113] havoc ~#sf_u~2; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418264E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L117] COND TRUE ~ha~0 - ~hb~0 > 251658240 [L118] #res := ~someBinaryArithmeticFLOAToperation(~a~0, ~b~0); VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418264E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L231] RET call #t~ret36 := __ieee754_hypotf(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret36=1.0737418243E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [L231] ~res~0 := #t~ret36; [L231] havoc #t~ret36; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [L233] CALL call #t~ret37 := isinf_float(~res~0); VAL [#in~x=1.0737418243E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L211-L220] ~x := #in~x; [L212] havoc ~ix~1; VAL [#in~x=1.0737418243E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L214] FCALL call ~#gf_u~3 := #Ultimate.alloc(4); [L215] FCALL call write~real(~x, { base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L216] FCALL call #t~mem33 := read~int({ base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L216] ~ix~1 := (if #t~mem33 % 4294967296 % 4294967296 <= 2147483647 then #t~mem33 % 4294967296 % 4294967296 else #t~mem33 % 4294967296 % 4294967296 - 4294967296); [L216] FCALL call write~real(#t~union34, { base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L216] havoc #t~union34; [L216] havoc #t~mem33; [L214] FCALL call ULTIMATE.dealloc(~#gf_u~3); [L214] havoc ~#gf_u~3; VAL [#in~x=1.0737418243E10, #NULL!base=0, #NULL!offset=0, ~ix~1=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L218] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647); [L219] #res := (if 2139095040 == ~ix~1 then 1 else 0); VAL [#in~x=1.0737418243E10, #NULL!base=0, #NULL!offset=0, #res=0, ~ix~1=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L233] RET call #t~ret37 := isinf_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret37=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [L233] assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret37=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [L233] COND TRUE 0 == #t~ret37 [L233] havoc #t~ret37; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [L234] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=10737418251, #NULL!offset=10737418241, old(#NULL!base)=10737418251, old(#NULL!offset)=10737418241, old(~one_sqrt~0)=1.0737418249E10, old(~tiny_sqrt~0)=1.0737418259E10, ~one_sqrt~0=1.0737418249E10, ~tiny_sqrt~0=1.0737418259E10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L12] ~one_sqrt~0 := 1.0; [L12] ~tiny_sqrt~0 := 1.0E-30; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=10737418251, old(#NULL!offset)=10737418241, old(~one_sqrt~0)=1.0737418249E10, old(~tiny_sqrt~0)=1.0737418259E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [?] CALL call #t~ret38 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L229] ~x~0 := #t~nondet35; [L229] havoc #t~nondet35; [L230] ~y~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10] [L231] CALL call #t~ret36 := __ieee754_hypotf(~x~0, ~y~0); VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L81-L208] ~x := #in~x; [L81-L208] ~y := #in~y; [L82] ~a~0 := ~x; [L82] ~b~0 := ~y; [L82] havoc ~t1~0; [L82] havoc ~t2~0; [L82] havoc ~y1~0; [L82] havoc ~y2~0; [L82] havoc ~w~0; [L83] havoc ~j~0; [L83] havoc ~k~0; [L83] havoc ~ha~0; [L83] havoc ~hb~0; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418247E10, ~b~0=1.0737418248E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L86] FCALL call ~#gf_u~1 := #Ultimate.alloc(4); [L87] FCALL call write~real(~x, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L88] FCALL call #t~mem5 := read~int({ base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L88] ~ha~0 := (if #t~mem5 % 4294967296 % 4294967296 <= 2147483647 then #t~mem5 % 4294967296 % 4294967296 else #t~mem5 % 4294967296 % 4294967296 - 4294967296); [L88] FCALL call write~real(#t~union6, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L88] havoc #t~mem5; [L88] havoc #t~union6; [L86] FCALL call ULTIMATE.dealloc(~#gf_u~1); [L86] havoc ~#gf_u~1; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418247E10, ~b~0=1.0737418248E10, ~ha~0=2147483647, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L90] ~ha~0 := ~bitwiseAnd(~ha~0, 2147483647); VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418247E10, ~b~0=1.0737418248E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L92] FCALL call ~#gf_u~2 := #Ultimate.alloc(4); [L93] FCALL call write~real(~y, { base: ~#gf_u~2!base, offset: ~#gf_u~2!offset }, 4); [L94] FCALL call #t~mem7 := read~int({ base: ~#gf_u~2!base, offset: ~#gf_u~2!offset }, 4); [L94] ~hb~0 := (if #t~mem7 % 4294967296 % 4294967296 <= 2147483647 then #t~mem7 % 4294967296 % 4294967296 else #t~mem7 % 4294967296 % 4294967296 - 4294967296); [L94] FCALL call write~real(#t~union8, { base: ~#gf_u~2!base, offset: ~#gf_u~2!offset }, 4); [L94] havoc #t~mem7; [L94] havoc #t~union8; [L92] FCALL call ULTIMATE.dealloc(~#gf_u~2); [L92] havoc ~#gf_u~2; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418247E10, ~b~0=1.0737418248E10, ~hb~0=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L96] ~hb~0 := ~bitwiseAnd(~hb~0, 2147483647); VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418247E10, ~b~0=1.0737418248E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L97] COND TRUE ~hb~0 > ~ha~0 [L98] ~a~0 := ~y; [L99] ~b~0 := ~x; [L100] ~j~0 := ~ha~0; [L101] ~ha~0 := ~hb~0; [L102] ~hb~0 := ~j~0; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418248E10, ~b~0=1.0737418247E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L108] FCALL call ~#sf_u~1 := #Ultimate.alloc(4); [L109] FCALL call write~int(~ha~0, { base: ~#sf_u~1!base, offset: ~#sf_u~1!offset }, 4); [L110] FCALL call #t~mem9 := read~real({ base: ~#sf_u~1!base, offset: ~#sf_u~1!offset }, 4); [L110] ~a~0 := #t~mem9; [L110] FCALL call write~int(#t~union10, { base: ~#sf_u~1!base, offset: ~#sf_u~1!offset }, 4); [L110] havoc #t~mem9; [L110] havoc #t~union10; [L108] FCALL call ULTIMATE.dealloc(~#sf_u~1); [L108] havoc ~#sf_u~1; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418247E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L113] FCALL call ~#sf_u~2 := #Ultimate.alloc(4); [L114] FCALL call write~int(~hb~0, { base: ~#sf_u~2!base, offset: ~#sf_u~2!offset }, 4); [L115] FCALL call #t~mem11 := read~real({ base: ~#sf_u~2!base, offset: ~#sf_u~2!offset }, 4); [L115] ~b~0 := #t~mem11; [L115] FCALL call write~int(#t~union12, { base: ~#sf_u~2!base, offset: ~#sf_u~2!offset }, 4); [L115] havoc #t~mem11; [L115] havoc #t~union12; [L113] FCALL call ULTIMATE.dealloc(~#sf_u~2); [L113] havoc ~#sf_u~2; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418264E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L117] COND TRUE ~ha~0 - ~hb~0 > 251658240 [L118] #res := ~someBinaryArithmeticFLOAToperation(~a~0, ~b~0); VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418264E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L231] RET call #t~ret36 := __ieee754_hypotf(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret36=1.0737418243E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [L231] ~res~0 := #t~ret36; [L231] havoc #t~ret36; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [L233] CALL call #t~ret37 := isinf_float(~res~0); VAL [#in~x=1.0737418243E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L211-L220] ~x := #in~x; [L212] havoc ~ix~1; VAL [#in~x=1.0737418243E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L214] FCALL call ~#gf_u~3 := #Ultimate.alloc(4); [L215] FCALL call write~real(~x, { base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L216] FCALL call #t~mem33 := read~int({ base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L216] ~ix~1 := (if #t~mem33 % 4294967296 % 4294967296 <= 2147483647 then #t~mem33 % 4294967296 % 4294967296 else #t~mem33 % 4294967296 % 4294967296 - 4294967296); [L216] FCALL call write~real(#t~union34, { base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L216] havoc #t~union34; [L216] havoc #t~mem33; [L214] FCALL call ULTIMATE.dealloc(~#gf_u~3); [L214] havoc ~#gf_u~3; VAL [#in~x=1.0737418243E10, #NULL!base=0, #NULL!offset=0, ~ix~1=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L218] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647); [L219] #res := (if 2139095040 == ~ix~1 then 1 else 0); VAL [#in~x=1.0737418243E10, #NULL!base=0, #NULL!offset=0, #res=0, ~ix~1=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L233] RET call #t~ret37 := isinf_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret37=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [L233] assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret37=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [L233] COND TRUE 0 == #t~ret37 [L233] havoc #t~ret37; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [L234] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=10737418251, #NULL!offset=10737418241, old(#NULL!base)=10737418251, old(#NULL!offset)=10737418241, old(~one_sqrt~0)=1.0737418249E10, old(~tiny_sqrt~0)=1.0737418259E10, ~one_sqrt~0=1.0737418249E10, ~tiny_sqrt~0=1.0737418259E10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L12] ~one_sqrt~0 := 1.0; [L12] ~tiny_sqrt~0 := 1.0E-30; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=10737418251, old(#NULL!offset)=10737418241, old(~one_sqrt~0)=1.0737418249E10, old(~tiny_sqrt~0)=1.0737418259E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [?] CALL call #t~ret38 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L229] ~x~0 := #t~nondet35; [L229] havoc #t~nondet35; [L230] ~y~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10] [L231] CALL call #t~ret36 := __ieee754_hypotf(~x~0, ~y~0); VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L81-L208] ~x := #in~x; [L81-L208] ~y := #in~y; [L82] ~a~0 := ~x; [L82] ~b~0 := ~y; [L82] havoc ~t1~0; [L82] havoc ~t2~0; [L82] havoc ~y1~0; [L82] havoc ~y2~0; [L82] havoc ~w~0; [L83] havoc ~j~0; [L83] havoc ~k~0; [L83] havoc ~ha~0; [L83] havoc ~hb~0; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418247E10, ~b~0=1.0737418248E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L86] FCALL call ~#gf_u~1 := #Ultimate.alloc(4); [L87] FCALL call write~real(~x, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L88] FCALL call #t~mem5 := read~int({ base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L88] ~ha~0 := (if #t~mem5 % 4294967296 % 4294967296 <= 2147483647 then #t~mem5 % 4294967296 % 4294967296 else #t~mem5 % 4294967296 % 4294967296 - 4294967296); [L88] FCALL call write~real(#t~union6, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L88] havoc #t~mem5; [L88] havoc #t~union6; [L86] FCALL call ULTIMATE.dealloc(~#gf_u~1); [L86] havoc ~#gf_u~1; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418247E10, ~b~0=1.0737418248E10, ~ha~0=2147483647, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L90] ~ha~0 := ~bitwiseAnd(~ha~0, 2147483647); VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418247E10, ~b~0=1.0737418248E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L92] FCALL call ~#gf_u~2 := #Ultimate.alloc(4); [L93] FCALL call write~real(~y, { base: ~#gf_u~2!base, offset: ~#gf_u~2!offset }, 4); [L94] FCALL call #t~mem7 := read~int({ base: ~#gf_u~2!base, offset: ~#gf_u~2!offset }, 4); [L94] ~hb~0 := (if #t~mem7 % 4294967296 % 4294967296 <= 2147483647 then #t~mem7 % 4294967296 % 4294967296 else #t~mem7 % 4294967296 % 4294967296 - 4294967296); [L94] FCALL call write~real(#t~union8, { base: ~#gf_u~2!base, offset: ~#gf_u~2!offset }, 4); [L94] havoc #t~mem7; [L94] havoc #t~union8; [L92] FCALL call ULTIMATE.dealloc(~#gf_u~2); [L92] havoc ~#gf_u~2; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418247E10, ~b~0=1.0737418248E10, ~hb~0=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L96] ~hb~0 := ~bitwiseAnd(~hb~0, 2147483647); VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418247E10, ~b~0=1.0737418248E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L97] COND TRUE ~hb~0 > ~ha~0 [L98] ~a~0 := ~y; [L99] ~b~0 := ~x; [L100] ~j~0 := ~ha~0; [L101] ~ha~0 := ~hb~0; [L102] ~hb~0 := ~j~0; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418248E10, ~b~0=1.0737418247E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L108] FCALL call ~#sf_u~1 := #Ultimate.alloc(4); [L109] FCALL call write~int(~ha~0, { base: ~#sf_u~1!base, offset: ~#sf_u~1!offset }, 4); [L110] FCALL call #t~mem9 := read~real({ base: ~#sf_u~1!base, offset: ~#sf_u~1!offset }, 4); [L110] ~a~0 := #t~mem9; [L110] FCALL call write~int(#t~union10, { base: ~#sf_u~1!base, offset: ~#sf_u~1!offset }, 4); [L110] havoc #t~mem9; [L110] havoc #t~union10; [L108] FCALL call ULTIMATE.dealloc(~#sf_u~1); [L108] havoc ~#sf_u~1; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418247E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L113] FCALL call ~#sf_u~2 := #Ultimate.alloc(4); [L114] FCALL call write~int(~hb~0, { base: ~#sf_u~2!base, offset: ~#sf_u~2!offset }, 4); [L115] FCALL call #t~mem11 := read~real({ base: ~#sf_u~2!base, offset: ~#sf_u~2!offset }, 4); [L115] ~b~0 := #t~mem11; [L115] FCALL call write~int(#t~union12, { base: ~#sf_u~2!base, offset: ~#sf_u~2!offset }, 4); [L115] havoc #t~mem11; [L115] havoc #t~union12; [L113] FCALL call ULTIMATE.dealloc(~#sf_u~2); [L113] havoc ~#sf_u~2; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418264E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L117] COND TRUE ~ha~0 - ~hb~0 > 251658240 [L118] #res := ~someBinaryArithmeticFLOAToperation(~a~0, ~b~0); VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418264E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L231] RET call #t~ret36 := __ieee754_hypotf(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret36=1.0737418243E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [L231] ~res~0 := #t~ret36; [L231] havoc #t~ret36; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [L233] CALL call #t~ret37 := isinf_float(~res~0); VAL [#in~x=1.0737418243E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L211-L220] ~x := #in~x; [L212] havoc ~ix~1; VAL [#in~x=1.0737418243E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L214] FCALL call ~#gf_u~3 := #Ultimate.alloc(4); [L215] FCALL call write~real(~x, { base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L216] FCALL call #t~mem33 := read~int({ base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L216] ~ix~1 := (if #t~mem33 % 4294967296 % 4294967296 <= 2147483647 then #t~mem33 % 4294967296 % 4294967296 else #t~mem33 % 4294967296 % 4294967296 - 4294967296); [L216] FCALL call write~real(#t~union34, { base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L216] havoc #t~union34; [L216] havoc #t~mem33; [L214] FCALL call ULTIMATE.dealloc(~#gf_u~3); [L214] havoc ~#gf_u~3; VAL [#in~x=1.0737418243E10, #NULL!base=0, #NULL!offset=0, ~ix~1=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L218] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647); [L219] #res := (if 2139095040 == ~ix~1 then 1 else 0); VAL [#in~x=1.0737418243E10, #NULL!base=0, #NULL!offset=0, #res=0, ~ix~1=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L233] RET call #t~ret37 := isinf_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret37=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [L233] assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret37=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [L233] COND TRUE 0 == #t~ret37 [L233] havoc #t~ret37; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [L234] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=10737418251, #NULL!offset=10737418241, old(#NULL!base)=10737418251, old(#NULL!offset)=10737418241, old(~one_sqrt~0)=1.0737418249E10, old(~tiny_sqrt~0)=1.0737418259E10, ~one_sqrt~0=1.0737418249E10, ~tiny_sqrt~0=1.0737418259E10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L12] ~one_sqrt~0 := 1.0; [L12] ~tiny_sqrt~0 := 1.0E-30; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=10737418251, old(#NULL!offset)=10737418241, old(~one_sqrt~0)=1.0737418249E10, old(~tiny_sqrt~0)=1.0737418259E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [?] CALL call #t~ret38 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L229] ~x~0 := #t~nondet35; [L229] havoc #t~nondet35; [L230] ~y~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10] [L231] CALL call #t~ret36 := __ieee754_hypotf(~x~0, ~y~0); VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L81-L208] ~x := #in~x; [L81-L208] ~y := #in~y; [L82] ~a~0 := ~x; [L82] ~b~0 := ~y; [L82] havoc ~t1~0; [L82] havoc ~t2~0; [L82] havoc ~y1~0; [L82] havoc ~y2~0; [L82] havoc ~w~0; [L83] havoc ~j~0; [L83] havoc ~k~0; [L83] havoc ~ha~0; [L83] havoc ~hb~0; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418247E10, ~b~0=1.0737418248E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L86] FCALL call ~#gf_u~1 := #Ultimate.alloc(4); [L87] FCALL call write~real(~x, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L88] FCALL call #t~mem5 := read~int({ base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L88] ~ha~0 := (if #t~mem5 % 4294967296 % 4294967296 <= 2147483647 then #t~mem5 % 4294967296 % 4294967296 else #t~mem5 % 4294967296 % 4294967296 - 4294967296); [L88] FCALL call write~real(#t~union6, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L88] havoc #t~mem5; [L88] havoc #t~union6; [L86] FCALL call ULTIMATE.dealloc(~#gf_u~1); [L86] havoc ~#gf_u~1; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418247E10, ~b~0=1.0737418248E10, ~ha~0=2147483647, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L90] ~ha~0 := ~bitwiseAnd(~ha~0, 2147483647); VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418247E10, ~b~0=1.0737418248E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L92] FCALL call ~#gf_u~2 := #Ultimate.alloc(4); [L93] FCALL call write~real(~y, { base: ~#gf_u~2!base, offset: ~#gf_u~2!offset }, 4); [L94] FCALL call #t~mem7 := read~int({ base: ~#gf_u~2!base, offset: ~#gf_u~2!offset }, 4); [L94] ~hb~0 := (if #t~mem7 % 4294967296 % 4294967296 <= 2147483647 then #t~mem7 % 4294967296 % 4294967296 else #t~mem7 % 4294967296 % 4294967296 - 4294967296); [L94] FCALL call write~real(#t~union8, { base: ~#gf_u~2!base, offset: ~#gf_u~2!offset }, 4); [L94] havoc #t~mem7; [L94] havoc #t~union8; [L92] FCALL call ULTIMATE.dealloc(~#gf_u~2); [L92] havoc ~#gf_u~2; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418247E10, ~b~0=1.0737418248E10, ~hb~0=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L96] ~hb~0 := ~bitwiseAnd(~hb~0, 2147483647); VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418247E10, ~b~0=1.0737418248E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L97] COND TRUE ~hb~0 > ~ha~0 [L98] ~a~0 := ~y; [L99] ~b~0 := ~x; [L100] ~j~0 := ~ha~0; [L101] ~ha~0 := ~hb~0; [L102] ~hb~0 := ~j~0; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418248E10, ~b~0=1.0737418247E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L108] FCALL call ~#sf_u~1 := #Ultimate.alloc(4); [L109] FCALL call write~int(~ha~0, { base: ~#sf_u~1!base, offset: ~#sf_u~1!offset }, 4); [L110] FCALL call #t~mem9 := read~real({ base: ~#sf_u~1!base, offset: ~#sf_u~1!offset }, 4); [L110] ~a~0 := #t~mem9; [L110] FCALL call write~int(#t~union10, { base: ~#sf_u~1!base, offset: ~#sf_u~1!offset }, 4); [L110] havoc #t~mem9; [L110] havoc #t~union10; [L108] FCALL call ULTIMATE.dealloc(~#sf_u~1); [L108] havoc ~#sf_u~1; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418247E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L113] FCALL call ~#sf_u~2 := #Ultimate.alloc(4); [L114] FCALL call write~int(~hb~0, { base: ~#sf_u~2!base, offset: ~#sf_u~2!offset }, 4); [L115] FCALL call #t~mem11 := read~real({ base: ~#sf_u~2!base, offset: ~#sf_u~2!offset }, 4); [L115] ~b~0 := #t~mem11; [L115] FCALL call write~int(#t~union12, { base: ~#sf_u~2!base, offset: ~#sf_u~2!offset }, 4); [L115] havoc #t~mem11; [L115] havoc #t~union12; [L113] FCALL call ULTIMATE.dealloc(~#sf_u~2); [L113] havoc ~#sf_u~2; VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418264E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L117] COND TRUE ~ha~0 - ~hb~0 > 251658240 [L118] #res := ~someBinaryArithmeticFLOAToperation(~a~0, ~b~0); VAL [#in~x=1.0737418247E10, #in~y=1.0737418248E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418264E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418247E10, ~y=1.0737418248E10] [L231] RET call #t~ret36 := __ieee754_hypotf(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret36=1.0737418243E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [L231] ~res~0 := #t~ret36; [L231] havoc #t~ret36; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [L233] CALL call #t~ret37 := isinf_float(~res~0); VAL [#in~x=1.0737418243E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L211-L220] ~x := #in~x; [L212] havoc ~ix~1; VAL [#in~x=1.0737418243E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L214] FCALL call ~#gf_u~3 := #Ultimate.alloc(4); [L215] FCALL call write~real(~x, { base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L216] FCALL call #t~mem33 := read~int({ base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L216] ~ix~1 := (if #t~mem33 % 4294967296 % 4294967296 <= 2147483647 then #t~mem33 % 4294967296 % 4294967296 else #t~mem33 % 4294967296 % 4294967296 - 4294967296); [L216] FCALL call write~real(#t~union34, { base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L216] havoc #t~union34; [L216] havoc #t~mem33; [L214] FCALL call ULTIMATE.dealloc(~#gf_u~3); [L214] havoc ~#gf_u~3; VAL [#in~x=1.0737418243E10, #NULL!base=0, #NULL!offset=0, ~ix~1=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L218] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647); [L219] #res := (if 2139095040 == ~ix~1 then 1 else 0); VAL [#in~x=1.0737418243E10, #NULL!base=0, #NULL!offset=0, #res=0, ~ix~1=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L233] RET call #t~ret37 := isinf_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret37=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [L233] assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret37=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [L233] COND TRUE 0 == #t~ret37 [L233] havoc #t~ret37; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [L234] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418247E10, ~y~0=1.0737418248E10] [L12] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; VAL [\old(one_sqrt)=10737418249, \old(tiny_sqrt)=10737418259, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L229] float x = __VERIFIER_nondet_float(); [L230] float y = -1.0f / 0.0f; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418247] [L231] CALL, EXPR __ieee754_hypotf(x, y) VAL [\old(x)=10737418247, \old(y)=10737418248, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L82] float a = x, b = y, t1, t2, y1, y2, w; [L83] __int32_t j, k, ha, hb; VAL [\old(x)=10737418247, \old(y)=10737418248, a=10737418247, b=10737418248, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418247, y=10737418248] [L86] ieee_float_shape_type gf_u; [L87] gf_u.value = (x) [L88] EXPR gf_u.word [L88] (ha) = gf_u.word [L90] ha &= 0x7fffffffL VAL [\old(x)=10737418247, \old(y)=10737418248, a=10737418247, b=10737418248, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418247, y=10737418248] [L92] ieee_float_shape_type gf_u; [L93] gf_u.value = (y) [L94] EXPR gf_u.word [L94] (hb) = gf_u.word [L96] hb &= 0x7fffffffL VAL [\old(x)=10737418247, \old(y)=10737418248, a=10737418247, b=10737418248, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418247, y=10737418248] [L97] COND TRUE hb > ha [L98] a = y [L99] b = x [L100] j = ha [L101] ha = hb [L102] hb = j VAL [\old(x)=10737418247, \old(y)=10737418248, a=10737418248, b=10737418247, ha=251658239, hb=-2, j=-2, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418247, y=10737418248] [L108] ieee_float_shape_type sf_u; [L109] sf_u.word = (ha) [L110] EXPR sf_u.value [L110] (a) = sf_u.value [L113] ieee_float_shape_type sf_u; [L114] sf_u.word = (hb) [L115] EXPR sf_u.value [L115] (b) = sf_u.value [L117] COND TRUE (ha - hb) > 0xf000000L [L118] return a + b; VAL [\old(x)=10737418247, \old(y)=10737418248, a=10737418263, b=10737418264, ha=251658239, hb=-2, j=-2, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418247, y=10737418248] [L231] RET, EXPR __ieee754_hypotf(x, y) VAL [__ieee754_hypotf(x, y)=10737418243, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418247, y=10737418248] [L231] float res = __ieee754_hypotf(x, y); [L233] CALL, EXPR isinf_float(res) VAL [\old(x)=10737418243, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L212] __int32_t ix; VAL [\old(x)=10737418243, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243] [L214] ieee_float_shape_type gf_u; [L215] gf_u.value = (x) [L216] EXPR gf_u.word [L216] (ix) = gf_u.word [L218] ix &= 0x7fffffff [L219] return ((ix) == 0x7f800000L); VAL [\old(x)=10737418243, \result=0, ix=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243] [L233] RET, EXPR isinf_float(res) VAL [isinf_float(res)=0, one_sqrt=1, res=10737418243, tiny_sqrt=1/1000000000000000000000000000000, x=10737418247, y=10737418248] [L233] COND TRUE !isinf_float(res) [L234] __VERIFIER_error() VAL [one_sqrt=1, res=10737418243, tiny_sqrt=1/1000000000000000000000000000000, x=10737418247, y=10737418248] ----- [2018-11-23 02:30:40,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:30:40 BoogieIcfgContainer [2018-11-23 02:30:40,257 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 02:30:40,257 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:30:40,258 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:30:40,258 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:30:40,258 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:30:39" (3/4) ... [2018-11-23 02:30:40,261 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 02:30:40,262 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:30:40,262 INFO L168 Benchmark]: Toolchain (without parser) took 1285.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 960.9 MB in the beginning and 1.1 GB in the end (delta: -89.3 MB). Peak memory consumption was 48.1 MB. Max. memory is 11.5 GB. [2018-11-23 02:30:40,264 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:30:40,264 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 960.9 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2018-11-23 02:30:40,264 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.42 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:30:40,265 INFO L168 Benchmark]: Boogie Preprocessor took 46.56 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-23 02:30:40,265 INFO L168 Benchmark]: RCFGBuilder took 463.28 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: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2018-11-23 02:30:40,266 INFO L168 Benchmark]: TraceAbstraction took 468.10 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: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-11-23 02:30:40,266 INFO L168 Benchmark]: Witness Printer took 4.25 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-23 02:30:40,268 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 271.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 960.9 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.42 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.56 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 463.28 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: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 468.10 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: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.25 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: 234]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryArithmeticFLOAToperation at line 118, overapproximation of bitwiseAnd at line 218. Possible FailurePath: [L12] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; VAL [\old(one_sqrt)=10737418249, \old(tiny_sqrt)=10737418259, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L229] float x = __VERIFIER_nondet_float(); [L230] float y = -1.0f / 0.0f; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418247] [L231] CALL, EXPR __ieee754_hypotf(x, y) VAL [\old(x)=10737418247, \old(y)=10737418248, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L82] float a = x, b = y, t1, t2, y1, y2, w; [L83] __int32_t j, k, ha, hb; VAL [\old(x)=10737418247, \old(y)=10737418248, a=10737418247, b=10737418248, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418247, y=10737418248] [L86] ieee_float_shape_type gf_u; [L87] gf_u.value = (x) [L88] EXPR gf_u.word [L88] (ha) = gf_u.word [L90] ha &= 0x7fffffffL VAL [\old(x)=10737418247, \old(y)=10737418248, a=10737418247, b=10737418248, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418247, y=10737418248] [L92] ieee_float_shape_type gf_u; [L93] gf_u.value = (y) [L94] EXPR gf_u.word [L94] (hb) = gf_u.word [L96] hb &= 0x7fffffffL VAL [\old(x)=10737418247, \old(y)=10737418248, a=10737418247, b=10737418248, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418247, y=10737418248] [L97] COND TRUE hb > ha [L98] a = y [L99] b = x [L100] j = ha [L101] ha = hb [L102] hb = j VAL [\old(x)=10737418247, \old(y)=10737418248, a=10737418248, b=10737418247, ha=251658239, hb=-2, j=-2, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418247, y=10737418248] [L108] ieee_float_shape_type sf_u; [L109] sf_u.word = (ha) [L110] EXPR sf_u.value [L110] (a) = sf_u.value [L113] ieee_float_shape_type sf_u; [L114] sf_u.word = (hb) [L115] EXPR sf_u.value [L115] (b) = sf_u.value [L117] COND TRUE (ha - hb) > 0xf000000L [L118] return a + b; VAL [\old(x)=10737418247, \old(y)=10737418248, a=10737418263, b=10737418264, ha=251658239, hb=-2, j=-2, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418247, y=10737418248] [L231] RET, EXPR __ieee754_hypotf(x, y) VAL [__ieee754_hypotf(x, y)=10737418243, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418247, y=10737418248] [L231] float res = __ieee754_hypotf(x, y); [L233] CALL, EXPR isinf_float(res) VAL [\old(x)=10737418243, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L212] __int32_t ix; VAL [\old(x)=10737418243, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243] [L214] ieee_float_shape_type gf_u; [L215] gf_u.value = (x) [L216] EXPR gf_u.word [L216] (ix) = gf_u.word [L218] ix &= 0x7fffffff [L219] return ((ix) == 0x7f800000L); VAL [\old(x)=10737418243, \result=0, ix=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243] [L233] RET, EXPR isinf_float(res) VAL [isinf_float(res)=0, one_sqrt=1, res=10737418243, tiny_sqrt=1/1000000000000000000000000000000, x=10737418247, y=10737418248] [L233] COND TRUE !isinf_float(res) [L234] __VERIFIER_error() VAL [one_sqrt=1, res=10737418243, tiny_sqrt=1/1000000000000000000000000000000, x=10737418247, y=10737418248] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 102 locations, 1 error locations. UNSAFE Result, 0.4s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 124 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 729 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 02:30:41,803 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:30:41,804 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:30:41,812 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:30:41,813 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:30:41,813 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:30:41,814 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:30:41,815 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:30:41,817 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:30:41,818 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:30:41,818 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:30:41,818 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:30:41,819 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:30:41,820 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:30:41,821 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:30:41,822 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:30:41,822 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:30:41,824 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:30:41,825 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:30:41,827 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:30:41,827 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:30:41,828 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:30:41,830 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:30:41,830 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:30:41,830 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:30:41,831 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:30:41,832 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:30:41,833 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:30:41,833 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:30:41,834 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:30:41,834 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:30:41,835 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:30:41,835 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:30:41,835 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:30:41,836 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:30:41,836 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:30:41,837 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 02:30:41,849 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:30:41,849 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:30:41,850 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:30:41,850 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:30:41,850 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 02:30:41,850 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 02:30:41,850 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 02:30:41,850 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 02:30:41,851 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 02:30:41,851 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 02:30:41,851 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:30:41,851 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:30:41,851 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:30:41,852 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:30:41,852 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:30:41,852 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:30:41,852 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:30:41,852 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 02:30:41,852 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 02:30:41,853 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:30:41,853 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:30:41,853 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:30:41,853 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:30:41,853 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:30:41,853 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:30:41,854 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:30:41,854 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:30:41,854 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:30:41,854 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:30:41,854 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:30:41,854 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:30:41,854 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 02:30:41,854 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:30:41,855 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 02:30:41,855 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 02:30:41,855 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_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan 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 -> Taipan 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 -> 5fe31b16a9cb808afe0897c04a27b4a4516ff173 [2018-11-23 02:30:41,886 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:30:41,895 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:30:41,897 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:30:41,898 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:30:41,899 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:30:41,899 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_1270d_true-unreach-call.c [2018-11-23 02:30:41,940 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/data/2d0beb276/387e9ce876ce4044b6ec67f96ee9058c/FLAG1495e42c3 [2018-11-23 02:30:42,302 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:30:42,302 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/sv-benchmarks/c/float-newlib/float_req_bl_1270d_true-unreach-call.c [2018-11-23 02:30:42,308 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/data/2d0beb276/387e9ce876ce4044b6ec67f96ee9058c/FLAG1495e42c3 [2018-11-23 02:30:42,317 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/data/2d0beb276/387e9ce876ce4044b6ec67f96ee9058c [2018-11-23 02:30:42,319 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:30:42,320 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:30:42,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:30:42,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:30:42,325 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:30:42,326 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:30:42" (1/1) ... [2018-11-23 02:30:42,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bc5cec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:42, skipping insertion in model container [2018-11-23 02:30:42,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:30:42" (1/1) ... [2018-11-23 02:30:42,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:30:42,362 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:30:42,542 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:30:42,547 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:30:42,594 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:30:42,614 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:30:42,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:42 WrapperNode [2018-11-23 02:30:42,615 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:30:42,615 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:30:42,615 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:30:42,616 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:30:42,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:42" (1/1) ... [2018-11-23 02:30:42,634 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:42" (1/1) ... [2018-11-23 02:30:42,641 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:30:42,641 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:30:42,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:30:42,642 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:30:42,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:42" (1/1) ... [2018-11-23 02:30:42,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:42" (1/1) ... [2018-11-23 02:30:42,702 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:42" (1/1) ... [2018-11-23 02:30:42,702 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:42" (1/1) ... [2018-11-23 02:30:42,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:42" (1/1) ... [2018-11-23 02:30:42,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:42" (1/1) ... [2018-11-23 02:30:42,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:42" (1/1) ... [2018-11-23 02:30:42,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:30:42,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:30:42,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:30:42,733 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:30:42,733 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/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-23 02:30:42,772 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:30:42,772 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:30:42,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-11-23 02:30:42,772 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_float [2018-11-23 02:30:42,772 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_float [2018-11-23 02:30:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:30:42,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:30:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:30:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 02:30:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:30:42,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:30:42,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-11-23 02:30:42,774 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_hypotf [2018-11-23 02:30:42,774 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_hypotf [2018-11-23 02:30:42,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 02:30:42,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 02:30:42,774 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrtf [2018-11-23 02:30:42,774 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrtf [2018-11-23 02:30:44,515 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:30:44,515 INFO L280 CfgBuilder]: Removed 34 assue(true) statements. [2018-11-23 02:30:44,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:30:44 BoogieIcfgContainer [2018-11-23 02:30:44,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:30:44,516 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:30:44,516 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:30:44,519 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:30:44,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:30:42" (1/3) ... [2018-11-23 02:30:44,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3947a2a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:30:44, skipping insertion in model container [2018-11-23 02:30:44,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:30:42" (2/3) ... [2018-11-23 02:30:44,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3947a2a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:30:44, skipping insertion in model container [2018-11-23 02:30:44,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:30:44" (3/3) ... [2018-11-23 02:30:44,522 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270d_true-unreach-call.c [2018-11-23 02:30:44,528 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:30:44,535 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 02:30:44,546 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 02:30:44,569 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 02:30:44,570 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:30:44,570 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:30:44,570 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:30:44,570 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:30:44,570 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:30:44,571 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:30:44,571 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:30:44,571 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:30:44,586 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states. [2018-11-23 02:30:44,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 02:30:44,591 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:30:44,592 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-23 02:30:44,593 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:30:44,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:30:44,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1684593163, now seen corresponding path program 1 times [2018-11-23 02:30:44,601 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:30:44,602 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/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-23 02:30:44,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:30:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:30:44,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:30:44,710 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-23 02:30:44,711 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:30:44,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:30:44,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:30:44,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 02:30:44,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 02:30:44,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 02:30:44,739 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 2 states. [2018-11-23 02:30:44,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:30:44,767 INFO L93 Difference]: Finished difference Result 194 states and 311 transitions. [2018-11-23 02:30:44,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 02:30:44,769 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-11-23 02:30:44,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:30:44,777 INFO L225 Difference]: With dead ends: 194 [2018-11-23 02:30:44,777 INFO L226 Difference]: Without dead ends: 97 [2018-11-23 02:30:44,780 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-23 02:30:44,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-23 02:30:44,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-11-23 02:30:44,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 02:30:44,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2018-11-23 02:30:44,818 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 27 [2018-11-23 02:30:44,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:30:44,819 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2018-11-23 02:30:44,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 02:30:44,819 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2018-11-23 02:30:44,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 02:30:44,820 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:30:44,821 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-23 02:30:44,821 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:30:44,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:30:44,822 INFO L82 PathProgramCache]: Analyzing trace with hash -592227502, now seen corresponding path program 1 times [2018-11-23 02:30:44,822 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:30:44,822 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/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-23 02:30:44,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:30:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:30:44,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:30:47,897 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-23 02:30:47,897 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:30:47,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:30:47,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-11-23 02:30:47,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 02:30:47,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 02:30:47,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-11-23 02:30:47,914 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand 17 states. [2018-11-23 02:30:49,572 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-11-23 02:30:53,331 WARN L180 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2018-11-23 02:31:06,123 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-23 02:31:32,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:31:32,383 INFO L93 Difference]: Finished difference Result 181 states and 225 transitions. [2018-11-23 02:31:32,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 02:31:32,437 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-11-23 02:31:32,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:31:32,440 INFO L225 Difference]: With dead ends: 181 [2018-11-23 02:31:32,441 INFO L226 Difference]: Without dead ends: 174 [2018-11-23 02:31:32,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2018-11-23 02:31:32,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-23 02:31:32,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 102. [2018-11-23 02:31:32,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 02:31:32,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 124 transitions. [2018-11-23 02:31:32,457 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 124 transitions. Word has length 32 [2018-11-23 02:31:32,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:31:32,457 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 124 transitions. [2018-11-23 02:31:32,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 02:31:32,458 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2018-11-23 02:31:32,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 02:31:32,459 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:31:32,459 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-23 02:31:32,459 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:31:32,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:31:32,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1708595088, now seen corresponding path program 1 times [2018-11-23 02:31:32,460 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:31:32,460 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/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-23 02:31:32,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:31:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:31:32,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:31:32,933 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-23 02:31:32,933 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:31:32,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:31:32,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 02:31:32,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:31:32,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:31:32,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:31:32,944 INFO L87 Difference]: Start difference. First operand 102 states and 124 transitions. Second operand 9 states. [2018-11-23 02:32:24,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:32:24,680 INFO L93 Difference]: Finished difference Result 199 states and 242 transitions. [2018-11-23 02:32:24,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 02:32:24,732 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-23 02:32:24,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:32:24,735 INFO L225 Difference]: With dead ends: 199 [2018-11-23 02:32:24,735 INFO L226 Difference]: Without dead ends: 161 [2018-11-23 02:32:24,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-11-23 02:32:24,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-23 02:32:24,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 106. [2018-11-23 02:32:24,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 02:32:24,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 129 transitions. [2018-11-23 02:32:24,755 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 129 transitions. Word has length 32 [2018-11-23 02:32:24,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:32:24,755 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 129 transitions. [2018-11-23 02:32:24,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:32:24,755 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 129 transitions. [2018-11-23 02:32:24,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 02:32:24,756 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:32:24,757 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] [2018-11-23 02:32:24,757 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:32:24,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:32:24,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1956568480, now seen corresponding path program 1 times [2018-11-23 02:32:24,758 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:32:24,758 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/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-23 02:32:24,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:32:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:32:24,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:32:24,946 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-23 02:32:24,947 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:32:24,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:32:24,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 02:32:24,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 02:32:24,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 02:32:24,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:32:24,956 INFO L87 Difference]: Start difference. First operand 106 states and 129 transitions. Second operand 8 states. [2018-11-23 02:33:10,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:33:10,604 INFO L93 Difference]: Finished difference Result 220 states and 264 transitions. [2018-11-23 02:33:10,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 02:33:10,652 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-11-23 02:33:10,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:33:10,653 INFO L225 Difference]: With dead ends: 220 [2018-11-23 02:33:10,654 INFO L226 Difference]: Without dead ends: 131 [2018-11-23 02:33:10,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-11-23 02:33:10,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-23 02:33:10,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 104. [2018-11-23 02:33:10,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 02:33:10,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 125 transitions. [2018-11-23 02:33:10,671 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 125 transitions. Word has length 35 [2018-11-23 02:33:10,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:33:10,671 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 125 transitions. [2018-11-23 02:33:10,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 02:33:10,671 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 125 transitions. [2018-11-23 02:33:10,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 02:33:10,673 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:33:10,673 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] [2018-11-23 02:33:10,673 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:33:10,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:33:10,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1068264538, now seen corresponding path program 1 times [2018-11-23 02:33:10,674 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:33:10,674 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/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-23 02:33:10,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:33:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:33:10,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:33:10,932 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-23 02:33:10,932 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:33:10,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:33:10,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 02:33:10,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:33:10,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:33:10,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:33:10,941 INFO L87 Difference]: Start difference. First operand 104 states and 125 transitions. Second operand 9 states. [2018-11-23 02:33:34,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:33:34,012 INFO L93 Difference]: Finished difference Result 151 states and 179 transitions. [2018-11-23 02:33:34,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:33:34,069 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-11-23 02:33:34,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:33:34,070 INFO L225 Difference]: With dead ends: 151 [2018-11-23 02:33:34,070 INFO L226 Difference]: Without dead ends: 137 [2018-11-23 02:33:34,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-11-23 02:33:34,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-23 02:33:34,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 107. [2018-11-23 02:33:34,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-23 02:33:34,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2018-11-23 02:33:34,087 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 37 [2018-11-23 02:33:34,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:33:34,087 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2018-11-23 02:33:34,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:33:34,087 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2018-11-23 02:33:34,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 02:33:34,088 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:33:34,088 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] [2018-11-23 02:33:34,089 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:33:34,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:33:34,089 INFO L82 PathProgramCache]: Analyzing trace with hash 57147288, now seen corresponding path program 1 times [2018-11-23 02:33:34,089 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:33:34,089 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-11-23 02:33:34,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:33:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:33:34,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:33:34,679 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-23 02:33:34,679 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:33:34,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:33:34,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-11-23 02:33:34,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 02:33:34,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 02:33:34,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-11-23 02:33:34,694 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand 16 states. [2018-11-23 02:34:10,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:34:10,943 INFO L93 Difference]: Finished difference Result 141 states and 168 transitions. [2018-11-23 02:34:10,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 02:34:10,944 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2018-11-23 02:34:10,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:34:10,945 INFO L225 Difference]: With dead ends: 141 [2018-11-23 02:34:10,945 INFO L226 Difference]: Without dead ends: 132 [2018-11-23 02:34:10,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2018-11-23 02:34:10,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-23 02:34:10,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 107. [2018-11-23 02:34:10,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-23 02:34:10,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 129 transitions. [2018-11-23 02:34:10,963 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 129 transitions. Word has length 37 [2018-11-23 02:34:10,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:34:10,964 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 129 transitions. [2018-11-23 02:34:10,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 02:34:10,964 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2018-11-23 02:34:10,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 02:34:10,965 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:34:10,965 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] [2018-11-23 02:34:10,965 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:34:10,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:34:10,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1222716390, now seen corresponding path program 1 times [2018-11-23 02:34:10,966 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:34:10,966 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-11-23 02:34:10,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:34:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:34:11,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:34:11,123 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-23 02:34:11,124 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:34:11,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:34:11,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 02:34:11,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 02:34:11,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 02:34:11,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:34:11,132 INFO L87 Difference]: Start difference. First operand 107 states and 129 transitions. Second operand 8 states. [2018-11-23 02:34:23,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:34:23,551 INFO L93 Difference]: Finished difference Result 180 states and 212 transitions. [2018-11-23 02:34:23,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 02:34:23,603 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-11-23 02:34:23,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:34:23,604 INFO L225 Difference]: With dead ends: 180 [2018-11-23 02:34:23,604 INFO L226 Difference]: Without dead ends: 119 [2018-11-23 02:34:23,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-11-23 02:34:23,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-23 02:34:23,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 98. [2018-11-23 02:34:23,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-23 02:34:23,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 117 transitions. [2018-11-23 02:34:23,617 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 117 transitions. Word has length 37 [2018-11-23 02:34:23,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:34:23,617 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 117 transitions. [2018-11-23 02:34:23,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 02:34:23,617 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2018-11-23 02:34:23,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 02:34:23,618 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:34:23,618 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] [2018-11-23 02:34:23,618 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:34:23,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:34:23,619 INFO L82 PathProgramCache]: Analyzing trace with hash -737173796, now seen corresponding path program 1 times [2018-11-23 02:34:23,619 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:34:23,619 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-11-23 02:34:23,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:34:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:34:23,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:34:24,010 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-23 02:34:24,011 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:34:24,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:34:24,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-23 02:34:24,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 02:34:24,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 02:34:24,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-23 02:34:24,019 INFO L87 Difference]: Start difference. First operand 98 states and 117 transitions. Second operand 15 states. [2018-11-23 02:34:44,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:34:44,844 INFO L93 Difference]: Finished difference Result 126 states and 149 transitions. [2018-11-23 02:34:44,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 02:34:44,845 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-11-23 02:34:44,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:34:44,846 INFO L225 Difference]: With dead ends: 126 [2018-11-23 02:34:44,846 INFO L226 Difference]: Without dead ends: 116 [2018-11-23 02:34:44,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2018-11-23 02:34:44,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-23 02:34:44,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 95. [2018-11-23 02:34:44,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-23 02:34:44,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 112 transitions. [2018-11-23 02:34:44,858 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 112 transitions. Word has length 37 [2018-11-23 02:34:44,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:34:44,858 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 112 transitions. [2018-11-23 02:34:44,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 02:34:44,859 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 112 transitions. [2018-11-23 02:34:44,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 02:34:44,859 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:34:44,859 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] [2018-11-23 02:34:44,860 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:34:44,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:34:44,860 INFO L82 PathProgramCache]: Analyzing trace with hash 184471245, now seen corresponding path program 1 times [2018-11-23 02:34:44,860 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:34:44,860 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-11-23 02:34:44,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:34:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:34:44,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:34:45,135 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-23 02:34:45,135 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:34:45,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:34:45,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 02:34:45,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:34:45,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:34:45,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:34:45,144 INFO L87 Difference]: Start difference. First operand 95 states and 112 transitions. Second operand 9 states. [2018-11-23 02:34:45,892 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-11-23 02:35:10,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:35:10,689 INFO L93 Difference]: Finished difference Result 133 states and 154 transitions. [2018-11-23 02:35:10,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 02:35:10,738 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-11-23 02:35:10,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:35:10,738 INFO L225 Difference]: With dead ends: 133 [2018-11-23 02:35:10,738 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 02:35:10,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-11-23 02:35:10,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 02:35:10,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-23 02:35:10,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 02:35:10,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2018-11-23 02:35:10,746 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 40 [2018-11-23 02:35:10,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:35:10,746 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2018-11-23 02:35:10,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:35:10,747 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2018-11-23 02:35:10,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 02:35:10,747 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:35:10,747 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:35:10,747 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:35:10,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:10,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1129799865, now seen corresponding path program 1 times [2018-11-23 02:35:10,748 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:35:10,748 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-11-23 02:35:10,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:35:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:35:11,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:35:11,396 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-23 02:35:11,396 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:35:11,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:35:11,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 02:35:11,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:35:11,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:35:11,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:35:11,409 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand 9 states. [2018-11-23 02:35:17,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:35:17,963 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2018-11-23 02:35:18,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:35:18,004 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2018-11-23 02:35:18,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:35:18,005 INFO L225 Difference]: With dead ends: 72 [2018-11-23 02:35:18,005 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 02:35:18,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-11-23 02:35:18,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 02:35:18,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 02:35:18,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 02:35:18,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 02:35:18,006 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2018-11-23 02:35:18,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:35:18,006 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 02:35:18,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:35:18,006 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 02:35:18,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 02:35:18,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 02:35:18,435 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 19 [2018-11-23 02:35:18,625 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 19 [2018-11-23 02:35:18,746 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 19 [2018-11-23 02:35:18,863 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 19 [2018-11-23 02:35:19,067 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 19 [2018-11-23 02:35:19,249 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 19 [2018-11-23 02:35:19,655 WARN L180 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 19 [2018-11-23 02:35:19,859 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 19 [2018-11-23 02:35:20,199 WARN L180 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2018-11-23 02:35:20,201 INFO L448 ceAbstractionStarter]: For program point L213-1(lines 213 217) no Hoare annotation was computed. [2018-11-23 02:35:20,201 INFO L444 ceAbstractionStarter]: At program point L213-2(lines 213 217) the Hoare annotation is: (= |isinf_float_#in~x| isinf_float_~x) [2018-11-23 02:35:20,201 INFO L448 ceAbstractionStarter]: For program point L213-3(lines 213 217) no Hoare annotation was computed. [2018-11-23 02:35:20,201 INFO L451 ceAbstractionStarter]: At program point isinf_floatENTRY(lines 211 220) the Hoare annotation is: true [2018-11-23 02:35:20,201 INFO L448 ceAbstractionStarter]: For program point isinf_floatEXIT(lines 211 220) no Hoare annotation was computed. [2018-11-23 02:35:20,201 INFO L448 ceAbstractionStarter]: For program point isinf_floatFINAL(lines 211 220) no Hoare annotation was computed. [2018-11-23 02:35:20,201 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 02:35:20,201 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 02:35:20,201 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 02:35:20,201 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 02:35:20,201 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 02:35:20,201 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 02:35:20,202 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 02:35:20,202 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 222 238) the Hoare annotation is: true [2018-11-23 02:35:20,202 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 222 238) no Hoare annotation was computed. [2018-11-23 02:35:20,202 INFO L448 ceAbstractionStarter]: For program point L234(line 234) no Hoare annotation was computed. [2018-11-23 02:35:20,202 INFO L444 ceAbstractionStarter]: At program point L233(line 233) the Hoare annotation is: (and (= main_~y~0 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (exists ((v___ieee754_hypotf_~ha~0_24 (_ BitVec 32)) (v___ieee754_hypotf_~hb~0_25 (_ BitVec 32))) (let ((.cse1 (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_25)) (.cse0 (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_24))) (and (= (fp ((_ extract 31 31) v___ieee754_hypotf_~hb~0_25) ((_ extract 30 23) v___ieee754_hypotf_~hb~0_25) ((_ extract 22 0) v___ieee754_hypotf_~hb~0_25)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (bvsgt (bvadd (bvneg .cse0) .cse1) (_ bv251658240 32)) (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) main_~res~0))))) [2018-11-23 02:35:20,202 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 222 238) no Hoare annotation was computed. [2018-11-23 02:35:20,202 INFO L448 ceAbstractionStarter]: For program point L233-1(lines 233 236) no Hoare annotation was computed. [2018-11-23 02:35:20,202 INFO L444 ceAbstractionStarter]: At program point L231(line 231) the Hoare annotation is: (= main_~y~0 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) [2018-11-23 02:35:20,202 INFO L448 ceAbstractionStarter]: For program point L231-1(line 231) no Hoare annotation was computed. [2018-11-23 02:35:20,202 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 234) no Hoare annotation was computed. [2018-11-23 02:35:20,202 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 126 127) no Hoare annotation was computed. [2018-11-23 02:35:20,202 INFO L448 ceAbstractionStarter]: For program point L85-1(lines 85 89) no Hoare annotation was computed. [2018-11-23 02:35:20,202 INFO L444 ceAbstractionStarter]: At program point L85-2(lines 85 89) the Hoare annotation is: (= |__ieee754_hypotf_#in~y| __ieee754_hypotf_~y) [2018-11-23 02:35:20,202 INFO L448 ceAbstractionStarter]: For program point L85-3(lines 85 89) no Hoare annotation was computed. [2018-11-23 02:35:20,203 INFO L448 ceAbstractionStarter]: For program point L176-1(lines 176 180) no Hoare annotation was computed. [2018-11-23 02:35:20,203 INFO L444 ceAbstractionStarter]: At program point L176-2(lines 176 180) the Hoare annotation is: (and (= |__ieee754_hypotf_#in~y| __ieee754_hypotf_~y) (exists ((v___ieee754_hypotf_~hb~0_34 (_ BitVec 32))) (and (not (= (bvadd (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_34) (_ bv2155872256 32)) (_ bv0 32))) (= (fp ((_ extract 31 31) v___ieee754_hypotf_~hb~0_34) ((_ extract 30 23) v___ieee754_hypotf_~hb~0_34) ((_ extract 22 0) v___ieee754_hypotf_~hb~0_34)) |__ieee754_hypotf_#in~y|)))) [2018-11-23 02:35:20,203 INFO L448 ceAbstractionStarter]: For program point L176-3(lines 176 180) no Hoare annotation was computed. [2018-11-23 02:35:20,203 INFO L448 ceAbstractionStarter]: For program point L185-1(lines 185 189) no Hoare annotation was computed. [2018-11-23 02:35:20,203 INFO L444 ceAbstractionStarter]: At program point L185-2(lines 185 189) the Hoare annotation is: (and (= |__ieee754_hypotf_#in~y| __ieee754_hypotf_~y) (exists ((v___ieee754_hypotf_~hb~0_34 (_ BitVec 32))) (and (not (= (bvadd (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_34) (_ bv2155872256 32)) (_ bv0 32))) (= (fp ((_ extract 31 31) v___ieee754_hypotf_~hb~0_34) ((_ extract 30 23) v___ieee754_hypotf_~hb~0_34) ((_ extract 22 0) v___ieee754_hypotf_~hb~0_34)) |__ieee754_hypotf_#in~y|)))) [2018-11-23 02:35:20,203 INFO L448 ceAbstractionStarter]: For program point L185-3(lines 185 189) no Hoare annotation was computed. [2018-11-23 02:35:20,203 INFO L448 ceAbstractionStarter]: For program point L161-1(lines 161 165) no Hoare annotation was computed. [2018-11-23 02:35:20,203 INFO L444 ceAbstractionStarter]: At program point L161-2(lines 161 165) the Hoare annotation is: (and (= |__ieee754_hypotf_#in~y| __ieee754_hypotf_~y) (exists ((v___ieee754_hypotf_~hb~0_34 (_ BitVec 32))) (and (not (= (bvadd (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_34) (_ bv2155872256 32)) (_ bv0 32))) (= (fp ((_ extract 31 31) v___ieee754_hypotf_~hb~0_34) ((_ extract 30 23) v___ieee754_hypotf_~hb~0_34) ((_ extract 22 0) v___ieee754_hypotf_~hb~0_34)) |__ieee754_hypotf_#in~y|)))) [2018-11-23 02:35:20,203 INFO L448 ceAbstractionStarter]: For program point __ieee754_hypotfFINAL(lines 81 208) no Hoare annotation was computed. [2018-11-23 02:35:20,203 INFO L448 ceAbstractionStarter]: For program point L145(lines 145 172) no Hoare annotation was computed. [2018-11-23 02:35:20,203 INFO L448 ceAbstractionStarter]: For program point L112(lines 112 116) no Hoare annotation was computed. [2018-11-23 02:35:20,203 INFO L448 ceAbstractionStarter]: For program point L112-1(lines 81 208) no Hoare annotation was computed. [2018-11-23 02:35:20,203 INFO L448 ceAbstractionStarter]: For program point L112-2(lines 81 208) no Hoare annotation was computed. [2018-11-23 02:35:20,203 INFO L448 ceAbstractionStarter]: For program point __ieee754_hypotfEXIT(lines 81 208) no Hoare annotation was computed. [2018-11-23 02:35:20,203 INFO L451 ceAbstractionStarter]: At program point __ieee754_hypotfENTRY(lines 81 208) the Hoare annotation is: true [2018-11-23 02:35:20,203 INFO L448 ceAbstractionStarter]: For program point L121(lines 121 144) no Hoare annotation was computed. [2018-11-23 02:35:20,203 INFO L448 ceAbstractionStarter]: For program point L121-1(lines 81 208) no Hoare annotation was computed. [2018-11-23 02:35:20,204 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 171) no Hoare annotation was computed. [2018-11-23 02:35:20,204 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 106) no Hoare annotation was computed. [2018-11-23 02:35:20,204 INFO L448 ceAbstractionStarter]: For program point L122(lines 122 129) no Hoare annotation was computed. [2018-11-23 02:35:20,204 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 143) no Hoare annotation was computed. [2018-11-23 02:35:20,204 INFO L448 ceAbstractionStarter]: For program point L139-1(lines 121 144) no Hoare annotation was computed. [2018-11-23 02:35:20,204 INFO L444 ceAbstractionStarter]: At program point L197(line 197) the Hoare annotation is: (and (= |__ieee754_hypotf_#in~y| __ieee754_hypotf_~y) (exists ((v___ieee754_hypotf_~hb~0_34 (_ BitVec 32))) (and (not (= (bvadd (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_34) (_ bv2155872256 32)) (_ bv0 32))) (= (fp ((_ extract 31 31) v___ieee754_hypotf_~hb~0_34) ((_ extract 30 23) v___ieee754_hypotf_~hb~0_34) ((_ extract 22 0) v___ieee754_hypotf_~hb~0_34)) |__ieee754_hypotf_#in~y|)))) [2018-11-23 02:35:20,204 INFO L448 ceAbstractionStarter]: For program point L197-1(line 197) no Hoare annotation was computed. [2018-11-23 02:35:20,204 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 171) no Hoare annotation was computed. [2018-11-23 02:35:20,204 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 111) no Hoare annotation was computed. [2018-11-23 02:35:20,204 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 81 208) no Hoare annotation was computed. [2018-11-23 02:35:20,204 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 125) no Hoare annotation was computed. [2018-11-23 02:35:20,204 INFO L448 ceAbstractionStarter]: For program point L91-1(lines 91 95) no Hoare annotation was computed. [2018-11-23 02:35:20,204 INFO L448 ceAbstractionStarter]: For program point L124-2(lines 122 129) no Hoare annotation was computed. [2018-11-23 02:35:20,204 INFO L444 ceAbstractionStarter]: At program point L91-2(lines 91 95) the Hoare annotation is: (and (= |__ieee754_hypotf_#in~y| __ieee754_hypotf_~y) (exists ((v___ieee754_hypotf_~ha~0_29 (_ BitVec 32))) (= __ieee754_hypotf_~ha~0 (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_29)))) [2018-11-23 02:35:20,204 INFO L448 ceAbstractionStarter]: For program point L91-3(lines 91 95) no Hoare annotation was computed. [2018-11-23 02:35:20,204 INFO L444 ceAbstractionStarter]: At program point L182(line 182) the Hoare annotation is: (and (= |__ieee754_hypotf_#in~y| __ieee754_hypotf_~y) (exists ((v___ieee754_hypotf_~hb~0_34 (_ BitVec 32))) (and (not (= (bvadd (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_34) (_ bv2155872256 32)) (_ bv0 32))) (= (fp ((_ extract 31 31) v___ieee754_hypotf_~hb~0_34) ((_ extract 30 23) v___ieee754_hypotf_~hb~0_34) ((_ extract 22 0) v___ieee754_hypotf_~hb~0_34)) |__ieee754_hypotf_#in~y|)))) [2018-11-23 02:35:20,204 INFO L448 ceAbstractionStarter]: For program point L182-1(line 182) no Hoare annotation was computed. [2018-11-23 02:35:20,205 INFO L448 ceAbstractionStarter]: For program point L149-1(lines 149 153) no Hoare annotation was computed. [2018-11-23 02:35:20,205 INFO L444 ceAbstractionStarter]: At program point L149-2(lines 149 153) the Hoare annotation is: (and (= |__ieee754_hypotf_#in~y| __ieee754_hypotf_~y) (exists ((v___ieee754_hypotf_~hb~0_34 (_ BitVec 32))) (and (not (= (bvadd (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_34) (_ bv2155872256 32)) (_ bv0 32))) (= (fp ((_ extract 31 31) v___ieee754_hypotf_~hb~0_34) ((_ extract 30 23) v___ieee754_hypotf_~hb~0_34) ((_ extract 22 0) v___ieee754_hypotf_~hb~0_34)) |__ieee754_hypotf_#in~y|)))) [2018-11-23 02:35:20,205 INFO L448 ceAbstractionStarter]: For program point L149-3(lines 149 153) no Hoare annotation was computed. [2018-11-23 02:35:20,205 INFO L448 ceAbstractionStarter]: For program point L166(lines 166 170) no Hoare annotation was computed. [2018-11-23 02:35:20,205 INFO L448 ceAbstractionStarter]: For program point L166-1(lines 157 171) no Hoare annotation was computed. [2018-11-23 02:35:20,205 INFO L448 ceAbstractionStarter]: For program point L191-1(lines 191 195) no Hoare annotation was computed. [2018-11-23 02:35:20,205 INFO L444 ceAbstractionStarter]: At program point L191-2(lines 191 195) the Hoare annotation is: (and (= |__ieee754_hypotf_#in~y| __ieee754_hypotf_~y) (exists ((v___ieee754_hypotf_~hb~0_34 (_ BitVec 32))) (and (not (= (bvadd (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_34) (_ bv2155872256 32)) (_ bv0 32))) (= (fp ((_ extract 31 31) v___ieee754_hypotf_~hb~0_34) ((_ extract 30 23) v___ieee754_hypotf_~hb~0_34) ((_ extract 22 0) v___ieee754_hypotf_~hb~0_34)) |__ieee754_hypotf_#in~y|)))) [2018-11-23 02:35:20,205 INFO L448 ceAbstractionStarter]: For program point L191-3(lines 191 195) no Hoare annotation was computed. [2018-11-23 02:35:20,205 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 198) no Hoare annotation was computed. [2018-11-23 02:35:20,205 INFO L448 ceAbstractionStarter]: For program point L175-2(lines 81 208) no Hoare annotation was computed. [2018-11-23 02:35:20,205 INFO L448 ceAbstractionStarter]: For program point L200-1(lines 200 204) no Hoare annotation was computed. [2018-11-23 02:35:20,205 INFO L444 ceAbstractionStarter]: At program point L200-2(lines 200 204) the Hoare annotation is: (and (= |__ieee754_hypotf_#in~y| __ieee754_hypotf_~y) (exists ((v___ieee754_hypotf_~hb~0_34 (_ BitVec 32))) (and (not (= (bvadd (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_34) (_ bv2155872256 32)) (_ bv0 32))) (= (fp ((_ extract 31 31) v___ieee754_hypotf_~hb~0_34) ((_ extract 30 23) v___ieee754_hypotf_~hb~0_34) ((_ extract 22 0) v___ieee754_hypotf_~hb~0_34)) |__ieee754_hypotf_#in~y|)))) [2018-11-23 02:35:20,205 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 134 138) no Hoare annotation was computed. [2018-11-23 02:35:20,206 INFO L448 ceAbstractionStarter]: For program point L200-3(lines 200 204) no Hoare annotation was computed. [2018-11-23 02:35:20,206 INFO L444 ceAbstractionStarter]: At program point L134-2(lines 134 138) the Hoare annotation is: (and (= |__ieee754_hypotf_#in~y| __ieee754_hypotf_~y) (exists ((v___ieee754_hypotf_~hb~0_34 (_ BitVec 32))) (and (not (= (bvadd (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_34) (_ bv2155872256 32)) (_ bv0 32))) (= (fp ((_ extract 31 31) v___ieee754_hypotf_~hb~0_34) ((_ extract 30 23) v___ieee754_hypotf_~hb~0_34) ((_ extract 22 0) v___ieee754_hypotf_~hb~0_34)) |__ieee754_hypotf_#in~y|)))) [2018-11-23 02:35:20,206 INFO L448 ceAbstractionStarter]: For program point L35-2(lines 35 39) no Hoare annotation was computed. [2018-11-23 02:35:20,206 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 32) no Hoare annotation was computed. [2018-11-23 02:35:20,206 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 56) no Hoare annotation was computed. [2018-11-23 02:35:20,206 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2018-11-23 02:35:20,206 INFO L448 ceAbstractionStarter]: For program point L52-2(lines 52 56) no Hoare annotation was computed. [2018-11-23 02:35:20,206 INFO L451 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: true [2018-11-23 02:35:20,206 INFO L448 ceAbstractionStarter]: For program point L19-3(lines 19 23) no Hoare annotation was computed. [2018-11-23 02:35:20,206 INFO L448 ceAbstractionStarter]: For program point L73-1(lines 73 77) no Hoare annotation was computed. [2018-11-23 02:35:20,207 INFO L451 ceAbstractionStarter]: At program point L73-2(lines 73 77) the Hoare annotation is: true [2018-11-23 02:35:20,207 INFO L448 ceAbstractionStarter]: For program point L73-3(lines 73 77) no Hoare annotation was computed. [2018-11-23 02:35:20,207 INFO L448 ceAbstractionStarter]: For program point L36-2(lines 36 37) no Hoare annotation was computed. [2018-11-23 02:35:20,207 INFO L451 ceAbstractionStarter]: At program point L36-3(lines 36 37) the Hoare annotation is: true [2018-11-23 02:35:20,207 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 68) no Hoare annotation was computed. [2018-11-23 02:35:20,207 INFO L448 ceAbstractionStarter]: For program point L36-4(lines 36 37) no Hoare annotation was computed. [2018-11-23 02:35:20,207 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 70) no Hoare annotation was computed. [2018-11-23 02:35:20,207 INFO L451 ceAbstractionStarter]: At program point __ieee754_sqrtfENTRY(lines 14 79) the Hoare annotation is: true [2018-11-23 02:35:20,207 INFO L448 ceAbstractionStarter]: For program point __ieee754_sqrtfFINAL(lines 14 79) no Hoare annotation was computed. [2018-11-23 02:35:20,207 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 30) no Hoare annotation was computed. [2018-11-23 02:35:20,207 INFO L448 ceAbstractionStarter]: For program point __ieee754_sqrtfEXIT(lines 14 79) no Hoare annotation was computed. [2018-11-23 02:35:20,208 INFO L451 ceAbstractionStarter]: At program point L50-2(lines 50 59) the Hoare annotation is: true [2018-11-23 02:35:20,208 INFO L448 ceAbstractionStarter]: For program point L50-3(lines 14 79) no Hoare annotation was computed. [2018-11-23 02:35:20,208 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 43) no Hoare annotation was computed. [2018-11-23 02:35:20,208 INFO L448 ceAbstractionStarter]: For program point L42-2(lines 42 43) no Hoare annotation was computed. [2018-11-23 02:35:20,208 INFO L448 ceAbstractionStarter]: For program point L63(lines 63 69) no Hoare annotation was computed. [2018-11-23 02:35:20,208 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 27) no Hoare annotation was computed. [2018-11-23 02:35:20,208 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 39) no Hoare annotation was computed. [2018-11-23 02:35:20,214 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,220 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,220 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,220 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,222 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,222 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,222 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,222 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,223 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,223 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,223 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,223 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-11-23 02:35:20,224 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-11-23 02:35:20,224 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,224 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,224 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,224 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,225 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,225 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,225 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,225 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,228 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,228 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,228 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,228 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,228 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,228 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,229 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,229 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,229 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,229 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,230 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,230 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,230 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,230 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,230 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,231 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,231 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,231 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,231 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,231 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,231 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,232 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:35:20 BoogieIcfgContainer [2018-11-23 02:35:20,240 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 02:35:20,240 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:35:20,240 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:35:20,240 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:35:20,241 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:30:44" (3/4) ... [2018-11-23 02:35:20,244 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 02:35:20,248 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isinf_float [2018-11-23 02:35:20,248 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 02:35:20,249 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 02:35:20,249 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ieee754_hypotf [2018-11-23 02:35:20,249 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ieee754_sqrtf [2018-11-23 02:35:20,253 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2018-11-23 02:35:20,253 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-11-23 02:35:20,253 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 02:35:20,253 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 02:35:20,271 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(y) == y [2018-11-23 02:35:20,271 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-11-23 02:35:20,271 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(y) == y && (\exists v___ieee754_hypotf_~ha~0_29 : bv32 :: ha == ~bvand32(2147483647bv32, v___ieee754_hypotf_~ha~0_29)) [2018-11-23 02:35:20,285 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_dea4fa09-5fad-45b4-a059-dce04ae59b67/bin-2019/utaipan/witness.graphml [2018-11-23 02:35:20,285 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:35:20,286 INFO L168 Benchmark]: Toolchain (without parser) took 277966.23 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 231.2 MB). Free memory was 949.2 MB in the beginning and 1.2 GB in the end (delta: -276.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:35:20,287 INFO L168 Benchmark]: CDTParser took 0.17 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-23 02:35:20,287 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.39 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 927.7 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-23 02:35:20,287 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.93 ms. Allocated memory is still 1.0 GB. Free memory is still 927.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:35:20,287 INFO L168 Benchmark]: Boogie Preprocessor took 90.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 927.7 MB in the beginning and 1.1 GB in the end (delta: -199.0 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-23 02:35:20,288 INFO L168 Benchmark]: RCFGBuilder took 1783.38 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: 59.4 MB). Peak memory consumption was 59.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:35:20,288 INFO L168 Benchmark]: TraceAbstraction took 275723.39 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 91.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -160.5 MB). Peak memory consumption was 333.2 MB. Max. memory is 11.5 GB. [2018-11-23 02:35:20,290 INFO L168 Benchmark]: Witness Printer took 45.55 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:35:20,291 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 293.39 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 927.7 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.93 ms. Allocated memory is still 1.0 GB. Free memory is still 927.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 90.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 927.7 MB in the beginning and 1.1 GB in the end (delta: -199.0 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1783.38 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: 59.4 MB). Peak memory consumption was 59.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 275723.39 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 91.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -160.5 MB). Peak memory consumption was 333.2 MB. Max. memory is 11.5 GB. * Witness Printer took 45.55 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 234]: 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: 50]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 200]: Loop Invariant [2018-11-23 02:35:20,295 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,295 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,295 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,295 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,295 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,295 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,295 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] Derived loop invariant: \old(y) == y && (\exists v___ieee754_hypotf_~hb~0_34 : bv32 :: !(~bvadd64(~bvand32(2147483647bv32, v___ieee754_hypotf_~hb~0_34), 2155872256bv32) == 0bv32) && ~fp~LONGDOUBLE(v___ieee754_hypotf_~hb~0_34[31:31], v___ieee754_hypotf_~hb~0_34[30:23], v___ieee754_hypotf_~hb~0_34[22:0]) == \old(y)) - InvariantResult [Line: 134]: Loop Invariant [2018-11-23 02:35:20,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] Derived loop invariant: \old(y) == y && (\exists v___ieee754_hypotf_~hb~0_34 : bv32 :: !(~bvadd64(~bvand32(2147483647bv32, v___ieee754_hypotf_~hb~0_34), 2155872256bv32) == 0bv32) && ~fp~LONGDOUBLE(v___ieee754_hypotf_~hb~0_34[31:31], v___ieee754_hypotf_~hb~0_34[30:23], v___ieee754_hypotf_~hb~0_34[22:0]) == \old(y)) - InvariantResult [Line: 91]: Loop Invariant [2018-11-23 02:35:20,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-11-23 02:35:20,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] Derived loop invariant: \old(y) == y && (\exists v___ieee754_hypotf_~ha~0_29 : bv32 :: ha == ~bvand32(2147483647bv32, v___ieee754_hypotf_~ha~0_29)) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 176]: Loop Invariant [2018-11-23 02:35:20,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,298 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,298 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,298 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,298 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,298 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,298 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,298 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] Derived loop invariant: \old(y) == y && (\exists v___ieee754_hypotf_~hb~0_34 : bv32 :: !(~bvadd64(~bvand32(2147483647bv32, v___ieee754_hypotf_~hb~0_34), 2155872256bv32) == 0bv32) && ~fp~LONGDOUBLE(v___ieee754_hypotf_~hb~0_34[31:31], v___ieee754_hypotf_~hb~0_34[30:23], v___ieee754_hypotf_~hb~0_34[22:0]) == \old(y)) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: \old(x) == x - InvariantResult [Line: 185]: Loop Invariant [2018-11-23 02:35:20,299 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,299 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,299 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,299 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,299 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,300 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,300 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,300 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] Derived loop invariant: \old(y) == y && (\exists v___ieee754_hypotf_~hb~0_34 : bv32 :: !(~bvadd64(~bvand32(2147483647bv32, v___ieee754_hypotf_~hb~0_34), 2155872256bv32) == 0bv32) && ~fp~LONGDOUBLE(v___ieee754_hypotf_~hb~0_34[31:31], v___ieee754_hypotf_~hb~0_34[30:23], v___ieee754_hypotf_~hb~0_34[22:0]) == \old(y)) - InvariantResult [Line: 161]: Loop Invariant [2018-11-23 02:35:20,300 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,300 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,300 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,301 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,301 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,301 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,301 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,301 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] Derived loop invariant: \old(y) == y && (\exists v___ieee754_hypotf_~hb~0_34 : bv32 :: !(~bvadd64(~bvand32(2147483647bv32, v___ieee754_hypotf_~hb~0_34), 2155872256bv32) == 0bv32) && ~fp~LONGDOUBLE(v___ieee754_hypotf_~hb~0_34[31:31], v___ieee754_hypotf_~hb~0_34[30:23], v___ieee754_hypotf_~hb~0_34[22:0]) == \old(y)) - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: \old(y) == y - InvariantResult [Line: 149]: Loop Invariant [2018-11-23 02:35:20,302 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,302 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,302 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,302 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,302 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,303 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,303 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,303 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] Derived loop invariant: \old(y) == y && (\exists v___ieee754_hypotf_~hb~0_34 : bv32 :: !(~bvadd64(~bvand32(2147483647bv32, v___ieee754_hypotf_~hb~0_34), 2155872256bv32) == 0bv32) && ~fp~LONGDOUBLE(v___ieee754_hypotf_~hb~0_34[31:31], v___ieee754_hypotf_~hb~0_34[30:23], v___ieee754_hypotf_~hb~0_34[22:0]) == \old(y)) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 191]: Loop Invariant [2018-11-23 02:35:20,303 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,303 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,303 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,304 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,304 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,304 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,304 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] [2018-11-23 02:35:20,304 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~hb~0_34,QUANTIFIED] Derived loop invariant: \old(y) == y && (\exists v___ieee754_hypotf_~hb~0_34 : bv32 :: !(~bvadd64(~bvand32(2147483647bv32, v___ieee754_hypotf_~hb~0_34), 2155872256bv32) == 0bv32) && ~fp~LONGDOUBLE(v___ieee754_hypotf_~hb~0_34[31:31], v___ieee754_hypotf_~hb~0_34[30:23], v___ieee754_hypotf_~hb~0_34[22:0]) == \old(y)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 101 locations, 1 error locations. SAFE Result, 275.6s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 266.9s AutomataDifference, 0.0s DeadEndRemovalTime, 2.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1172 SDtfs, 1641 SDslu, 7262 SDs, 0 SdLazy, 2393 SolverSat, 126 SolverUnsat, 100 SolverUnknown, 0 SolverNotchecked, 255.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 421 GetRequests, 273 SyntacticMatches, 1 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 11.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=5, 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.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 251 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 118 PreInvPairs, 235 NumberOfFragments, 310 HoareAnnotationTreeSize, 118 FomulaSimplifications, 172366 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 25 FomulaSimplificationsInter, 859 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 363 NumberOfCodeBlocks, 363 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 353 ConstructedInterpolants, 140 QuantifiedInterpolants, 132076 SizeOfPredicates, 47 NumberOfNonLiveVariables, 1106 ConjunctsInSsa, 106 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...