./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_0730a.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_0730a.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 08b98e45599512b8d6c489b1dd455db4184e1609dc88e012fc4f2e92ac326cf0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:42:23,228 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:42:23,230 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:42:23,263 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:42:23,263 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:42:23,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:42:23,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:42:23,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:42:23,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:42:23,273 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:42:23,274 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:42:23,275 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:42:23,275 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:42:23,277 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:42:23,277 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:42:23,280 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:42:23,281 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:42:23,281 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:42:23,283 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:42:23,287 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:42:23,287 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:42:23,288 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:42:23,289 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:42:23,290 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:42:23,294 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:42:23,295 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:42:23,295 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:42:23,296 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:42:23,296 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:42:23,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:42:23,297 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:42:23,298 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:42:23,299 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:42:23,299 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:42:23,300 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:42:23,301 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:42:23,301 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:42:23,301 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:42:23,302 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:42:23,302 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:42:23,303 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:42:23,304 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:23,327 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:42:23,327 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:42:23,328 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:42:23,328 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:42:23,329 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:42:23,329 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:42:23,329 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:42:23,329 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:42:23,329 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:42:23,330 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:42:23,330 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:42:23,330 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:42:23,331 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:42:23,331 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:42:23,331 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:42:23,331 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:42:23,331 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:42:23,331 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:42:23,331 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:42:23,332 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:42:23,332 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:42:23,332 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:42:23,332 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:42:23,332 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:42:23,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:42:23,333 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:42:23,333 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:42:23,334 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:42:23,334 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:42:23,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:42:23,334 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:42:23,334 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:42:23,335 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:42:23,335 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 -> 08b98e45599512b8d6c489b1dd455db4184e1609dc88e012fc4f2e92ac326cf0 [2022-02-20 16:42:23,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:42:23,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:42:23,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:42:23,563 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:42:23,564 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:42:23,565 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0730a.c [2022-02-20 16:42:23,623 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7355f7a02/1e67feb5f7754736938c75805db209be/FLAGf5c73ca7b [2022-02-20 16:42:24,004 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:42:24,005 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0730a.c [2022-02-20 16:42:24,020 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7355f7a02/1e67feb5f7754736938c75805db209be/FLAGf5c73ca7b [2022-02-20 16:42:24,413 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7355f7a02/1e67feb5f7754736938c75805db209be [2022-02-20 16:42:24,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:42:24,418 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:42:24,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:42:24,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:42:24,424 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:42:24,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:42:24" (1/1) ... [2022-02-20 16:42:24,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@645cd5fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:24, skipping insertion in model container [2022-02-20 16:42:24,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:42:24" (1/1) ... [2022-02-20 16:42:24,431 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:42:24,444 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:42:24,613 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_0730a.c[2102,2115] [2022-02-20 16:42:24,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:42:24,630 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:42:24,654 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_0730a.c[2102,2115] [2022-02-20 16:42:24,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:42:24,664 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:42:24,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:24 WrapperNode [2022-02-20 16:42:24,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:42:24,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:42:24,666 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:42:24,666 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:42:24,676 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:24" (1/1) ... [2022-02-20 16:42:24,684 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:24" (1/1) ... [2022-02-20 16:42:24,708 INFO L137 Inliner]: procedures = 17, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 150 [2022-02-20 16:42:24,709 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:42:24,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:42:24,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:42:24,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:42:24,720 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:24" (1/1) ... [2022-02-20 16:42:24,722 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:24" (1/1) ... [2022-02-20 16:42:24,725 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:24" (1/1) ... [2022-02-20 16:42:24,734 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:24" (1/1) ... [2022-02-20 16:42:24,742 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:24" (1/1) ... [2022-02-20 16:42:24,757 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:24" (1/1) ... [2022-02-20 16:42:24,758 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:24" (1/1) ... [2022-02-20 16:42:24,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:42:24,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:42:24,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:42:24,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:42:24,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:24" (1/1) ... [2022-02-20 16:42:24,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:42:24,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:42:24,785 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:24,799 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:24,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:42:24,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:42:24,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:42:24,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:42:24,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:42:24,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:42:24,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:42:24,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:42:24,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:42:24,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:42:24,887 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:42:24,888 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:42:25,176 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:42:25,182 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:42:25,183 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-20 16:42:25,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:25 BoogieIcfgContainer [2022-02-20 16:42:25,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:42:25,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:42:25,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:42:25,189 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:42:25,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:42:24" (1/3) ... [2022-02-20 16:42:25,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@789adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:42:25, skipping insertion in model container [2022-02-20 16:42:25,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:24" (2/3) ... [2022-02-20 16:42:25,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@789adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:42:25, skipping insertion in model container [2022-02-20 16:42:25,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:25" (3/3) ... [2022-02-20 16:42:25,192 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0730a.c [2022-02-20 16:42:25,200 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:42:25,200 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:42:25,232 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:42:25,237 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:25,237 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:42:25,248 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 42 states have internal predecessors, (70), 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:25,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:42:25,252 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:25,253 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:25,253 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:25,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:25,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1149636621, now seen corresponding path program 1 times [2022-02-20 16:42:25,266 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:42:25,266 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800043229] [2022-02-20 16:42:25,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:25,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:42:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:25,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {46#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; {46#true} is VALID [2022-02-20 16:42:25,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#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_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(1.0, 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; {46#true} is VALID [2022-02-20 16:42:25,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {46#true} assume !true; {47#false} is VALID [2022-02-20 16:42:25,391 INFO L290 TraceCheckUtils]: 3: Hoare triple {47#false} assume 0 == __ieee754_sqrtf_~ix~0#1;__ieee754_sqrtf_~hx~0#1 := 0; {47#false} is VALID [2022-02-20 16:42:25,391 INFO L290 TraceCheckUtils]: 4: Hoare triple {47#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); {47#false} is VALID [2022-02-20 16:42:25,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {47#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;assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_~res~0#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem9#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, isinf_float_~x#1, isinf_float_~ix~1#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~1#1; {47#false} is VALID [2022-02-20 16:42:25,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {47#false} assume !true; {47#false} is VALID [2022-02-20 16:42:25,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {47#false} isinf_float_~ix~1#1 := (if 0 == isinf_float_~ix~1#1 then 0 else (if 1 == isinf_float_~ix~1#1 then 1 else ~bitwiseAnd(isinf_float_~ix~1#1, 2147483647)));isinf_float_#res#1 := (if 2139095040 == isinf_float_~ix~1#1 then 1 else 0); {47#false} is VALID [2022-02-20 16:42:25,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {47#false} main_#t~ret11#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true;assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647; {47#false} is VALID [2022-02-20 16:42:25,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {47#false} assume 0 == main_#t~ret11#1;havoc main_#t~ret11#1; {47#false} is VALID [2022-02-20 16:42:25,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {47#false} assume !false; {47#false} is VALID [2022-02-20 16:42:25,395 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:25,396 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:42:25,396 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800043229] [2022-02-20 16:42:25,397 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800043229] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:25,397 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:25,397 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:42:25,400 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959217148] [2022-02-20 16:42:25,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:25,405 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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:25,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:25,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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:25,428 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:25,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:42:25,429 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:42:25,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:42:25,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:42:25,449 INFO L87 Difference]: Start difference. First operand has 43 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 42 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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:25,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:25,519 INFO L93 Difference]: Finished difference Result 84 states and 138 transitions. [2022-02-20 16:42:25,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:42:25,519 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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:25,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:25,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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:25,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 138 transitions. [2022-02-20 16:42:25,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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:25,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 138 transitions. [2022-02-20 16:42:25,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 138 transitions. [2022-02-20 16:42:25,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:25,644 INFO L225 Difference]: With dead ends: 84 [2022-02-20 16:42:25,645 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 16:42:25,647 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:25,649 INFO L933 BasicCegarLoop]: 56 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, 56 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:25,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 56 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:25,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 16:42:25,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-02-20 16:42:25,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:25,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:25,680 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:25,680 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:25,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:25,683 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-02-20 16:42:25,683 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-02-20 16:42:25,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:25,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:25,685 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 40 states. [2022-02-20 16:42:25,687 INFO L87 Difference]: Start difference. First operand has 40 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 40 states. [2022-02-20 16:42:25,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:25,689 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-02-20 16:42:25,694 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-02-20 16:42:25,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:25,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:25,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:25,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:25,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:25,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2022-02-20 16:42:25,700 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 53 transitions. Word has length 11 [2022-02-20 16:42:25,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:25,700 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 53 transitions. [2022-02-20 16:42:25,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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:25,701 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-02-20 16:42:25,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:42:25,702 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:25,702 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:25,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:42:25,705 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:25,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:25,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1183374909, now seen corresponding path program 1 times [2022-02-20 16:42:25,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:42:25,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839609841] [2022-02-20 16:42:25,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:25,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:42:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:25,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {277#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; {277#true} is VALID [2022-02-20 16:42:25,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {277#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_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(1.0, 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; {277#true} is VALID [2022-02-20 16:42:25,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {277#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; {277#true} is VALID [2022-02-20 16:42:25,776 INFO L290 TraceCheckUtils]: 3: Hoare triple {277#true} goto; {277#true} is VALID [2022-02-20 16:42:25,777 INFO L290 TraceCheckUtils]: 4: Hoare triple {277#true} assume 0 == __ieee754_sqrtf_~ix~0#1;__ieee754_sqrtf_~hx~0#1 := 0; {279#(= |ULTIMATE.start___ieee754_sqrtf_~hx~0#1| 0)} is VALID [2022-02-20 16:42:25,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {279#(= |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); {278#false} is VALID [2022-02-20 16:42:25,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {278#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;assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_~res~0#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem9#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, isinf_float_~x#1, isinf_float_~ix~1#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~1#1; {278#false} is VALID [2022-02-20 16:42:25,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {278#false} call isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4);call write~real(isinf_float_~x#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, 4);call isinf_float_#t~mem9#1 := read~int(isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, 4);isinf_float_~ix~1#1 := (if isinf_float_#t~mem9#1 % 4294967296 % 4294967296 <= 2147483647 then isinf_float_#t~mem9#1 % 4294967296 % 4294967296 else isinf_float_#t~mem9#1 % 4294967296 % 4294967296 - 4294967296);havoc isinf_float_#t~mem9#1;call ULTIMATE.dealloc(isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset);havoc isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset; {278#false} is VALID [2022-02-20 16:42:25,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {278#false} goto; {278#false} is VALID [2022-02-20 16:42:25,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {278#false} isinf_float_~ix~1#1 := (if 0 == isinf_float_~ix~1#1 then 0 else (if 1 == isinf_float_~ix~1#1 then 1 else ~bitwiseAnd(isinf_float_~ix~1#1, 2147483647)));isinf_float_#res#1 := (if 2139095040 == isinf_float_~ix~1#1 then 1 else 0); {278#false} is VALID [2022-02-20 16:42:25,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {278#false} main_#t~ret11#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true;assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647; {278#false} is VALID [2022-02-20 16:42:25,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {278#false} assume 0 == main_#t~ret11#1;havoc main_#t~ret11#1; {278#false} is VALID [2022-02-20 16:42:25,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {278#false} assume !false; {278#false} is VALID [2022-02-20 16:42:25,779 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:25,779 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:42:25,779 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839609841] [2022-02-20 16:42:25,779 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839609841] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:25,780 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:25,780 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:42:25,780 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267682585] [2022-02-20 16:42:25,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:25,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2022-02-20 16:42:25,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:25,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:25,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:25,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:42:25,790 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:42:25,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:42:25,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:42:25,791 INFO L87 Difference]: Start difference. First operand 40 states and 53 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:25,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:25,850 INFO L93 Difference]: Finished difference Result 80 states and 103 transitions. [2022-02-20 16:42:25,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:42:25,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2022-02-20 16:42:25,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:25,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:25,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2022-02-20 16:42:25,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:25,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2022-02-20 16:42:25,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 103 transitions. [2022-02-20 16:42:25,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:25,927 INFO L225 Difference]: With dead ends: 80 [2022-02-20 16:42:25,927 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 16:42:25,927 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:25,928 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 9 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 94 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:25,929 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 94 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:25,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 16:42:25,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-02-20 16:42:25,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:25,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 42 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 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:25,933 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 42 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 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:25,933 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 42 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 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:25,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:25,951 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-02-20 16:42:25,951 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-02-20 16:42:25,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:25,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:25,952 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 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 50 states. [2022-02-20 16:42:25,953 INFO L87 Difference]: Start difference. First operand has 42 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 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 50 states. [2022-02-20 16:42:25,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:25,955 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-02-20 16:42:25,955 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-02-20 16:42:25,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:25,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:25,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:25,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:25,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 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:25,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2022-02-20 16:42:25,958 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 13 [2022-02-20 16:42:25,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:25,959 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2022-02-20 16:42:25,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:25,959 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2022-02-20 16:42:25,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:42:25,960 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:25,960 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:25,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:42:25,960 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:25,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:25,961 INFO L85 PathProgramCache]: Analyzing trace with hash -2006834894, now seen corresponding path program 1 times [2022-02-20 16:42:25,961 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:42:25,961 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742004777] [2022-02-20 16:42:25,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:25,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:42:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:42:26,000 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:42:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:42:26,036 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:42:26,036 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:42:26,037 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:42:26,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:42:26,040 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:42:26,042 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:42:26,060 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:42:26,060 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:42:26,060 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-02-20 16:42:26,061 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-02-20 16:42:26,061 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:42:26,061 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:42:26,061 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-02-20 16:42:26,061 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-02-20 16:42:26,061 WARN L170 areAnnotationChecker]: L26-7 has no Hoare annotation [2022-02-20 16:42:26,061 WARN L170 areAnnotationChecker]: L26-7 has no Hoare annotation [2022-02-20 16:42:26,061 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-20 16:42:26,061 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-20 16:42:26,062 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:42:26,062 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 16:42:26,062 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 16:42:26,062 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2022-02-20 16:42:26,062 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2022-02-20 16:42:26,062 WARN L170 areAnnotationChecker]: L86-2 has no Hoare annotation [2022-02-20 16:42:26,062 WARN L170 areAnnotationChecker]: L86-2 has no Hoare annotation [2022-02-20 16:42:26,062 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 16:42:26,062 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 16:42:26,063 WARN L170 areAnnotationChecker]: L26-5 has no Hoare annotation [2022-02-20 16:42:26,063 WARN L170 areAnnotationChecker]: L26-5 has no Hoare annotation [2022-02-20 16:42:26,063 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-02-20 16:42:26,063 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-02-20 16:42:26,063 WARN L170 areAnnotationChecker]: L86-3 has no Hoare annotation [2022-02-20 16:42:26,063 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 16:42:26,063 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 16:42:26,063 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2022-02-20 16:42:26,063 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2022-02-20 16:42:26,064 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2022-02-20 16:42:26,064 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2022-02-20 16:42:26,064 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2022-02-20 16:42:26,064 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2022-02-20 16:42:26,064 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2022-02-20 16:42:26,064 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2022-02-20 16:42:26,064 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-02-20 16:42:26,064 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:42:26,064 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:42:26,065 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:42:26,065 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:42:26,065 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-02-20 16:42:26,065 WARN L170 areAnnotationChecker]: L43-8 has no Hoare annotation [2022-02-20 16:42:26,065 WARN L170 areAnnotationChecker]: L43-8 has no Hoare annotation [2022-02-20 16:42:26,065 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:42:26,065 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:42:26,065 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:42:26,065 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2022-02-20 16:42:26,066 WARN L170 areAnnotationChecker]: L43-4 has no Hoare annotation [2022-02-20 16:42:26,066 WARN L170 areAnnotationChecker]: L43-4 has no Hoare annotation [2022-02-20 16:42:26,066 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 16:42:26,066 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 16:42:26,066 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 16:42:26,066 WARN L170 areAnnotationChecker]: L43-6 has no Hoare annotation [2022-02-20 16:42:26,066 WARN L170 areAnnotationChecker]: L43-6 has no Hoare annotation [2022-02-20 16:42:26,066 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2022-02-20 16:42:26,066 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2022-02-20 16:42:26,067 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:42:26,067 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:42:26,067 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-02-20 16:42:26,067 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-02-20 16:42:26,067 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-02-20 16:42:26,067 WARN L170 areAnnotationChecker]: L54-2 has no Hoare annotation [2022-02-20 16:42:26,067 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-02-20 16:42:26,067 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-02-20 16:42:26,067 WARN L170 areAnnotationChecker]: L75-2 has no Hoare annotation [2022-02-20 16:42:26,068 WARN L170 areAnnotationChecker]: L75-2 has no Hoare annotation [2022-02-20 16:42:26,068 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2022-02-20 16:42:26,068 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2022-02-20 16:42:26,068 WARN L170 areAnnotationChecker]: L75-3 has no Hoare annotation [2022-02-20 16:42:26,068 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:26,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:42:26 BoogieIcfgContainer [2022-02-20 16:42:26,069 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:42:26,070 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:42:26,070 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:42:26,070 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:42:26,070 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:25" (3/4) ... [2022-02-20 16:42:26,072 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:42:26,072 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:42:26,074 INFO L158 Benchmark]: Toolchain (without parser) took 1655.32ms. Allocated memory was 121.6MB in the beginning and 155.2MB in the end (delta: 33.6MB). Free memory was 93.6MB in the beginning and 94.8MB in the end (delta: -1.2MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2022-02-20 16:42:26,074 INFO L158 Benchmark]: CDTParser took 14.30ms. Allocated memory is still 121.6MB. Free memory was 79.4MB in the beginning and 79.3MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:42:26,074 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.08ms. Allocated memory was 121.6MB in the beginning and 155.2MB in the end (delta: 33.6MB). Free memory was 93.3MB in the beginning and 125.7MB in the end (delta: -32.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:42:26,075 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.33ms. Allocated memory is still 155.2MB. Free memory was 125.7MB in the beginning and 123.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:42:26,075 INFO L158 Benchmark]: Boogie Preprocessor took 51.47ms. Allocated memory is still 155.2MB. Free memory was 123.2MB in the beginning and 121.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:42:26,075 INFO L158 Benchmark]: RCFGBuilder took 423.60ms. Allocated memory is still 155.2MB. Free memory was 121.5MB in the beginning and 103.9MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-02-20 16:42:26,076 INFO L158 Benchmark]: TraceAbstraction took 882.47ms. Allocated memory is still 155.2MB. Free memory was 103.5MB in the beginning and 95.0MB in the end (delta: 8.5MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2022-02-20 16:42:26,076 INFO L158 Benchmark]: Witness Printer took 3.03ms. Allocated memory is still 155.2MB. Free memory was 95.0MB in the beginning and 94.8MB in the end (delta: 175.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:42:26,077 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 14.30ms. Allocated memory is still 121.6MB. Free memory was 79.4MB in the beginning and 79.3MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.08ms. Allocated memory was 121.6MB in the beginning and 155.2MB in the end (delta: 33.6MB). Free memory was 93.3MB in the beginning and 125.7MB in the end (delta: -32.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.33ms. Allocated memory is still 155.2MB. Free memory was 125.7MB in the beginning and 123.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.47ms. Allocated memory is still 155.2MB. Free memory was 123.2MB in the beginning and 121.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 423.60ms. Allocated memory is still 155.2MB. Free memory was 121.5MB in the beginning and 103.9MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 882.47ms. Allocated memory is still 155.2MB. Free memory was 103.5MB in the beginning and 95.0MB in the end (delta: 8.5MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Witness Printer took 3.03ms. Allocated memory is still 155.2MB. Free memory was 95.0MB in the beginning and 94.8MB in the end (delta: 175.9kB). 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: 109]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticFLOAToperation at line 103, overapproximation of bitwiseAnd at line 91. 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 = 1.0f / 0.0f; [L105] 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)=4294967304, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967304] [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)=4294967304, hx=0, ix=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967304] [L28] COND FALSE !(!((hx) < 0x7f800000L)) VAL [\old(x)=4294967304, hx=0, ix=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967304] [L31] COND TRUE ((hx) == 0) [L32] return x; VAL [\old(x)=4294967304, \result=4294967304, hx=0, ix=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967304] [L105] RET, EXPR __ieee754_sqrtf(x) [L105] float res = __ieee754_sqrtf(x); [L108] CALL, EXPR isinf_float(res) [L85] __int32_t ix; VAL [\old(x)=4294967304, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967304] [L87] ieee_float_shape_type gf_u; [L88] gf_u.value = (x) [L89] EXPR gf_u.word [L89] (ix) = gf_u.word [L91] ix &= 0x7fffffff [L92] return ((ix) == 0x7f800000L); VAL [\old(x)=4294967304, \result=0, ix=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967304] [L108] RET, EXPR isinf_float(res) [L108] COND TRUE !isinf_float(res) [L109] reach_error() VAL [one_sqrt=1, res=4294967304, tiny_sqrt=1/1000000000000000000000000000000, x=4294967304] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, 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, 9 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 150 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 107 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=43occurred 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, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 24 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:26,120 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_0730a.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 08b98e45599512b8d6c489b1dd455db4184e1609dc88e012fc4f2e92ac326cf0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:42:28,029 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:42:28,031 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:42:28,058 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:42:28,058 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:42:28,059 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:42:28,060 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:42:28,062 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:42:28,063 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:42:28,064 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:42:28,065 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:42:28,066 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:42:28,067 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:42:28,067 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:42:28,068 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:42:28,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:42:28,069 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:42:28,070 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:42:28,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:42:28,072 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:42:28,073 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:42:28,087 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:42:28,087 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:42:28,088 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:42:28,089 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:42:28,090 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:42:28,090 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:42:28,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:42:28,091 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:42:28,091 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:42:28,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:42:28,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:42:28,092 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:42:28,093 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:42:28,094 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:42:28,094 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:42:28,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:42:28,095 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:42:28,096 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:42:28,097 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:42:28,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:42:28,101 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:28,130 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:42:28,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:42:28,131 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:42:28,131 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:42:28,132 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:42:28,132 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:42:28,133 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:42:28,133 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:42:28,134 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:42:28,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:42:28,134 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:42:28,134 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:42:28,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:42:28,135 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:42:28,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:42:28,135 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:42:28,135 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:42:28,135 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:42:28,136 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:42:28,136 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:42:28,136 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:42:28,136 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:42:28,136 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:42:28,137 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:42:28,137 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:42:28,137 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:42:28,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:42:28,137 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:42:28,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:42:28,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:42:28,138 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:42:28,138 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:42:28,138 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:42:28,138 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:42:28,138 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:42:28,139 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:42:28,139 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 -> 08b98e45599512b8d6c489b1dd455db4184e1609dc88e012fc4f2e92ac326cf0 [2022-02-20 16:42:28,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:42:28,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:42:28,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:42:28,452 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:42:28,453 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:42:28,454 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0730a.c [2022-02-20 16:42:28,515 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ba925280/ef9f7f369b0f4ada8350dc212f450eec/FLAG7047fbea7 [2022-02-20 16:42:28,851 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:42:28,854 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0730a.c [2022-02-20 16:42:28,861 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ba925280/ef9f7f369b0f4ada8350dc212f450eec/FLAG7047fbea7 [2022-02-20 16:42:29,255 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ba925280/ef9f7f369b0f4ada8350dc212f450eec [2022-02-20 16:42:29,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:42:29,258 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:42:29,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:42:29,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:42:29,265 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:42:29,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:42:29" (1/1) ... [2022-02-20 16:42:29,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@395c389b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:29, skipping insertion in model container [2022-02-20 16:42:29,269 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:42:29" (1/1) ... [2022-02-20 16:42:29,279 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:42:29,296 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:42:29,453 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_0730a.c[2102,2115] [2022-02-20 16:42:29,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:42:29,518 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:42:29,553 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_0730a.c[2102,2115] [2022-02-20 16:42:29,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:42:29,571 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:42:29,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:29 WrapperNode [2022-02-20 16:42:29,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:42:29,577 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:42:29,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:42:29,578 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:42:29,583 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:29" (1/1) ... [2022-02-20 16:42:29,599 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:29" (1/1) ... [2022-02-20 16:42:29,630 INFO L137 Inliner]: procedures = 20, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 127 [2022-02-20 16:42:29,631 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:42:29,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:42:29,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:42:29,632 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:42:29,637 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:29" (1/1) ... [2022-02-20 16:42:29,638 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:29" (1/1) ... [2022-02-20 16:42:29,652 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:29" (1/1) ... [2022-02-20 16:42:29,653 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:29" (1/1) ... [2022-02-20 16:42:29,664 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:29" (1/1) ... [2022-02-20 16:42:29,671 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:29" (1/1) ... [2022-02-20 16:42:29,678 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:29" (1/1) ... [2022-02-20 16:42:29,683 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:42:29,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:42:29,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:42:29,688 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:42:29,690 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:29" (1/1) ... [2022-02-20 16:42:29,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:42:29,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:42:29,721 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:29,753 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:29,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:42:29,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:42:29,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:42:29,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:42:29,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:42:29,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:42:29,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:42:29,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:42:29,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:42:29,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:42:29,845 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:42:29,846 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:42:30,484 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:42:30,488 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:42:30,488 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-20 16:42:30,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:30 BoogieIcfgContainer [2022-02-20 16:42:30,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:42:30,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:42:30,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:42:30,503 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:42:30,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:42:29" (1/3) ... [2022-02-20 16:42:30,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cadf330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:42:30, skipping insertion in model container [2022-02-20 16:42:30,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:29" (2/3) ... [2022-02-20 16:42:30,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cadf330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:42:30, skipping insertion in model container [2022-02-20 16:42:30,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:30" (3/3) ... [2022-02-20 16:42:30,505 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0730a.c [2022-02-20 16:42:30,508 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:42:30,509 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:42:30,558 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:42:30,563 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:30,563 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:42:30,577 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 35 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:30,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:42:30,580 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:30,581 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:30,581 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:30,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:30,585 INFO L85 PathProgramCache]: Analyzing trace with hash 175857115, now seen corresponding path program 1 times [2022-02-20 16:42:30,594 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:42:30,595 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1298663131] [2022-02-20 16:42:30,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:30,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:42:30,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:42:30,608 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:30,609 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:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:30,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:42:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:30,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:42:30,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#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)); {39#true} is VALID [2022-02-20 16:42:30,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#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_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~to_fp~FLOAT(currentRoundingMode, 1.0), ~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; {39#true} is VALID [2022-02-20 16:42:30,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} assume !true; {40#false} is VALID [2022-02-20 16:42:30,867 INFO L290 TraceCheckUtils]: 3: Hoare triple {40#false} __ieee754_sqrtf_~hx~0#1 := ~bvand32(2147483647bv32, __ieee754_sqrtf_~ix~0#1); {40#false} is VALID [2022-02-20 16:42:30,868 INFO L290 TraceCheckUtils]: 4: Hoare triple {40#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); {40#false} is VALID [2022-02-20 16:42:30,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#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;assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_~res~0#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem7#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, isinf_float_~x#1, isinf_float_~ix~1#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~1#1; {40#false} is VALID [2022-02-20 16:42:30,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {40#false} assume !true; {40#false} is VALID [2022-02-20 16:42:30,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#false} isinf_float_~ix~1#1 := ~bvand32(2147483647bv32, isinf_float_~ix~1#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~1#1 then 1bv32 else 0bv32); {40#false} is VALID [2022-02-20 16:42:30,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#false} main_#t~ret9#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true; {40#false} is VALID [2022-02-20 16:42:30,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#false} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {40#false} is VALID [2022-02-20 16:42:30,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-02-20 16:42:30,869 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:30,869 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:42:30,870 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:42:30,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1298663131] [2022-02-20 16:42:30,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1298663131] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:30,870 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:30,870 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:42:30,871 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274488820] [2022-02-20 16:42:30,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:30,875 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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:30,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:30,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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:30,927 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:30,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:42:30,928 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:42:30,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:42:30,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:42:30,946 INFO L87 Difference]: Start difference. First operand has 36 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 35 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 has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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:31,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:31,412 INFO L93 Difference]: Finished difference Result 70 states and 108 transitions. [2022-02-20 16:42:31,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:42:31,413 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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:31,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:31,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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:31,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 108 transitions. [2022-02-20 16:42:31,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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:31,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 108 transitions. [2022-02-20 16:42:31,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 108 transitions. [2022-02-20 16:42:31,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:31,952 INFO L225 Difference]: With dead ends: 70 [2022-02-20 16:42:31,952 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 16:42:31,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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:31,965 INFO L933 BasicCegarLoop]: 46 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, 46 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:31,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 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:31,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 16:42:31,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-02-20 16:42:31,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:31,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 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:31,998 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 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:31,998 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 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:32,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:32,005 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-02-20 16:42:32,006 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-02-20 16:42:32,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:32,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:32,007 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 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 33 states. [2022-02-20 16:42:32,009 INFO L87 Difference]: Start difference. First operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 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 33 states. [2022-02-20 16:42:32,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:32,013 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-02-20 16:42:32,013 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-02-20 16:42:32,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:32,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:32,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:32,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:32,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 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:32,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-02-20 16:42:32,024 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 11 [2022-02-20 16:42:32,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:32,025 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-02-20 16:42:32,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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:32,027 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-02-20 16:42:32,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:42:32,028 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:32,030 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:32,043 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:32,241 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:32,241 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:32,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:32,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1305768564, now seen corresponding path program 1 times [2022-02-20 16:42:32,242 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:42:32,243 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1993610472] [2022-02-20 16:42:32,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:32,243 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:42:32,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:42:32,247 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:32,248 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:32,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:32,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 16:42:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:32,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:42:32,880 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)); {270#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:42:32,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {270#(= currentRoundingMode roundNearestTiesToEven)} 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_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~to_fp~FLOAT(currentRoundingMode, 1.0), ~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; {274#(and (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:42:32,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {274#(and (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} 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; {274#(and (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:42:32,888 INFO L290 TraceCheckUtils]: 3: Hoare triple {274#(and (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} goto; {274#(and (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:42:32,889 INFO L290 TraceCheckUtils]: 4: Hoare triple {274#(and (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} __ieee754_sqrtf_~hx~0#1 := ~bvand32(2147483647bv32, __ieee754_sqrtf_~ix~0#1); {274#(and (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:42:32,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {274#(and (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} 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); {287#(= (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)) (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) |ULTIMATE.start___ieee754_sqrtf_#res#1|)} is VALID [2022-02-20 16:42:32,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {287#(= (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)) (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) |ULTIMATE.start___ieee754_sqrtf_#res#1|)} 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;assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_~res~0#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem7#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, isinf_float_~x#1, isinf_float_~ix~1#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~1#1; {291#(= (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)) (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) |ULTIMATE.start_isinf_float_~x#1|)} is VALID [2022-02-20 16:42:32,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {291#(= (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)) (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) |ULTIMATE.start_isinf_float_~x#1|)} call isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isinf_float_~x#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, 4bv32);call isinf_float_#t~mem7#1 := read~intINTTYPE4(isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, 4bv32);isinf_float_~ix~1#1 := isinf_float_#t~mem7#1;havoc isinf_float_#t~mem7#1;call ULTIMATE.dealloc(isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset);havoc isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset; {295#(= (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)) (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~1#1|)))} is VALID [2022-02-20 16:42:32,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {295#(= (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)) (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~1#1|)))} goto; {295#(= (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)) (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~1#1|)))} is VALID [2022-02-20 16:42:32,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {295#(= (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)) (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~1#1|)))} isinf_float_~ix~1#1 := ~bvand32(2147483647bv32, isinf_float_~ix~1#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~1#1 then 1bv32 else 0bv32); {302#(= |ULTIMATE.start_isinf_float_#res#1| (_ bv1 32))} is VALID [2022-02-20 16:42:32,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {302#(= |ULTIMATE.start_isinf_float_#res#1| (_ bv1 32))} main_#t~ret9#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true; {306#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret9#1|)} is VALID [2022-02-20 16:42:32,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {306#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret9#1|)} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {266#false} is VALID [2022-02-20 16:42:32,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {266#false} assume !false; {266#false} is VALID [2022-02-20 16:42:32,895 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:32,895 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:42:32,895 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:42:32,895 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1993610472] [2022-02-20 16:42:32,895 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1993610472] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:32,896 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:32,896 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 16:42:32,896 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913113443] [2022-02-20 16:42:32,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:32,897 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 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 13 [2022-02-20 16:42:32,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:32,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 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:32,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:32,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 16:42:32,964 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:42:32,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 16:42:32,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:42:32,965 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 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:36,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:36,147 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-02-20 16:42:36,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 16:42:36,147 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 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 13 [2022-02-20 16:42:36,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:36,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 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:36,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-02-20 16:42:36,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 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:36,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-02-20 16:42:36,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-02-20 16:42:36,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:36,401 INFO L225 Difference]: With dead ends: 41 [2022-02-20 16:42:36,401 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 16:42:36,401 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-02-20 16:42:36,402 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 55 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-20 16:42:36,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 196 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-02-20 16:42:36,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 16:42:36,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-02-20 16:42:36,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:36,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:36,405 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:36,405 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:36,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:36,407 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-02-20 16:42:36,407 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-02-20 16:42:36,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:36,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:36,409 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 33 states. [2022-02-20 16:42:36,409 INFO L87 Difference]: Start difference. First operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 33 states. [2022-02-20 16:42:36,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:36,412 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-02-20 16:42:36,412 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-02-20 16:42:36,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:36,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:36,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:36,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:36,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:36,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2022-02-20 16:42:36,418 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 13 [2022-02-20 16:42:36,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:36,418 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-02-20 16:42:36,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 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:36,419 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-02-20 16:42:36,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:42:36,420 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:36,420 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:36,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:42:36,650 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:36,651 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:36,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:36,652 INFO L85 PathProgramCache]: Analyzing trace with hash -358919737, now seen corresponding path program 1 times [2022-02-20 16:42:36,653 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:42:36,655 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1755412219] [2022-02-20 16:42:36,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:36,657 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:42:36,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:42:36,658 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:36,659 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:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:36,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:42:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:36,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:42:37,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {479#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)); {479#true} is VALID [2022-02-20 16:42:37,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {479#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_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~to_fp~FLOAT(currentRoundingMode, 1.0), ~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; {487#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:42:37,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {487#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +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; {491#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +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:37,040 INFO L290 TraceCheckUtils]: 3: Hoare triple {491#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +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; {491#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +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:37,042 INFO L290 TraceCheckUtils]: 4: Hoare triple {491#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +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); {498#(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|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +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:37,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {498#(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|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +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); {480#false} is VALID [2022-02-20 16:42:37,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {480#false} assume !(0bv32 == __ieee754_sqrtf_~hx~0#1); {480#false} is VALID [2022-02-20 16:42:37,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {480#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)); {480#false} is VALID [2022-02-20 16:42:37,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {480#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;assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_~res~0#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem7#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, isinf_float_~x#1, isinf_float_~ix~1#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~1#1; {480#false} is VALID [2022-02-20 16:42:37,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {480#false} call isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isinf_float_~x#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, 4bv32);call isinf_float_#t~mem7#1 := read~intINTTYPE4(isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, 4bv32);isinf_float_~ix~1#1 := isinf_float_#t~mem7#1;havoc isinf_float_#t~mem7#1;call ULTIMATE.dealloc(isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset);havoc isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset; {480#false} is VALID [2022-02-20 16:42:37,044 INFO L290 TraceCheckUtils]: 10: Hoare triple {480#false} goto; {480#false} is VALID [2022-02-20 16:42:37,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {480#false} isinf_float_~ix~1#1 := ~bvand32(2147483647bv32, isinf_float_~ix~1#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~1#1 then 1bv32 else 0bv32); {480#false} is VALID [2022-02-20 16:42:37,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {480#false} main_#t~ret9#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true; {480#false} is VALID [2022-02-20 16:42:37,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {480#false} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {480#false} is VALID [2022-02-20 16:42:37,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {480#false} assume !false; {480#false} is VALID [2022-02-20 16:42:37,045 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:37,045 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:42:37,045 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:42:37,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1755412219] [2022-02-20 16:42:37,045 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1755412219] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:37,046 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:37,046 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:42:37,046 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399043599] [2022-02-20 16:42:37,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:37,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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:37,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:37,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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:37,188 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:37,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:42:37,189 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:42:37,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:42:37,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:42:37,189 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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:37,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:37,227 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-02-20 16:42:37,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:42:37,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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:37,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:37,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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:37,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:42:37,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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:37,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:42:37,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-02-20 16:42:37,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:37,419 INFO L225 Difference]: With dead ends: 33 [2022-02-20 16:42:37,419 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:42:37,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:42:37,420 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:42:37,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-02-20 16:42:37,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:42:37,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:42:37,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:37,421 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:37,421 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:37,421 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:37,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:37,421 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:42:37,422 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:42:37,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:37,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:37,422 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:37,422 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:37,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:37,424 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:42:37,424 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:42:37,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:37,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:37,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:37,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:37,424 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:37,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:42:37,424 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2022-02-20 16:42:37,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:37,424 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:42:37,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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:37,424 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:42:37,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:37,426 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:42:37,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-02-20 16:42:37,627 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:37,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:42:37,785 INFO L854 garLoopResultBuilder]: At program point L52-2(lines 52 61) the Hoare annotation is: false [2022-02-20 16:42:37,785 INFO L858 garLoopResultBuilder]: For program point L52-3(lines 16 81) no Hoare annotation was computed. [2022-02-20 16:42:37,786 INFO L858 garLoopResultBuilder]: For program point L44(lines 44 45) no Hoare annotation was computed. [2022-02-20 16:42:37,786 INFO L858 garLoopResultBuilder]: For program point L44-2(lines 44 45) no Hoare annotation was computed. [2022-02-20 16:42:37,786 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:42:37,786 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:42:37,786 INFO L858 garLoopResultBuilder]: For program point L28(lines 28 29) no Hoare annotation was computed. [2022-02-20 16:42:37,786 INFO L858 garLoopResultBuilder]: For program point L86-1(lines 86 90) no Hoare annotation was computed. [2022-02-20 16:42:37,786 INFO L854 garLoopResultBuilder]: At program point L86-2(lines 86 90) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))) (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse1) .cse1)))) (and (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= .cse0 |ULTIMATE.start_isinf_float_~x#1|) (= .cse0 |ULTIMATE.start___ieee754_sqrtf_#res#1|) (= currentRoundingMode roundNearestTiesToEven))) [2022-02-20 16:42:37,786 INFO L858 garLoopResultBuilder]: For program point L86-3(lines 86 90) no Hoare annotation was computed. [2022-02-20 16:42:37,786 INFO L858 garLoopResultBuilder]: For program point L37(lines 37 41) no Hoare annotation was computed. [2022-02-20 16:42:37,786 INFO L858 garLoopResultBuilder]: For program point L37-2(lines 37 41) no Hoare annotation was computed. [2022-02-20 16:42:37,786 INFO L858 garLoopResultBuilder]: For program point L54(lines 54 58) no Hoare annotation was computed. [2022-02-20 16:42:37,786 INFO L858 garLoopResultBuilder]: For program point L21-1(lines 21 25) no Hoare annotation was computed. [2022-02-20 16:42:37,786 INFO L858 garLoopResultBuilder]: For program point L54-2(lines 54 58) no Hoare annotation was computed. [2022-02-20 16:42:37,786 INFO L854 garLoopResultBuilder]: At program point L21-2(lines 21 25) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))) (= currentRoundingMode roundNearestTiesToEven)) [2022-02-20 16:42:37,786 INFO L858 garLoopResultBuilder]: For program point L21-3(lines 21 25) no Hoare annotation was computed. [2022-02-20 16:42:37,786 INFO L858 garLoopResultBuilder]: For program point L38-2(lines 38 39) no Hoare annotation was computed. [2022-02-20 16:42:37,787 INFO L854 garLoopResultBuilder]: At program point L38-3(lines 38 39) the Hoare annotation is: false [2022-02-20 16:42:37,787 INFO L858 garLoopResultBuilder]: For program point L38-4(lines 38 39) no Hoare annotation was computed. [2022-02-20 16:42:37,787 INFO L858 garLoopResultBuilder]: For program point L63(lines 63 72) no Hoare annotation was computed. [2022-02-20 16:42:37,787 INFO L861 garLoopResultBuilder]: At program point L113(lines 95 114) the Hoare annotation is: true [2022-02-20 16:42:37,787 INFO L854 garLoopResultBuilder]: At program point L80(lines 16 81) the Hoare annotation is: (and (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= (let ((.cse0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))) (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse0) .cse0)) |ULTIMATE.start___ieee754_sqrtf_#res#1|) (= currentRoundingMode roundNearestTiesToEven)) [2022-02-20 16:42:37,787 INFO L858 garLoopResultBuilder]: For program point L31(lines 31 32) no Hoare annotation was computed. [2022-02-20 16:42:37,787 INFO L858 garLoopResultBuilder]: For program point L65(lines 65 71) no Hoare annotation was computed. [2022-02-20 16:42:37,787 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:42:37,787 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2022-02-20 16:42:37,787 INFO L858 garLoopResultBuilder]: For program point L33(lines 33 34) no Hoare annotation was computed. [2022-02-20 16:42:37,787 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:42:37,787 INFO L858 garLoopResultBuilder]: For program point L108(lines 108 111) no Hoare annotation was computed. [2022-02-20 16:42:37,787 INFO L858 garLoopResultBuilder]: For program point L75-1(lines 75 79) no Hoare annotation was computed. [2022-02-20 16:42:37,787 INFO L854 garLoopResultBuilder]: At program point L75-2(lines 75 79) the Hoare annotation is: false [2022-02-20 16:42:37,787 INFO L858 garLoopResultBuilder]: For program point L75-3(lines 75 79) no Hoare annotation was computed. [2022-02-20 16:42:37,788 INFO L858 garLoopResultBuilder]: For program point L67(lines 67 70) no Hoare annotation was computed. [2022-02-20 16:42:37,788 INFO L854 garLoopResultBuilder]: At program point L92(lines 84 93) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))) (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse1) .cse1)))) (and (= .cse0 (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~1#1|))) (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= .cse0 |ULTIMATE.start_isinf_float_~x#1|) (= .cse0 |ULTIMATE.start___ieee754_sqrtf_#res#1|) (= |ULTIMATE.start_isinf_float_#res#1| (_ bv1 32)) (= currentRoundingMode roundNearestTiesToEven))) [2022-02-20 16:42:37,788 INFO L858 garLoopResultBuilder]: For program point L109(line 109) no Hoare annotation was computed. [2022-02-20 16:42:37,790 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:42:37,790 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:42:37,795 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:42:37,795 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:42:37,795 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:42:37,795 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-02-20 16:42:37,795 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:42:37,795 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:42:37,795 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-02-20 16:42:37,795 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:42:37,795 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:42:37,796 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 16:42:37,796 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 16:42:37,796 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-02-20 16:42:37,796 WARN L170 areAnnotationChecker]: L86-3 has no Hoare annotation [2022-02-20 16:42:37,796 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 16:42:37,796 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 16:42:37,796 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-02-20 16:42:37,796 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-02-20 16:42:37,796 WARN L170 areAnnotationChecker]: L86-3 has no Hoare annotation [2022-02-20 16:42:37,796 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 16:42:37,796 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 16:42:37,796 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2022-02-20 16:42:37,796 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2022-02-20 16:42:37,796 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2022-02-20 16:42:37,796 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-02-20 16:42:37,796 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2022-02-20 16:42:37,796 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2022-02-20 16:42:37,796 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2022-02-20 16:42:37,796 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2022-02-20 16:42:37,796 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-02-20 16:42:37,796 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 16:42:37,796 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 16:42:37,796 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:42:37,797 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:42:37,797 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:42:37,797 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2022-02-20 16:42:37,797 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:42:37,797 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2022-02-20 16:42:37,797 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2022-02-20 16:42:37,797 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:42:37,797 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2022-02-20 16:42:37,797 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2022-02-20 16:42:37,797 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:42:37,797 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:42:37,797 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-02-20 16:42:37,797 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-02-20 16:42:37,797 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-02-20 16:42:37,797 WARN L170 areAnnotationChecker]: L54-2 has no Hoare annotation [2022-02-20 16:42:37,797 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-02-20 16:42:37,797 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-02-20 16:42:37,797 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2022-02-20 16:42:37,797 WARN L170 areAnnotationChecker]: L75-3 has no Hoare annotation [2022-02-20 16:42:37,797 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2022-02-20 16:42:37,797 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2022-02-20 16:42:37,797 WARN L170 areAnnotationChecker]: L75-3 has no Hoare annotation [2022-02-20 16:42:37,797 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:42:37,799 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,800 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,800 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,800 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,800 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,800 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,800 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,800 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,800 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,800 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,801 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,801 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,801 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,801 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,801 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,801 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,801 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,801 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,801 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,801 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,801 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,801 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,801 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,801 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,802 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,817 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,818 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,818 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,818 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,818 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,818 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,818 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,818 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,818 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,818 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,818 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,818 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,819 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,819 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,819 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,819 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,819 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,819 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,819 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,819 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,819 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,819 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,819 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,819 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,819 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,821 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:42:37,821 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:42:37,821 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,821 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:42:37,822 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:42:37,822 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,822 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,822 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,822 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,822 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,822 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,822 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,822 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,822 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,822 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,823 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,823 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,823 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,823 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,823 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,823 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,823 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,823 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,824 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,824 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,824 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,824 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,824 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,824 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,824 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,824 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,824 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,824 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,824 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,824 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,824 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,824 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,824 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,824 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,825 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,825 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,825 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,825 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,825 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,826 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,826 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,826 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,826 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,826 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,826 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,826 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,826 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,826 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,826 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,827 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,827 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,827 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,827 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:42:37 BoogieIcfgContainer [2022-02-20 16:42:37,827 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:42:37,828 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:42:37,828 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:42:37,828 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:42:37,828 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:30" (3/4) ... [2022-02-20 16:42:37,830 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:42:37,838 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-02-20 16:42:37,838 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-02-20 16:42:37,838 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:42:37,838 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:42:37,855 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-02-20 16:42:37,855 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (x == ~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0), ~Pluszero~LONGDOUBLE()) && ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())), ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())) == \result) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-02-20 16:42:37,856 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((x == ~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0), ~Pluszero~LONGDOUBLE()) && ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())), ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())) == x) && ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())), ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())) == \result) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-02-20 16:42:37,856 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())), ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())) == ~fp~LONGDOUBLE(ix[31:31], ix[30:23], ix[22:0]) && x == ~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0), ~Pluszero~LONGDOUBLE())) && ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())), ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())) == x) && ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())), ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())) == \result) && \result == 1bv32) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-02-20 16:42:37,879 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:42:37,879 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:42:37,880 INFO L158 Benchmark]: Toolchain (without parser) took 8621.81ms. Allocated memory was 52.4MB in the beginning and 79.7MB in the end (delta: 27.3MB). Free memory was 29.1MB in the beginning and 38.4MB in the end (delta: -9.4MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2022-02-20 16:42:37,883 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 52.4MB. Free memory was 34.1MB in the beginning and 34.0MB in the end (delta: 47.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:42:37,884 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.02ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 28.9MB in the beginning and 43.3MB in the end (delta: -14.4MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2022-02-20 16:42:37,884 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.35ms. Allocated memory is still 62.9MB. Free memory was 43.3MB in the beginning and 41.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:42:37,884 INFO L158 Benchmark]: Boogie Preprocessor took 54.52ms. Allocated memory is still 62.9MB. Free memory was 41.2MB in the beginning and 39.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:42:37,884 INFO L158 Benchmark]: RCFGBuilder took 802.90ms. Allocated memory is still 62.9MB. Free memory was 39.3MB in the beginning and 39.8MB in the end (delta: -574.4kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 16:42:37,885 INFO L158 Benchmark]: TraceAbstraction took 7336.65ms. Allocated memory was 62.9MB in the beginning and 79.7MB in the end (delta: 16.8MB). Free memory was 39.1MB in the beginning and 42.1MB in the end (delta: -3.0MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2022-02-20 16:42:37,885 INFO L158 Benchmark]: Witness Printer took 51.29ms. Allocated memory is still 79.7MB. Free memory was 42.1MB in the beginning and 38.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:42:37,886 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.18ms. Allocated memory is still 52.4MB. Free memory was 34.1MB in the beginning and 34.0MB in the end (delta: 47.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.02ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 28.9MB in the beginning and 43.3MB in the end (delta: -14.4MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.35ms. Allocated memory is still 62.9MB. Free memory was 43.3MB in the beginning and 41.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.52ms. Allocated memory is still 62.9MB. Free memory was 41.2MB in the beginning and 39.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 802.90ms. Allocated memory is still 62.9MB. Free memory was 39.3MB in the beginning and 39.8MB in the end (delta: -574.4kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7336.65ms. Allocated memory was 62.9MB in the beginning and 79.7MB in the end (delta: 16.8MB). Free memory was 39.1MB in the beginning and 42.1MB in the end (delta: -3.0MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * Witness Printer took 51.29ms. Allocated memory is still 79.7MB. Free memory was 42.1MB in the beginning and 38.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * 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: 109]: 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, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 55 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 55 mSDsluCounter, 250 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4 IncrementalHoareTripleChecker+Unchecked, 169 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 61 IncrementalHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 81 mSDtfsCounter, 61 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, InterpolantAutomatonStates: 16, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 13 NumberOfFragments, 206 HoareAnnotationTreeSize, 8 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 8 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 36 ConstructedInterpolants, 4 QuantifiedInterpolants, 247 SizeOfPredicates, 18 NumberOfNonLiveVariables, 149 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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: 84]: Loop Invariant [2022-02-20 16:42:37,910 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,911 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,911 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,911 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,911 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,911 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,911 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,911 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,912 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,912 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,912 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,912 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,912 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,912 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,912 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,912 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,914 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,914 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,915 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,915 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,915 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,915 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,915 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,915 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,915 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,916 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,916 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,916 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,916 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,916 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,916 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,916 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,916 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())), ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())) == ~fp~LONGDOUBLE(ix[31:31], ix[30:23], ix[22:0]) && x == ~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0), ~Pluszero~LONGDOUBLE())) && ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())), ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())) == x) && ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())), ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())) == \result) && \result == 1bv32) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - 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 [2022-02-20 16:42:37,918 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:42:37,919 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:42:37,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,919 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:42:37,919 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:42:37,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 86]: Loop Invariant [2022-02-20 16:42:37,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,921 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,921 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,921 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,921 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,921 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,921 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,921 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,922 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,922 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,922 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,922 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,922 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,922 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,922 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,923 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,923 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,923 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,923 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,923 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,923 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,923 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,923 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,924 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,924 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((x == ~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0), ~Pluszero~LONGDOUBLE()) && ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())), ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())) == x) && ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())), ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())) == \result) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 16]: Loop Invariant [2022-02-20 16:42:37,924 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,925 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,925 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,925 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,925 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,925 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,925 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,925 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,925 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,926 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,926 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,926 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,926 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,926 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,926 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,926 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,926 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:37,927 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (x == ~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0), ~Pluszero~LONGDOUBLE()) && ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())), ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())) == \result) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven RESULT: Ultimate proved your program to be correct! [2022-02-20 16:42:37,972 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