./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_0710.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_0710.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bef6e9194447b24677d0088ba0b7766a25273d0b ...................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_0710.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bef6e9194447b24677d0088ba0b7766a25273d0b ....................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@7efd7861 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 13:14:27,243 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 13:14:27,246 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 13:14:27,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 13:14:27,289 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 13:14:27,292 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 13:14:27,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 13:14:27,298 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 13:14:27,301 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 13:14:27,305 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 13:14:27,307 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 13:14:27,310 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 13:14:27,311 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 13:14:27,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 13:14:27,314 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 13:14:27,318 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 13:14:27,319 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 13:14:27,319 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 13:14:27,324 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 13:14:27,329 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 13:14:27,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 13:14:27,332 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 13:14:27,333 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 13:14:27,334 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 13:14:27,340 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 13:14:27,341 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 13:14:27,341 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 13:14:27,342 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 13:14:27,343 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 13:14:27,344 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 13:14:27,344 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 13:14:27,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 13:14:27,346 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 13:14:27,346 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 13:14:27,348 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 13:14:27,348 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 13:14:27,348 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 13:14:27,349 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 13:14:27,349 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 13:14:27,350 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 13:14:27,351 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 13:14:27,352 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-09-13 13:14:27,388 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 13:14:27,388 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 13:14:27,389 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 13:14:27,390 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 13:14:27,391 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 13:14:27,392 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 13:14:27,392 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 13:14:27,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 13:14:27,392 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 13:14:27,392 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-13 13:14:27,393 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 13:14:27,393 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 13:14:27,394 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 13:14:27,394 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 13:14:27,394 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 13:14:27,394 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 13:14:27,394 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 13:14:27,394 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 13:14:27,395 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 13:14:27,395 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 13:14:27,395 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 13:14:27,395 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 13:14:27,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 13:14:27,395 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 13:14:27,396 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 13:14:27,396 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 13:14:27,396 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-13 13:14:27,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-13 13:14:27,396 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 13:14:27,396 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 13:14:27,397 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_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 -> bef6e9194447b24677d0088ba0b7766a25273d0b [2021-09-13 13:14:27,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 13:14:27,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 13:14:27,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 13:14:27,750 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 13:14:27,751 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 13:14:27,752 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0710.c [2021-09-13 13:14:27,804 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d82a036c7/9e74d96a58074c79bbb264283cee5783/FLAGd58dc5c35 [2021-09-13 13:14:28,173 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 13:14:28,174 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0710.c [2021-09-13 13:14:28,185 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d82a036c7/9e74d96a58074c79bbb264283cee5783/FLAGd58dc5c35 [2021-09-13 13:14:28,611 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d82a036c7/9e74d96a58074c79bbb264283cee5783 [2021-09-13 13:14:28,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 13:14:28,615 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 13:14:28,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 13:14:28,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 13:14:28,622 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 13:14:28,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 01:14:28" (1/1) ... [2021-09-13 13:14:28,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@487afe30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:14:28, skipping insertion in model container [2021-09-13 13:14:28,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 01:14:28" (1/1) ... [2021-09-13 13:14:28,630 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 13:14:28,647 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 13:14:28,824 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0710.c[1961,1974] [2021-09-13 13:14:28,854 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 13:14:28,887 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 13:14:28,937 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0710.c[1961,1974] [2021-09-13 13:14:28,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 13:14:28,957 INFO L208 MainTranslator]: Completed translation [2021-09-13 13:14:28,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:14:28 WrapperNode [2021-09-13 13:14:28,958 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 13:14:28,959 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 13:14:28,960 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 13:14:28,960 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 13:14:28,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:14:28" (1/1) ... [2021-09-13 13:14:28,987 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:14:28" (1/1) ... [2021-09-13 13:14:29,025 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 13:14:29,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 13:14:29,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 13:14:29,028 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 13:14:29,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:14:28" (1/1) ... [2021-09-13 13:14:29,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:14:28" (1/1) ... [2021-09-13 13:14:29,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:14:28" (1/1) ... [2021-09-13 13:14:29,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:14:28" (1/1) ... [2021-09-13 13:14:29,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:14:28" (1/1) ... [2021-09-13 13:14:29,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:14:28" (1/1) ... [2021-09-13 13:14:29,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:14:28" (1/1) ... [2021-09-13 13:14:29,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 13:14:29,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 13:14:29,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 13:14:29,078 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 13:14:29,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:14:28" (1/1) ... [2021-09-13 13:14:29,085 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 13:14:29,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 13:14:29,114 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-09-13 13:14:29,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-09-13 13:14:29,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-13 13:14:29,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 13:14:29,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-09-13 13:14:29,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-09-13 13:14:29,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2021-09-13 13:14:29,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 13:14:29,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 13:14:29,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-09-13 13:14:29,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-09-13 13:14:29,470 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 13:14:29,471 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2021-09-13 13:14:29,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 01:14:29 BoogieIcfgContainer [2021-09-13 13:14:29,472 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 13:14:29,473 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 13:14:29,474 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 13:14:29,476 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 13:14:29,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 01:14:28" (1/3) ... [2021-09-13 13:14:29,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d714005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 01:14:29, skipping insertion in model container [2021-09-13 13:14:29,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:14:28" (2/3) ... [2021-09-13 13:14:29,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d714005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 01:14:29, skipping insertion in model container [2021-09-13 13:14:29,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 01:14:29" (3/3) ... [2021-09-13 13:14:29,485 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0710.c [2021-09-13 13:14:29,488 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 13:14:29,489 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-09-13 13:14:29,531 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 13:14:29,536 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-09-13 13:14:29,537 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-09-13 13:14:29,551 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 33 states have (on average 1.606060606060606) internal successors, (53), 34 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 13:14:29,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-09-13 13:14:29,555 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 13:14:29,556 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 13:14:29,556 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 13:14:29,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 13:14:29,561 INFO L82 PathProgramCache]: Analyzing trace with hash 860611220, now seen corresponding path program 1 times [2021-09-13 13:14:29,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 13:14:29,569 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664452771] [2021-09-13 13:14:29,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 13:14:29,570 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 13:14:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 13:14:29,703 INFO L281 TraceCheckUtils]: 0: Hoare triple {38#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(20);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~one_sqrt~0 := 1.0;~tiny_sqrt~0 := 1.0E-30; {38#true} is VALID [2021-09-13 13:14:29,703 INFO L281 TraceCheckUtils]: 1: Hoare triple {38#true} havoc main_#res;havoc main_#t~nondet10, main_#t~ret11, main_#t~ret12, main_~res~0, main_~x~0;main_~x~0 := main_#t~nondet10;havoc main_#t~nondet10; {38#true} is VALID [2021-09-13 13:14:29,704 INFO L281 TraceCheckUtils]: 2: Hoare triple {38#true} assume ~someBinaryFLOATComparisonOperation(main_~x~0, ~someUnaryFLOAToperation(0.0));__ieee754_sqrtf_#in~x := main_~x~0;havoc __ieee754_sqrtf_#res;havoc __ieee754_sqrtf_#t~mem7, __ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset, __ieee754_sqrtf_#t~post8, __ieee754_sqrtf_#t~mem9, __ieee754_sqrtf_~#sf_u~0.base, __ieee754_sqrtf_~#sf_u~0.offset, __ieee754_sqrtf_~x, __ieee754_sqrtf_~z~0, __ieee754_sqrtf_~r~0, __ieee754_sqrtf_~hx~0, __ieee754_sqrtf_~ix~0, __ieee754_sqrtf_~s~0, __ieee754_sqrtf_~q~0, __ieee754_sqrtf_~m~0, __ieee754_sqrtf_~t~0, __ieee754_sqrtf_~i~0;__ieee754_sqrtf_~x := __ieee754_sqrtf_#in~x;havoc __ieee754_sqrtf_~z~0;havoc __ieee754_sqrtf_~r~0;havoc __ieee754_sqrtf_~hx~0;havoc __ieee754_sqrtf_~ix~0;havoc __ieee754_sqrtf_~s~0;havoc __ieee754_sqrtf_~q~0;havoc __ieee754_sqrtf_~m~0;havoc __ieee754_sqrtf_~t~0;havoc __ieee754_sqrtf_~i~0; {38#true} is VALID [2021-09-13 13:14:29,705 INFO L281 TraceCheckUtils]: 3: Hoare triple {38#true} assume !true; {39#false} is VALID [2021-09-13 13:14:29,705 INFO L281 TraceCheckUtils]: 4: Hoare triple {39#false} __ieee754_sqrtf_~hx~0 := ~bitwiseAnd(__ieee754_sqrtf_~ix~0, 2147483647); {39#false} is VALID [2021-09-13 13:14:29,705 INFO L281 TraceCheckUtils]: 5: Hoare triple {39#false} assume !(__ieee754_sqrtf_~hx~0 % 4294967296 < 2139095040);__ieee754_sqrtf_#res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(__ieee754_sqrtf_~x, __ieee754_sqrtf_~x), __ieee754_sqrtf_~x); {39#false} is VALID [2021-09-13 13:14:29,706 INFO L281 TraceCheckUtils]: 6: Hoare triple {39#false} main_#t~ret11 := __ieee754_sqrtf_#res;main_~res~0 := main_#t~ret11;havoc main_#t~ret11;isnan_float_#in~x := main_~res~0;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if ~someBinaryFLOATComparisonOperation(isnan_float_~x, isnan_float_~x) then 1 else 0); {39#false} is VALID [2021-09-13 13:14:29,706 INFO L281 TraceCheckUtils]: 7: Hoare triple {39#false} main_#t~ret12 := isnan_float_#res;assume -2147483648 <= main_#t~ret12 && main_#t~ret12 <= 2147483647; {39#false} is VALID [2021-09-13 13:14:29,706 INFO L281 TraceCheckUtils]: 8: Hoare triple {39#false} assume 0 == main_#t~ret12;havoc main_#t~ret12; {39#false} is VALID [2021-09-13 13:14:29,706 INFO L281 TraceCheckUtils]: 9: Hoare triple {39#false} assume !false; {39#false} is VALID [2021-09-13 13:14:29,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 13:14:29,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 13:14:29,727 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664452771] [2021-09-13 13:14:29,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664452771] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 13:14:29,728 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 13:14:29,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-13 13:14:29,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688642864] [2021-09-13 13:14:29,737 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-09-13 13:14:29,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 13:14:29,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 13:14:29,767 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 13:14:29,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-09-13 13:14:29,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 13:14:29,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-09-13 13:14:29,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 13:14:29,794 INFO L87 Difference]: Start difference. First operand has 35 states, 33 states have (on average 1.606060606060606) internal successors, (53), 34 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 13:14:29,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 13:14:29,945 INFO L93 Difference]: Finished difference Result 67 states and 102 transitions. [2021-09-13 13:14:29,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-09-13 13:14:29,947 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-09-13 13:14:29,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 13:14:29,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 13:14:29,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 102 transitions. [2021-09-13 13:14:29,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 13:14:29,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 102 transitions. [2021-09-13 13:14:29,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 102 transitions. [2021-09-13 13:14:30,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 13:14:30,093 INFO L225 Difference]: With dead ends: 67 [2021-09-13 13:14:30,102 INFO L226 Difference]: Without dead ends: 31 [2021-09-13 13:14:30,106 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.04ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 13:14:30,109 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.43ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.66ms IncrementalHoareTripleChecker+Time [2021-09-13 13:14:30,114 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 46 Unknown, 0 Unchecked, 1.43ms Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 52.66ms Time] [2021-09-13 13:14:30,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-09-13 13:14:30,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-09-13 13:14:30,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 13:14:30,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 13:14:30,145 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 13:14:30,146 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 13:14:30,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 13:14:30,150 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2021-09-13 13:14:30,150 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2021-09-13 13:14:30,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 13:14:30,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 13:14:30,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 31 states. [2021-09-13 13:14:30,152 INFO L87 Difference]: Start difference. First operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 31 states. [2021-09-13 13:14:30,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 13:14:30,161 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2021-09-13 13:14:30,161 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2021-09-13 13:14:30,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 13:14:30,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 13:14:30,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 13:14:30,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 13:14:30,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 13:14:30,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2021-09-13 13:14:30,169 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 10 [2021-09-13 13:14:30,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 13:14:30,170 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2021-09-13 13:14:30,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 13:14:30,170 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2021-09-13 13:14:30,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-09-13 13:14:30,171 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 13:14:30,171 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 13:14:30,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-09-13 13:14:30,173 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 13:14:30,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 13:14:30,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1279985196, now seen corresponding path program 1 times [2021-09-13 13:14:30,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 13:14:30,176 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100263036] [2021-09-13 13:14:30,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 13:14:30,176 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 13:14:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-09-13 13:14:30,246 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-09-13 13:14:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-09-13 13:14:30,319 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-09-13 13:14:30,319 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-09-13 13:14:30,321 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-09-13 13:14:30,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-09-13 13:14:30,332 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-09-13 13:14:30,369 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2021-09-13 13:14:30,370 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2021-09-13 13:14:30,371 WARN L170 areAnnotationChecker]: L94 has no Hoare annotation [2021-09-13 13:14:30,376 WARN L170 areAnnotationChecker]: L94 has no Hoare annotation [2021-09-13 13:14:30,376 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2021-09-13 13:14:30,376 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2021-09-13 13:14:30,376 WARN L170 areAnnotationChecker]: L94-2 has no Hoare annotation [2021-09-13 13:14:30,376 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2021-09-13 13:14:30,376 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2021-09-13 13:14:30,376 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2021-09-13 13:14:30,377 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2021-09-13 13:14:30,377 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2021-09-13 13:14:30,377 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2021-09-13 13:14:30,377 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 13:14:30,377 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2021-09-13 13:14:30,377 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2021-09-13 13:14:30,377 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2021-09-13 13:14:30,377 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2021-09-13 13:14:30,378 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2021-09-13 13:14:30,378 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2021-09-13 13:14:30,378 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2021-09-13 13:14:30,378 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2021-09-13 13:14:30,378 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2021-09-13 13:14:30,378 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2021-09-13 13:14:30,378 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2021-09-13 13:14:30,378 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2021-09-13 13:14:30,379 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2021-09-13 13:14:30,379 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2021-09-13 13:14:30,379 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2021-09-13 13:14:30,379 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2021-09-13 13:14:30,379 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation [2021-09-13 13:14:30,379 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2021-09-13 13:14:30,379 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2021-09-13 13:14:30,380 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2021-09-13 13:14:30,380 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2021-09-13 13:14:30,380 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2021-09-13 13:14:30,380 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2021-09-13 13:14:30,380 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2021-09-13 13:14:30,380 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2021-09-13 13:14:30,380 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2021-09-13 13:14:30,380 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2021-09-13 13:14:30,381 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2021-09-13 13:14:30,381 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2021-09-13 13:14:30,381 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2021-09-13 13:14:30,381 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2021-09-13 13:14:30,381 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2021-09-13 13:14:30,381 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2021-09-13 13:14:30,381 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2021-09-13 13:14:30,381 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2021-09-13 13:14:30,382 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2021-09-13 13:14:30,382 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2021-09-13 13:14:30,382 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2021-09-13 13:14:30,382 WARN L170 areAnnotationChecker]: L78-3 has no Hoare annotation [2021-09-13 13:14:30,382 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2021-09-13 13:14:30,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 01:14:30 BoogieIcfgContainer [2021-09-13 13:14:30,385 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-09-13 13:14:30,385 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-09-13 13:14:30,385 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-09-13 13:14:30,386 INFO L275 PluginConnector]: Witness Printer initialized [2021-09-13 13:14:30,386 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 01:14:29" (3/4) ... [2021-09-13 13:14:30,389 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-09-13 13:14:30,389 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-09-13 13:14:30,390 INFO L158 Benchmark]: Toolchain (without parser) took 1775.17ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 32.0MB in the beginning and 38.4MB in the end (delta: -6.5MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. [2021-09-13 13:14:30,391 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 54.5MB. Free memory was 37.0MB in the beginning and 37.0MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 13:14:30,393 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.68ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 31.8MB in the beginning and 49.0MB in the end (delta: -17.3MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2021-09-13 13:14:30,394 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.90ms. Allocated memory is still 67.1MB. Free memory was 49.0MB in the beginning and 46.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 13:14:30,397 INFO L158 Benchmark]: Boogie Preprocessor took 48.93ms. Allocated memory is still 67.1MB. Free memory was 46.9MB in the beginning and 45.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 13:14:30,397 INFO L158 Benchmark]: RCFGBuilder took 394.34ms. Allocated memory is still 67.1MB. Free memory was 45.3MB in the beginning and 47.3MB in the end (delta: -2.0MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2021-09-13 13:14:30,397 INFO L158 Benchmark]: TraceAbstraction took 911.29ms. Allocated memory is still 67.1MB. Free memory was 46.6MB in the beginning and 39.1MB in the end (delta: 7.6MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2021-09-13 13:14:30,398 INFO L158 Benchmark]: Witness Printer took 3.60ms. Allocated memory is still 67.1MB. Free memory was 38.8MB in the beginning and 38.4MB in the end (delta: 357.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 13:14:30,403 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 54.5MB. Free memory was 37.0MB in the beginning and 37.0MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 339.68ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 31.8MB in the beginning and 49.0MB in the end (delta: -17.3MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.90ms. Allocated memory is still 67.1MB. Free memory was 49.0MB in the beginning and 46.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.93ms. Allocated memory is still 67.1MB. Free memory was 46.9MB in the beginning and 45.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 394.34ms. Allocated memory is still 67.1MB. Free memory was 45.3MB in the beginning and 47.3MB in the end (delta: -2.0MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * TraceAbstraction took 911.29ms. Allocated memory is still 67.1MB. Free memory was 46.6MB in the beginning and 39.1MB in the end (delta: 7.6MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Witness Printer took 3.60ms. Allocated memory is still 67.1MB. Free memory was 38.8MB in the beginning and 38.4MB in the end (delta: 357.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 100]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 15, overapproximation of bitwiseAnd at line 29, overapproximation of someBinaryArithmeticFLOAToperation at line 32. Possible FailurePath: [L17] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L93] float x = __VERIFIER_nondet_float(); [L94] COND TRUE x < -0.0f [L20] float z; [L21] __uint32_t r, hx; [L22] __int32_t ix, s, q, m, t, i; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L25] ieee_float_shape_type gf_u; [L26] gf_u.value = (x) [L27] EXPR gf_u.word [L27] (ix) = gf_u.word [L29] hx = ix & 0x7fffffff VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L31] COND TRUE !((hx) < 0x7f800000L) [L32] return x * x + x; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L96] float res = __ieee754_sqrtf(x); [L15] return x != x; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L99] COND TRUE !isnan_float(res) [L100] reach_error() VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 801.45ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 10.09ms, AutomataDifference: 347.78ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 9.12ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 52.66ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 48.79ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 46 IncrementalHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 0 mSDtfsCounter, 46 mSolverCounterSat, 1.43ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.04ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 42.39ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 19.90ms SsaConstructionTime, 80.14ms SatisfiabilityAnalysisTime, 50.97ms InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 9 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-09-13 13:14:30,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 13:14:32,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 13:14:32,267 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 13:14:32,305 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 13:14:32,305 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 13:14:32,309 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 13:14:32,311 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 13:14:32,315 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 13:14:32,317 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 13:14:32,322 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 13:14:32,323 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 13:14:32,326 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 13:14:32,327 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 13:14:32,329 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 13:14:32,330 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 13:14:32,333 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 13:14:32,334 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 13:14:32,334 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 13:14:32,337 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 13:14:32,342 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 13:14:32,343 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 13:14:32,344 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 13:14:32,346 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 13:14:32,346 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 13:14:32,352 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 13:14:32,353 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 13:14:32,353 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 13:14:32,354 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 13:14:32,355 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 13:14:32,356 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 13:14:32,356 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 13:14:32,356 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 13:14:32,358 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 13:14:32,358 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 13:14:32,360 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 13:14:32,360 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 13:14:32,361 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 13:14:32,361 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 13:14:32,361 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 13:14:32,363 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 13:14:32,363 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 13:14:32,364 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-09-13 13:14:32,400 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 13:14:32,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 13:14:32,402 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 13:14:32,402 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 13:14:32,404 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 13:14:32,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 13:14:32,404 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 13:14:32,405 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 13:14:32,405 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 13:14:32,405 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 13:14:32,406 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 13:14:32,406 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 13:14:32,406 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 13:14:32,416 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 13:14:32,416 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-09-13 13:14:32,417 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-09-13 13:14:32,417 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 13:14:32,417 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 13:14:32,417 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 13:14:32,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 13:14:32,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 13:14:32,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 13:14:32,418 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 13:14:32,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 13:14:32,418 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 13:14:32,418 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 13:14:32,418 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 13:14:32,418 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-09-13 13:14:32,418 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-09-13 13:14:32,419 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 13:14:32,419 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 13:14:32,419 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-09-13 13:14:32,419 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_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 -> bef6e9194447b24677d0088ba0b7766a25273d0b [2021-09-13 13:14:32,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 13:14:32,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 13:14:32,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 13:14:32,758 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 13:14:32,759 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 13:14:32,760 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0710.c [2021-09-13 13:14:32,819 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64b4ea102/3ef03cba859447f492ddcde1165587fe/FLAGd4146a0e3 [2021-09-13 13:14:33,215 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 13:14:33,218 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0710.c [2021-09-13 13:14:33,225 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64b4ea102/3ef03cba859447f492ddcde1165587fe/FLAGd4146a0e3 [2021-09-13 13:14:33,637 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64b4ea102/3ef03cba859447f492ddcde1165587fe [2021-09-13 13:14:33,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 13:14:33,642 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 13:14:33,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 13:14:33,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 13:14:33,648 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 13:14:33,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 01:14:33" (1/1) ... [2021-09-13 13:14:33,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d80e51e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:14:33, skipping insertion in model container [2021-09-13 13:14:33,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 01:14:33" (1/1) ... [2021-09-13 13:14:33,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 13:14:33,673 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 13:14:33,829 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0710.c[1961,1974] [2021-09-13 13:14:33,833 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 13:14:33,843 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 13:14:33,911 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0710.c[1961,1974] [2021-09-13 13:14:33,912 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 13:14:33,932 INFO L208 MainTranslator]: Completed translation [2021-09-13 13:14:33,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:14:33 WrapperNode [2021-09-13 13:14:33,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 13:14:33,934 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 13:14:33,934 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 13:14:33,934 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 13:14:33,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:14:33" (1/1) ... [2021-09-13 13:14:33,953 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:14:33" (1/1) ... [2021-09-13 13:14:33,979 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 13:14:33,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 13:14:33,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 13:14:33,980 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 13:14:33,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:14:33" (1/1) ... [2021-09-13 13:14:33,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:14:33" (1/1) ... [2021-09-13 13:14:33,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:14:33" (1/1) ... [2021-09-13 13:14:33,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:14:33" (1/1) ... [2021-09-13 13:14:34,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:14:33" (1/1) ... [2021-09-13 13:14:34,005 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:14:33" (1/1) ... [2021-09-13 13:14:34,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:14:33" (1/1) ... [2021-09-13 13:14:34,010 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 13:14:34,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 13:14:34,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 13:14:34,011 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 13:14:34,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:14:33" (1/1) ... [2021-09-13 13:14:34,017 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 13:14:34,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 13:14:34,036 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-09-13 13:14:34,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-09-13 13:14:34,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-09-13 13:14:34,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 13:14:34,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2021-09-13 13:14:34,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-09-13 13:14:34,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 13:14:34,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 13:14:34,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2021-09-13 13:14:34,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-09-13 13:14:34,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-09-13 13:14:34,373 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 13:14:34,374 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2021-09-13 13:14:34,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 01:14:34 BoogieIcfgContainer [2021-09-13 13:14:34,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 13:14:34,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 13:14:34,377 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 13:14:34,379 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 13:14:34,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 01:14:33" (1/3) ... [2021-09-13 13:14:34,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@359fa97e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 01:14:34, skipping insertion in model container [2021-09-13 13:14:34,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:14:33" (2/3) ... [2021-09-13 13:14:34,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@359fa97e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 01:14:34, skipping insertion in model container [2021-09-13 13:14:34,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 01:14:34" (3/3) ... [2021-09-13 13:14:34,382 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0710.c [2021-09-13 13:14:34,385 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 13:14:34,386 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-09-13 13:14:34,460 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 13:14:34,477 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-09-13 13:14:34,477 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-09-13 13:14:34,501 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 33 states have (on average 1.606060606060606) internal successors, (53), 34 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 13:14:34,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-09-13 13:14:34,506 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 13:14:34,506 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 13:14:34,507 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 13:14:34,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 13:14:34,514 INFO L82 PathProgramCache]: Analyzing trace with hash 860611220, now seen corresponding path program 1 times [2021-09-13 13:14:34,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 13:14:34,526 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541309060] [2021-09-13 13:14:34,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 13:14:34,527 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 13:14:34,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 13:14:34,533 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 13:14:34,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-09-13 13:14:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 13:14:34,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2021-09-13 13:14:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 13:14:34,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 13:14:34,851 INFO L281 TraceCheckUtils]: 0: Hoare triple {38#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(20bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~one_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~tiny_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E-30)); {38#true} is VALID [2021-09-13 13:14:34,852 INFO L281 TraceCheckUtils]: 1: Hoare triple {38#true} havoc main_#res;havoc main_#t~nondet10, main_#t~ret11, main_#t~ret12, main_~res~0, main_~x~0;main_~x~0 := main_#t~nondet10;havoc main_#t~nondet10; {38#true} is VALID [2021-09-13 13:14:34,852 INFO L281 TraceCheckUtils]: 2: Hoare triple {38#true} assume ~fp.lt~FLOAT(main_~x~0, ~fp.neg~FLOAT(~Pluszero~FLOAT()));__ieee754_sqrtf_#in~x := main_~x~0;havoc __ieee754_sqrtf_#res;havoc __ieee754_sqrtf_#t~mem7, __ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset, __ieee754_sqrtf_#t~post8, __ieee754_sqrtf_#t~mem9, __ieee754_sqrtf_~#sf_u~0.base, __ieee754_sqrtf_~#sf_u~0.offset, __ieee754_sqrtf_~x, __ieee754_sqrtf_~z~0, __ieee754_sqrtf_~r~0, __ieee754_sqrtf_~hx~0, __ieee754_sqrtf_~ix~0, __ieee754_sqrtf_~s~0, __ieee754_sqrtf_~q~0, __ieee754_sqrtf_~m~0, __ieee754_sqrtf_~t~0, __ieee754_sqrtf_~i~0;__ieee754_sqrtf_~x := __ieee754_sqrtf_#in~x;havoc __ieee754_sqrtf_~z~0;havoc __ieee754_sqrtf_~r~0;havoc __ieee754_sqrtf_~hx~0;havoc __ieee754_sqrtf_~ix~0;havoc __ieee754_sqrtf_~s~0;havoc __ieee754_sqrtf_~q~0;havoc __ieee754_sqrtf_~m~0;havoc __ieee754_sqrtf_~t~0;havoc __ieee754_sqrtf_~i~0; {38#true} is VALID [2021-09-13 13:14:34,853 INFO L281 TraceCheckUtils]: 3: Hoare triple {38#true} assume !true; {39#false} is VALID [2021-09-13 13:14:34,853 INFO L281 TraceCheckUtils]: 4: Hoare triple {39#false} __ieee754_sqrtf_~hx~0 := ~bvand32(2147483647bv32, __ieee754_sqrtf_~ix~0); {39#false} is VALID [2021-09-13 13:14:34,854 INFO L281 TraceCheckUtils]: 5: Hoare triple {39#false} assume !~bvult32(__ieee754_sqrtf_~hx~0, 2139095040bv32);__ieee754_sqrtf_#res := ~fp.add~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, __ieee754_sqrtf_~x, __ieee754_sqrtf_~x), __ieee754_sqrtf_~x); {39#false} is VALID [2021-09-13 13:14:34,854 INFO L281 TraceCheckUtils]: 6: Hoare triple {39#false} main_#t~ret11 := __ieee754_sqrtf_#res;main_~res~0 := main_#t~ret11;havoc main_#t~ret11;isnan_float_#in~x := main_~res~0;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if !~fp.eq~FLOAT(isnan_float_~x, isnan_float_~x) then 1bv32 else 0bv32); {39#false} is VALID [2021-09-13 13:14:34,854 INFO L281 TraceCheckUtils]: 7: Hoare triple {39#false} main_#t~ret12 := isnan_float_#res; {39#false} is VALID [2021-09-13 13:14:34,855 INFO L281 TraceCheckUtils]: 8: Hoare triple {39#false} assume 0bv32 == main_#t~ret12;havoc main_#t~ret12; {39#false} is VALID [2021-09-13 13:14:34,855 INFO L281 TraceCheckUtils]: 9: Hoare triple {39#false} assume !false; {39#false} is VALID [2021-09-13 13:14:34,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 13:14:34,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 13:14:34,920 INFO L281 TraceCheckUtils]: 9: Hoare triple {39#false} assume !false; {39#false} is VALID [2021-09-13 13:14:34,921 INFO L281 TraceCheckUtils]: 8: Hoare triple {39#false} assume 0bv32 == main_#t~ret12;havoc main_#t~ret12; {39#false} is VALID [2021-09-13 13:14:34,921 INFO L281 TraceCheckUtils]: 7: Hoare triple {39#false} main_#t~ret12 := isnan_float_#res; {39#false} is VALID [2021-09-13 13:14:34,922 INFO L281 TraceCheckUtils]: 6: Hoare triple {39#false} main_#t~ret11 := __ieee754_sqrtf_#res;main_~res~0 := main_#t~ret11;havoc main_#t~ret11;isnan_float_#in~x := main_~res~0;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if !~fp.eq~FLOAT(isnan_float_~x, isnan_float_~x) then 1bv32 else 0bv32); {39#false} is VALID [2021-09-13 13:14:34,922 INFO L281 TraceCheckUtils]: 5: Hoare triple {39#false} assume !~bvult32(__ieee754_sqrtf_~hx~0, 2139095040bv32);__ieee754_sqrtf_#res := ~fp.add~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, __ieee754_sqrtf_~x, __ieee754_sqrtf_~x), __ieee754_sqrtf_~x); {39#false} is VALID [2021-09-13 13:14:34,922 INFO L281 TraceCheckUtils]: 4: Hoare triple {39#false} __ieee754_sqrtf_~hx~0 := ~bvand32(2147483647bv32, __ieee754_sqrtf_~ix~0); {39#false} is VALID [2021-09-13 13:14:34,923 INFO L281 TraceCheckUtils]: 3: Hoare triple {38#true} assume !true; {39#false} is VALID [2021-09-13 13:14:34,923 INFO L281 TraceCheckUtils]: 2: Hoare triple {38#true} assume ~fp.lt~FLOAT(main_~x~0, ~fp.neg~FLOAT(~Pluszero~FLOAT()));__ieee754_sqrtf_#in~x := main_~x~0;havoc __ieee754_sqrtf_#res;havoc __ieee754_sqrtf_#t~mem7, __ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset, __ieee754_sqrtf_#t~post8, __ieee754_sqrtf_#t~mem9, __ieee754_sqrtf_~#sf_u~0.base, __ieee754_sqrtf_~#sf_u~0.offset, __ieee754_sqrtf_~x, __ieee754_sqrtf_~z~0, __ieee754_sqrtf_~r~0, __ieee754_sqrtf_~hx~0, __ieee754_sqrtf_~ix~0, __ieee754_sqrtf_~s~0, __ieee754_sqrtf_~q~0, __ieee754_sqrtf_~m~0, __ieee754_sqrtf_~t~0, __ieee754_sqrtf_~i~0;__ieee754_sqrtf_~x := __ieee754_sqrtf_#in~x;havoc __ieee754_sqrtf_~z~0;havoc __ieee754_sqrtf_~r~0;havoc __ieee754_sqrtf_~hx~0;havoc __ieee754_sqrtf_~ix~0;havoc __ieee754_sqrtf_~s~0;havoc __ieee754_sqrtf_~q~0;havoc __ieee754_sqrtf_~m~0;havoc __ieee754_sqrtf_~t~0;havoc __ieee754_sqrtf_~i~0; {38#true} is VALID [2021-09-13 13:14:34,924 INFO L281 TraceCheckUtils]: 1: Hoare triple {38#true} havoc main_#res;havoc main_#t~nondet10, main_#t~ret11, main_#t~ret12, main_~res~0, main_~x~0;main_~x~0 := main_#t~nondet10;havoc main_#t~nondet10; {38#true} is VALID [2021-09-13 13:14:34,924 INFO L281 TraceCheckUtils]: 0: Hoare triple {38#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(20bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~one_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~tiny_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E-30)); {38#true} is VALID [2021-09-13 13:14:34,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 13:14:34,925 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 13:14:34,926 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541309060] [2021-09-13 13:14:34,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1541309060] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 13:14:34,926 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 13:14:34,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-09-13 13:14:34,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881483210] [2021-09-13 13:14:34,932 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-09-13 13:14:34,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 13:14:34,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 13:14:34,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 13:14:34,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-09-13 13:14:34,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 13:14:35,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-09-13 13:14:35,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 13:14:35,026 INFO L87 Difference]: Start difference. First operand has 35 states, 33 states have (on average 1.606060606060606) internal successors, (53), 34 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 13:14:36,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 13:14:36,054 INFO L93 Difference]: Finished difference Result 67 states and 102 transitions. [2021-09-13 13:14:36,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-09-13 13:14:36,055 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-09-13 13:14:36,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 13:14:36,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 13:14:36,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 102 transitions. [2021-09-13 13:14:36,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 13:14:36,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 102 transitions. [2021-09-13 13:14:36,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 102 transitions. [2021-09-13 13:14:36,534 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 13:14:36,541 INFO L225 Difference]: With dead ends: 67 [2021-09-13 13:14:36,542 INFO L226 Difference]: Without dead ends: 31 [2021-09-13 13:14:36,545 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.15ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 13:14:36,548 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 619.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.21ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 622.18ms IncrementalHoareTripleChecker+Time [2021-09-13 13:14:36,549 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 46 Unknown, 0 Unchecked, 1.21ms Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 622.18ms Time] [2021-09-13 13:14:36,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-09-13 13:14:36,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-09-13 13:14:36,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 13:14:36,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 13:14:36,574 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 13:14:36,575 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 13:14:36,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 13:14:36,578 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2021-09-13 13:14:36,578 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2021-09-13 13:14:36,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 13:14:36,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 13:14:36,579 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 31 states. [2021-09-13 13:14:36,579 INFO L87 Difference]: Start difference. First operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 31 states. [2021-09-13 13:14:36,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 13:14:36,582 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2021-09-13 13:14:36,582 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2021-09-13 13:14:36,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 13:14:36,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 13:14:36,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 13:14:36,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 13:14:36,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 13:14:36,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2021-09-13 13:14:36,586 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 10 [2021-09-13 13:14:36,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 13:14:36,587 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2021-09-13 13:14:36,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 13:14:36,587 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2021-09-13 13:14:36,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-09-13 13:14:36,587 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 13:14:36,588 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 13:14:36,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-09-13 13:14:36,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 13:14:36,801 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 13:14:36,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 13:14:36,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1279985196, now seen corresponding path program 1 times [2021-09-13 13:14:36,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 13:14:36,803 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1757906563] [2021-09-13 13:14:36,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 13:14:36,803 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 13:14:36,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 13:14:36,805 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 13:14:36,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-09-13 13:14:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 13:14:36,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 16 conjunts are in the unsatisfiable core [2021-09-13 13:14:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 13:14:37,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 13:14:47,350 INFO L281 TraceCheckUtils]: 0: Hoare triple {276#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(20bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~one_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~tiny_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E-30)); {281#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2021-09-13 13:14:47,351 INFO L281 TraceCheckUtils]: 1: Hoare triple {281#(= currentRoundingMode roundNearestTiesToEven)} havoc main_#res;havoc main_#t~nondet10, main_#t~ret11, main_#t~ret12, main_~res~0, main_~x~0;main_~x~0 := main_#t~nondet10;havoc main_#t~nondet10; {281#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2021-09-13 13:14:47,351 INFO L281 TraceCheckUtils]: 2: Hoare triple {281#(= currentRoundingMode roundNearestTiesToEven)} assume ~fp.lt~FLOAT(main_~x~0, ~fp.neg~FLOAT(~Pluszero~FLOAT()));__ieee754_sqrtf_#in~x := main_~x~0;havoc __ieee754_sqrtf_#res;havoc __ieee754_sqrtf_#t~mem7, __ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset, __ieee754_sqrtf_#t~post8, __ieee754_sqrtf_#t~mem9, __ieee754_sqrtf_~#sf_u~0.base, __ieee754_sqrtf_~#sf_u~0.offset, __ieee754_sqrtf_~x, __ieee754_sqrtf_~z~0, __ieee754_sqrtf_~r~0, __ieee754_sqrtf_~hx~0, __ieee754_sqrtf_~ix~0, __ieee754_sqrtf_~s~0, __ieee754_sqrtf_~q~0, __ieee754_sqrtf_~m~0, __ieee754_sqrtf_~t~0, __ieee754_sqrtf_~i~0;__ieee754_sqrtf_~x := __ieee754_sqrtf_#in~x;havoc __ieee754_sqrtf_~z~0;havoc __ieee754_sqrtf_~r~0;havoc __ieee754_sqrtf_~hx~0;havoc __ieee754_sqrtf_~ix~0;havoc __ieee754_sqrtf_~s~0;havoc __ieee754_sqrtf_~q~0;havoc __ieee754_sqrtf_~m~0;havoc __ieee754_sqrtf_~t~0;havoc __ieee754_sqrtf_~i~0; {288#(and (fp.lt ULTIMATE.start___ieee754_sqrtf_~x (fp.neg (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2021-09-13 13:14:47,404 INFO L281 TraceCheckUtils]: 3: Hoare triple {288#(and (fp.lt ULTIMATE.start___ieee754_sqrtf_~x (fp.neg (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} call __ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_sqrtf_~x, __ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset, 4bv32);call __ieee754_sqrtf_#t~mem7 := read~intINTTYPE4(__ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset, 4bv32);__ieee754_sqrtf_~ix~0 := __ieee754_sqrtf_#t~mem7;havoc __ieee754_sqrtf_#t~mem7;call ULTIMATE.dealloc(__ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset);havoc __ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset; {292#(and (= ULTIMATE.start___ieee754_sqrtf_~x (fp ((_ extract 31 31) ULTIMATE.start___ieee754_sqrtf_~ix~0) ((_ extract 30 23) ULTIMATE.start___ieee754_sqrtf_~ix~0) ((_ extract 22 0) ULTIMATE.start___ieee754_sqrtf_~ix~0))) (fp.lt ULTIMATE.start___ieee754_sqrtf_~x (fp.neg (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2021-09-13 13:14:47,405 INFO L281 TraceCheckUtils]: 4: Hoare triple {292#(and (= ULTIMATE.start___ieee754_sqrtf_~x (fp ((_ extract 31 31) ULTIMATE.start___ieee754_sqrtf_~ix~0) ((_ extract 30 23) ULTIMATE.start___ieee754_sqrtf_~ix~0) ((_ extract 22 0) ULTIMATE.start___ieee754_sqrtf_~ix~0))) (fp.lt ULTIMATE.start___ieee754_sqrtf_~x (fp.neg (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} goto; {292#(and (= ULTIMATE.start___ieee754_sqrtf_~x (fp ((_ extract 31 31) ULTIMATE.start___ieee754_sqrtf_~ix~0) ((_ extract 30 23) ULTIMATE.start___ieee754_sqrtf_~ix~0) ((_ extract 22 0) ULTIMATE.start___ieee754_sqrtf_~ix~0))) (fp.lt ULTIMATE.start___ieee754_sqrtf_~x (fp.neg (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2021-09-13 13:14:47,407 INFO L281 TraceCheckUtils]: 5: Hoare triple {292#(and (= ULTIMATE.start___ieee754_sqrtf_~x (fp ((_ extract 31 31) ULTIMATE.start___ieee754_sqrtf_~ix~0) ((_ extract 30 23) ULTIMATE.start___ieee754_sqrtf_~ix~0) ((_ extract 22 0) ULTIMATE.start___ieee754_sqrtf_~ix~0))) (fp.lt ULTIMATE.start___ieee754_sqrtf_~x (fp.neg (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} __ieee754_sqrtf_~hx~0 := ~bvand32(2147483647bv32, __ieee754_sqrtf_~ix~0); {299#(and (exists ((ULTIMATE.start___ieee754_sqrtf_~ix~0 (_ BitVec 32))) (and (= ULTIMATE.start___ieee754_sqrtf_~hx~0 (bvand (_ bv2147483647 32) ULTIMATE.start___ieee754_sqrtf_~ix~0)) (= ULTIMATE.start___ieee754_sqrtf_~x (fp ((_ extract 31 31) ULTIMATE.start___ieee754_sqrtf_~ix~0) ((_ extract 30 23) ULTIMATE.start___ieee754_sqrtf_~ix~0) ((_ extract 22 0) ULTIMATE.start___ieee754_sqrtf_~ix~0))))) (fp.lt ULTIMATE.start___ieee754_sqrtf_~x (fp.neg (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2021-09-13 13:14:47,514 INFO L281 TraceCheckUtils]: 6: Hoare triple {299#(and (exists ((ULTIMATE.start___ieee754_sqrtf_~ix~0 (_ BitVec 32))) (and (= ULTIMATE.start___ieee754_sqrtf_~hx~0 (bvand (_ bv2147483647 32) ULTIMATE.start___ieee754_sqrtf_~ix~0)) (= ULTIMATE.start___ieee754_sqrtf_~x (fp ((_ extract 31 31) ULTIMATE.start___ieee754_sqrtf_~ix~0) ((_ extract 30 23) ULTIMATE.start___ieee754_sqrtf_~ix~0) ((_ extract 22 0) ULTIMATE.start___ieee754_sqrtf_~ix~0))))) (fp.lt ULTIMATE.start___ieee754_sqrtf_~x (fp.neg (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} assume !~bvult32(__ieee754_sqrtf_~hx~0, 2139095040bv32);__ieee754_sqrtf_#res := ~fp.add~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, __ieee754_sqrtf_~x, __ieee754_sqrtf_~x), __ieee754_sqrtf_~x); {303#(exists ((ULTIMATE.start___ieee754_sqrtf_~ix~0 (_ BitVec 32))) (and (= (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp ((_ extract 31 31) ULTIMATE.start___ieee754_sqrtf_~ix~0) ((_ extract 30 23) ULTIMATE.start___ieee754_sqrtf_~ix~0) ((_ extract 22 0) ULTIMATE.start___ieee754_sqrtf_~ix~0)) (fp ((_ extract 31 31) ULTIMATE.start___ieee754_sqrtf_~ix~0) ((_ extract 30 23) ULTIMATE.start___ieee754_sqrtf_~ix~0) ((_ extract 22 0) ULTIMATE.start___ieee754_sqrtf_~ix~0))) (fp ((_ extract 31 31) ULTIMATE.start___ieee754_sqrtf_~ix~0) ((_ extract 30 23) ULTIMATE.start___ieee754_sqrtf_~ix~0) ((_ extract 22 0) ULTIMATE.start___ieee754_sqrtf_~ix~0))) |ULTIMATE.start___ieee754_sqrtf_#res|) (fp.lt (fp ((_ extract 31 31) ULTIMATE.start___ieee754_sqrtf_~ix~0) ((_ extract 30 23) ULTIMATE.start___ieee754_sqrtf_~ix~0) ((_ extract 22 0) ULTIMATE.start___ieee754_sqrtf_~ix~0)) (fp.neg (_ +zero 8 24))) (not (bvult (bvand (_ bv2147483647 32) ULTIMATE.start___ieee754_sqrtf_~ix~0) (_ bv2139095040 32)))))} is VALID [2021-09-13 13:14:47,585 INFO L281 TraceCheckUtils]: 7: Hoare triple {303#(exists ((ULTIMATE.start___ieee754_sqrtf_~ix~0 (_ BitVec 32))) (and (= (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp ((_ extract 31 31) ULTIMATE.start___ieee754_sqrtf_~ix~0) ((_ extract 30 23) ULTIMATE.start___ieee754_sqrtf_~ix~0) ((_ extract 22 0) ULTIMATE.start___ieee754_sqrtf_~ix~0)) (fp ((_ extract 31 31) ULTIMATE.start___ieee754_sqrtf_~ix~0) ((_ extract 30 23) ULTIMATE.start___ieee754_sqrtf_~ix~0) ((_ extract 22 0) ULTIMATE.start___ieee754_sqrtf_~ix~0))) (fp ((_ extract 31 31) ULTIMATE.start___ieee754_sqrtf_~ix~0) ((_ extract 30 23) ULTIMATE.start___ieee754_sqrtf_~ix~0) ((_ extract 22 0) ULTIMATE.start___ieee754_sqrtf_~ix~0))) |ULTIMATE.start___ieee754_sqrtf_#res|) (fp.lt (fp ((_ extract 31 31) ULTIMATE.start___ieee754_sqrtf_~ix~0) ((_ extract 30 23) ULTIMATE.start___ieee754_sqrtf_~ix~0) ((_ extract 22 0) ULTIMATE.start___ieee754_sqrtf_~ix~0)) (fp.neg (_ +zero 8 24))) (not (bvult (bvand (_ bv2147483647 32) ULTIMATE.start___ieee754_sqrtf_~ix~0) (_ bv2139095040 32)))))} main_#t~ret11 := __ieee754_sqrtf_#res;main_~res~0 := main_#t~ret11;havoc main_#t~ret11;isnan_float_#in~x := main_~res~0;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if !~fp.eq~FLOAT(isnan_float_~x, isnan_float_~x) then 1bv32 else 0bv32); {307#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)} is VALID [2021-09-13 13:14:47,586 INFO L281 TraceCheckUtils]: 8: Hoare triple {307#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)} main_#t~ret12 := isnan_float_#res; {311#(= |ULTIMATE.start_main_#t~ret12| (_ bv1 32))} is VALID [2021-09-13 13:14:47,587 INFO L281 TraceCheckUtils]: 9: Hoare triple {311#(= |ULTIMATE.start_main_#t~ret12| (_ bv1 32))} assume 0bv32 == main_#t~ret12;havoc main_#t~ret12; {277#false} is VALID [2021-09-13 13:14:47,587 INFO L281 TraceCheckUtils]: 10: Hoare triple {277#false} assume !false; {277#false} is VALID [2021-09-13 13:14:47,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 13:14:47,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 13:15:39,905 INFO L281 TraceCheckUtils]: 10: Hoare triple {277#false} assume !false; {277#false} is VALID [2021-09-13 13:15:39,906 INFO L281 TraceCheckUtils]: 9: Hoare triple {321#(not (= |ULTIMATE.start_main_#t~ret12| (_ bv0 32)))} assume 0bv32 == main_#t~ret12;havoc main_#t~ret12; {277#false} is VALID [2021-09-13 13:15:39,906 INFO L281 TraceCheckUtils]: 8: Hoare triple {325#(not (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|))} main_#t~ret12 := isnan_float_#res; {321#(not (= |ULTIMATE.start_main_#t~ret12| (_ bv0 32)))} is VALID [2021-09-13 13:15:39,907 INFO L281 TraceCheckUtils]: 7: Hoare triple {329#(not (fp.eq |ULTIMATE.start___ieee754_sqrtf_#res| |ULTIMATE.start___ieee754_sqrtf_#res|))} main_#t~ret11 := __ieee754_sqrtf_#res;main_~res~0 := main_#t~ret11;havoc main_#t~ret11;isnan_float_#in~x := main_~res~0;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if !~fp.eq~FLOAT(isnan_float_~x, isnan_float_~x) then 1bv32 else 0bv32); {325#(not (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|))} is VALID [2021-09-13 13:15:39,907 INFO L281 TraceCheckUtils]: 6: Hoare triple {333#(or (bvult ULTIMATE.start___ieee754_sqrtf_~hx~0 (_ bv2139095040 32)) (not (fp.eq (fp.add currentRoundingMode (fp.mul currentRoundingMode ULTIMATE.start___ieee754_sqrtf_~x ULTIMATE.start___ieee754_sqrtf_~x) ULTIMATE.start___ieee754_sqrtf_~x) (fp.add currentRoundingMode (fp.mul currentRoundingMode ULTIMATE.start___ieee754_sqrtf_~x ULTIMATE.start___ieee754_sqrtf_~x) ULTIMATE.start___ieee754_sqrtf_~x))))} assume !~bvult32(__ieee754_sqrtf_~hx~0, 2139095040bv32);__ieee754_sqrtf_#res := ~fp.add~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, __ieee754_sqrtf_~x, __ieee754_sqrtf_~x), __ieee754_sqrtf_~x); {329#(not (fp.eq |ULTIMATE.start___ieee754_sqrtf_#res| |ULTIMATE.start___ieee754_sqrtf_#res|))} is VALID [2021-09-13 13:15:39,965 INFO L281 TraceCheckUtils]: 5: Hoare triple {337#(or (bvult (bvand (_ bv2147483647 32) ULTIMATE.start___ieee754_sqrtf_~ix~0) (_ bv2139095040 32)) (not (fp.eq (fp.add currentRoundingMode (fp.mul currentRoundingMode ULTIMATE.start___ieee754_sqrtf_~x ULTIMATE.start___ieee754_sqrtf_~x) ULTIMATE.start___ieee754_sqrtf_~x) (fp.add currentRoundingMode (fp.mul currentRoundingMode ULTIMATE.start___ieee754_sqrtf_~x ULTIMATE.start___ieee754_sqrtf_~x) ULTIMATE.start___ieee754_sqrtf_~x))))} __ieee754_sqrtf_~hx~0 := ~bvand32(2147483647bv32, __ieee754_sqrtf_~ix~0); {333#(or (bvult ULTIMATE.start___ieee754_sqrtf_~hx~0 (_ bv2139095040 32)) (not (fp.eq (fp.add currentRoundingMode (fp.mul currentRoundingMode ULTIMATE.start___ieee754_sqrtf_~x ULTIMATE.start___ieee754_sqrtf_~x) ULTIMATE.start___ieee754_sqrtf_~x) (fp.add currentRoundingMode (fp.mul currentRoundingMode ULTIMATE.start___ieee754_sqrtf_~x ULTIMATE.start___ieee754_sqrtf_~x) ULTIMATE.start___ieee754_sqrtf_~x))))} is VALID [2021-09-13 13:15:39,967 INFO L281 TraceCheckUtils]: 4: Hoare triple {337#(or (bvult (bvand (_ bv2147483647 32) ULTIMATE.start___ieee754_sqrtf_~ix~0) (_ bv2139095040 32)) (not (fp.eq (fp.add currentRoundingMode (fp.mul currentRoundingMode ULTIMATE.start___ieee754_sqrtf_~x ULTIMATE.start___ieee754_sqrtf_~x) ULTIMATE.start___ieee754_sqrtf_~x) (fp.add currentRoundingMode (fp.mul currentRoundingMode ULTIMATE.start___ieee754_sqrtf_~x ULTIMATE.start___ieee754_sqrtf_~x) ULTIMATE.start___ieee754_sqrtf_~x))))} goto; {337#(or (bvult (bvand (_ bv2147483647 32) ULTIMATE.start___ieee754_sqrtf_~ix~0) (_ bv2139095040 32)) (not (fp.eq (fp.add currentRoundingMode (fp.mul currentRoundingMode ULTIMATE.start___ieee754_sqrtf_~x ULTIMATE.start___ieee754_sqrtf_~x) ULTIMATE.start___ieee754_sqrtf_~x) (fp.add currentRoundingMode (fp.mul currentRoundingMode ULTIMATE.start___ieee754_sqrtf_~x ULTIMATE.start___ieee754_sqrtf_~x) ULTIMATE.start___ieee754_sqrtf_~x))))} is VALID [2021-09-13 13:15:40,011 INFO L281 TraceCheckUtils]: 3: Hoare triple {344#(or (not (fp.eq (fp.add currentRoundingMode (fp.mul currentRoundingMode ULTIMATE.start___ieee754_sqrtf_~x ULTIMATE.start___ieee754_sqrtf_~x) ULTIMATE.start___ieee754_sqrtf_~x) (fp.add currentRoundingMode (fp.mul currentRoundingMode ULTIMATE.start___ieee754_sqrtf_~x ULTIMATE.start___ieee754_sqrtf_~x) ULTIMATE.start___ieee754_sqrtf_~x))) (forall ((v_ULTIMATE.start___ieee754_sqrtf_~ix~0_26 (_ BitVec 32))) (or (bvult (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_sqrtf_~ix~0_26) (_ bv2139095040 32)) (not (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_sqrtf_~ix~0_26) ((_ extract 30 23) v_ULTIMATE.start___ieee754_sqrtf_~ix~0_26) ((_ extract 22 0) v_ULTIMATE.start___ieee754_sqrtf_~ix~0_26)) ULTIMATE.start___ieee754_sqrtf_~x)))))} call __ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_sqrtf_~x, __ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset, 4bv32);call __ieee754_sqrtf_#t~mem7 := read~intINTTYPE4(__ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset, 4bv32);__ieee754_sqrtf_~ix~0 := __ieee754_sqrtf_#t~mem7;havoc __ieee754_sqrtf_#t~mem7;call ULTIMATE.dealloc(__ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset);havoc __ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset; {337#(or (bvult (bvand (_ bv2147483647 32) ULTIMATE.start___ieee754_sqrtf_~ix~0) (_ bv2139095040 32)) (not (fp.eq (fp.add currentRoundingMode (fp.mul currentRoundingMode ULTIMATE.start___ieee754_sqrtf_~x ULTIMATE.start___ieee754_sqrtf_~x) ULTIMATE.start___ieee754_sqrtf_~x) (fp.add currentRoundingMode (fp.mul currentRoundingMode ULTIMATE.start___ieee754_sqrtf_~x ULTIMATE.start___ieee754_sqrtf_~x) ULTIMATE.start___ieee754_sqrtf_~x))))} is VALID [2021-09-13 13:15:40,069 INFO L281 TraceCheckUtils]: 2: Hoare triple {276#true} assume ~fp.lt~FLOAT(main_~x~0, ~fp.neg~FLOAT(~Pluszero~FLOAT()));__ieee754_sqrtf_#in~x := main_~x~0;havoc __ieee754_sqrtf_#res;havoc __ieee754_sqrtf_#t~mem7, __ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset, __ieee754_sqrtf_#t~post8, __ieee754_sqrtf_#t~mem9, __ieee754_sqrtf_~#sf_u~0.base, __ieee754_sqrtf_~#sf_u~0.offset, __ieee754_sqrtf_~x, __ieee754_sqrtf_~z~0, __ieee754_sqrtf_~r~0, __ieee754_sqrtf_~hx~0, __ieee754_sqrtf_~ix~0, __ieee754_sqrtf_~s~0, __ieee754_sqrtf_~q~0, __ieee754_sqrtf_~m~0, __ieee754_sqrtf_~t~0, __ieee754_sqrtf_~i~0;__ieee754_sqrtf_~x := __ieee754_sqrtf_#in~x;havoc __ieee754_sqrtf_~z~0;havoc __ieee754_sqrtf_~r~0;havoc __ieee754_sqrtf_~hx~0;havoc __ieee754_sqrtf_~ix~0;havoc __ieee754_sqrtf_~s~0;havoc __ieee754_sqrtf_~q~0;havoc __ieee754_sqrtf_~m~0;havoc __ieee754_sqrtf_~t~0;havoc __ieee754_sqrtf_~i~0; {344#(or (not (fp.eq (fp.add currentRoundingMode (fp.mul currentRoundingMode ULTIMATE.start___ieee754_sqrtf_~x ULTIMATE.start___ieee754_sqrtf_~x) ULTIMATE.start___ieee754_sqrtf_~x) (fp.add currentRoundingMode (fp.mul currentRoundingMode ULTIMATE.start___ieee754_sqrtf_~x ULTIMATE.start___ieee754_sqrtf_~x) ULTIMATE.start___ieee754_sqrtf_~x))) (forall ((v_ULTIMATE.start___ieee754_sqrtf_~ix~0_26 (_ BitVec 32))) (or (bvult (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_sqrtf_~ix~0_26) (_ bv2139095040 32)) (not (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_sqrtf_~ix~0_26) ((_ extract 30 23) v_ULTIMATE.start___ieee754_sqrtf_~ix~0_26) ((_ extract 22 0) v_ULTIMATE.start___ieee754_sqrtf_~ix~0_26)) ULTIMATE.start___ieee754_sqrtf_~x)))))} is VALID [2021-09-13 13:15:40,069 INFO L281 TraceCheckUtils]: 1: Hoare triple {276#true} havoc main_#res;havoc main_#t~nondet10, main_#t~ret11, main_#t~ret12, main_~res~0, main_~x~0;main_~x~0 := main_#t~nondet10;havoc main_#t~nondet10; {276#true} is VALID [2021-09-13 13:15:40,069 INFO L281 TraceCheckUtils]: 0: Hoare triple {276#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(20bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~one_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~tiny_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E-30)); {276#true} is VALID [2021-09-13 13:15:40,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 13:15:40,070 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 13:15:40,070 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1757906563] [2021-09-13 13:15:40,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1757906563] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 13:15:40,070 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 13:15:40,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2021-09-13 13:15:40,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014199000] [2021-09-13 13:15:40,072 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-09-13 13:15:40,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 13:15:40,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 13:15:40,571 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 13:15:40,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-13 13:15:40,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 13:15:40,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-13 13:15:40,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=167, Unknown=2, NotChecked=0, Total=210 [2021-09-13 13:15:40,573 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 13:15:57,027 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 13:16:01,670 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 13:16:09,057 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 13:16:13,278 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 13:16:18,147 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 13:16:24,826 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 13:16:29,456 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 13:16:31,202 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 13:16:32,577 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 13:16:36,604 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 13:16:42,422 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 13:16:49,630 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 13:16:53,648 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 13:16:56,966 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 13:17:00,205 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 13:17:03,641 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 13:17:22,099 WARN L210 SmtUtils]: Spent 11.77s on a formula simplification that was a NOOP. DAG size: 16 [2021-09-13 13:17:23,969 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 13:17:28,548 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 13:17:30,731 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 13:17:33,467 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 13:17:35,448 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 13:17:37,266 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 13:17:45,160 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 13:17:47,474 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 13:17:53,842 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 13:17:55,873 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 13:18:04,021 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 13:18:04,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-09-13 13:18:04,042 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 74672.17ms TimeCoverageRelationStatistics Valid=70, Invalid=270, Unknown=2, NotChecked=0, Total=342 [2021-09-13 13:18:04,043 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 22 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 75876.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.58ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 75918.20ms IncrementalHoareTripleChecker+Time [2021-09-13 13:18:04,043 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 0 Invalid, 168 Unknown, 0 Unchecked, 4.58ms Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 4 Unknown, 25 Unchecked, 75918.20ms Time] [2021-09-13 13:18:04,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-09-13 13:18:04,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 13:18:04,245 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@7efd7861 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:182) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.checkInternal(MonolithicHoareTripleChecker.java:91) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ReviewedProtectedHtc.reviewInductiveInternal(ChainingHoareTripleChecker.java:318) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ReviewedProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:290) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:863) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:779) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-09-13 13:18:04,248 INFO L158 Benchmark]: Toolchain (without parser) took 210606.56ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 44.8MB in the beginning and 31.4MB in the end (delta: 13.4MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2021-09-13 13:18:04,249 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 65.0MB. Free memory was 46.4MB in the beginning and 46.3MB in the end (delta: 44.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 13:18:04,249 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.23ms. Allocated memory is still 65.0MB. Free memory was 44.6MB in the beginning and 46.5MB in the end (delta: -1.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-09-13 13:18:04,250 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.44ms. Allocated memory is still 65.0MB. Free memory was 46.3MB in the beginning and 44.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 13:18:04,250 INFO L158 Benchmark]: Boogie Preprocessor took 29.91ms. Allocated memory is still 65.0MB. Free memory was 44.2MB in the beginning and 42.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 13:18:04,251 INFO L158 Benchmark]: RCFGBuilder took 364.58ms. Allocated memory is still 65.0MB. Free memory was 42.4MB in the beginning and 29.5MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-09-13 13:18:04,251 INFO L158 Benchmark]: TraceAbstraction took 209870.79ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 29.1MB in the beginning and 31.4MB in the end (delta: -2.3MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2021-09-13 13:18:04,253 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 65.0MB. Free memory was 46.4MB in the beginning and 46.3MB in the end (delta: 44.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.23ms. Allocated memory is still 65.0MB. Free memory was 44.6MB in the beginning and 46.5MB in the end (delta: -1.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.44ms. Allocated memory is still 65.0MB. Free memory was 46.3MB in the beginning and 44.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.91ms. Allocated memory is still 65.0MB. Free memory was 44.2MB in the beginning and 42.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 364.58ms. Allocated memory is still 65.0MB. Free memory was 42.4MB in the beginning and 29.5MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 209870.79ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 29.1MB in the beginning and 31.4MB in the end (delta: -2.3MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@7efd7861 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@7efd7861: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-09-13 13:18:04,477 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-09-13 13:18:04,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...