./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_0730c.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 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_0730c.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 9abd2050bf3fc760379c862e37663c5f55c1439a487d6741471f6573b4b4c89a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:42:38,337 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:42:38,367 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:42:38,406 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:42:38,406 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:42:38,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:42:38,410 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:42:38,412 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:42:38,414 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:42:38,418 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:42:38,418 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:42:38,420 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:42:38,420 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:42:38,422 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:42:38,423 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:42:38,425 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:42:38,426 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:42:38,427 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:42:38,429 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:42:38,433 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:42:38,434 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:42:38,435 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:42:38,436 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:42:38,437 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:42:38,442 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:42:38,442 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:42:38,442 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:42:38,444 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:42:38,444 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:42:38,445 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:42:38,445 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:42:38,446 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:42:38,447 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:42:38,448 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:42:38,448 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:42:38,449 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:42:38,449 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:42:38,450 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:42:38,451 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:42:38,451 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:42:38,452 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:42:38,453 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:42:38,478 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:42:38,479 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:42:38,479 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:42:38,479 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:42:38,480 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:42:38,480 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:42:38,481 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:42:38,481 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:42:38,481 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:42:38,481 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:42:38,482 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:42:38,482 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:42:38,482 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:42:38,482 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:42:38,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:42:38,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:42:38,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:42:38,483 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:42:38,483 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:42:38,483 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:42:38,483 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:42:38,484 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:42:38,484 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:42:38,484 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:42:38,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:42:38,484 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:42:38,484 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:42:38,485 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:42:38,485 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:42:38,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:42:38,486 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:42:38,486 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:42:38,486 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:42:38,486 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 -> 9abd2050bf3fc760379c862e37663c5f55c1439a487d6741471f6573b4b4c89a [2022-02-20 16:42:38,722 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:42:38,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:42:38,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:42:38,759 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:42:38,760 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:42:38,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_0730c.c [2022-02-20 16:42:38,816 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc00d4385/36d74dfc64ef4285a8cfc278bb3b989a/FLAGcc8c74c15 [2022-02-20 16:42:39,110 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:42:39,111 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0730c.c [2022-02-20 16:42:39,128 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc00d4385/36d74dfc64ef4285a8cfc278bb3b989a/FLAGcc8c74c15 [2022-02-20 16:42:39,544 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc00d4385/36d74dfc64ef4285a8cfc278bb3b989a [2022-02-20 16:42:39,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:42:39,548 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:42:39,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:42:39,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:42:39,552 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:42:39,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:42:39" (1/1) ... [2022-02-20 16:42:39,554 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e5d55c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:39, skipping insertion in model container [2022-02-20 16:42:39,554 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:42:39" (1/1) ... [2022-02-20 16:42:39,562 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:42:39,575 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:42:39,727 WARN L230 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_0730c.c[2071,2084] [2022-02-20 16:42:39,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:42:39,739 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:42:39,786 WARN L230 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_0730c.c[2071,2084] [2022-02-20 16:42:39,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:42:39,801 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:42:39,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:39 WrapperNode [2022-02-20 16:42:39,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:42:39,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:42:39,807 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:42:39,808 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:42:39,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:39" (1/1) ... [2022-02-20 16:42:39,827 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:39" (1/1) ... [2022-02-20 16:42:39,865 INFO L137 Inliner]: procedures = 17, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 154 [2022-02-20 16:42:39,866 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:42:39,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:42:39,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:42:39,867 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:42:39,873 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:39" (1/1) ... [2022-02-20 16:42:39,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:39" (1/1) ... [2022-02-20 16:42:39,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:39" (1/1) ... [2022-02-20 16:42:39,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:39" (1/1) ... [2022-02-20 16:42:39,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:39" (1/1) ... [2022-02-20 16:42:39,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:39" (1/1) ... [2022-02-20 16:42:39,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:39" (1/1) ... [2022-02-20 16:42:39,913 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:42:39,914 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:42:39,914 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:42:39,914 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:42:39,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:39" (1/1) ... [2022-02-20 16:42:39,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:42:39,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:42:39,987 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) [2022-02-20 16:42:39,993 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 [2022-02-20 16:42:40,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:42:40,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:42:40,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:42:40,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:42:40,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:42:40,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:42:40,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:42:40,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:42:40,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:42:40,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:42:40,114 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:42:40,115 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:42:40,408 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:42:40,415 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:42:40,416 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-20 16:42:40,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:40 BoogieIcfgContainer [2022-02-20 16:42:40,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:42:40,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:42:40,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:42:40,422 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:42:40,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:42:39" (1/3) ... [2022-02-20 16:42:40,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@709a98ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:42:40, skipping insertion in model container [2022-02-20 16:42:40,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:39" (2/3) ... [2022-02-20 16:42:40,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@709a98ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:42:40, skipping insertion in model container [2022-02-20 16:42:40,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:40" (3/3) ... [2022-02-20 16:42:40,427 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0730c.c [2022-02-20 16:42:40,433 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:42:40,434 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:42:40,476 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:42:40,486 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, mAutomataTypeConcurrency=PETRI_NET, 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 [2022-02-20 16:42:40,486 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:42:40,500 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 42 states have (on average 1.7142857142857142) internal successors, (72), 43 states have internal predecessors, (72), 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) [2022-02-20 16:42:40,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:42:40,504 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:40,504 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:40,505 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:40,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:40,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1826725644, now seen corresponding path program 1 times [2022-02-20 16:42:40,554 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:42:40,555 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598916891] [2022-02-20 16:42:40,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:40,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:42:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:40,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {47#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~one_sqrt~0 := 1.0;~tiny_sqrt~0 := 1.0E-30; {47#true} is VALID [2022-02-20 16:42:40,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {47#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1, main_#t~ret11#1, main_#t~short12#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someUnaryFLOAToperation(0.0);assume { :begin_inline___ieee754_sqrtf } true;__ieee754_sqrtf_#in~x#1 := main_~x~0#1;havoc __ieee754_sqrtf_#res#1;havoc __ieee754_sqrtf_#t~mem4#1, __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, __ieee754_sqrtf_#t~post6#1, __ieee754_sqrtf_#t~mem8#1, __ieee754_sqrtf_~#sf_u~0#1.base, __ieee754_sqrtf_~#sf_u~0#1.offset, __ieee754_sqrtf_~x#1, __ieee754_sqrtf_~z~0#1, __ieee754_sqrtf_~r~0#1, __ieee754_sqrtf_~hx~0#1, __ieee754_sqrtf_~ix~0#1, __ieee754_sqrtf_~s~0#1, __ieee754_sqrtf_~q~0#1, __ieee754_sqrtf_~m~0#1, __ieee754_sqrtf_~t~0#1, __ieee754_sqrtf_~i~0#1, __ieee754_sqrtf_#t~nondet5#1, __ieee754_sqrtf_#t~nondet7#1;__ieee754_sqrtf_~x#1 := __ieee754_sqrtf_#in~x#1;havoc __ieee754_sqrtf_~z~0#1;havoc __ieee754_sqrtf_~r~0#1;havoc __ieee754_sqrtf_~hx~0#1;havoc __ieee754_sqrtf_~ix~0#1;havoc __ieee754_sqrtf_~s~0#1;havoc __ieee754_sqrtf_~q~0#1;havoc __ieee754_sqrtf_~m~0#1;havoc __ieee754_sqrtf_~t~0#1;havoc __ieee754_sqrtf_~i~0#1; {47#true} is VALID [2022-02-20 16:42:40,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {47#true} assume !true; {48#false} is VALID [2022-02-20 16:42:40,677 INFO L290 TraceCheckUtils]: 3: Hoare triple {48#false} assume 0 == __ieee754_sqrtf_~ix~0#1;__ieee754_sqrtf_~hx~0#1 := 0; {48#false} is VALID [2022-02-20 16:42:40,677 INFO L290 TraceCheckUtils]: 4: Hoare triple {48#false} assume !(__ieee754_sqrtf_~hx~0#1 % 4294967296 < 2139095040);__ieee754_sqrtf_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(__ieee754_sqrtf_~x#1, __ieee754_sqrtf_~x#1), __ieee754_sqrtf_~x#1); {48#false} is VALID [2022-02-20 16:42:40,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {48#false} main_#t~ret10#1 := __ieee754_sqrtf_#res#1;assume { :end_inline___ieee754_sqrtf } true;main_~res~0#1 := main_#t~ret10#1;havoc main_#t~ret10#1;main_#t~short12#1 := ~someBinaryFLOATComparisonOperation(main_~res~0#1, ~someUnaryFLOAToperation(0.0)); {48#false} is VALID [2022-02-20 16:42:40,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {48#false} assume !main_#t~short12#1; {48#false} is VALID [2022-02-20 16:42:40,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {48#false} assume !main_#t~short12#1;havoc main_#t~ret11#1;havoc main_#t~short12#1; {48#false} is VALID [2022-02-20 16:42:40,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {48#false} assume !false; {48#false} is VALID [2022-02-20 16:42:40,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:42:40,680 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:42:40,680 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598916891] [2022-02-20 16:42:40,681 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598916891] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:40,681 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:40,681 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:42:40,683 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15628369] [2022-02-20 16:42:40,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:40,686 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-02-20 16:42:40,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:40,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2022-02-20 16:42:40,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:40,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:42:40,708 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:42:40,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:42:40,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:42:40,730 INFO L87 Difference]: Start difference. First operand has 44 states, 42 states have (on average 1.7142857142857142) internal successors, (72), 43 states have internal predecessors, (72), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2022-02-20 16:42:40,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:40,801 INFO L93 Difference]: Finished difference Result 86 states and 142 transitions. [2022-02-20 16:42:40,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:42:40,802 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-02-20 16:42:40,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:40,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2022-02-20 16:42:40,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 142 transitions. [2022-02-20 16:42:40,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2022-02-20 16:42:40,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 142 transitions. [2022-02-20 16:42:40,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 142 transitions. [2022-02-20 16:42:40,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:40,948 INFO L225 Difference]: With dead ends: 86 [2022-02-20 16:42:40,949 INFO L226 Difference]: Without dead ends: 41 [2022-02-20 16:42:40,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:42:40,954 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:42:40,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:42:40,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-02-20 16:42:40,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-02-20 16:42:40,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:40,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 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) [2022-02-20 16:42:40,981 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 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) [2022-02-20 16:42:40,982 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 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) [2022-02-20 16:42:40,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:40,985 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-02-20 16:42:40,985 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2022-02-20 16:42:40,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:40,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:40,989 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 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 41 states. [2022-02-20 16:42:40,990 INFO L87 Difference]: Start difference. First operand has 41 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 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 41 states. [2022-02-20 16:42:40,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:40,994 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-02-20 16:42:40,995 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2022-02-20 16:42:40,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:40,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:40,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:40,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:40,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 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) [2022-02-20 16:42:40,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2022-02-20 16:42:41,000 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 55 transitions. Word has length 9 [2022-02-20 16:42:41,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:41,000 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 55 transitions. [2022-02-20 16:42:41,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2022-02-20 16:42:41,001 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2022-02-20 16:42:41,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:42:41,002 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:41,002 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:41,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:42:41,003 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:41,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:41,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1561625169, now seen corresponding path program 1 times [2022-02-20 16:42:41,007 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:42:41,007 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039903243] [2022-02-20 16:42:41,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:41,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:42:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:41,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {283#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~one_sqrt~0 := 1.0;~tiny_sqrt~0 := 1.0E-30; {283#true} is VALID [2022-02-20 16:42:41,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {283#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1, main_#t~ret11#1, main_#t~short12#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someUnaryFLOAToperation(0.0);assume { :begin_inline___ieee754_sqrtf } true;__ieee754_sqrtf_#in~x#1 := main_~x~0#1;havoc __ieee754_sqrtf_#res#1;havoc __ieee754_sqrtf_#t~mem4#1, __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, __ieee754_sqrtf_#t~post6#1, __ieee754_sqrtf_#t~mem8#1, __ieee754_sqrtf_~#sf_u~0#1.base, __ieee754_sqrtf_~#sf_u~0#1.offset, __ieee754_sqrtf_~x#1, __ieee754_sqrtf_~z~0#1, __ieee754_sqrtf_~r~0#1, __ieee754_sqrtf_~hx~0#1, __ieee754_sqrtf_~ix~0#1, __ieee754_sqrtf_~s~0#1, __ieee754_sqrtf_~q~0#1, __ieee754_sqrtf_~m~0#1, __ieee754_sqrtf_~t~0#1, __ieee754_sqrtf_~i~0#1, __ieee754_sqrtf_#t~nondet5#1, __ieee754_sqrtf_#t~nondet7#1;__ieee754_sqrtf_~x#1 := __ieee754_sqrtf_#in~x#1;havoc __ieee754_sqrtf_~z~0#1;havoc __ieee754_sqrtf_~r~0#1;havoc __ieee754_sqrtf_~hx~0#1;havoc __ieee754_sqrtf_~ix~0#1;havoc __ieee754_sqrtf_~s~0#1;havoc __ieee754_sqrtf_~q~0#1;havoc __ieee754_sqrtf_~m~0#1;havoc __ieee754_sqrtf_~t~0#1;havoc __ieee754_sqrtf_~i~0#1; {283#true} is VALID [2022-02-20 16:42:41,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {283#true} call __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4);call write~real(__ieee754_sqrtf_~x#1, __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, 4);call __ieee754_sqrtf_#t~mem4#1 := read~int(__ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, 4);__ieee754_sqrtf_~ix~0#1 := (if __ieee754_sqrtf_#t~mem4#1 % 4294967296 % 4294967296 <= 2147483647 then __ieee754_sqrtf_#t~mem4#1 % 4294967296 % 4294967296 else __ieee754_sqrtf_#t~mem4#1 % 4294967296 % 4294967296 - 4294967296);havoc __ieee754_sqrtf_#t~mem4#1;call ULTIMATE.dealloc(__ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset);havoc __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset; {283#true} is VALID [2022-02-20 16:42:41,087 INFO L290 TraceCheckUtils]: 3: Hoare triple {283#true} goto; {283#true} is VALID [2022-02-20 16:42:41,088 INFO L290 TraceCheckUtils]: 4: Hoare triple {283#true} assume 0 == __ieee754_sqrtf_~ix~0#1;__ieee754_sqrtf_~hx~0#1 := 0; {285#(= |ULTIMATE.start___ieee754_sqrtf_~hx~0#1| 0)} is VALID [2022-02-20 16:42:41,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {285#(= |ULTIMATE.start___ieee754_sqrtf_~hx~0#1| 0)} assume !(__ieee754_sqrtf_~hx~0#1 % 4294967296 < 2139095040);__ieee754_sqrtf_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(__ieee754_sqrtf_~x#1, __ieee754_sqrtf_~x#1), __ieee754_sqrtf_~x#1); {284#false} is VALID [2022-02-20 16:42:41,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {284#false} main_#t~ret10#1 := __ieee754_sqrtf_#res#1;assume { :end_inline___ieee754_sqrtf } true;main_~res~0#1 := main_#t~ret10#1;havoc main_#t~ret10#1;main_#t~short12#1 := ~someBinaryFLOATComparisonOperation(main_~res~0#1, ~someUnaryFLOAToperation(0.0)); {284#false} is VALID [2022-02-20 16:42:41,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {284#false} assume !main_#t~short12#1; {284#false} is VALID [2022-02-20 16:42:41,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {284#false} assume !main_#t~short12#1;havoc main_#t~ret11#1;havoc main_#t~short12#1; {284#false} is VALID [2022-02-20 16:42:41,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {284#false} assume !false; {284#false} is VALID [2022-02-20 16:42:41,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:42:41,090 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:42:41,090 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039903243] [2022-02-20 16:42:41,090 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039903243] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:41,091 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:41,091 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:42:41,091 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985933075] [2022-02-20 16:42:41,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:41,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 [2022-02-20 16:42:41,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:41,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2022-02-20 16:42:41,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:41,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:42:41,103 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:42:41,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:42:41,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:42:41,105 INFO L87 Difference]: Start difference. First operand 41 states and 55 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2022-02-20 16:42:41,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:41,176 INFO L93 Difference]: Finished difference Result 83 states and 109 transitions. [2022-02-20 16:42:41,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:42:41,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 [2022-02-20 16:42:41,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:41,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2022-02-20 16:42:41,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2022-02-20 16:42:41,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2022-02-20 16:42:41,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2022-02-20 16:42:41,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 109 transitions. [2022-02-20 16:42:41,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:41,278 INFO L225 Difference]: With dead ends: 83 [2022-02-20 16:42:41,278 INFO L226 Difference]: Without dead ends: 52 [2022-02-20 16:42:41,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:42:41,280 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 11 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:42:41,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 98 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:42:41,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-02-20 16:42:41,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2022-02-20 16:42:41,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:41,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 43 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 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) [2022-02-20 16:42:41,288 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 43 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 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) [2022-02-20 16:42:41,288 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 43 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 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) [2022-02-20 16:42:41,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:41,290 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-02-20 16:42:41,290 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-02-20 16:42:41,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:41,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:41,291 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 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 52 states. [2022-02-20 16:42:41,291 INFO L87 Difference]: Start difference. First operand has 43 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 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 52 states. [2022-02-20 16:42:41,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:41,295 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-02-20 16:42:41,295 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-02-20 16:42:41,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:41,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:41,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:41,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:41,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 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) [2022-02-20 16:42:41,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2022-02-20 16:42:41,298 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 10 [2022-02-20 16:42:41,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:41,299 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2022-02-20 16:42:41,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2022-02-20 16:42:41,300 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2022-02-20 16:42:41,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:42:41,300 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:41,301 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:41,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:42:41,301 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:41,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:41,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1121734978, now seen corresponding path program 1 times [2022-02-20 16:42:41,302 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:42:41,303 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299992493] [2022-02-20 16:42:41,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:41,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:42:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:42:41,328 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:42:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:42:41,354 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:42:41,355 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:42:41,355 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:42:41,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:42:41,358 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:42:41,360 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:42:41,381 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:42:41,381 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:42:41,381 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-02-20 16:42:41,381 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-02-20 16:42:41,381 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:42:41,381 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:42:41,382 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-02-20 16:42:41,382 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-02-20 16:42:41,382 WARN L170 areAnnotationChecker]: L26-7 has no Hoare annotation [2022-02-20 16:42:41,382 WARN L170 areAnnotationChecker]: L26-7 has no Hoare annotation [2022-02-20 16:42:41,382 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-20 16:42:41,382 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-20 16:42:41,382 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:42:41,382 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 16:42:41,382 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 16:42:41,383 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2022-02-20 16:42:41,383 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2022-02-20 16:42:41,383 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2022-02-20 16:42:41,383 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2022-02-20 16:42:41,383 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 16:42:41,383 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 16:42:41,383 WARN L170 areAnnotationChecker]: L26-5 has no Hoare annotation [2022-02-20 16:42:41,383 WARN L170 areAnnotationChecker]: L26-5 has no Hoare annotation [2022-02-20 16:42:41,384 WARN L170 areAnnotationChecker]: L86-2 has no Hoare annotation [2022-02-20 16:42:41,384 WARN L170 areAnnotationChecker]: L86-2 has no Hoare annotation [2022-02-20 16:42:41,384 WARN L170 areAnnotationChecker]: L107-2 has no Hoare annotation [2022-02-20 16:42:41,384 WARN L170 areAnnotationChecker]: L107-2 has no Hoare annotation [2022-02-20 16:42:41,384 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 16:42:41,384 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 16:42:41,385 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-02-20 16:42:41,392 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-02-20 16:42:41,392 WARN L170 areAnnotationChecker]: L86-3 has no Hoare annotation [2022-02-20 16:42:41,392 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2022-02-20 16:42:41,392 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2022-02-20 16:42:41,392 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2022-02-20 16:42:41,392 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2022-02-20 16:42:41,392 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2022-02-20 16:42:41,392 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2022-02-20 16:42:41,393 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2022-02-20 16:42:41,393 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2022-02-20 16:42:41,396 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:42:41,397 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2022-02-20 16:42:41,397 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-02-20 16:42:41,397 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:42:41,397 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:42:41,397 WARN L170 areAnnotationChecker]: L43-8 has no Hoare annotation [2022-02-20 16:42:41,397 WARN L170 areAnnotationChecker]: L43-8 has no Hoare annotation [2022-02-20 16:42:41,397 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:42:41,397 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:42:41,397 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2022-02-20 16:42:41,398 WARN L170 areAnnotationChecker]: L43-4 has no Hoare annotation [2022-02-20 16:42:41,398 WARN L170 areAnnotationChecker]: L43-4 has no Hoare annotation [2022-02-20 16:42:41,398 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 16:42:41,398 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 16:42:41,398 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 16:42:41,398 WARN L170 areAnnotationChecker]: L43-6 has no Hoare annotation [2022-02-20 16:42:41,398 WARN L170 areAnnotationChecker]: L43-6 has no Hoare annotation [2022-02-20 16:42:41,398 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2022-02-20 16:42:41,399 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2022-02-20 16:42:41,399 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:42:41,399 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:42:41,399 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-02-20 16:42:41,399 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-02-20 16:42:41,399 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-02-20 16:42:41,400 WARN L170 areAnnotationChecker]: L54-2 has no Hoare annotation [2022-02-20 16:42:41,400 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-02-20 16:42:41,400 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-02-20 16:42:41,400 WARN L170 areAnnotationChecker]: L75-2 has no Hoare annotation [2022-02-20 16:42:41,400 WARN L170 areAnnotationChecker]: L75-2 has no Hoare annotation [2022-02-20 16:42:41,400 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2022-02-20 16:42:41,401 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2022-02-20 16:42:41,401 WARN L170 areAnnotationChecker]: L75-3 has no Hoare annotation [2022-02-20 16:42:41,401 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. [2022-02-20 16:42:41,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:42:41 BoogieIcfgContainer [2022-02-20 16:42:41,402 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:42:41,403 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:42:41,403 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:42:41,403 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:42:41,403 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:40" (3/4) ... [2022-02-20 16:42:41,405 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:42:41,406 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:42:41,406 INFO L158 Benchmark]: Toolchain (without parser) took 1858.42ms. Allocated memory was 81.8MB in the beginning and 111.1MB in the end (delta: 29.4MB). Free memory was 48.0MB in the beginning and 65.1MB in the end (delta: -17.0MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2022-02-20 16:42:41,407 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 81.8MB. Free memory was 54.5MB in the beginning and 54.5MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:42:41,407 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.46ms. Allocated memory was 81.8MB in the beginning and 111.1MB in the end (delta: 29.4MB). Free memory was 47.8MB in the beginning and 85.6MB in the end (delta: -37.8MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2022-02-20 16:42:41,415 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.30ms. Allocated memory is still 111.1MB. Free memory was 85.6MB in the beginning and 83.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:42:41,417 INFO L158 Benchmark]: Boogie Preprocessor took 46.03ms. Allocated memory is still 111.1MB. Free memory was 83.2MB in the beginning and 81.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:42:41,418 INFO L158 Benchmark]: RCFGBuilder took 504.27ms. Allocated memory is still 111.1MB. Free memory was 81.5MB in the beginning and 63.9MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-02-20 16:42:41,418 INFO L158 Benchmark]: TraceAbstraction took 982.90ms. Allocated memory is still 111.1MB. Free memory was 63.5MB in the beginning and 65.6MB in the end (delta: -2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:42:41,419 INFO L158 Benchmark]: Witness Printer took 2.91ms. Allocated memory is still 111.1MB. Free memory was 65.6MB in the beginning and 65.1MB in the end (delta: 559.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:42:41,421 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.15ms. Allocated memory is still 81.8MB. Free memory was 54.5MB in the beginning and 54.5MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.46ms. Allocated memory was 81.8MB in the beginning and 111.1MB in the end (delta: 29.4MB). Free memory was 47.8MB in the beginning and 85.6MB in the end (delta: -37.8MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.30ms. Allocated memory is still 111.1MB. Free memory was 85.6MB in the beginning and 83.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.03ms. Allocated memory is still 111.1MB. Free memory was 83.2MB in the beginning and 81.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 504.27ms. Allocated memory is still 111.1MB. Free memory was 81.5MB in the beginning and 63.9MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 982.90ms. Allocated memory is still 111.1MB. Free memory was 63.5MB in the beginning and 65.6MB in the end (delta: -2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.91ms. Allocated memory is still 111.1MB. Free memory was 65.6MB in the beginning and 65.1MB in the end (delta: 559.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 108]: 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 107, overapproximation of someUnaryFLOAToperation at line 103. Possible FailurePath: [L14] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L103] float x = -0.0f; [L104] CALL, EXPR __ieee754_sqrtf(x) [L17] float z; [L18] __uint32_t r, hx; [L19] __int32_t ix, s, q, m, t, i; VAL [\old(x)=4294967297, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967297] [L22] ieee_float_shape_type gf_u; [L23] gf_u.value = (x) [L24] EXPR gf_u.word [L24] (ix) = gf_u.word [L26] hx = ix & 0x7fffffff VAL [\old(x)=4294967297, hx=0, ix=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967297] [L28] COND FALSE !(!((hx) < 0x7f800000L)) VAL [\old(x)=4294967297, hx=0, ix=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967297] [L31] COND TRUE ((hx) == 0) [L32] return x; VAL [\old(x)=4294967297, \result=4294967297, hx=0, ix=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967297] [L104] RET, EXPR __ieee754_sqrtf(x) [L104] float res = __ieee754_sqrtf(x); [L107] EXPR res == -0.0f && __signbit_float(res) == 1 VAL [one_sqrt=1, res=4294967297, res == -0.0f && __signbit_float(res) == 1=0, tiny_sqrt=1/1000000000000000000000000000000, x=4294967297] [L107] COND TRUE !(res == -0.0f && __signbit_float(res) == 1) [L108] reach_error() VAL [one_sqrt=1, res=4294967297, tiny_sqrt=1/1000000000000000000000000000000, x=4294967297] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 156 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 111 mSDtfsCounter, 11 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 19 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 [2022-02-20 16:42:41,451 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_0730c.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 9abd2050bf3fc760379c862e37663c5f55c1439a487d6741471f6573b4b4c89a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:42:43,111 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:42:43,114 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:42:43,157 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:42:43,157 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:42:43,159 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:42:43,161 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:42:43,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:42:43,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:42:43,170 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:42:43,171 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:42:43,174 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:42:43,175 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:42:43,176 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:42:43,177 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:42:43,180 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:42:43,180 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:42:43,181 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:42:43,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:42:43,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:42:43,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:42:43,189 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:42:43,190 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:42:43,191 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:42:43,195 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:42:43,196 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:42:43,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:42:43,197 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:42:43,198 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:42:43,198 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:42:43,199 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:42:43,199 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:42:43,200 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:42:43,201 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:42:43,202 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:42:43,202 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:42:43,203 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:42:43,203 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:42:43,203 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:42:43,204 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:42:43,205 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:42:43,205 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:42:43,234 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:42:43,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:42:43,235 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:42:43,236 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:42:43,236 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:42:43,237 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:42:43,237 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:42:43,238 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:42:43,238 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:42:43,238 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:42:43,239 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:42:43,239 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:42:43,239 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:42:43,239 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:42:43,239 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:42:43,239 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:42:43,240 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:42:43,240 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:42:43,240 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:42:43,240 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:42:43,240 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:42:43,240 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:42:43,240 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:42:43,241 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:42:43,241 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:42:43,241 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:42:43,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:42:43,241 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:42:43,241 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:42:43,241 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:42:43,242 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:42:43,242 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:42:43,242 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:42:43,242 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:42:43,242 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:42:43,242 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:42:43,243 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 -> 9abd2050bf3fc760379c862e37663c5f55c1439a487d6741471f6573b4b4c89a [2022-02-20 16:42:43,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:42:43,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:42:43,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:42:43,560 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:42:43,561 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:42:43,562 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0730c.c [2022-02-20 16:42:43,604 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24ddd58cb/38cc47c481444b5d8921b787c588b254/FLAGa2a15d9f6 [2022-02-20 16:42:43,942 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:42:43,942 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0730c.c [2022-02-20 16:42:43,947 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24ddd58cb/38cc47c481444b5d8921b787c588b254/FLAGa2a15d9f6 [2022-02-20 16:42:44,342 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24ddd58cb/38cc47c481444b5d8921b787c588b254 [2022-02-20 16:42:44,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:42:44,348 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:42:44,351 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:42:44,351 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:42:44,354 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:42:44,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:42:44" (1/1) ... [2022-02-20 16:42:44,357 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba96e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:44, skipping insertion in model container [2022-02-20 16:42:44,357 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:42:44" (1/1) ... [2022-02-20 16:42:44,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:42:44,375 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:42:44,480 WARN L230 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_0730c.c[2071,2084] [2022-02-20 16:42:44,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:42:44,508 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:42:44,574 WARN L230 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_0730c.c[2071,2084] [2022-02-20 16:42:44,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:42:44,592 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:42:44,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:44 WrapperNode [2022-02-20 16:42:44,592 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:42:44,593 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:42:44,593 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:42:44,594 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:42:44,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:44" (1/1) ... [2022-02-20 16:42:44,607 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:44" (1/1) ... [2022-02-20 16:42:44,644 INFO L137 Inliner]: procedures = 20, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 131 [2022-02-20 16:42:44,646 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:42:44,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:42:44,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:42:44,647 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:42:44,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:44" (1/1) ... [2022-02-20 16:42:44,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:44" (1/1) ... [2022-02-20 16:42:44,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:44" (1/1) ... [2022-02-20 16:42:44,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:44" (1/1) ... [2022-02-20 16:42:44,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:44" (1/1) ... [2022-02-20 16:42:44,688 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:44" (1/1) ... [2022-02-20 16:42:44,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:44" (1/1) ... [2022-02-20 16:42:44,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:42:44,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:42:44,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:42:44,702 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:42:44,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:44" (1/1) ... [2022-02-20 16:42:44,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:42:44,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:42:44,736 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) [2022-02-20 16:42:44,752 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 [2022-02-20 16:42:44,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:42:44,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:42:44,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:42:44,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:42:44,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:42:44,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:42:44,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:42:44,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:42:44,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:42:44,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:42:44,856 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:42:44,857 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:42:45,783 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:42:45,788 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:42:45,789 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-20 16:42:45,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:45 BoogieIcfgContainer [2022-02-20 16:42:45,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:42:45,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:42:45,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:42:45,794 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:42:45,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:42:44" (1/3) ... [2022-02-20 16:42:45,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601434a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:42:45, skipping insertion in model container [2022-02-20 16:42:45,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:44" (2/3) ... [2022-02-20 16:42:45,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601434a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:42:45, skipping insertion in model container [2022-02-20 16:42:45,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:45" (3/3) ... [2022-02-20 16:42:45,797 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0730c.c [2022-02-20 16:42:45,801 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:42:45,801 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:42:45,848 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:42:45,853 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, mAutomataTypeConcurrency=PETRI_NET, 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 [2022-02-20 16:42:45,854 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:42:45,865 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 36 states have internal predecessors, (57), 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) [2022-02-20 16:42:45,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:42:45,868 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:45,869 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:45,869 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:45,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:45,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1903716510, now seen corresponding path program 1 times [2022-02-20 16:42:45,883 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:42:45,884 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973591183] [2022-02-20 16:42:45,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:45,885 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:42:45,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:42:45,888 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) [2022-02-20 16:42:45,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:42:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:46,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:42:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:46,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:42:46,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~tiny_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E-30)); {40#true} is VALID [2022-02-20 16:42:46,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_#t~ret9#1, main_#t~short10#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());assume { :begin_inline___ieee754_sqrtf } true;__ieee754_sqrtf_#in~x#1 := main_~x~0#1;havoc __ieee754_sqrtf_#res#1;havoc __ieee754_sqrtf_#t~mem4#1, __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, __ieee754_sqrtf_#t~post5#1, __ieee754_sqrtf_#t~mem6#1, __ieee754_sqrtf_~#sf_u~0#1.base, __ieee754_sqrtf_~#sf_u~0#1.offset, __ieee754_sqrtf_~x#1, __ieee754_sqrtf_~z~0#1, __ieee754_sqrtf_~r~0#1, __ieee754_sqrtf_~hx~0#1, __ieee754_sqrtf_~ix~0#1, __ieee754_sqrtf_~s~0#1, __ieee754_sqrtf_~q~0#1, __ieee754_sqrtf_~m~0#1, __ieee754_sqrtf_~t~0#1, __ieee754_sqrtf_~i~0#1;__ieee754_sqrtf_~x#1 := __ieee754_sqrtf_#in~x#1;havoc __ieee754_sqrtf_~z~0#1;havoc __ieee754_sqrtf_~r~0#1;havoc __ieee754_sqrtf_~hx~0#1;havoc __ieee754_sqrtf_~ix~0#1;havoc __ieee754_sqrtf_~s~0#1;havoc __ieee754_sqrtf_~q~0#1;havoc __ieee754_sqrtf_~m~0#1;havoc __ieee754_sqrtf_~t~0#1;havoc __ieee754_sqrtf_~i~0#1; {40#true} is VALID [2022-02-20 16:42:46,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume !true; {41#false} is VALID [2022-02-20 16:42:46,096 INFO L290 TraceCheckUtils]: 3: Hoare triple {41#false} __ieee754_sqrtf_~hx~0#1 := ~bvand32(2147483647bv32, __ieee754_sqrtf_~ix~0#1); {41#false} is VALID [2022-02-20 16:42:46,096 INFO L290 TraceCheckUtils]: 4: Hoare triple {41#false} assume !~bvult32(__ieee754_sqrtf_~hx~0#1, 2139095040bv32);__ieee754_sqrtf_#res#1 := ~fp.add~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, __ieee754_sqrtf_~x#1, __ieee754_sqrtf_~x#1), __ieee754_sqrtf_~x#1); {41#false} is VALID [2022-02-20 16:42:46,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#false} main_#t~ret8#1 := __ieee754_sqrtf_#res#1;assume { :end_inline___ieee754_sqrtf } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;main_#t~short10#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {41#false} is VALID [2022-02-20 16:42:46,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {41#false} assume !main_#t~short10#1; {41#false} is VALID [2022-02-20 16:42:46,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#false} assume !main_#t~short10#1;havoc main_#t~ret9#1;havoc main_#t~short10#1; {41#false} is VALID [2022-02-20 16:42:46,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-02-20 16:42:46,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:42:46,099 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:42:46,099 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:42:46,099 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1973591183] [2022-02-20 16:42:46,100 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1973591183] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:46,100 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:46,100 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:42:46,102 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329363795] [2022-02-20 16:42:46,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:46,107 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-02-20 16:42:46,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:46,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2022-02-20 16:42:46,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:46,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:42:46,164 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:42:46,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:42:46,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:42:46,186 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 36 states have internal predecessors, (57), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2022-02-20 16:42:46,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:46,587 INFO L93 Difference]: Finished difference Result 72 states and 112 transitions. [2022-02-20 16:42:46,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:42:46,588 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-02-20 16:42:46,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:46,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2022-02-20 16:42:46,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2022-02-20 16:42:46,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2022-02-20 16:42:46,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2022-02-20 16:42:46,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 112 transitions. [2022-02-20 16:42:47,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:47,065 INFO L225 Difference]: With dead ends: 72 [2022-02-20 16:42:47,065 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 16:42:47,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:42:47,069 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:42:47,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:42:47,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 16:42:47,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-02-20 16:42:47,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:47,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 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) [2022-02-20 16:42:47,089 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 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) [2022-02-20 16:42:47,090 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 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) [2022-02-20 16:42:47,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:47,092 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-02-20 16:42:47,092 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-02-20 16:42:47,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:47,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:47,093 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 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 34 states. [2022-02-20 16:42:47,093 INFO L87 Difference]: Start difference. First operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 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 34 states. [2022-02-20 16:42:47,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:47,095 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-02-20 16:42:47,095 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-02-20 16:42:47,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:47,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:47,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:47,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:47,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 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) [2022-02-20 16:42:47,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-02-20 16:42:47,099 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 9 [2022-02-20 16:42:47,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:47,099 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-02-20 16:42:47,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2022-02-20 16:42:47,099 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-02-20 16:42:47,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:42:47,100 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:47,100 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:47,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:42:47,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:42:47,316 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:47,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:47,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1484634303, now seen corresponding path program 1 times [2022-02-20 16:42:47,317 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:42:47,317 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092571375] [2022-02-20 16:42:47,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:47,317 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:42:47,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:42:47,332 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) [2022-02-20 16:42:47,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:42:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:47,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:42:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:47,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:42:47,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {265#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~tiny_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E-30)); {265#true} is VALID [2022-02-20 16:42:47,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {265#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_#t~ret9#1, main_#t~short10#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());assume { :begin_inline___ieee754_sqrtf } true;__ieee754_sqrtf_#in~x#1 := main_~x~0#1;havoc __ieee754_sqrtf_#res#1;havoc __ieee754_sqrtf_#t~mem4#1, __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, __ieee754_sqrtf_#t~post5#1, __ieee754_sqrtf_#t~mem6#1, __ieee754_sqrtf_~#sf_u~0#1.base, __ieee754_sqrtf_~#sf_u~0#1.offset, __ieee754_sqrtf_~x#1, __ieee754_sqrtf_~z~0#1, __ieee754_sqrtf_~r~0#1, __ieee754_sqrtf_~hx~0#1, __ieee754_sqrtf_~ix~0#1, __ieee754_sqrtf_~s~0#1, __ieee754_sqrtf_~q~0#1, __ieee754_sqrtf_~m~0#1, __ieee754_sqrtf_~t~0#1, __ieee754_sqrtf_~i~0#1;__ieee754_sqrtf_~x#1 := __ieee754_sqrtf_#in~x#1;havoc __ieee754_sqrtf_~z~0#1;havoc __ieee754_sqrtf_~r~0#1;havoc __ieee754_sqrtf_~hx~0#1;havoc __ieee754_sqrtf_~ix~0#1;havoc __ieee754_sqrtf_~s~0#1;havoc __ieee754_sqrtf_~q~0#1;havoc __ieee754_sqrtf_~m~0#1;havoc __ieee754_sqrtf_~t~0#1;havoc __ieee754_sqrtf_~i~0#1; {273#(= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:42:47,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {273#(= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24)))} call __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_sqrtf_~x#1, __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, 4bv32);call __ieee754_sqrtf_#t~mem4#1 := read~intINTTYPE4(__ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, 4bv32);__ieee754_sqrtf_~ix~0#1 := __ieee754_sqrtf_#t~mem4#1;havoc __ieee754_sqrtf_#t~mem4#1;call ULTIMATE.dealloc(__ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset);havoc __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset; {277#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|)))} is VALID [2022-02-20 16:42:47,595 INFO L290 TraceCheckUtils]: 3: Hoare triple {277#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|)))} goto; {277#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|)))} is VALID [2022-02-20 16:42:47,596 INFO L290 TraceCheckUtils]: 4: Hoare triple {277#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|)))} __ieee754_sqrtf_~hx~0#1 := ~bvand32(2147483647bv32, __ieee754_sqrtf_~ix~0#1); {284#(exists ((|ULTIMATE.start___ieee754_sqrtf_~ix~0#1| (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) |ULTIMATE.start___ieee754_sqrtf_~hx~0#1|) (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|)))))} is VALID [2022-02-20 16:42:47,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {284#(exists ((|ULTIMATE.start___ieee754_sqrtf_~ix~0#1| (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) |ULTIMATE.start___ieee754_sqrtf_~hx~0#1|) (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|)))))} assume !~bvult32(__ieee754_sqrtf_~hx~0#1, 2139095040bv32);__ieee754_sqrtf_#res#1 := ~fp.add~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, __ieee754_sqrtf_~x#1, __ieee754_sqrtf_~x#1), __ieee754_sqrtf_~x#1); {266#false} is VALID [2022-02-20 16:42:47,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {266#false} main_#t~ret8#1 := __ieee754_sqrtf_#res#1;assume { :end_inline___ieee754_sqrtf } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;main_#t~short10#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {266#false} is VALID [2022-02-20 16:42:47,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {266#false} assume !main_#t~short10#1; {266#false} is VALID [2022-02-20 16:42:47,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {266#false} assume !main_#t~short10#1;havoc main_#t~ret9#1;havoc main_#t~short10#1; {266#false} is VALID [2022-02-20 16:42:47,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {266#false} assume !false; {266#false} is VALID [2022-02-20 16:42:47,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:42:47,633 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:42:47,633 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:42:47,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092571375] [2022-02-20 16:42:47,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2092571375] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:47,633 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:47,633 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:42:47,634 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964184549] [2022-02-20 16:42:47,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:47,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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 [2022-02-20 16:42:47,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:47,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) [2022-02-20 16:42:47,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:47,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:42:47,688 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:42:47,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:42:47,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:42:47,689 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) [2022-02-20 16:42:49,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:49,506 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-02-20 16:42:49,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:42:49,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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 [2022-02-20 16:42:49,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:49,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) [2022-02-20 16:42:49,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-02-20 16:42:49,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) [2022-02-20 16:42:49,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-02-20 16:42:49,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2022-02-20 16:42:49,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:49,729 INFO L225 Difference]: With dead ends: 43 [2022-02-20 16:42:49,729 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 16:42:49,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:42:49,730 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 4 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 16:42:49,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 139 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 7 Unchecked, 0.3s Time] [2022-02-20 16:42:49,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 16:42:49,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-02-20 16:42:49,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:49,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 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) [2022-02-20 16:42:49,735 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 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) [2022-02-20 16:42:49,735 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 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) [2022-02-20 16:42:49,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:49,737 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-02-20 16:42:49,737 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-02-20 16:42:49,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:49,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:49,737 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 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 34 states. [2022-02-20 16:42:49,738 INFO L87 Difference]: Start difference. First operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 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 34 states. [2022-02-20 16:42:49,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:49,739 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-02-20 16:42:49,739 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-02-20 16:42:49,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:49,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:49,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:49,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:49,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 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) [2022-02-20 16:42:49,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2022-02-20 16:42:49,747 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 10 [2022-02-20 16:42:49,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:49,747 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2022-02-20 16:42:49,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) [2022-02-20 16:42:49,747 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-02-20 16:42:49,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:42:49,748 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:49,748 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:49,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 16:42:49,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:42:49,958 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:49,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:49,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1245587968, now seen corresponding path program 1 times [2022-02-20 16:42:49,959 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:42:49,959 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071339939] [2022-02-20 16:42:49,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:49,959 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:42:49,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:42:49,961 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:42:49,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:42:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:50,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 16:42:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:50,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:42:50,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {465#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~tiny_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E-30)); {465#true} is VALID [2022-02-20 16:42:50,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {465#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_#t~ret9#1, main_#t~short10#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());assume { :begin_inline___ieee754_sqrtf } true;__ieee754_sqrtf_#in~x#1 := main_~x~0#1;havoc __ieee754_sqrtf_#res#1;havoc __ieee754_sqrtf_#t~mem4#1, __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, __ieee754_sqrtf_#t~post5#1, __ieee754_sqrtf_#t~mem6#1, __ieee754_sqrtf_~#sf_u~0#1.base, __ieee754_sqrtf_~#sf_u~0#1.offset, __ieee754_sqrtf_~x#1, __ieee754_sqrtf_~z~0#1, __ieee754_sqrtf_~r~0#1, __ieee754_sqrtf_~hx~0#1, __ieee754_sqrtf_~ix~0#1, __ieee754_sqrtf_~s~0#1, __ieee754_sqrtf_~q~0#1, __ieee754_sqrtf_~m~0#1, __ieee754_sqrtf_~t~0#1, __ieee754_sqrtf_~i~0#1;__ieee754_sqrtf_~x#1 := __ieee754_sqrtf_#in~x#1;havoc __ieee754_sqrtf_~z~0#1;havoc __ieee754_sqrtf_~r~0#1;havoc __ieee754_sqrtf_~hx~0#1;havoc __ieee754_sqrtf_~ix~0#1;havoc __ieee754_sqrtf_~s~0#1;havoc __ieee754_sqrtf_~q~0#1;havoc __ieee754_sqrtf_~m~0#1;havoc __ieee754_sqrtf_~t~0#1;havoc __ieee754_sqrtf_~i~0#1; {473#(= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:42:50,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {473#(= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24)))} call __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_sqrtf_~x#1, __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, 4bv32);call __ieee754_sqrtf_#t~mem4#1 := read~intINTTYPE4(__ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, 4bv32);__ieee754_sqrtf_~ix~0#1 := __ieee754_sqrtf_#t~mem4#1;havoc __ieee754_sqrtf_#t~mem4#1;call ULTIMATE.dealloc(__ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset);havoc __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset; {473#(= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:42:50,151 INFO L290 TraceCheckUtils]: 3: Hoare triple {473#(= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24)))} goto; {473#(= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:42:50,152 INFO L290 TraceCheckUtils]: 4: Hoare triple {473#(= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24)))} __ieee754_sqrtf_~hx~0#1 := ~bvand32(2147483647bv32, __ieee754_sqrtf_~ix~0#1); {473#(= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:42:50,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {473#(= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24)))} assume !!~bvult32(__ieee754_sqrtf_~hx~0#1, 2139095040bv32); {473#(= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:42:50,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {473#(= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24)))} assume 0bv32 == __ieee754_sqrtf_~hx~0#1;__ieee754_sqrtf_#res#1 := __ieee754_sqrtf_~x#1; {489#(= |ULTIMATE.start___ieee754_sqrtf_#res#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:42:50,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {489#(= |ULTIMATE.start___ieee754_sqrtf_#res#1| (fp.neg (_ +zero 8 24)))} main_#t~ret8#1 := __ieee754_sqrtf_#res#1;assume { :end_inline___ieee754_sqrtf } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;main_#t~short10#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {493#|ULTIMATE.start_main_#t~short10#1|} is VALID [2022-02-20 16:42:50,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {493#|ULTIMATE.start_main_#t~short10#1|} assume !main_#t~short10#1; {466#false} is VALID [2022-02-20 16:42:50,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {466#false} assume !main_#t~short10#1;havoc main_#t~ret9#1;havoc main_#t~short10#1; {466#false} is VALID [2022-02-20 16:42:50,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {466#false} assume !false; {466#false} is VALID [2022-02-20 16:42:50,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:42:50,154 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:42:50,154 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:42:50,154 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071339939] [2022-02-20 16:42:50,154 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071339939] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:50,154 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:50,154 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:42:50,154 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587841999] [2022-02-20 16:42:50,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:50,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 [2022-02-20 16:42:50,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:50,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2022-02-20 16:42:50,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:50,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:42:50,168 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:42:50,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:42:50,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:42:50,169 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2022-02-20 16:42:51,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:51,162 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-02-20 16:42:51,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:42:51,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 [2022-02-20 16:42:51,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:51,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2022-02-20 16:42:51,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-02-20 16:42:51,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2022-02-20 16:42:51,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-02-20 16:42:51,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2022-02-20 16:42:51,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:51,363 INFO L225 Difference]: With dead ends: 46 [2022-02-20 16:42:51,363 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 16:42:51,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:42:51,364 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 59 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 16:42:51,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 113 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 16:42:51,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 16:42:51,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2022-02-20 16:42:51,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:51,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 36 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 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) [2022-02-20 16:42:51,368 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 36 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 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) [2022-02-20 16:42:51,368 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 36 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 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) [2022-02-20 16:42:51,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:51,369 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-02-20 16:42:51,370 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2022-02-20 16:42:51,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:51,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:51,370 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 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 43 states. [2022-02-20 16:42:51,370 INFO L87 Difference]: Start difference. First operand has 36 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 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 43 states. [2022-02-20 16:42:51,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:51,372 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-02-20 16:42:51,372 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2022-02-20 16:42:51,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:51,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:51,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:51,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:51,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 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) [2022-02-20 16:42:51,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2022-02-20 16:42:51,374 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 11 [2022-02-20 16:42:51,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:51,374 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2022-02-20 16:42:51,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2022-02-20 16:42:51,374 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-02-20 16:42:51,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:42:51,375 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:51,375 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:51,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:42:51,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:42:51,580 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:51,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:51,581 INFO L85 PathProgramCache]: Analyzing trace with hash 21485156, now seen corresponding path program 1 times [2022-02-20 16:42:51,581 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:42:51,581 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212132665] [2022-02-20 16:42:51,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:51,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:42:51,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:42:51,583 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:42:51,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 16:42:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:51,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:42:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:51,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:42:51,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {694#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~tiny_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E-30)); {694#true} is VALID [2022-02-20 16:42:51,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {694#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_#t~ret9#1, main_#t~short10#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());assume { :begin_inline___ieee754_sqrtf } true;__ieee754_sqrtf_#in~x#1 := main_~x~0#1;havoc __ieee754_sqrtf_#res#1;havoc __ieee754_sqrtf_#t~mem4#1, __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, __ieee754_sqrtf_#t~post5#1, __ieee754_sqrtf_#t~mem6#1, __ieee754_sqrtf_~#sf_u~0#1.base, __ieee754_sqrtf_~#sf_u~0#1.offset, __ieee754_sqrtf_~x#1, __ieee754_sqrtf_~z~0#1, __ieee754_sqrtf_~r~0#1, __ieee754_sqrtf_~hx~0#1, __ieee754_sqrtf_~ix~0#1, __ieee754_sqrtf_~s~0#1, __ieee754_sqrtf_~q~0#1, __ieee754_sqrtf_~m~0#1, __ieee754_sqrtf_~t~0#1, __ieee754_sqrtf_~i~0#1;__ieee754_sqrtf_~x#1 := __ieee754_sqrtf_#in~x#1;havoc __ieee754_sqrtf_~z~0#1;havoc __ieee754_sqrtf_~r~0#1;havoc __ieee754_sqrtf_~hx~0#1;havoc __ieee754_sqrtf_~ix~0#1;havoc __ieee754_sqrtf_~s~0#1;havoc __ieee754_sqrtf_~q~0#1;havoc __ieee754_sqrtf_~m~0#1;havoc __ieee754_sqrtf_~t~0#1;havoc __ieee754_sqrtf_~i~0#1; {702#(= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:42:51,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {702#(= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24)))} call __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_sqrtf_~x#1, __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, 4bv32);call __ieee754_sqrtf_#t~mem4#1 := read~intINTTYPE4(__ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, 4bv32);__ieee754_sqrtf_~ix~0#1 := __ieee754_sqrtf_#t~mem4#1;havoc __ieee754_sqrtf_#t~mem4#1;call ULTIMATE.dealloc(__ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset);havoc __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset; {706#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|)))} is VALID [2022-02-20 16:42:51,877 INFO L290 TraceCheckUtils]: 3: Hoare triple {706#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|)))} goto; {706#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|)))} is VALID [2022-02-20 16:42:51,878 INFO L290 TraceCheckUtils]: 4: Hoare triple {706#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|)))} __ieee754_sqrtf_~hx~0#1 := ~bvand32(2147483647bv32, __ieee754_sqrtf_~ix~0#1); {713#(exists ((|ULTIMATE.start___ieee754_sqrtf_~ix~0#1| (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) |ULTIMATE.start___ieee754_sqrtf_~hx~0#1|) (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|)))))} is VALID [2022-02-20 16:42:51,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {713#(exists ((|ULTIMATE.start___ieee754_sqrtf_~ix~0#1| (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) |ULTIMATE.start___ieee754_sqrtf_~hx~0#1|) (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|)))))} assume !!~bvult32(__ieee754_sqrtf_~hx~0#1, 2139095040bv32); {713#(exists ((|ULTIMATE.start___ieee754_sqrtf_~ix~0#1| (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) |ULTIMATE.start___ieee754_sqrtf_~hx~0#1|) (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|)))))} is VALID [2022-02-20 16:42:51,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {713#(exists ((|ULTIMATE.start___ieee754_sqrtf_~ix~0#1| (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) |ULTIMATE.start___ieee754_sqrtf_~hx~0#1|) (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|)))))} assume !(0bv32 == __ieee754_sqrtf_~hx~0#1); {695#false} is VALID [2022-02-20 16:42:51,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {695#false} assume ~bvslt32(__ieee754_sqrtf_~ix~0#1, 0bv32);__ieee754_sqrtf_#res#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.sub~FLOAT(currentRoundingMode, __ieee754_sqrtf_~x#1, __ieee754_sqrtf_~x#1), ~fp.sub~FLOAT(currentRoundingMode, __ieee754_sqrtf_~x#1, __ieee754_sqrtf_~x#1)); {695#false} is VALID [2022-02-20 16:42:51,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {695#false} main_#t~ret8#1 := __ieee754_sqrtf_#res#1;assume { :end_inline___ieee754_sqrtf } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;main_#t~short10#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {695#false} is VALID [2022-02-20 16:42:51,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {695#false} assume !main_#t~short10#1; {695#false} is VALID [2022-02-20 16:42:51,881 INFO L290 TraceCheckUtils]: 10: Hoare triple {695#false} assume !main_#t~short10#1;havoc main_#t~ret9#1;havoc main_#t~short10#1; {695#false} is VALID [2022-02-20 16:42:51,881 INFO L290 TraceCheckUtils]: 11: Hoare triple {695#false} assume !false; {695#false} is VALID [2022-02-20 16:42:51,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:42:51,881 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:42:51,882 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:42:51,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212132665] [2022-02-20 16:42:51,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212132665] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:51,882 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:51,882 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:42:51,882 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054629154] [2022-02-20 16:42:51,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:51,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2022-02-20 16:42:51,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:51,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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) [2022-02-20 16:42:52,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:52,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:42:52,015 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:42:52,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:42:52,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:42:52,016 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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) [2022-02-20 16:42:52,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:52,138 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-02-20 16:42:52,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:42:52,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2022-02-20 16:42:52,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:52,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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) [2022-02-20 16:42:52,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2022-02-20 16:42:52,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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) [2022-02-20 16:42:52,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2022-02-20 16:42:52,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 52 transitions. [2022-02-20 16:42:52,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:52,322 INFO L225 Difference]: With dead ends: 43 [2022-02-20 16:42:52,322 INFO L226 Difference]: Without dead ends: 16 [2022-02-20 16:42:52,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:42:52,323 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:42:52,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 39 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-02-20 16:42:52,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-20 16:42:52,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-20 16:42:52,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:52,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.0) internal successors, (15), 15 states have internal predecessors, (15), 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) [2022-02-20 16:42:52,324 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.0) internal successors, (15), 15 states have internal predecessors, (15), 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) [2022-02-20 16:42:52,325 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.0) internal successors, (15), 15 states have internal predecessors, (15), 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) [2022-02-20 16:42:52,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:52,325 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2022-02-20 16:42:52,325 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2022-02-20 16:42:52,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:52,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:52,325 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 15 states have (on average 1.0) internal successors, (15), 15 states have internal predecessors, (15), 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 16 states. [2022-02-20 16:42:52,325 INFO L87 Difference]: Start difference. First operand has 16 states, 15 states have (on average 1.0) internal successors, (15), 15 states have internal predecessors, (15), 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 16 states. [2022-02-20 16:42:52,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:52,326 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2022-02-20 16:42:52,326 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2022-02-20 16:42:52,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:52,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:52,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:52,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:52,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0) internal successors, (15), 15 states have internal predecessors, (15), 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) [2022-02-20 16:42:52,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2022-02-20 16:42:52,328 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 12 [2022-02-20 16:42:52,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:52,328 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2022-02-20 16:42:52,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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) [2022-02-20 16:42:52,328 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2022-02-20 16:42:52,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:42:52,329 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:52,329 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:52,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 16:42:52,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:42:52,544 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:52,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:52,545 INFO L85 PathProgramCache]: Analyzing trace with hash 336653141, now seen corresponding path program 1 times [2022-02-20 16:42:52,545 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:42:52,545 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578054440] [2022-02-20 16:42:52,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:52,545 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:42:52,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:42:52,546 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:42:52,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 16:42:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:52,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 16:42:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:52,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:42:52,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {843#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~tiny_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E-30)); {843#true} is VALID [2022-02-20 16:42:52,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {843#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_#t~ret9#1, main_#t~short10#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());assume { :begin_inline___ieee754_sqrtf } true;__ieee754_sqrtf_#in~x#1 := main_~x~0#1;havoc __ieee754_sqrtf_#res#1;havoc __ieee754_sqrtf_#t~mem4#1, __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, __ieee754_sqrtf_#t~post5#1, __ieee754_sqrtf_#t~mem6#1, __ieee754_sqrtf_~#sf_u~0#1.base, __ieee754_sqrtf_~#sf_u~0#1.offset, __ieee754_sqrtf_~x#1, __ieee754_sqrtf_~z~0#1, __ieee754_sqrtf_~r~0#1, __ieee754_sqrtf_~hx~0#1, __ieee754_sqrtf_~ix~0#1, __ieee754_sqrtf_~s~0#1, __ieee754_sqrtf_~q~0#1, __ieee754_sqrtf_~m~0#1, __ieee754_sqrtf_~t~0#1, __ieee754_sqrtf_~i~0#1;__ieee754_sqrtf_~x#1 := __ieee754_sqrtf_#in~x#1;havoc __ieee754_sqrtf_~z~0#1;havoc __ieee754_sqrtf_~r~0#1;havoc __ieee754_sqrtf_~hx~0#1;havoc __ieee754_sqrtf_~ix~0#1;havoc __ieee754_sqrtf_~s~0#1;havoc __ieee754_sqrtf_~q~0#1;havoc __ieee754_sqrtf_~m~0#1;havoc __ieee754_sqrtf_~t~0#1;havoc __ieee754_sqrtf_~i~0#1; {851#(= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:42:52,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {851#(= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24)))} call __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_sqrtf_~x#1, __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, 4bv32);call __ieee754_sqrtf_#t~mem4#1 := read~intINTTYPE4(__ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, 4bv32);__ieee754_sqrtf_~ix~0#1 := __ieee754_sqrtf_#t~mem4#1;havoc __ieee754_sqrtf_#t~mem4#1;call ULTIMATE.dealloc(__ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset);havoc __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset; {851#(= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:42:52,817 INFO L290 TraceCheckUtils]: 3: Hoare triple {851#(= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24)))} goto; {851#(= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:42:52,817 INFO L290 TraceCheckUtils]: 4: Hoare triple {851#(= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24)))} __ieee754_sqrtf_~hx~0#1 := ~bvand32(2147483647bv32, __ieee754_sqrtf_~ix~0#1); {851#(= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:42:52,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {851#(= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24)))} assume !!~bvult32(__ieee754_sqrtf_~hx~0#1, 2139095040bv32); {851#(= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:42:52,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {851#(= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24)))} assume 0bv32 == __ieee754_sqrtf_~hx~0#1;__ieee754_sqrtf_#res#1 := __ieee754_sqrtf_~x#1; {867#(= |ULTIMATE.start___ieee754_sqrtf_#res#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:42:52,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {867#(= |ULTIMATE.start___ieee754_sqrtf_#res#1| (fp.neg (_ +zero 8 24)))} main_#t~ret8#1 := __ieee754_sqrtf_#res#1;assume { :end_inline___ieee754_sqrtf } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;main_#t~short10#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {871#(= |ULTIMATE.start_main_~res~0#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:42:52,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {871#(= |ULTIMATE.start_main_~res~0#1| (fp.neg (_ +zero 8 24)))} assume main_#t~short10#1;assume { :begin_inline___signbit_float } true;__signbit_float_#in~x#1 := main_~res~0#1;havoc __signbit_float_#res#1;havoc __signbit_float_#t~mem7#1, __signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset, __signbit_float_~x#1, __signbit_float_~w~0#1;__signbit_float_~x#1 := __signbit_float_#in~x#1;havoc __signbit_float_~w~0#1; {875#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start___signbit_float_~x#1|)} is VALID [2022-02-20 16:42:52,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {875#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start___signbit_float_~x#1|)} call __signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__signbit_float_~x#1, __signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset, 4bv32);call __signbit_float_#t~mem7#1 := read~intINTTYPE4(__signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset, 4bv32);__signbit_float_~w~0#1 := __signbit_float_#t~mem7#1;havoc __signbit_float_#t~mem7#1;call ULTIMATE.dealloc(__signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset);havoc __signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset; {879#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|)))} is VALID [2022-02-20 16:42:52,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {879#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|)))} goto; {879#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|)))} is VALID [2022-02-20 16:42:52,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {879#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|)))} __signbit_float_#res#1 := (if 0bv32 != ~bvand32(2147483648bv32, __signbit_float_~w~0#1) then 1bv32 else 0bv32); {886#(= |ULTIMATE.start___signbit_float_#res#1| (_ bv1 32))} is VALID [2022-02-20 16:42:52,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {886#(= |ULTIMATE.start___signbit_float_#res#1| (_ bv1 32))} main_#t~ret9#1 := __signbit_float_#res#1;assume { :end_inline___signbit_float } true;main_#t~short10#1 := 1bv32 == main_#t~ret9#1; {890#|ULTIMATE.start_main_#t~short10#1|} is VALID [2022-02-20 16:42:52,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {890#|ULTIMATE.start_main_#t~short10#1|} assume !main_#t~short10#1;havoc main_#t~ret9#1;havoc main_#t~short10#1; {844#false} is VALID [2022-02-20 16:42:52,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {844#false} assume !false; {844#false} is VALID [2022-02-20 16:42:52,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:42:52,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:42:52,826 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:42:52,826 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578054440] [2022-02-20 16:42:52,826 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578054440] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:52,827 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:52,827 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 16:42:52,827 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646949498] [2022-02-20 16:42:52,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:52,827 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 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 15 [2022-02-20 16:42:52,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:52,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 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) [2022-02-20 16:42:52,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:52,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 16:42:52,841 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:42:52,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 16:42:52,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:42:52,842 INFO L87 Difference]: Start difference. First operand 16 states and 15 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 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) [2022-02-20 16:42:53,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:53,164 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2022-02-20 16:42:53,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 16:42:53,165 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 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 15 [2022-02-20 16:42:53,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:53,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 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) [2022-02-20 16:42:53,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2022-02-20 16:42:53,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 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) [2022-02-20 16:42:53,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2022-02-20 16:42:53,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 15 transitions. [2022-02-20 16:42:53,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:53,184 INFO L225 Difference]: With dead ends: 16 [2022-02-20 16:42:53,184 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:42:53,184 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-02-20 16:42:53,184 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 23 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:42:53,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 35 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:42:53,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:42:53,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:42:53,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:53,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-02-20 16:42:53,186 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-02-20 16:42:53,186 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-02-20 16:42:53,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:53,186 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:42:53,187 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:42:53,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:53,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:53,187 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-02-20 16:42:53,187 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-02-20 16:42:53,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:53,187 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:42:53,187 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:42:53,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:53,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:53,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:53,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:53,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-02-20 16:42:53,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:42:53,188 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2022-02-20 16:42:53,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:53,189 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:42:53,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 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) [2022-02-20 16:42:53,189 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:42:53,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:53,191 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:42:53,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-02-20 16:42:53,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:42:53,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:42:53,520 INFO L854 garLoopResultBuilder]: At program point L52-2(lines 52 61) the Hoare annotation is: false [2022-02-20 16:42:53,520 INFO L858 garLoopResultBuilder]: For program point L52-3(lines 16 81) no Hoare annotation was computed. [2022-02-20 16:42:53,520 INFO L858 garLoopResultBuilder]: For program point L44(lines 44 45) no Hoare annotation was computed. [2022-02-20 16:42:53,520 INFO L858 garLoopResultBuilder]: For program point L44-2(lines 44 45) no Hoare annotation was computed. [2022-02-20 16:42:53,520 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:42:53,521 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:42:53,521 INFO L858 garLoopResultBuilder]: For program point L28(lines 28 29) no Hoare annotation was computed. [2022-02-20 16:42:53,521 INFO L858 garLoopResultBuilder]: For program point L86-1(lines 86 90) no Hoare annotation was computed. [2022-02-20 16:42:53,521 INFO L854 garLoopResultBuilder]: At program point L86-2(lines 86 90) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 8 24)))) (and (= |ULTIMATE.start___ieee754_sqrtf_#res#1| .cse0) (= |ULTIMATE.start___ieee754_sqrtf_~x#1| .cse0) |ULTIMATE.start_main_#t~short10#1| (= .cse0 |ULTIMATE.start___signbit_float_~x#1|) (= |ULTIMATE.start_main_~res~0#1| .cse0))) [2022-02-20 16:42:53,521 INFO L858 garLoopResultBuilder]: For program point L86-3(lines 86 90) no Hoare annotation was computed. [2022-02-20 16:42:53,521 INFO L858 garLoopResultBuilder]: For program point L37(lines 37 41) no Hoare annotation was computed. [2022-02-20 16:42:53,521 INFO L858 garLoopResultBuilder]: For program point L37-2(lines 37 41) no Hoare annotation was computed. [2022-02-20 16:42:53,521 INFO L858 garLoopResultBuilder]: For program point L54(lines 54 58) no Hoare annotation was computed. [2022-02-20 16:42:53,521 INFO L858 garLoopResultBuilder]: For program point L21-1(lines 21 25) no Hoare annotation was computed. [2022-02-20 16:42:53,521 INFO L858 garLoopResultBuilder]: For program point L54-2(lines 54 58) no Hoare annotation was computed. [2022-02-20 16:42:53,521 INFO L854 garLoopResultBuilder]: At program point L21-2(lines 21 25) the Hoare annotation is: (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24))) [2022-02-20 16:42:53,521 INFO L858 garLoopResultBuilder]: For program point L21-3(lines 21 25) no Hoare annotation was computed. [2022-02-20 16:42:53,521 INFO L861 garLoopResultBuilder]: At program point L112(lines 95 113) the Hoare annotation is: true [2022-02-20 16:42:53,521 INFO L858 garLoopResultBuilder]: For program point L38-2(lines 38 39) no Hoare annotation was computed. [2022-02-20 16:42:53,521 INFO L854 garLoopResultBuilder]: At program point L38-3(lines 38 39) the Hoare annotation is: false [2022-02-20 16:42:53,521 INFO L858 garLoopResultBuilder]: For program point L38-4(lines 38 39) no Hoare annotation was computed. [2022-02-20 16:42:53,521 INFO L858 garLoopResultBuilder]: For program point L63(lines 63 72) no Hoare annotation was computed. [2022-02-20 16:42:53,521 INFO L854 garLoopResultBuilder]: At program point L80(lines 16 81) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 8 24)))) (and (= |ULTIMATE.start___ieee754_sqrtf_#res#1| .cse0) (= |ULTIMATE.start___ieee754_sqrtf_~x#1| .cse0))) [2022-02-20 16:42:53,522 INFO L858 garLoopResultBuilder]: For program point L31(lines 31 32) no Hoare annotation was computed. [2022-02-20 16:42:53,522 INFO L858 garLoopResultBuilder]: For program point L65(lines 65 71) no Hoare annotation was computed. [2022-02-20 16:42:53,522 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:42:53,522 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 108) no Hoare annotation was computed. [2022-02-20 16:42:53,522 INFO L858 garLoopResultBuilder]: For program point L107(line 107) no Hoare annotation was computed. [2022-02-20 16:42:53,522 INFO L858 garLoopResultBuilder]: For program point L107-2(lines 107 110) no Hoare annotation was computed. [2022-02-20 16:42:53,522 INFO L858 garLoopResultBuilder]: For program point L33(lines 33 34) no Hoare annotation was computed. [2022-02-20 16:42:53,522 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:42:53,524 INFO L858 garLoopResultBuilder]: For program point L108(line 108) no Hoare annotation was computed. [2022-02-20 16:42:53,524 INFO L858 garLoopResultBuilder]: For program point L75-1(lines 75 79) no Hoare annotation was computed. [2022-02-20 16:42:53,524 INFO L854 garLoopResultBuilder]: At program point L75-2(lines 75 79) the Hoare annotation is: false [2022-02-20 16:42:53,524 INFO L858 garLoopResultBuilder]: For program point L75-3(lines 75 79) no Hoare annotation was computed. [2022-02-20 16:42:53,524 INFO L858 garLoopResultBuilder]: For program point L67(lines 67 70) no Hoare annotation was computed. [2022-02-20 16:42:53,524 INFO L854 garLoopResultBuilder]: At program point L92(lines 83 93) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 8 24)))) (and (= |ULTIMATE.start___ieee754_sqrtf_#res#1| .cse0) (= |ULTIMATE.start___ieee754_sqrtf_~x#1| .cse0) |ULTIMATE.start_main_#t~short10#1| (= |ULTIMATE.start___signbit_float_#res#1| (_ bv1 32)) (= .cse0 |ULTIMATE.start___signbit_float_~x#1|) (= .cse0 (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|))) (= |ULTIMATE.start_main_~res~0#1| .cse0))) [2022-02-20 16:42:53,526 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 16:42:53,527 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:42:53,530 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:42:53,530 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:42:53,530 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:42:53,530 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-02-20 16:42:53,530 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:42:53,530 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:42:53,530 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-02-20 16:42:53,530 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:42:53,530 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:42:53,530 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2022-02-20 16:42:53,530 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 16:42:53,530 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 16:42:53,530 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2022-02-20 16:42:53,530 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2022-02-20 16:42:53,530 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 16:42:53,530 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 16:42:53,530 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-02-20 16:42:53,530 WARN L170 areAnnotationChecker]: L86-3 has no Hoare annotation [2022-02-20 16:42:53,530 WARN L170 areAnnotationChecker]: L107-2 has no Hoare annotation [2022-02-20 16:42:53,530 WARN L170 areAnnotationChecker]: L107-2 has no Hoare annotation [2022-02-20 16:42:53,530 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 16:42:53,530 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 16:42:53,531 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-02-20 16:42:53,531 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-02-20 16:42:53,531 WARN L170 areAnnotationChecker]: L86-3 has no Hoare annotation [2022-02-20 16:42:53,531 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2022-02-20 16:42:53,531 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2022-02-20 16:42:53,531 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:42:53,531 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2022-02-20 16:42:53,531 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2022-02-20 16:42:53,531 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-02-20 16:42:53,531 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2022-02-20 16:42:53,531 WARN L170 areAnnotationChecker]: L107-2 has no Hoare annotation [2022-02-20 16:42:53,531 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:42:53,531 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2022-02-20 16:42:53,531 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-02-20 16:42:53,531 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 16:42:53,531 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 16:42:53,531 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2022-02-20 16:42:53,531 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2022-02-20 16:42:53,531 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2022-02-20 16:42:53,531 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:42:53,531 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2022-02-20 16:42:53,531 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2022-02-20 16:42:53,531 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:42:53,531 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:42:53,531 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-02-20 16:42:53,532 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-02-20 16:42:53,532 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-02-20 16:42:53,532 WARN L170 areAnnotationChecker]: L54-2 has no Hoare annotation [2022-02-20 16:42:53,532 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-02-20 16:42:53,532 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-02-20 16:42:53,532 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2022-02-20 16:42:53,532 WARN L170 areAnnotationChecker]: L75-3 has no Hoare annotation [2022-02-20 16:42:53,532 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2022-02-20 16:42:53,532 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2022-02-20 16:42:53,532 WARN L170 areAnnotationChecker]: L75-3 has no Hoare annotation [2022-02-20 16:42:53,532 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. [2022-02-20 16:42:53,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:42:53 BoogieIcfgContainer [2022-02-20 16:42:53,546 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:42:53,549 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:42:53,549 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:42:53,549 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:42:53,550 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:45" (3/4) ... [2022-02-20 16:42:53,552 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:42:53,560 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-02-20 16:42:53,561 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-02-20 16:42:53,561 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:42:53,561 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:42:53,580 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \result == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) [2022-02-20 16:42:53,581 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && aux-res == -0.0f && __signbit_float(res) == 1-aux) && ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == x) && res == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) [2022-02-20 16:42:53,581 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && aux-res == -0.0f && __signbit_float(res) == 1-aux) && \result == 1bv32) && ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == x) && ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && res == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) [2022-02-20 16:42:53,589 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:42:53,589 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:42:53,590 INFO L158 Benchmark]: Toolchain (without parser) took 9241.64ms. Allocated memory was 67.1MB in the beginning and 90.2MB in the end (delta: 23.1MB). Free memory was 47.6MB in the beginning and 68.8MB in the end (delta: -21.2MB). Peak memory consumption was 1.4MB. Max. memory is 16.1GB. [2022-02-20 16:42:53,590 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 67.1MB. Free memory was 48.9MB in the beginning and 48.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:42:53,590 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.73ms. Allocated memory is still 67.1MB. Free memory was 47.2MB in the beginning and 49.2MB in the end (delta: -2.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 16:42:53,590 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.49ms. Allocated memory is still 67.1MB. Free memory was 49.2MB in the beginning and 46.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:42:53,591 INFO L158 Benchmark]: Boogie Preprocessor took 54.12ms. Allocated memory is still 67.1MB. Free memory was 46.8MB in the beginning and 45.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:42:53,591 INFO L158 Benchmark]: RCFGBuilder took 1089.23ms. Allocated memory was 67.1MB in the beginning and 90.2MB in the end (delta: 23.1MB). Free memory was 45.0MB in the beginning and 71.7MB in the end (delta: -26.7MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2022-02-20 16:42:53,591 INFO L158 Benchmark]: TraceAbstraction took 7753.90ms. Allocated memory is still 90.2MB. Free memory was 71.3MB in the beginning and 28.4MB in the end (delta: 42.9MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. [2022-02-20 16:42:53,591 INFO L158 Benchmark]: Witness Printer took 40.23ms. Allocated memory is still 90.2MB. Free memory was 71.7MB in the beginning and 68.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:42:53,592 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.17ms. Allocated memory is still 67.1MB. Free memory was 48.9MB in the beginning and 48.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.73ms. Allocated memory is still 67.1MB. Free memory was 47.2MB in the beginning and 49.2MB in the end (delta: -2.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.49ms. Allocated memory is still 67.1MB. Free memory was 49.2MB in the beginning and 46.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.12ms. Allocated memory is still 67.1MB. Free memory was 46.8MB in the beginning and 45.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1089.23ms. Allocated memory was 67.1MB in the beginning and 90.2MB in the end (delta: 23.1MB). Free memory was 45.0MB in the beginning and 71.7MB in the end (delta: -26.7MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7753.90ms. Allocated memory is still 90.2MB. Free memory was 71.3MB in the beginning and 28.4MB in the end (delta: 42.9MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. * Witness Printer took 40.23ms. Allocated memory is still 90.2MB. Free memory was 71.7MB in the beginning and 68.8MB in the end (delta: 2.9MB). 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.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 108]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 90 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 90 mSDsluCounter, 374 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 11 IncrementalHoareTripleChecker+Unchecked, 227 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 68 IncrementalHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 147 mSDtfsCounter, 68 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 13 NumberOfFragments, 66 HoareAnnotationTreeSize, 8 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 34 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 57 NumberOfCodeBlocks, 57 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 52 ConstructedInterpolants, 3 QuantifiedInterpolants, 204 SizeOfPredicates, 28 NumberOfNonLiveVariables, 215 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: (((((\result == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && aux-res == -0.0f && __signbit_float(res) == 1-aux) && \result == 1bv32) && ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == x) && ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && res == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: (((\result == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && aux-res == -0.0f && __signbit_float(res) == 1-aux) && ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == x) && res == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: \result == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) RESULT: Ultimate proved your program to be correct! [2022-02-20 16:42:53,635 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE