./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.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_685445d7-efb7-4884-85a8-7b56ee49b6ef/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_685445d7-efb7-4884-85a8-7b56ee49b6ef/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_685445d7-efb7-4884-85a8-7b56ee49b6ef/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_685445d7-efb7-4884-85a8-7b56ee49b6ef/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_685445d7-efb7-4884-85a8-7b56ee49b6ef/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_685445d7-efb7-4884-85a8-7b56ee49b6ef/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97ac2503801a101f5a44ae44e4a77e81fa872959 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_685445d7-efb7-4884-85a8-7b56ee49b6ef/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_685445d7-efb7-4884-85a8-7b56ee49b6ef/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_685445d7-efb7-4884-85a8-7b56ee49b6ef/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_685445d7-efb7-4884-85a8-7b56ee49b6ef/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_685445d7-efb7-4884-85a8-7b56ee49b6ef/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_685445d7-efb7-4884-85a8-7b56ee49b6ef/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97ac2503801a101f5a44ae44e4a77e81fa872959 .............................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 09:49:10,474 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:49:10,476 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:49:10,484 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:49:10,484 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:49:10,485 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:49:10,486 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:49:10,487 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:49:10,488 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:49:10,489 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:49:10,489 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:49:10,490 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:49:10,490 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:49:10,491 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:49:10,491 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:49:10,492 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:49:10,492 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:49:10,493 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:49:10,494 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:49:10,495 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:49:10,496 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:49:10,497 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:49:10,498 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:49:10,499 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:49:10,499 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:49:10,499 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:49:10,500 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:49:10,500 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:49:10,501 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:49:10,502 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:49:10,502 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:49:10,502 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:49:10,503 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:49:10,503 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:49:10,503 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:49:10,504 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:49:10,504 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_685445d7-efb7-4884-85a8-7b56ee49b6ef/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 09:49:10,511 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:49:10,512 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:49:10,512 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:49:10,512 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 09:49:10,513 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:49:10,513 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:49:10,513 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 09:49:10,513 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:49:10,514 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:49:10,514 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 09:49:10,514 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:49:10,514 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:49:10,514 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:49:10,514 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:49:10,514 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:49:10,515 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:49:10,515 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:49:10,515 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:49:10,515 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:49:10,515 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:49:10,515 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:49:10,515 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:49:10,516 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 09:49:10,516 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:49:10,516 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:49:10,516 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:49:10,516 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:49:10,516 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 09:49:10,516 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:49:10,517 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 09:49:10,517 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_685445d7-efb7-4884-85a8-7b56ee49b6ef/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97ac2503801a101f5a44ae44e4a77e81fa872959 [2018-11-23 09:49:10,541 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:49:10,551 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:49:10,553 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:49:10,554 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:49:10,555 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:49:10,555 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_685445d7-efb7-4884-85a8-7b56ee49b6ef/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c [2018-11-23 09:49:10,601 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_685445d7-efb7-4884-85a8-7b56ee49b6ef/bin-2019/uautomizer/data/a06248606/a92b961377194fe1aa4d7c2064228745/FLAG715a77bc7 [2018-11-23 09:49:10,905 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:49:10,905 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_685445d7-efb7-4884-85a8-7b56ee49b6ef/sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c [2018-11-23 09:49:10,909 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_685445d7-efb7-4884-85a8-7b56ee49b6ef/bin-2019/uautomizer/data/a06248606/a92b961377194fe1aa4d7c2064228745/FLAG715a77bc7 [2018-11-23 09:49:10,920 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_685445d7-efb7-4884-85a8-7b56ee49b6ef/bin-2019/uautomizer/data/a06248606/a92b961377194fe1aa4d7c2064228745 [2018-11-23 09:49:10,923 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:49:10,924 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:49:10,925 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:49:10,925 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:49:10,928 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:49:10,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:49:10" (1/1) ... [2018-11-23 09:49:10,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bb4fcbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:49:10, skipping insertion in model container [2018-11-23 09:49:10,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:49:10" (1/1) ... [2018-11-23 09:49:10,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:49:10,955 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:49:11,072 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:49:11,074 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:49:11,089 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:49:11,103 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:49:11,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:49:11 WrapperNode [2018-11-23 09:49:11,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:49:11,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:49:11,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:49:11,104 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:49:11,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:49:11" (1/1) ... [2018-11-23 09:49:11,116 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:49:11" (1/1) ... [2018-11-23 09:49:11,120 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:49:11,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:49:11,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:49:11,121 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:49:11,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:49:11" (1/1) ... [2018-11-23 09:49:11,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:49:11" (1/1) ... [2018-11-23 09:49:11,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:49:11" (1/1) ... [2018-11-23 09:49:11,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:49:11" (1/1) ... [2018-11-23 09:49:11,173 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:49:11" (1/1) ... [2018-11-23 09:49:11,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:49:11" (1/1) ... [2018-11-23 09:49:11,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:49:11" (1/1) ... [2018-11-23 09:49:11,178 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:49:11,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:49:11,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:49:11,178 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:49:11,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:49:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_685445d7-efb7-4884-85a8-7b56ee49b6ef/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:49:11,217 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 09:49:11,217 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 09:49:11,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 09:49:11,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 09:49:11,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 09:49:11,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 09:49:11,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 09:49:11,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 09:49:11,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:49:11,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:49:11,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 09:49:11,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 09:49:11,383 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:49:11,383 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 09:49:11,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:49:11 BoogieIcfgContainer [2018-11-23 09:49:11,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:49:11,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 09:49:11,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 09:49:11,391 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 09:49:11,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:49:10" (1/3) ... [2018-11-23 09:49:11,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4827478e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:49:11, skipping insertion in model container [2018-11-23 09:49:11,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:49:11" (2/3) ... [2018-11-23 09:49:11,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4827478e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:49:11, skipping insertion in model container [2018-11-23 09:49:11,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:49:11" (3/3) ... [2018-11-23 09:49:11,394 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c [2018-11-23 09:49:11,403 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 09:49:11,409 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 09:49:11,424 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 09:49:11,449 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 09:49:11,450 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 09:49:11,450 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 09:49:11,450 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 09:49:11,450 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:49:11,450 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:49:11,450 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 09:49:11,450 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:49:11,450 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 09:49:11,467 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 09:49:11,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 09:49:11,472 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:49:11,473 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:49:11,475 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:49:11,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:49:11,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1326004698, now seen corresponding path program 1 times [2018-11-23 09:49:11,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:49:11,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:49:11,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:49:11,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:49:11,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:49:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:49:11,628 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 09:49:11,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:49:11,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 09:49:11,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 09:49:11,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 09:49:11,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:49:11,642 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 4 states. [2018-11-23 09:49:11,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:49:11,680 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-11-23 09:49:11,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 09:49:11,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-23 09:49:11,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:49:11,687 INFO L225 Difference]: With dead ends: 30 [2018-11-23 09:49:11,687 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 09:49:11,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 09:49:11,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 09:49:11,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 09:49:11,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 09:49:11,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-23 09:49:11,710 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-11-23 09:49:11,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:49:11,710 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-23 09:49:11,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 09:49:11,711 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 09:49:11,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 09:49:11,711 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:49:11,711 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:49:11,711 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:49:11,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:49:11,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1310900661, now seen corresponding path program 1 times [2018-11-23 09:49:11,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:49:11,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:49:11,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:49:11,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:49:11,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:49:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:49:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:49:11,757 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=15, |#NULL.offset|=5, |old(#NULL.base)|=15, |old(#NULL.offset)|=5, |old(~__return_72~0)|=10.0, |old(~__return_87~0)|=7, |old(~__return_main~0)|=8, ~__return_72~0=10.0, ~__return_87~0=7, ~__return_main~0=8] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__return_main~0 := 0;~__return_72~0 := 0.0;~__return_87~0 := 0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=15, |old(#NULL.offset)|=5, |old(~__return_72~0)|=10.0, |old(~__return_87~0)|=7, |old(~__return_main~0)|=8, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=15, |old(#NULL.offset)|=5, |old(~__return_72~0)|=10.0, |old(~__return_87~0)|=7, |old(~__return_main~0)|=8, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0] [?] RET #40#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0] [?] CALL call #t~ret4 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~__return_72~0)|=0.0, |old(~__return_87~0)|=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0] [?] havoc ~main__a~0;havoc ~main__r~0;~main__a~0 := #t~nondet0;havoc #t~nondet0;havoc ~main____CPAchecker_TMP_0~0; VAL [main_~main__a~0=16.0, |#NULL.base|=0, |#NULL.offset|=0, |old(~__return_72~0)|=0.0, |old(~__return_87~0)|=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0] [?] assume ~someBinaryDOUBLEComparisonOperation(~main__a~0, 0.10000000149011612); VAL [main_~main__a~0=16.0, |#NULL.base|=0, |#NULL.offset|=0, |old(~__return_72~0)|=0.0, |old(~__return_87~0)|=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0] [?] assume ~someBinaryDOUBLEComparisonOperation(~main__a~0, 100.0);~main____CPAchecker_TMP_0~0 := 1; VAL [main_~main____CPAchecker_TMP_0~0=1, main_~main__a~0=16.0, |#NULL.base|=0, |#NULL.offset|=0, |old(~__return_72~0)|=0.0, |old(~__return_87~0)|=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0] [?] assume 0 != ~main____CPAchecker_TMP_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := ~main__a~0;havoc ~InvSqrt__x~0;~InvSqrt__x~0 := ~__tmp_1~0;~InvSqrt__xhalf~0 := ~someBinaryArithmeticDOUBLEoperation(0.5, ~InvSqrt__x~0);call ~#InvSqrt__i~0.base, ~#InvSqrt__i~0.offset := #Ultimate.alloc(4);call write~real(~InvSqrt__x~0, ~#InvSqrt__i~0.base, ~#InvSqrt__i~0.offset, 4);call #t~mem1 := read~int(~#InvSqrt__i~0.base, ~#InvSqrt__i~0.offset, 4);call write~int(1597463007 - #t~mem1 / 2, ~#InvSqrt__i~0.base, ~#InvSqrt__i~0.offset, 4);havoc #t~mem1;call #t~mem2 := read~real(~#InvSqrt__i~0.base, ~#InvSqrt__i~0.offset, 4);~InvSqrt__x~0 := #t~mem2;call write~int(#t~union3, ~#InvSqrt__i~0.base, ~#InvSqrt__i~0.offset, 4);havoc #t~mem2;havoc #t~union3;~InvSqrt__x~0 := ~someBinaryArithmeticDOUBLEoperation(~InvSqrt__x~0, ~someBinaryArithmeticDOUBLEoperation(1.5, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~InvSqrt__xhalf~0, ~InvSqrt__x~0), ~InvSqrt__x~0)));~__return_72~0 := ~InvSqrt__x~0;~main__r~0 := ~__return_72~0;havoc ~main____CPAchecker_TMP_1~0; VAL [main_~__tmp_1~0=16.0, main_~InvSqrt__x~0=12.0, main_~main____CPAchecker_TMP_0~0=1, main_~main__a~0=16.0, main_~main__r~0=12.0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#InvSqrt__i~0.base|=6, |main_~#InvSqrt__i~0.offset|=0, |old(~__return_72~0)|=0.0, |old(~__return_87~0)|=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0] [?] assume !~someBinaryDOUBLEComparisonOperation(~main__r~0, 0.0); VAL [main_~__tmp_1~0=16.0, main_~InvSqrt__x~0=12.0, main_~main____CPAchecker_TMP_0~0=1, main_~main__a~0=16.0, main_~main__r~0=12.0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#InvSqrt__i~0.base|=6, |main_~#InvSqrt__i~0.offset|=0, |old(~__return_72~0)|=0.0, |old(~__return_87~0)|=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0] [?] ~main____CPAchecker_TMP_1~0 := 0; VAL [main_~__tmp_1~0=16.0, main_~InvSqrt__x~0=12.0, main_~main____CPAchecker_TMP_0~0=1, main_~main____CPAchecker_TMP_1~0=0, main_~main__a~0=16.0, main_~main__r~0=12.0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#InvSqrt__i~0.base|=6, |main_~#InvSqrt__i~0.offset|=0, |old(~__return_72~0)|=0.0, |old(~__return_87~0)|=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0] [?] havoc ~__tmp_2~0;~__tmp_2~0 := ~main____CPAchecker_TMP_1~0;havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_2~0; VAL [main_~__tmp_1~0=16.0, main_~__tmp_2~0=0, main_~__VERIFIER_assert__cond~0=0, main_~InvSqrt__x~0=12.0, main_~main____CPAchecker_TMP_0~0=1, main_~main____CPAchecker_TMP_1~0=0, main_~main__a~0=16.0, main_~main__r~0=12.0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#InvSqrt__i~0.base|=6, |main_~#InvSqrt__i~0.offset|=0, |old(~__return_72~0)|=0.0, |old(~__return_87~0)|=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0] [?] assume 0 == ~__VERIFIER_assert__cond~0; VAL [main_~__tmp_1~0=16.0, main_~__tmp_2~0=0, main_~__VERIFIER_assert__cond~0=0, main_~InvSqrt__x~0=12.0, main_~main____CPAchecker_TMP_0~0=1, main_~main____CPAchecker_TMP_1~0=0, main_~main__a~0=16.0, main_~main__r~0=12.0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#InvSqrt__i~0.base|=6, |main_~#InvSqrt__i~0.offset|=0, |old(~__return_72~0)|=0.0, |old(~__return_87~0)|=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0] [?] assume !false; VAL [main_~__tmp_1~0=16.0, main_~__tmp_2~0=0, main_~__VERIFIER_assert__cond~0=0, main_~InvSqrt__x~0=12.0, main_~main____CPAchecker_TMP_0~0=1, main_~main____CPAchecker_TMP_1~0=0, main_~main__a~0=16.0, main_~main__r~0=12.0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#InvSqrt__i~0.base|=6, |main_~#InvSqrt__i~0.offset|=0, |old(~__return_72~0)|=0.0, |old(~__return_87~0)|=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=15, #NULL.offset=5, old(#NULL.base)=15, old(#NULL.offset)=5, old(~__return_72~0)=10.0, old(~__return_87~0)=7, old(~__return_main~0)=8, ~__return_72~0=10.0, ~__return_87~0=7, ~__return_main~0=8] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L1] ~__return_main~0 := 0; [L12] ~__return_72~0 := 0.0; [L13] ~__return_87~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=5, old(~__return_72~0)=10.0, old(~__return_87~0)=7, old(~__return_main~0)=8, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=5, old(~__return_72~0)=10.0, old(~__return_87~0)=7, old(~__return_main~0)=8, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0] [?] CALL call #t~ret4 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0] [L16] havoc ~main__a~0; [L17] havoc ~main__r~0; [L18] ~main__a~0 := #t~nondet0; [L18] havoc #t~nondet0; [L19] havoc ~main____CPAchecker_TMP_0~0; VAL [#NULL.base=0, #NULL.offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0, ~main__a~0=16.0] [L20-L90] assume ~someBinaryDOUBLEComparisonOperation(~main__a~0, 0.10000000149011612); VAL [#NULL.base=0, #NULL.offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0, ~main__a~0=16.0] [L22-L85] assume ~someBinaryDOUBLEComparisonOperation(~main__a~0, 100.0); [L24] ~main____CPAchecker_TMP_0~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0, ~main____CPAchecker_TMP_0~0=1, ~main__a~0=16.0] [L25-L80] assume 0 != ~main____CPAchecker_TMP_0~0; [L28] havoc ~__tmp_1~0; [L29] ~__tmp_1~0 := ~main__a~0; [L30] havoc ~InvSqrt__x~0; [L31] ~InvSqrt__x~0 := ~__tmp_1~0; [L32] ~InvSqrt__xhalf~0 := ~someBinaryArithmeticDOUBLEoperation(0.5, ~InvSqrt__x~0); [L33] call ~#InvSqrt__i~0.base, ~#InvSqrt__i~0.offset := #Ultimate.alloc(4); [L34] call write~real(~InvSqrt__x~0, ~#InvSqrt__i~0.base, ~#InvSqrt__i~0.offset, 4); [L35] call #t~mem1 := read~int(~#InvSqrt__i~0.base, ~#InvSqrt__i~0.offset, 4); [L35] call write~int(1597463007 - #t~mem1 / 2, ~#InvSqrt__i~0.base, ~#InvSqrt__i~0.offset, 4); [L35] havoc #t~mem1; [L36] call #t~mem2 := read~real(~#InvSqrt__i~0.base, ~#InvSqrt__i~0.offset, 4); [L36] ~InvSqrt__x~0 := #t~mem2; [L36] call write~int(#t~union3, ~#InvSqrt__i~0.base, ~#InvSqrt__i~0.offset, 4); [L36] havoc #t~mem2; [L36] havoc #t~union3; [L37] ~InvSqrt__x~0 := ~someBinaryArithmeticDOUBLEoperation(~InvSqrt__x~0, ~someBinaryArithmeticDOUBLEoperation(1.5, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~InvSqrt__xhalf~0, ~InvSqrt__x~0), ~InvSqrt__x~0))); [L38] ~__return_72~0 := ~InvSqrt__x~0; [L39] ~main__r~0 := ~__return_72~0; [L40] havoc ~main____CPAchecker_TMP_1~0; VAL [#NULL.base=0, #NULL.offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0.base=6, ~#InvSqrt__i~0.offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main__a~0=16.0, ~main__r~0=12.0] [L41-L74] assume !~someBinaryDOUBLEComparisonOperation(~main__r~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0.base=6, ~#InvSqrt__i~0.offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main__a~0=16.0, ~main__r~0=12.0] [L67] ~main____CPAchecker_TMP_1~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0.base=6, ~#InvSqrt__i~0.offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main____CPAchecker_TMP_1~0=0, ~main__a~0=16.0, ~main__r~0=12.0] [L48] havoc ~__tmp_2~0; [L49] ~__tmp_2~0 := ~main____CPAchecker_TMP_1~0; [L50] havoc ~__VERIFIER_assert__cond~0; [L51] ~__VERIFIER_assert__cond~0 := ~__tmp_2~0; VAL [#NULL.base=0, #NULL.offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0.base=6, ~#InvSqrt__i~0.offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main____CPAchecker_TMP_1~0=0, ~main__a~0=16.0, ~main__r~0=12.0] [L52-L61] assume 0 == ~__VERIFIER_assert__cond~0; VAL [#NULL.base=0, #NULL.offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0.base=6, ~#InvSqrt__i~0.offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main____CPAchecker_TMP_1~0=0, ~main__a~0=16.0, ~main__r~0=12.0] [L54] assert false; VAL [#NULL.base=0, #NULL.offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0.base=6, ~#InvSqrt__i~0.offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main____CPAchecker_TMP_1~0=0, ~main__a~0=16.0, ~main__r~0=12.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=15, #NULL.offset=5, old(#NULL.base)=15, old(#NULL.offset)=5, old(~__return_72~0)=10.0, old(~__return_87~0)=7, old(~__return_main~0)=8, ~__return_72~0=10.0, ~__return_87~0=7, ~__return_main~0=8] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L1] ~__return_main~0 := 0; [L12] ~__return_72~0 := 0.0; [L13] ~__return_87~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=5, old(~__return_72~0)=10.0, old(~__return_87~0)=7, old(~__return_main~0)=8, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=5, old(~__return_72~0)=10.0, old(~__return_87~0)=7, old(~__return_main~0)=8, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0] [?] CALL call #t~ret4 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0] [L16] havoc ~main__a~0; [L17] havoc ~main__r~0; [L18] ~main__a~0 := #t~nondet0; [L18] havoc #t~nondet0; [L19] havoc ~main____CPAchecker_TMP_0~0; VAL [#NULL.base=0, #NULL.offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0, ~main__a~0=16.0] [L20-L90] assume ~someBinaryDOUBLEComparisonOperation(~main__a~0, 0.10000000149011612); VAL [#NULL.base=0, #NULL.offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0, ~main__a~0=16.0] [L22-L85] assume ~someBinaryDOUBLEComparisonOperation(~main__a~0, 100.0); [L24] ~main____CPAchecker_TMP_0~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0, ~main____CPAchecker_TMP_0~0=1, ~main__a~0=16.0] [L25-L80] assume 0 != ~main____CPAchecker_TMP_0~0; [L28] havoc ~__tmp_1~0; [L29] ~__tmp_1~0 := ~main__a~0; [L30] havoc ~InvSqrt__x~0; [L31] ~InvSqrt__x~0 := ~__tmp_1~0; [L32] ~InvSqrt__xhalf~0 := ~someBinaryArithmeticDOUBLEoperation(0.5, ~InvSqrt__x~0); [L33] call ~#InvSqrt__i~0.base, ~#InvSqrt__i~0.offset := #Ultimate.alloc(4); [L34] call write~real(~InvSqrt__x~0, ~#InvSqrt__i~0.base, ~#InvSqrt__i~0.offset, 4); [L35] call #t~mem1 := read~int(~#InvSqrt__i~0.base, ~#InvSqrt__i~0.offset, 4); [L35] call write~int(1597463007 - #t~mem1 / 2, ~#InvSqrt__i~0.base, ~#InvSqrt__i~0.offset, 4); [L35] havoc #t~mem1; [L36] call #t~mem2 := read~real(~#InvSqrt__i~0.base, ~#InvSqrt__i~0.offset, 4); [L36] ~InvSqrt__x~0 := #t~mem2; [L36] call write~int(#t~union3, ~#InvSqrt__i~0.base, ~#InvSqrt__i~0.offset, 4); [L36] havoc #t~mem2; [L36] havoc #t~union3; [L37] ~InvSqrt__x~0 := ~someBinaryArithmeticDOUBLEoperation(~InvSqrt__x~0, ~someBinaryArithmeticDOUBLEoperation(1.5, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~InvSqrt__xhalf~0, ~InvSqrt__x~0), ~InvSqrt__x~0))); [L38] ~__return_72~0 := ~InvSqrt__x~0; [L39] ~main__r~0 := ~__return_72~0; [L40] havoc ~main____CPAchecker_TMP_1~0; VAL [#NULL.base=0, #NULL.offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0.base=6, ~#InvSqrt__i~0.offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main__a~0=16.0, ~main__r~0=12.0] [L41-L74] assume !~someBinaryDOUBLEComparisonOperation(~main__r~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0.base=6, ~#InvSqrt__i~0.offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main__a~0=16.0, ~main__r~0=12.0] [L67] ~main____CPAchecker_TMP_1~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0.base=6, ~#InvSqrt__i~0.offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main____CPAchecker_TMP_1~0=0, ~main__a~0=16.0, ~main__r~0=12.0] [L48] havoc ~__tmp_2~0; [L49] ~__tmp_2~0 := ~main____CPAchecker_TMP_1~0; [L50] havoc ~__VERIFIER_assert__cond~0; [L51] ~__VERIFIER_assert__cond~0 := ~__tmp_2~0; VAL [#NULL.base=0, #NULL.offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0.base=6, ~#InvSqrt__i~0.offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main____CPAchecker_TMP_1~0=0, ~main__a~0=16.0, ~main__r~0=12.0] [L52-L61] assume 0 == ~__VERIFIER_assert__cond~0; VAL [#NULL.base=0, #NULL.offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0.base=6, ~#InvSqrt__i~0.offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main____CPAchecker_TMP_1~0=0, ~main__a~0=16.0, ~main__r~0=12.0] [L54] assert false; VAL [#NULL.base=0, #NULL.offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0.base=6, ~#InvSqrt__i~0.offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main____CPAchecker_TMP_1~0=0, ~main__a~0=16.0, ~main__r~0=12.0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15, #NULL!offset=5, old(#NULL!base)=15, old(#NULL!offset)=5, old(~__return_72~0)=10.0, old(~__return_87~0)=7, old(~__return_main~0)=8, ~__return_72~0=10.0, ~__return_87~0=7, ~__return_main~0=8] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L1] ~__return_main~0 := 0; [L12] ~__return_72~0 := 0.0; [L13] ~__return_87~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=5, old(~__return_72~0)=10.0, old(~__return_87~0)=7, old(~__return_main~0)=8, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0] [L16] havoc ~main__a~0; [L17] havoc ~main__r~0; [L18] ~main__a~0 := #t~nondet0; [L18] havoc #t~nondet0; [L19] havoc ~main____CPAchecker_TMP_0~0; VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0, ~main__a~0=16.0] [L20] COND TRUE ~someBinaryDOUBLEComparisonOperation(~main__a~0, 0.10000000149011612) VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0, ~main__a~0=16.0] [L22] COND TRUE ~someBinaryDOUBLEComparisonOperation(~main__a~0, 100.0) [L24] ~main____CPAchecker_TMP_0~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0, ~main____CPAchecker_TMP_0~0=1, ~main__a~0=16.0] [L25] COND TRUE 0 != ~main____CPAchecker_TMP_0~0 [L28] havoc ~__tmp_1~0; [L29] ~__tmp_1~0 := ~main__a~0; [L30] havoc ~InvSqrt__x~0; [L31] ~InvSqrt__x~0 := ~__tmp_1~0; [L32] ~InvSqrt__xhalf~0 := ~someBinaryArithmeticDOUBLEoperation(0.5, ~InvSqrt__x~0); [L33] FCALL call ~#InvSqrt__i~0 := #Ultimate.alloc(4); [L34] FCALL call write~real(~InvSqrt__x~0, { base: ~#InvSqrt__i~0!base, offset: ~#InvSqrt__i~0!offset }, 4); [L35] FCALL call #t~mem1 := read~int({ base: ~#InvSqrt__i~0!base, offset: ~#InvSqrt__i~0!offset }, 4); [L35] FCALL call write~int(1597463007 - #t~mem1 / 2, { base: ~#InvSqrt__i~0!base, offset: ~#InvSqrt__i~0!offset }, 4); [L35] havoc #t~mem1; [L36] FCALL call #t~mem2 := read~real({ base: ~#InvSqrt__i~0!base, offset: ~#InvSqrt__i~0!offset }, 4); [L36] ~InvSqrt__x~0 := #t~mem2; [L36] FCALL call write~int(#t~union3, { base: ~#InvSqrt__i~0!base, offset: ~#InvSqrt__i~0!offset }, 4); [L36] havoc #t~mem2; [L36] havoc #t~union3; [L37] ~InvSqrt__x~0 := ~someBinaryArithmeticDOUBLEoperation(~InvSqrt__x~0, ~someBinaryArithmeticDOUBLEoperation(1.5, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~InvSqrt__xhalf~0, ~InvSqrt__x~0), ~InvSqrt__x~0))); [L38] ~__return_72~0 := ~InvSqrt__x~0; [L39] ~main__r~0 := ~__return_72~0; [L40] havoc ~main____CPAchecker_TMP_1~0; VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0!base=6, ~#InvSqrt__i~0!offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main__a~0=16.0, ~main__r~0=12.0] [L41] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~main__r~0, 0.0)) VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0!base=6, ~#InvSqrt__i~0!offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main__a~0=16.0, ~main__r~0=12.0] [L67] ~main____CPAchecker_TMP_1~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0!base=6, ~#InvSqrt__i~0!offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main____CPAchecker_TMP_1~0=0, ~main__a~0=16.0, ~main__r~0=12.0] [L48] havoc ~__tmp_2~0; [L49] ~__tmp_2~0 := ~main____CPAchecker_TMP_1~0; [L50] havoc ~__VERIFIER_assert__cond~0; [L51] ~__VERIFIER_assert__cond~0 := ~__tmp_2~0; VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0!base=6, ~#InvSqrt__i~0!offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main____CPAchecker_TMP_1~0=0, ~main__a~0=16.0, ~main__r~0=12.0] [L52] COND TRUE 0 == ~__VERIFIER_assert__cond~0 VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0!base=6, ~#InvSqrt__i~0!offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main____CPAchecker_TMP_1~0=0, ~main__a~0=16.0, ~main__r~0=12.0] [L54] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0!base=6, ~#InvSqrt__i~0!offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main____CPAchecker_TMP_1~0=0, ~main__a~0=16.0, ~main__r~0=12.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15, #NULL!offset=5, old(#NULL!base)=15, old(#NULL!offset)=5, old(~__return_72~0)=10.0, old(~__return_87~0)=7, old(~__return_main~0)=8, ~__return_72~0=10.0, ~__return_87~0=7, ~__return_main~0=8] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L1] ~__return_main~0 := 0; [L12] ~__return_72~0 := 0.0; [L13] ~__return_87~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=5, old(~__return_72~0)=10.0, old(~__return_87~0)=7, old(~__return_main~0)=8, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0] [L16] havoc ~main__a~0; [L17] havoc ~main__r~0; [L18] ~main__a~0 := #t~nondet0; [L18] havoc #t~nondet0; [L19] havoc ~main____CPAchecker_TMP_0~0; VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0, ~main__a~0=16.0] [L20] COND TRUE ~someBinaryDOUBLEComparisonOperation(~main__a~0, 0.10000000149011612) VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0, ~main__a~0=16.0] [L22] COND TRUE ~someBinaryDOUBLEComparisonOperation(~main__a~0, 100.0) [L24] ~main____CPAchecker_TMP_0~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0, ~main____CPAchecker_TMP_0~0=1, ~main__a~0=16.0] [L25] COND TRUE 0 != ~main____CPAchecker_TMP_0~0 [L28] havoc ~__tmp_1~0; [L29] ~__tmp_1~0 := ~main__a~0; [L30] havoc ~InvSqrt__x~0; [L31] ~InvSqrt__x~0 := ~__tmp_1~0; [L32] ~InvSqrt__xhalf~0 := ~someBinaryArithmeticDOUBLEoperation(0.5, ~InvSqrt__x~0); [L33] FCALL call ~#InvSqrt__i~0 := #Ultimate.alloc(4); [L34] FCALL call write~real(~InvSqrt__x~0, { base: ~#InvSqrt__i~0!base, offset: ~#InvSqrt__i~0!offset }, 4); [L35] FCALL call #t~mem1 := read~int({ base: ~#InvSqrt__i~0!base, offset: ~#InvSqrt__i~0!offset }, 4); [L35] FCALL call write~int(1597463007 - #t~mem1 / 2, { base: ~#InvSqrt__i~0!base, offset: ~#InvSqrt__i~0!offset }, 4); [L35] havoc #t~mem1; [L36] FCALL call #t~mem2 := read~real({ base: ~#InvSqrt__i~0!base, offset: ~#InvSqrt__i~0!offset }, 4); [L36] ~InvSqrt__x~0 := #t~mem2; [L36] FCALL call write~int(#t~union3, { base: ~#InvSqrt__i~0!base, offset: ~#InvSqrt__i~0!offset }, 4); [L36] havoc #t~mem2; [L36] havoc #t~union3; [L37] ~InvSqrt__x~0 := ~someBinaryArithmeticDOUBLEoperation(~InvSqrt__x~0, ~someBinaryArithmeticDOUBLEoperation(1.5, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~InvSqrt__xhalf~0, ~InvSqrt__x~0), ~InvSqrt__x~0))); [L38] ~__return_72~0 := ~InvSqrt__x~0; [L39] ~main__r~0 := ~__return_72~0; [L40] havoc ~main____CPAchecker_TMP_1~0; VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0!base=6, ~#InvSqrt__i~0!offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main__a~0=16.0, ~main__r~0=12.0] [L41] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~main__r~0, 0.0)) VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0!base=6, ~#InvSqrt__i~0!offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main__a~0=16.0, ~main__r~0=12.0] [L67] ~main____CPAchecker_TMP_1~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0!base=6, ~#InvSqrt__i~0!offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main____CPAchecker_TMP_1~0=0, ~main__a~0=16.0, ~main__r~0=12.0] [L48] havoc ~__tmp_2~0; [L49] ~__tmp_2~0 := ~main____CPAchecker_TMP_1~0; [L50] havoc ~__VERIFIER_assert__cond~0; [L51] ~__VERIFIER_assert__cond~0 := ~__tmp_2~0; VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0!base=6, ~#InvSqrt__i~0!offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main____CPAchecker_TMP_1~0=0, ~main__a~0=16.0, ~main__r~0=12.0] [L52] COND TRUE 0 == ~__VERIFIER_assert__cond~0 VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0!base=6, ~#InvSqrt__i~0!offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main____CPAchecker_TMP_1~0=0, ~main__a~0=16.0, ~main__r~0=12.0] [L54] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0!base=6, ~#InvSqrt__i~0!offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main____CPAchecker_TMP_1~0=0, ~main__a~0=16.0, ~main__r~0=12.0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15, #NULL!offset=5, old(#NULL!base)=15, old(#NULL!offset)=5, old(~__return_72~0)=10.0, old(~__return_87~0)=7, old(~__return_main~0)=8, ~__return_72~0=10.0, ~__return_87~0=7, ~__return_main~0=8] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L1] ~__return_main~0 := 0; [L12] ~__return_72~0 := 0.0; [L13] ~__return_87~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=5, old(~__return_72~0)=10.0, old(~__return_87~0)=7, old(~__return_main~0)=8, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0] [L16] havoc ~main__a~0; [L17] havoc ~main__r~0; [L18] ~main__a~0 := #t~nondet0; [L18] havoc #t~nondet0; [L19] havoc ~main____CPAchecker_TMP_0~0; VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0, ~main__a~0=16.0] [L20] COND TRUE ~someBinaryDOUBLEComparisonOperation(~main__a~0, 0.10000000149011612) VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0, ~main__a~0=16.0] [L22] COND TRUE ~someBinaryDOUBLEComparisonOperation(~main__a~0, 100.0) [L24] ~main____CPAchecker_TMP_0~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0, ~main____CPAchecker_TMP_0~0=1, ~main__a~0=16.0] [L25] COND TRUE 0 != ~main____CPAchecker_TMP_0~0 [L28] havoc ~__tmp_1~0; [L29] ~__tmp_1~0 := ~main__a~0; [L30] havoc ~InvSqrt__x~0; [L31] ~InvSqrt__x~0 := ~__tmp_1~0; [L32] ~InvSqrt__xhalf~0 := ~someBinaryArithmeticDOUBLEoperation(0.5, ~InvSqrt__x~0); [L33] FCALL call ~#InvSqrt__i~0 := #Ultimate.alloc(4); [L34] FCALL call write~real(~InvSqrt__x~0, { base: ~#InvSqrt__i~0!base, offset: ~#InvSqrt__i~0!offset }, 4); [L35] FCALL call #t~mem1 := read~int({ base: ~#InvSqrt__i~0!base, offset: ~#InvSqrt__i~0!offset }, 4); [L35] FCALL call write~int(1597463007 - #t~mem1 / 2, { base: ~#InvSqrt__i~0!base, offset: ~#InvSqrt__i~0!offset }, 4); [L35] havoc #t~mem1; [L36] FCALL call #t~mem2 := read~real({ base: ~#InvSqrt__i~0!base, offset: ~#InvSqrt__i~0!offset }, 4); [L36] ~InvSqrt__x~0 := #t~mem2; [L36] FCALL call write~int(#t~union3, { base: ~#InvSqrt__i~0!base, offset: ~#InvSqrt__i~0!offset }, 4); [L36] havoc #t~mem2; [L36] havoc #t~union3; [L37] ~InvSqrt__x~0 := ~someBinaryArithmeticDOUBLEoperation(~InvSqrt__x~0, ~someBinaryArithmeticDOUBLEoperation(1.5, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~InvSqrt__xhalf~0, ~InvSqrt__x~0), ~InvSqrt__x~0))); [L38] ~__return_72~0 := ~InvSqrt__x~0; [L39] ~main__r~0 := ~__return_72~0; [L40] havoc ~main____CPAchecker_TMP_1~0; VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0!base=6, ~#InvSqrt__i~0!offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main__a~0=16.0, ~main__r~0=12.0] [L41] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~main__r~0, 0.0)) VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0!base=6, ~#InvSqrt__i~0!offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main__a~0=16.0, ~main__r~0=12.0] [L67] ~main____CPAchecker_TMP_1~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0!base=6, ~#InvSqrt__i~0!offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main____CPAchecker_TMP_1~0=0, ~main__a~0=16.0, ~main__r~0=12.0] [L48] havoc ~__tmp_2~0; [L49] ~__tmp_2~0 := ~main____CPAchecker_TMP_1~0; [L50] havoc ~__VERIFIER_assert__cond~0; [L51] ~__VERIFIER_assert__cond~0 := ~__tmp_2~0; VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0!base=6, ~#InvSqrt__i~0!offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main____CPAchecker_TMP_1~0=0, ~main__a~0=16.0, ~main__r~0=12.0] [L52] COND TRUE 0 == ~__VERIFIER_assert__cond~0 VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0!base=6, ~#InvSqrt__i~0!offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main____CPAchecker_TMP_1~0=0, ~main__a~0=16.0, ~main__r~0=12.0] [L54] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0!base=6, ~#InvSqrt__i~0!offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main____CPAchecker_TMP_1~0=0, ~main__a~0=16.0, ~main__r~0=12.0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15, #NULL!offset=5, old(#NULL!base)=15, old(#NULL!offset)=5, old(~__return_72~0)=10.0, old(~__return_87~0)=7, old(~__return_main~0)=8, ~__return_72~0=10.0, ~__return_87~0=7, ~__return_main~0=8] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L1] ~__return_main~0 := 0; [L12] ~__return_72~0 := 0.0; [L13] ~__return_87~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=5, old(~__return_72~0)=10.0, old(~__return_87~0)=7, old(~__return_main~0)=8, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0] [L16] havoc ~main__a~0; [L17] havoc ~main__r~0; [L18] ~main__a~0 := #t~nondet0; [L18] havoc #t~nondet0; [L19] havoc ~main____CPAchecker_TMP_0~0; VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0, ~main__a~0=16.0] [L20] COND TRUE ~someBinaryDOUBLEComparisonOperation(~main__a~0, 0.10000000149011612) VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0, ~main__a~0=16.0] [L22] COND TRUE ~someBinaryDOUBLEComparisonOperation(~main__a~0, 100.0) [L24] ~main____CPAchecker_TMP_0~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~__return_72~0=0.0, ~__return_87~0=0, ~__return_main~0=0, ~main____CPAchecker_TMP_0~0=1, ~main__a~0=16.0] [L25] COND TRUE 0 != ~main____CPAchecker_TMP_0~0 [L28] havoc ~__tmp_1~0; [L29] ~__tmp_1~0 := ~main__a~0; [L30] havoc ~InvSqrt__x~0; [L31] ~InvSqrt__x~0 := ~__tmp_1~0; [L32] ~InvSqrt__xhalf~0 := ~someBinaryArithmeticDOUBLEoperation(0.5, ~InvSqrt__x~0); [L33] FCALL call ~#InvSqrt__i~0 := #Ultimate.alloc(4); [L34] FCALL call write~real(~InvSqrt__x~0, { base: ~#InvSqrt__i~0!base, offset: ~#InvSqrt__i~0!offset }, 4); [L35] FCALL call #t~mem1 := read~int({ base: ~#InvSqrt__i~0!base, offset: ~#InvSqrt__i~0!offset }, 4); [L35] FCALL call write~int(1597463007 - #t~mem1 / 2, { base: ~#InvSqrt__i~0!base, offset: ~#InvSqrt__i~0!offset }, 4); [L35] havoc #t~mem1; [L36] FCALL call #t~mem2 := read~real({ base: ~#InvSqrt__i~0!base, offset: ~#InvSqrt__i~0!offset }, 4); [L36] ~InvSqrt__x~0 := #t~mem2; [L36] FCALL call write~int(#t~union3, { base: ~#InvSqrt__i~0!base, offset: ~#InvSqrt__i~0!offset }, 4); [L36] havoc #t~mem2; [L36] havoc #t~union3; [L37] ~InvSqrt__x~0 := ~someBinaryArithmeticDOUBLEoperation(~InvSqrt__x~0, ~someBinaryArithmeticDOUBLEoperation(1.5, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~InvSqrt__xhalf~0, ~InvSqrt__x~0), ~InvSqrt__x~0))); [L38] ~__return_72~0 := ~InvSqrt__x~0; [L39] ~main__r~0 := ~__return_72~0; [L40] havoc ~main____CPAchecker_TMP_1~0; VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0!base=6, ~#InvSqrt__i~0!offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main__a~0=16.0, ~main__r~0=12.0] [L41] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~main__r~0, 0.0)) VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0!base=6, ~#InvSqrt__i~0!offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main__a~0=16.0, ~main__r~0=12.0] [L67] ~main____CPAchecker_TMP_1~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0!base=6, ~#InvSqrt__i~0!offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main____CPAchecker_TMP_1~0=0, ~main__a~0=16.0, ~main__r~0=12.0] [L48] havoc ~__tmp_2~0; [L49] ~__tmp_2~0 := ~main____CPAchecker_TMP_1~0; [L50] havoc ~__VERIFIER_assert__cond~0; [L51] ~__VERIFIER_assert__cond~0 := ~__tmp_2~0; VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0!base=6, ~#InvSqrt__i~0!offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main____CPAchecker_TMP_1~0=0, ~main__a~0=16.0, ~main__r~0=12.0] [L52] COND TRUE 0 == ~__VERIFIER_assert__cond~0 VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0!base=6, ~#InvSqrt__i~0!offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main____CPAchecker_TMP_1~0=0, ~main__a~0=16.0, ~main__r~0=12.0] [L54] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~__return_72~0)=0.0, old(~__return_87~0)=0, ~#InvSqrt__i~0!base=6, ~#InvSqrt__i~0!offset=0, ~__return_72~0=12.0, ~__return_87~0=0, ~__return_main~0=0, ~__tmp_1~0=16.0, ~__tmp_2~0=0, ~__VERIFIER_assert__cond~0=0, ~InvSqrt__x~0=12.0, ~main____CPAchecker_TMP_0~0=1, ~main____CPAchecker_TMP_1~0=0, ~main__a~0=16.0, ~main__r~0=12.0] [L1] int __return_main; [L12] float __return_72; [L13] int __return_87; VAL [\old(__return_72)=10, \old(__return_87)=7, \old(__return_main)=8, __return_72=0, __return_87=0, __return_main=0] [L16] float main__a; [L17] float main__r; [L18] main__a = __VERIFIER_nondet_float() [L19] int main____CPAchecker_TMP_0; VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=0, __return_87=0, __return_main=0, main__a=16] [L20] COND TRUE main__a >= 0.10000000149011612 VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=0, __return_87=0, __return_main=0, main__a=16] [L22] COND TRUE main__a <= 100.0 [L24] main____CPAchecker_TMP_0 = 1 VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=0, __return_87=0, __return_main=0, main____CPAchecker_TMP_0=1, main__a=16] [L25] COND TRUE main____CPAchecker_TMP_0 != 0 [L28] float __tmp_1; [L29] __tmp_1 = main__a [L30] float InvSqrt__x; [L31] InvSqrt__x = __tmp_1 [L32] float InvSqrt__xhalf = 0.5 * InvSqrt__x; [L33] union float_int InvSqrt__i; [L34] InvSqrt__i.f = InvSqrt__x [L35] EXPR InvSqrt__i.i [L35] InvSqrt__i.i = 1597463007 - ((InvSqrt__i.i) >> 1) [L36] EXPR InvSqrt__i.f [L36] InvSqrt__x = InvSqrt__i.f [L37] InvSqrt__x = InvSqrt__x * (1.5 - ((InvSqrt__xhalf * InvSqrt__x) * InvSqrt__x)) [L38] __return_72 = InvSqrt__x [L39] main__r = __return_72 [L40] int main____CPAchecker_TMP_1; VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=12, __return_87=0, __return_main=0, __tmp_1=16, InvSqrt__i={6:0}, InvSqrt__x=12, main____CPAchecker_TMP_0=1, main__a=16, main__r=12] [L41] COND FALSE !(main__r >= 0.0) VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=12, __return_87=0, __return_main=0, __tmp_1=16, InvSqrt__i={6:0}, InvSqrt__x=12, main____CPAchecker_TMP_0=1, main__a=16, main__r=12] [L67] main____CPAchecker_TMP_1 = 0 VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=12, __return_87=0, __return_main=0, __tmp_1=16, InvSqrt__i={6:0}, InvSqrt__x=12, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=16, main__r=12] [L48] int __tmp_2; [L49] __tmp_2 = main____CPAchecker_TMP_1 [L50] int __VERIFIER_assert__cond; [L51] __VERIFIER_assert__cond = __tmp_2 VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=12, __return_87=0, __return_main=0, __tmp_1=16, __tmp_2=0, __VERIFIER_assert__cond=0, InvSqrt__i={6:0}, InvSqrt__x=12, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=16, main__r=12] [L52] COND TRUE __VERIFIER_assert__cond == 0 VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=12, __return_87=0, __return_main=0, __tmp_1=16, __tmp_2=0, __VERIFIER_assert__cond=0, InvSqrt__i={6:0}, InvSqrt__x=12, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=16, main__r=12] [L54] __VERIFIER_error() VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=12, __return_87=0, __return_main=0, __tmp_1=16, __tmp_2=0, __VERIFIER_assert__cond=0, InvSqrt__i={6:0}, InvSqrt__x=12, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=16, main__r=12] ----- [2018-11-23 09:49:11,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:49:11 BoogieIcfgContainer [2018-11-23 09:49:11,801 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 09:49:11,802 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 09:49:11,802 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 09:49:11,802 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 09:49:11,802 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:49:11" (3/4) ... [2018-11-23 09:49:11,805 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 09:49:11,805 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 09:49:11,806 INFO L168 Benchmark]: Toolchain (without parser) took 882.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 959.3 MB in the beginning and 1.1 GB in the end (delta: -151.9 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-23 09:49:11,808 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:49:11,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 178.53 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 945.8 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-11-23 09:49:11,809 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.98 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:49:11,809 INFO L168 Benchmark]: Boogie Preprocessor took 57.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 945.8 MB in the beginning and 1.2 GB in the end (delta: -218.4 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 09:49:11,810 INFO L168 Benchmark]: RCFGBuilder took 205.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 09:49:11,810 INFO L168 Benchmark]: TraceAbstraction took 417.37 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: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. [2018-11-23 09:49:11,811 INFO L168 Benchmark]: Witness Printer took 3.97 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 09:49:11,813 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 178.53 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 945.8 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.98 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 945.8 MB in the beginning and 1.2 GB in the end (delta: -218.4 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 205.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 417.37 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: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.97 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: 54]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 41, overapproximation of someBinaryArithmeticDOUBLEoperation at line 32. Possible FailurePath: [L1] int __return_main; [L12] float __return_72; [L13] int __return_87; VAL [\old(__return_72)=10, \old(__return_87)=7, \old(__return_main)=8, __return_72=0, __return_87=0, __return_main=0] [L16] float main__a; [L17] float main__r; [L18] main__a = __VERIFIER_nondet_float() [L19] int main____CPAchecker_TMP_0; VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=0, __return_87=0, __return_main=0, main__a=16] [L20] COND TRUE main__a >= 0.10000000149011612 VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=0, __return_87=0, __return_main=0, main__a=16] [L22] COND TRUE main__a <= 100.0 [L24] main____CPAchecker_TMP_0 = 1 VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=0, __return_87=0, __return_main=0, main____CPAchecker_TMP_0=1, main__a=16] [L25] COND TRUE main____CPAchecker_TMP_0 != 0 [L28] float __tmp_1; [L29] __tmp_1 = main__a [L30] float InvSqrt__x; [L31] InvSqrt__x = __tmp_1 [L32] float InvSqrt__xhalf = 0.5 * InvSqrt__x; [L33] union float_int InvSqrt__i; [L34] InvSqrt__i.f = InvSqrt__x [L35] EXPR InvSqrt__i.i [L35] InvSqrt__i.i = 1597463007 - ((InvSqrt__i.i) >> 1) [L36] EXPR InvSqrt__i.f [L36] InvSqrt__x = InvSqrt__i.f [L37] InvSqrt__x = InvSqrt__x * (1.5 - ((InvSqrt__xhalf * InvSqrt__x) * InvSqrt__x)) [L38] __return_72 = InvSqrt__x [L39] main__r = __return_72 [L40] int main____CPAchecker_TMP_1; VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=12, __return_87=0, __return_main=0, __tmp_1=16, InvSqrt__i={6:0}, InvSqrt__x=12, main____CPAchecker_TMP_0=1, main__a=16, main__r=12] [L41] COND FALSE !(main__r >= 0.0) VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=12, __return_87=0, __return_main=0, __tmp_1=16, InvSqrt__i={6:0}, InvSqrt__x=12, main____CPAchecker_TMP_0=1, main__a=16, main__r=12] [L67] main____CPAchecker_TMP_1 = 0 VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=12, __return_87=0, __return_main=0, __tmp_1=16, InvSqrt__i={6:0}, InvSqrt__x=12, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=16, main__r=12] [L48] int __tmp_2; [L49] __tmp_2 = main____CPAchecker_TMP_1 [L50] int __VERIFIER_assert__cond; [L51] __VERIFIER_assert__cond = __tmp_2 VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=12, __return_87=0, __return_main=0, __tmp_1=16, __tmp_2=0, __VERIFIER_assert__cond=0, InvSqrt__i={6:0}, InvSqrt__x=12, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=16, main__r=12] [L52] COND TRUE __VERIFIER_assert__cond == 0 VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=12, __return_87=0, __return_main=0, __tmp_1=16, __tmp_2=0, __VERIFIER_assert__cond=0, InvSqrt__i={6:0}, InvSqrt__x=12, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=16, main__r=12] [L54] __VERIFIER_error() VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=12, __return_87=0, __return_main=0, __tmp_1=16, __tmp_2=0, __VERIFIER_assert__cond=0, InvSqrt__i={6:0}, InvSqrt__x=12, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=16, main__r=12] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 20 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 5 SDslu, 43 SDs, 0 SdLazy, 8 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred 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, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 221 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 09:49:13,257 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:49:13,258 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:49:13,265 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:49:13,266 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:49:13,266 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:49:13,267 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:49:13,268 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:49:13,270 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:49:13,270 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:49:13,271 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:49:13,271 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:49:13,272 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:49:13,273 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:49:13,273 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:49:13,274 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:49:13,275 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:49:13,276 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:49:13,277 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:49:13,278 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:49:13,279 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:49:13,280 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:49:13,282 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:49:13,282 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:49:13,282 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:49:13,283 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:49:13,283 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:49:13,284 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:49:13,285 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:49:13,285 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:49:13,285 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:49:13,286 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:49:13,286 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:49:13,286 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:49:13,287 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:49:13,287 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:49:13,288 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_685445d7-efb7-4884-85a8-7b56ee49b6ef/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 09:49:13,298 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:49:13,299 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:49:13,299 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:49:13,299 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 09:49:13,300 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:49:13,300 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:49:13,300 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 09:49:13,300 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:49:13,301 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:49:13,301 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:49:13,301 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:49:13,301 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:49:13,301 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:49:13,301 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:49:13,301 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 09:49:13,301 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 09:49:13,302 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:49:13,302 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:49:13,302 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:49:13,302 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:49:13,302 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:49:13,302 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:49:13,302 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:49:13,303 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 09:49:13,303 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:49:13,303 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:49:13,303 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:49:13,303 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:49:13,303 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 09:49:13,303 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:49:13,304 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 09:49:13,304 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 09:49:13,304 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_685445d7-efb7-4884-85a8-7b56ee49b6ef/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97ac2503801a101f5a44ae44e4a77e81fa872959 [2018-11-23 09:49:13,332 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:49:13,340 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:49:13,342 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:49:13,343 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:49:13,344 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:49:13,344 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_685445d7-efb7-4884-85a8-7b56ee49b6ef/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c [2018-11-23 09:49:13,379 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_685445d7-efb7-4884-85a8-7b56ee49b6ef/bin-2019/uautomizer/data/51a58f9b5/aae0e3b5699f4b41bba59441c6afe50e/FLAG13f0d7fe7 [2018-11-23 09:49:13,685 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:49:13,686 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_685445d7-efb7-4884-85a8-7b56ee49b6ef/sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c [2018-11-23 09:49:13,690 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_685445d7-efb7-4884-85a8-7b56ee49b6ef/bin-2019/uautomizer/data/51a58f9b5/aae0e3b5699f4b41bba59441c6afe50e/FLAG13f0d7fe7 [2018-11-23 09:49:13,698 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_685445d7-efb7-4884-85a8-7b56ee49b6ef/bin-2019/uautomizer/data/51a58f9b5/aae0e3b5699f4b41bba59441c6afe50e [2018-11-23 09:49:13,701 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:49:13,702 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:49:13,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:49:13,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:49:13,706 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:49:13,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:49:13" (1/1) ... [2018-11-23 09:49:13,709 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50e4942f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:49:13, skipping insertion in model container [2018-11-23 09:49:13,709 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:49:13" (1/1) ... [2018-11-23 09:49:13,720 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:49:13,736 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:49:13,873 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:49:13,876 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:49:13,892 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:49:13,913 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:49:13,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:49:13 WrapperNode [2018-11-23 09:49:13,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:49:13,914 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:49:13,914 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:49:13,914 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:49:13,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:49:13" (1/1) ... [2018-11-23 09:49:13,927 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:49:13" (1/1) ... [2018-11-23 09:49:13,932 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:49:13,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:49:13,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:49:13,932 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:49:13,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:49:13" (1/1) ... [2018-11-23 09:49:13,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:49:13" (1/1) ... [2018-11-23 09:49:13,941 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:49:13" (1/1) ... [2018-11-23 09:49:13,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:49:13" (1/1) ... [2018-11-23 09:49:13,950 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:49:13" (1/1) ... [2018-11-23 09:49:13,953 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:49:13" (1/1) ... [2018-11-23 09:49:13,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:49:13" (1/1) ... [2018-11-23 09:49:13,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:49:13,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:49:13,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:49:13,958 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:49:13,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:49:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_685445d7-efb7-4884-85a8-7b56ee49b6ef/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:49:14,049 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 09:49:14,050 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 09:49:14,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-11-23 09:49:14,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 09:49:14,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 09:49:14,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 09:49:14,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 09:49:14,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:49:14,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:49:14,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-11-23 09:49:14,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 09:49:14,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 09:49:16,715 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:49:16,715 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 09:49:16,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:49:16 BoogieIcfgContainer [2018-11-23 09:49:16,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:49:16,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 09:49:16,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 09:49:16,718 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 09:49:16,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:49:13" (1/3) ... [2018-11-23 09:49:16,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c674754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:49:16, skipping insertion in model container [2018-11-23 09:49:16,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:49:13" (2/3) ... [2018-11-23 09:49:16,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c674754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:49:16, skipping insertion in model container [2018-11-23 09:49:16,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:49:16" (3/3) ... [2018-11-23 09:49:16,720 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c [2018-11-23 09:49:16,727 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 09:49:16,732 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 09:49:16,742 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 09:49:16,761 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 09:49:16,761 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 09:49:16,761 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 09:49:16,762 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 09:49:16,762 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:49:16,762 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:49:16,762 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 09:49:16,762 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:49:16,762 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 09:49:16,773 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 09:49:16,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 09:49:16,777 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:49:16,778 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:49:16,779 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:49:16,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:49:16,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1326004698, now seen corresponding path program 1 times [2018-11-23 09:49:16,786 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 09:49:16,786 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_685445d7-efb7-4884-85a8-7b56ee49b6ef/bin-2019/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-23 09:49:16,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:49:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:49:17,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:49:17,378 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 09:49:17,379 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:49:17,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:49:17,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 09:49:17,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 09:49:17,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 09:49:17,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:49:17,406 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 4 states. [2018-11-23 09:49:19,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:49:19,771 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-11-23 09:49:19,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 09:49:19,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-23 09:49:19,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:49:19,780 INFO L225 Difference]: With dead ends: 30 [2018-11-23 09:49:19,780 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 09:49:19,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 09:49:19,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 09:49:19,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 09:49:19,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 09:49:19,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-23 09:49:19,806 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-11-23 09:49:19,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:49:19,806 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-23 09:49:19,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 09:49:19,806 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 09:49:19,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 09:49:19,807 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:49:19,807 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:49:19,807 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:49:19,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:49:19,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1310900661, now seen corresponding path program 1 times [2018-11-23 09:49:19,808 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 09:49:19,808 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_685445d7-efb7-4884-85a8-7b56ee49b6ef/bin-2019/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-23 09:49:19,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:49:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:49:20,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:49:21,051 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2018-11-23 09:49:21,489 WARN L180 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-23 09:49:23,602 WARN L832 $PredicateComparison]: unable to prove that (exists ((|v_main_#t~mem1_4| (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_main_#t~mem1_4|) ((_ extract 30 23) |v_main_#t~mem1_4|) ((_ extract 22 0) |v_main_#t~mem1_4|))))) (and (= c_main_~main__r~0 ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse0 (let ((.cse2 (bvadd (bvneg (bvashr |v_main_#t~mem1_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse1)) .cse0) .cse0))))))) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 100.0))))) is different from false [2018-11-23 09:49:25,689 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_#t~mem1_4| (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_main_#t~mem1_4|) ((_ extract 30 23) |v_main_#t~mem1_4|) ((_ extract 22 0) |v_main_#t~mem1_4|))))) (and (= c_main_~main__r~0 ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse0 (let ((.cse2 (bvadd (bvneg (bvashr |v_main_#t~mem1_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse1)) .cse0) .cse0))))))) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 100.0))))) is different from true [2018-11-23 09:49:32,018 WARN L832 $PredicateComparison]: unable to prove that (exists ((|v_main_#t~mem1_4| (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_main_#t~mem1_4|) ((_ extract 30 23) |v_main_#t~mem1_4|) ((_ extract 22 0) |v_main_#t~mem1_4|))))) (and (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse0 (let ((.cse2 (bvadd (bvneg (bvashr |v_main_#t~mem1_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse1)) .cse0) .cse0))))))) (_ +zero 11 53))) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 100.0))))) is different from false [2018-11-23 09:49:34,118 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_#t~mem1_4| (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_main_#t~mem1_4|) ((_ extract 30 23) |v_main_#t~mem1_4|) ((_ extract 22 0) |v_main_#t~mem1_4|))))) (and (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse0 (let ((.cse2 (bvadd (bvneg (bvashr |v_main_#t~mem1_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse1)) .cse0) .cse0))))))) (_ +zero 11 53))) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 100.0))))) is different from true [2018-11-23 09:49:46,807 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 09:49:46,808 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:49:46,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:49:46,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 09:49:46,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 09:49:46,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 09:49:46,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=6, Unknown=4, NotChecked=10, Total=30 [2018-11-23 09:49:46,824 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 6 states. [2018-11-23 09:49:49,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:49:49,614 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2018-11-23 09:49:49,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 09:49:49,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 09:49:49,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:49:49,715 INFO L225 Difference]: With dead ends: 21 [2018-11-23 09:49:49,715 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 09:49:49,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=10, Invalid=6, Unknown=4, NotChecked=10, Total=30 [2018-11-23 09:49:49,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 09:49:49,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 09:49:49,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 09:49:49,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2018-11-23 09:49:49,718 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 14 [2018-11-23 09:49:49,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:49:49,719 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2018-11-23 09:49:49,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 09:49:49,719 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2018-11-23 09:49:49,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 09:49:49,720 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:49:49,720 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:49:49,720 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:49:49,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:49:49,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1852104242, now seen corresponding path program 1 times [2018-11-23 09:49:49,721 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 09:49:49,721 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_685445d7-efb7-4884-85a8-7b56ee49b6ef/bin-2019/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-11-23 09:49:49,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:49:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:49:51,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:49:52,096 WARN L180 SmtUtils]: Spent 784.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-23 09:49:54,216 WARN L832 $PredicateComparison]: unable to prove that (exists ((|v_main_#t~mem1_5| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_main_#t~mem1_5|) ((_ extract 30 23) |v_main_#t~mem1_5|) ((_ extract 22 0) |v_main_#t~mem1_5|))))) (and (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (= c_main_~main__r~0 ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_main_#t~mem1_5| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0)) .cse1) .cse1)))))))))) is different from false [2018-11-23 09:49:56,318 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_#t~mem1_5| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_main_#t~mem1_5|) ((_ extract 30 23) |v_main_#t~mem1_5|) ((_ extract 22 0) |v_main_#t~mem1_5|))))) (and (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (= c_main_~main__r~0 ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_main_#t~mem1_5| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0)) .cse1) .cse1)))))))))) is different from true [2018-11-23 09:49:58,432 WARN L832 $PredicateComparison]: unable to prove that (and (exists ((|v_main_#t~mem1_5| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_main_#t~mem1_5|) ((_ extract 30 23) |v_main_#t~mem1_5|) ((_ extract 22 0) |v_main_#t~mem1_5|))))) (and (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (= c_main_~main__r~0 ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_main_#t~mem1_5| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0)) .cse1) .cse1)))))))))) (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__r~0) (_ +zero 11 53))) is different from false [2018-11-23 09:50:00,989 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_main_#t~mem1_5| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_main_#t~mem1_5|) ((_ extract 30 23) |v_main_#t~mem1_5|) ((_ extract 22 0) |v_main_#t~mem1_5|))))) (and (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (= c_main_~main__r~0 ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_main_#t~mem1_5| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0)) .cse1) .cse1)))))))))) (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__r~0) (_ +zero 11 53))) is different from true [2018-11-23 09:50:07,353 WARN L832 $PredicateComparison]: unable to prove that (exists ((|v_main_#t~mem1_5| (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_main_#t~mem1_5|) ((_ extract 30 23) |v_main_#t~mem1_5|) ((_ extract 22 0) |v_main_#t~mem1_5|))))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_main_#t~mem1_5| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse2) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse1)) .cse2) .cse2))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)))))) is different from false [2018-11-23 09:50:09,482 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_#t~mem1_5| (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_main_#t~mem1_5|) ((_ extract 30 23) |v_main_#t~mem1_5|) ((_ extract 22 0) |v_main_#t~mem1_5|))))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_main_#t~mem1_5| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse2) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse1)) .cse2) .cse2))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)))))) is different from true [2018-11-23 09:50:22,229 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 09:50:22,230 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:50:22,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:50:22,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 09:50:22,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 09:50:22,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 09:50:22,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=6, Unknown=6, NotChecked=18, Total=42 [2018-11-23 09:50:22,252 INFO L87 Difference]: Start difference. First operand 16 states and 15 transitions. Second operand 7 states. [2018-11-23 09:50:24,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:50:24,882 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2018-11-23 09:50:24,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 09:50:24,993 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-11-23 09:50:24,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:50:24,993 INFO L225 Difference]: With dead ends: 16 [2018-11-23 09:50:24,993 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 09:50:24,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=12, Invalid=6, Unknown=6, NotChecked=18, Total=42 [2018-11-23 09:50:24,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 09:50:24,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 09:50:24,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 09:50:24,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 09:50:24,995 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2018-11-23 09:50:24,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:50:24,995 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 09:50:24,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 09:50:24,996 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 09:50:24,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:50:25,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 09:50:39,321 WARN L180 SmtUtils]: Spent 14.29 s on a formula simplification that was a NOOP. DAG size: 74 [2018-11-23 09:50:57,739 WARN L180 SmtUtils]: Spent 18.42 s on a formula simplification that was a NOOP. DAG size: 76 [2018-11-23 09:50:57,741 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 09:50:57,742 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 09:50:57,742 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 09:50:57,742 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 09:50:57,742 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 09:50:57,742 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 09:50:57,742 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 09:50:57,742 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 80) no Hoare annotation was computed. [2018-11-23 09:50:57,742 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 14 91) no Hoare annotation was computed. [2018-11-23 09:50:57,743 INFO L448 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-11-23 09:50:57,743 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 61) no Hoare annotation was computed. [2018-11-23 09:50:57,743 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 14 91) no Hoare annotation was computed. [2018-11-23 09:50:57,743 INFO L444 ceAbstractionStarter]: At program point L73(lines 41 74) the Hoare annotation is: (or (exists ((|v_main_#t~mem1_5| (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_main_#t~mem1_5|) ((_ extract 30 23) |v_main_#t~mem1_5|) ((_ extract 22 0) |v_main_#t~mem1_5|))))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_main_#t~mem1_5| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse2) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse1)) .cse2) .cse2))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)))))) (exists ((|v_main_#t~mem1_4| (_ BitVec 32))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_main_#t~mem1_4|) ((_ extract 30 23) |v_main_#t~mem1_4|) ((_ extract 22 0) |v_main_#t~mem1_4|))))) (and (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse4 (let ((.cse6 (bvadd (bvneg (bvashr |v_main_#t~mem1_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse4) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse5)) .cse4) .cse4))))))) (_ +zero 11 53))) (fp.geq .cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse5 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)))))) [2018-11-23 09:50:57,743 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 14 91) the Hoare annotation is: true [2018-11-23 09:50:57,743 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2018-11-23 09:50:57,744 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 85) no Hoare annotation was computed. [2018-11-23 09:50:57,744 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 90) no Hoare annotation was computed. [2018-11-23 09:50:57,744 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 69) no Hoare annotation was computed. [2018-11-23 09:50:57,744 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 74) no Hoare annotation was computed. [2018-11-23 09:50:57,744 INFO L444 ceAbstractionStarter]: At program point L68(lines 43 69) the Hoare annotation is: (or (exists ((|v_main_#t~mem1_5| (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_main_#t~mem1_5|) ((_ extract 30 23) |v_main_#t~mem1_5|) ((_ extract 22 0) |v_main_#t~mem1_5|))))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_main_#t~mem1_5| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse2) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse1)) .cse2) .cse2))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)))))) (= (_ bv1 32) main_~main____CPAchecker_TMP_1~0) (exists ((|v_main_#t~mem1_4| (_ BitVec 32))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_main_#t~mem1_4|) ((_ extract 30 23) |v_main_#t~mem1_4|) ((_ extract 22 0) |v_main_#t~mem1_4|))))) (and (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse4 (let ((.cse6 (bvadd (bvneg (bvashr |v_main_#t~mem1_4| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse4) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse5)) .cse4) .cse4))))))) (_ +zero 11 53))) (fp.geq .cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse5 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)))))) [2018-11-23 09:50:57,747 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:446) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:105) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 09:50:57,749 INFO L168 Benchmark]: Toolchain (without parser) took 104048.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -106.8 MB). Peak memory consumption was 64.7 MB. Max. memory is 11.5 GB. [2018-11-23 09:50:57,750 INFO L168 Benchmark]: CDTParser took 0.14 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 09:50:57,751 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.97 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 09:50:57,751 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.38 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:50:57,751 INFO L168 Benchmark]: Boogie Preprocessor took 24.99 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:50:57,752 INFO L168 Benchmark]: RCFGBuilder took 2757.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -205.7 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-11-23 09:50:57,752 INFO L168 Benchmark]: TraceAbstraction took 101032.89 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: 82.8 MB). Peak memory consumption was 82.8 MB. Max. memory is 11.5 GB. [2018-11-23 09:50:57,755 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.14 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 210.97 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.38 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.99 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2757.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -205.7 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 101032.89 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: 82.8 MB). Peak memory consumption was 82.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 54]: 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 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...