./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1032b.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_1032b.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 ef387b9dfe6a568fd7853720ccee1caca2dc0e11798e2bafc997da20a8b7d09b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:45:56,207 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:45:56,209 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:45:56,241 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:45:56,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:45:56,243 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:45:56,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:45:56,246 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:45:56,248 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:45:56,248 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:45:56,249 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:45:56,250 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:45:56,250 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:45:56,251 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:45:56,252 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:45:56,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:45:56,254 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:45:56,254 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:45:56,256 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:45:56,258 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:45:56,259 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:45:56,260 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:45:56,261 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:45:56,263 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:45:56,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:45:56,277 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:45:56,278 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:45:56,278 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:45:56,280 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:45:56,281 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:45:56,281 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:45:56,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:45:56,282 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:45:56,283 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:45:56,284 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:45:56,286 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:45:56,287 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:45:56,288 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:45:56,288 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:45:56,289 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:45:56,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:45:56,290 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:45:56,312 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:45:56,313 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:45:56,313 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:45:56,313 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:45:56,314 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:45:56,314 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:45:56,315 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:45:56,315 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:45:56,315 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:45:56,315 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:45:56,316 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:45:56,316 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:45:56,316 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:45:56,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:45:56,317 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:45:56,317 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:45:56,317 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:45:56,317 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:45:56,317 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:45:56,318 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:45:56,318 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:45:56,318 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:45:56,318 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:45:56,318 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:45:56,318 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:45:56,319 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:45:56,319 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:45:56,319 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:45:56,319 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:45:56,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:45:56,320 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:45:56,320 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:45:56,320 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:45:56,320 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 -> ef387b9dfe6a568fd7853720ccee1caca2dc0e11798e2bafc997da20a8b7d09b [2022-02-20 16:45:56,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:45:56,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:45:56,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:45:56,597 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:45:56,597 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:45:56,598 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1032b.c [2022-02-20 16:45:56,665 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be754f69c/bfe84be6d1de4efd9bf1ea362de1cf40/FLAGcc229c82c [2022-02-20 16:45:56,980 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:45:56,980 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1032b.c [2022-02-20 16:45:56,985 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be754f69c/bfe84be6d1de4efd9bf1ea362de1cf40/FLAGcc229c82c [2022-02-20 16:45:57,417 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be754f69c/bfe84be6d1de4efd9bf1ea362de1cf40 [2022-02-20 16:45:57,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:45:57,420 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:45:57,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:45:57,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:45:57,429 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:45:57,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:45:57" (1/1) ... [2022-02-20 16:45:57,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e6cc51d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:45:57, skipping insertion in model container [2022-02-20 16:45:57,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:45:57" (1/1) ... [2022-02-20 16:45:57,441 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:45:57,455 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:45:57,581 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_1032b.c[1753,1766] [2022-02-20 16:45:57,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:45:57,597 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:45:57,615 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_1032b.c[1753,1766] [2022-02-20 16:45:57,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:45:57,628 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:45:57,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:45:57 WrapperNode [2022-02-20 16:45:57,629 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:45:57,630 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:45:57,630 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:45:57,630 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:45:57,637 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:45:57" (1/1) ... [2022-02-20 16:45:57,643 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:45:57" (1/1) ... [2022-02-20 16:45:57,698 INFO L137 Inliner]: procedures = 17, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 88 [2022-02-20 16:45:57,704 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:45:57,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:45:57,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:45:57,705 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:45:57,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:45:57" (1/1) ... [2022-02-20 16:45:57,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:45:57" (1/1) ... [2022-02-20 16:45:57,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:45:57" (1/1) ... [2022-02-20 16:45:57,713 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:45:57" (1/1) ... [2022-02-20 16:45:57,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:45:57" (1/1) ... [2022-02-20 16:45:57,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:45:57" (1/1) ... [2022-02-20 16:45:57,727 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:45:57" (1/1) ... [2022-02-20 16:45:57,730 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:45:57,731 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:45:57,731 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:45:57,731 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:45:57,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:45:57" (1/1) ... [2022-02-20 16:45:57,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:45:57,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:45:57,761 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:45:57,771 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:45:57,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:45:57,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:45:57,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:45:57,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:45:57,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:45:57,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:45:57,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:45:57,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:45:57,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:45:57,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:45:57,861 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:45:57,862 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:45:58,041 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:45:58,047 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:45:58,047 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 16:45:58,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:45:58 BoogieIcfgContainer [2022-02-20 16:45:58,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:45:58,051 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:45:58,051 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:45:58,054 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:45:58,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:45:57" (1/3) ... [2022-02-20 16:45:58,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7106f031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:45:58, skipping insertion in model container [2022-02-20 16:45:58,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:45:57" (2/3) ... [2022-02-20 16:45:58,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7106f031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:45:58, skipping insertion in model container [2022-02-20 16:45:58,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:45:58" (3/3) ... [2022-02-20 16:45:58,057 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1032b.c [2022-02-20 16:45:58,060 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:45:58,061 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:45:58,095 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:45:58,101 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:45:58,101 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:45:58,114 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.608695652173913) internal successors, (37), 24 states have internal predecessors, (37), 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:45:58,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:45:58,123 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:45:58,123 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:45:58,124 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:45:58,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:45:58,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1590452317, now seen corresponding path program 1 times [2022-02-20 16:45:58,137 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:45:58,137 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117081371] [2022-02-20 16:45:58,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:45:58,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:45:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:45:58,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#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); {28#true} is VALID [2022-02-20 16:45:58,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_#t~short9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someUnaryFLOAToperation(0.0);assume { :begin_inline_round_float } true;round_float_#in~x#1 := main_~x~0#1;havoc round_float_#res#1;havoc round_float_#t~mem4#1, round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, round_float_~exponent_mask~0#1, round_float_#t~mem5#1, round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset, round_float_~x#1, round_float_~w~0#1, round_float_~exponent_less_127~0#1;round_float_~x#1 := round_float_#in~x#1;havoc round_float_~w~0#1;havoc round_float_~exponent_less_127~0#1; {28#true} is VALID [2022-02-20 16:45:58,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-02-20 16:45:58,264 INFO L290 TraceCheckUtils]: 3: Hoare triple {29#false} round_float_~exponent_less_127~0#1 := (if (if 0 == round_float_~w~0#1 then 0 else (if 1 == round_float_~w~0#1 then 0 else ~bitwiseAnd(round_float_~w~0#1, 2139095040))) / 8388608 % 4294967296 % 4294967296 <= 2147483647 then (if 0 == round_float_~w~0#1 then 0 else (if 1 == round_float_~w~0#1 then 0 else ~bitwiseAnd(round_float_~w~0#1, 2139095040))) / 8388608 % 4294967296 % 4294967296 else (if 0 == round_float_~w~0#1 then 0 else (if 1 == round_float_~w~0#1 then 0 else ~bitwiseAnd(round_float_~w~0#1, 2139095040))) / 8388608 % 4294967296 % 4294967296 - 4294967296) - 127; {29#false} is VALID [2022-02-20 16:45:58,264 INFO L290 TraceCheckUtils]: 4: Hoare triple {29#false} assume !(round_float_~exponent_less_127~0#1 < 23); {29#false} is VALID [2022-02-20 16:45:58,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#false} assume 128 == round_float_~exponent_less_127~0#1;round_float_#res#1 := ~someBinaryArithmeticFLOAToperation(round_float_~x#1, round_float_~x#1); {29#false} is VALID [2022-02-20 16:45:58,265 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#false} main_#t~ret7#1 := round_float_#res#1;assume { :end_inline_round_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_#t~short9#1 := ~someBinaryFLOATComparisonOperation(main_~res~0#1, ~someUnaryFLOAToperation(0.0)); {29#false} is VALID [2022-02-20 16:45:58,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#false} assume !main_#t~short9#1; {29#false} is VALID [2022-02-20 16:45:58,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#false} assume !main_#t~short9#1;havoc main_#t~ret8#1;havoc main_#t~short9#1; {29#false} is VALID [2022-02-20 16:45:58,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-02-20 16:45:58,266 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:45:58,267 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:45:58,267 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117081371] [2022-02-20 16:45:58,267 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117081371] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:45:58,268 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:45:58,268 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:45:58,269 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780153015] [2022-02-20 16:45:58,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:45:58,274 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:45:58,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:45:58,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:45:58,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:45:58,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:45:58,291 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:45:58,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:45:58,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:45:58,311 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.608695652173913) internal successors, (37), 24 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:45:58,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:45:58,359 INFO L93 Difference]: Finished difference Result 48 states and 72 transitions. [2022-02-20 16:45:58,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:45:58,360 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:45:58,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:45:58,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:45:58,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 72 transitions. [2022-02-20 16:45:58,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:45:58,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 72 transitions. [2022-02-20 16:45:58,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 72 transitions. [2022-02-20 16:45:58,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:45:58,473 INFO L225 Difference]: With dead ends: 48 [2022-02-20 16:45:58,473 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 16:45:58,476 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:45:58,478 INFO L933 BasicCegarLoop]: 30 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, 30 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:45:58,479 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:45:58,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 16:45:58,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 16:45:58,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:45:58,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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:45:58,500 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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:45:58,500 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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:45:58,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:45:58,503 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-02-20 16:45:58,503 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-02-20 16:45:58,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:45:58,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:45:58,504 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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 22 states. [2022-02-20 16:45:58,505 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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 22 states. [2022-02-20 16:45:58,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:45:58,507 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-02-20 16:45:58,507 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-02-20 16:45:58,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:45:58,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:45:58,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:45:58,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:45:58,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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:45:58,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-02-20 16:45:58,512 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 10 [2022-02-20 16:45:58,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:45:58,512 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-02-20 16:45:58,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:45:58,513 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-02-20 16:45:58,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:45:58,513 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:45:58,513 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:45:58,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:45:58,514 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:45:58,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:45:58,515 INFO L85 PathProgramCache]: Analyzing trace with hash -744854880, now seen corresponding path program 1 times [2022-02-20 16:45:58,515 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:45:58,515 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211260881] [2022-02-20 16:45:58,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:45:58,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:45:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:45:58,591 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:45:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:45:58,635 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:45:58,635 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:45:58,636 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:45:58,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:45:58,640 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:45:58,642 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:45:58,661 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:45:58,663 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:45:58,663 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-02-20 16:45:58,663 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-02-20 16:45:58,663 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-20 16:45:58,663 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-20 16:45:58,664 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-02-20 16:45:58,664 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:45:58,664 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:45:58,664 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:45:58,664 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:45:58,664 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:45:58,665 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:45:58,665 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:45:58,665 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:45:58,665 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 16:45:58,666 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 16:45:58,666 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:45:58,666 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-02-20 16:45:58,666 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-02-20 16:45:58,667 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-02-20 16:45:58,667 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-02-20 16:45:58,667 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-02-20 16:45:58,667 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-02-20 16:45:58,667 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-02-20 16:45:58,667 WARN L170 areAnnotationChecker]: L60-2 has no Hoare annotation [2022-02-20 16:45:58,668 WARN L170 areAnnotationChecker]: L60-2 has no Hoare annotation [2022-02-20 16:45:58,668 WARN L170 areAnnotationChecker]: L81-2 has no Hoare annotation [2022-02-20 16:45:58,668 WARN L170 areAnnotationChecker]: L81-2 has no Hoare annotation [2022-02-20 16:45:58,668 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2022-02-20 16:45:58,668 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2022-02-20 16:45:58,669 WARN L170 areAnnotationChecker]: L60-3 has no Hoare annotation [2022-02-20 16:45:58,669 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-20 16:45:58,669 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-20 16:45:58,669 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2022-02-20 16:45:58,669 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:45:58,669 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:45:58,669 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:45:58,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:45:58 BoogieIcfgContainer [2022-02-20 16:45:58,671 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:45:58,672 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:45:58,672 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:45:58,672 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:45:58,673 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:45:58" (3/4) ... [2022-02-20 16:45:58,676 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:45:58,676 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:45:58,678 INFO L158 Benchmark]: Toolchain (without parser) took 1256.86ms. Allocated memory is still 111.1MB. Free memory was 72.6MB in the beginning and 35.1MB in the end (delta: 37.5MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. [2022-02-20 16:45:58,678 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 111.1MB. Free memory is still 89.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:45:58,680 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.21ms. Allocated memory is still 111.1MB. Free memory was 72.5MB in the beginning and 61.4MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 16:45:58,684 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.09ms. Allocated memory is still 111.1MB. Free memory was 61.3MB in the beginning and 90.0MB in the end (delta: -28.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:45:58,684 INFO L158 Benchmark]: Boogie Preprocessor took 25.27ms. Allocated memory is still 111.1MB. Free memory was 90.0MB in the beginning and 88.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:45:58,685 INFO L158 Benchmark]: RCFGBuilder took 319.29ms. Allocated memory is still 111.1MB. Free memory was 88.4MB in the beginning and 73.1MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 16:45:58,686 INFO L158 Benchmark]: TraceAbstraction took 620.13ms. Allocated memory is still 111.1MB. Free memory was 72.9MB in the beginning and 35.5MB in the end (delta: 37.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-02-20 16:45:58,687 INFO L158 Benchmark]: Witness Printer took 4.01ms. Allocated memory is still 111.1MB. Free memory was 35.5MB in the beginning and 35.1MB in the end (delta: 415.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:45:58,693 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 111.1MB. Free memory is still 89.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.21ms. Allocated memory is still 111.1MB. Free memory was 72.5MB in the beginning and 61.4MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.09ms. Allocated memory is still 111.1MB. Free memory was 61.3MB in the beginning and 90.0MB in the end (delta: -28.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.27ms. Allocated memory is still 111.1MB. Free memory was 90.0MB in the beginning and 88.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 319.29ms. Allocated memory is still 111.1MB. Free memory was 88.4MB in the beginning and 73.1MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 620.13ms. Allocated memory is still 111.1MB. Free memory was 72.9MB in the beginning and 35.5MB in the end (delta: 37.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Witness Printer took 4.01ms. Allocated memory is still 111.1MB. Free memory was 35.5MB in the beginning and 35.1MB in the end (delta: 415.8kB). 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: 82]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of bitwiseAnd at line 25, overapproximation of someUnaryFLOAToperation at line 77, overapproximation of someBinaryArithmeticFLOAToperation at line 45. Possible FailurePath: [L77] float x = -0.0f; [L78] CALL, EXPR round_float(x) [L15] __uint32_t w; [L17] int exponent_less_127; VAL [\old(x)=2139095042, x=2139095042] [L20] ieee_float_shape_type gf_u; [L21] gf_u.value = (x) [L22] EXPR gf_u.word [L22] (w) = gf_u.word [L25] exponent_less_127 = (int)((w & 0x7f800000) >> 23) - 127 VAL [\old(x)=2139095042, exponent_less_127=128, w=2139095041, x=2139095042] [L27] COND FALSE !(exponent_less_127 < 23) VAL [\old(x)=2139095042, exponent_less_127=128, w=2139095041, x=2139095042] [L43] COND TRUE exponent_less_127 == 128 [L45] return x + x; VAL [\old(x)=2139095042, exponent_less_127=128, w=2139095041, x=2139095042] [L78] RET, EXPR round_float(x) [L78] float res = round_float(x); [L81] EXPR res == -0.0f && __signbit_float(res) == 1 VAL [res=2139095043, res == -0.0f && __signbit_float(res) == 1=0, x=2139095042] [L81] COND TRUE !(res == -0.0f && __signbit_float(res) == 1) [L82] reach_error() VAL [res=2139095043, x=2139095042] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 30 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 9 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 16:45:58,737 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_1032b.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 ef387b9dfe6a568fd7853720ccee1caca2dc0e11798e2bafc997da20a8b7d09b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:00,621 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:00,624 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:00,657 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:00,658 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:00,662 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:00,664 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:00,667 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:00,669 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:00,672 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:00,673 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:00,674 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:00,684 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:00,685 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:00,686 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:00,687 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:00,688 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:00,689 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:00,690 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:00,692 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:00,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:00,694 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:00,695 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:00,696 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:00,698 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:00,699 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:00,699 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:00,700 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:00,700 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:00,701 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:00,701 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:00,702 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:00,703 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:00,703 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:00,704 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:00,705 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:00,705 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:00,706 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:00,706 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:00,707 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:00,707 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:00,708 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:46:00,731 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:00,733 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:00,734 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:00,734 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:00,735 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:00,735 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:00,736 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:00,736 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:00,737 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:00,737 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:00,738 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:00,738 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:00,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:00,738 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:00,738 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:00,739 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:00,739 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:46:00,739 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:46:00,739 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:46:00,739 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:00,740 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:00,740 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:00,740 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:00,740 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:00,740 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:00,741 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:00,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:00,741 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:00,741 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:00,741 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:00,742 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:46:00,742 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:46:00,742 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:00,742 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:00,742 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:00,743 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:46:00,743 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 -> ef387b9dfe6a568fd7853720ccee1caca2dc0e11798e2bafc997da20a8b7d09b [2022-02-20 16:46:01,079 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:01,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:01,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:01,107 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:01,108 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:01,109 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1032b.c [2022-02-20 16:46:01,161 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ccaa772e/57c7dfa392c040beaa20c16b3103582d/FLAGe718728d4 [2022-02-20 16:46:01,582 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:01,584 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1032b.c [2022-02-20 16:46:01,590 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ccaa772e/57c7dfa392c040beaa20c16b3103582d/FLAGe718728d4 [2022-02-20 16:46:01,981 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ccaa772e/57c7dfa392c040beaa20c16b3103582d [2022-02-20 16:46:01,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:01,984 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:01,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:01,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:01,990 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:01,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:01" (1/1) ... [2022-02-20 16:46:01,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29198737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:01, skipping insertion in model container [2022-02-20 16:46:01,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:01" (1/1) ... [2022-02-20 16:46:02,003 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:02,023 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:02,153 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_1032b.c[1753,1766] [2022-02-20 16:46:02,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:02,172 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:02,231 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_1032b.c[1753,1766] [2022-02-20 16:46:02,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:02,244 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:02,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:02 WrapperNode [2022-02-20 16:46:02,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:02,246 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:02,246 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:02,246 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:02,252 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:46:02" (1/1) ... [2022-02-20 16:46:02,259 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:46:02" (1/1) ... [2022-02-20 16:46:02,278 INFO L137 Inliner]: procedures = 20, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 88 [2022-02-20 16:46:02,278 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:02,279 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:02,279 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:02,279 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:02,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:02" (1/1) ... [2022-02-20 16:46:02,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:02" (1/1) ... [2022-02-20 16:46:02,289 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:02" (1/1) ... [2022-02-20 16:46:02,289 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:02" (1/1) ... [2022-02-20 16:46:02,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:02" (1/1) ... [2022-02-20 16:46:02,301 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:02" (1/1) ... [2022-02-20 16:46:02,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:02" (1/1) ... [2022-02-20 16:46:02,305 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:02,305 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:02,305 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:02,306 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:02,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:02" (1/1) ... [2022-02-20 16:46:02,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:02,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:02,332 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:46:02,353 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:46:02,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:02,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:46:02,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:02,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:46:02,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:46:02,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:02,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:02,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:46:02,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:46:02,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:02,463 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:02,464 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:02,735 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:02,741 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:02,746 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 16:46:02,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:02 BoogieIcfgContainer [2022-02-20 16:46:02,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:02,749 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:02,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:02,753 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:02,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:01" (1/3) ... [2022-02-20 16:46:02,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25073d72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:02, skipping insertion in model container [2022-02-20 16:46:02,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:02" (2/3) ... [2022-02-20 16:46:02,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25073d72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:02, skipping insertion in model container [2022-02-20 16:46:02,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:02" (3/3) ... [2022-02-20 16:46:02,757 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1032b.c [2022-02-20 16:46:02,762 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:02,762 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:02,811 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:02,816 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:46:02,816 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:02,828 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.608695652173913) internal successors, (37), 24 states have internal predecessors, (37), 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:46:02,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:46:02,831 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:02,832 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:02,832 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:02,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:02,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1590452317, now seen corresponding path program 1 times [2022-02-20 16:46:02,851 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:02,852 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [805023716] [2022-02-20 16:46:02,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:02,853 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:02,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:02,857 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:46:02,859 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:46:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:02,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:46:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:02,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:03,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#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); {28#true} is VALID [2022-02-20 16:46:03,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_#t~short9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());assume { :begin_inline_round_float } true;round_float_#in~x#1 := main_~x~0#1;havoc round_float_#res#1;havoc round_float_#t~mem4#1, round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, round_float_~exponent_mask~0#1, round_float_#t~mem5#1, round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset, round_float_~x#1, round_float_~w~0#1, round_float_~exponent_less_127~0#1;round_float_~x#1 := round_float_#in~x#1;havoc round_float_~w~0#1;havoc round_float_~exponent_less_127~0#1; {28#true} is VALID [2022-02-20 16:46:03,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-02-20 16:46:03,028 INFO L290 TraceCheckUtils]: 3: Hoare triple {29#false} round_float_~exponent_less_127~0#1 := ~bvsub32(~bvlshr32(~bvand32(2139095040bv32, round_float_~w~0#1), 23bv32), 127bv32); {29#false} is VALID [2022-02-20 16:46:03,028 INFO L290 TraceCheckUtils]: 4: Hoare triple {29#false} assume !~bvslt32(round_float_~exponent_less_127~0#1, 23bv32); {29#false} is VALID [2022-02-20 16:46:03,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#false} assume 128bv32 == round_float_~exponent_less_127~0#1;round_float_#res#1 := ~fp.add~FLOAT(currentRoundingMode, round_float_~x#1, round_float_~x#1); {29#false} is VALID [2022-02-20 16:46:03,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#false} main_#t~ret7#1 := round_float_#res#1;assume { :end_inline_round_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_#t~short9#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {29#false} is VALID [2022-02-20 16:46:03,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#false} assume !main_#t~short9#1; {29#false} is VALID [2022-02-20 16:46:03,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#false} assume !main_#t~short9#1;havoc main_#t~ret8#1;havoc main_#t~short9#1; {29#false} is VALID [2022-02-20 16:46:03,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-02-20 16:46:03,031 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:46:03,031 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:03,032 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:03,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [805023716] [2022-02-20 16:46:03,032 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [805023716] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:03,033 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:03,033 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:03,035 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608825146] [2022-02-20 16:46:03,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:03,040 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:46:03,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:03,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:03,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:03,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:03,084 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:03,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:03,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:03,105 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.608695652173913) internal successors, (37), 24 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:03,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:03,166 INFO L93 Difference]: Finished difference Result 48 states and 72 transitions. [2022-02-20 16:46:03,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:03,167 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:46:03,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:03,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:03,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 72 transitions. [2022-02-20 16:46:03,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:03,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 72 transitions. [2022-02-20 16:46:03,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 72 transitions. [2022-02-20 16:46:03,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:03,270 INFO L225 Difference]: With dead ends: 48 [2022-02-20 16:46:03,270 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 16:46:03,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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:46:03,276 INFO L933 BasicCegarLoop]: 30 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, 30 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:46:03,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:03,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 16:46:03,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 16:46:03,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:03,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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:46:03,299 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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:46:03,299 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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:46:03,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:03,302 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-02-20 16:46:03,302 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-02-20 16:46:03,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:03,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:03,303 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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 22 states. [2022-02-20 16:46:03,303 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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 22 states. [2022-02-20 16:46:03,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:03,305 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-02-20 16:46:03,305 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-02-20 16:46:03,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:03,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:03,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:03,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:03,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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:46:03,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-02-20 16:46:03,309 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 10 [2022-02-20 16:46:03,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:03,310 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-02-20 16:46:03,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:03,310 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-02-20 16:46:03,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:46:03,311 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:03,311 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:03,325 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:46:03,525 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:46:03,526 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:03,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:03,527 INFO L85 PathProgramCache]: Analyzing trace with hash -744854880, now seen corresponding path program 1 times [2022-02-20 16:46:03,527 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:03,528 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143463050] [2022-02-20 16:46:03,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:03,528 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:03,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:03,530 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:46:03,532 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:46:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:03,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:46:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:03,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:03,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {187#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); {187#true} is VALID [2022-02-20 16:46:03,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {187#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_#t~short9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());assume { :begin_inline_round_float } true;round_float_#in~x#1 := main_~x~0#1;havoc round_float_#res#1;havoc round_float_#t~mem4#1, round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, round_float_~exponent_mask~0#1, round_float_#t~mem5#1, round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset, round_float_~x#1, round_float_~w~0#1, round_float_~exponent_less_127~0#1;round_float_~x#1 := round_float_#in~x#1;havoc round_float_~w~0#1;havoc round_float_~exponent_less_127~0#1; {195#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_round_float_~x#1|)} is VALID [2022-02-20 16:46:03,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {195#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_round_float_~x#1|)} call round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(round_float_~x#1, round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, 4bv32);call round_float_#t~mem4#1 := read~intINTTYPE4(round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, 4bv32);round_float_~w~0#1 := round_float_#t~mem4#1;havoc round_float_#t~mem4#1;call ULTIMATE.dealloc(round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset);havoc round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset; {199#(= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:03,798 INFO L290 TraceCheckUtils]: 3: Hoare triple {199#(= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (fp.neg (_ +zero 8 24)))} goto; {199#(= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:03,800 INFO L290 TraceCheckUtils]: 4: Hoare triple {199#(= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (fp.neg (_ +zero 8 24)))} round_float_~exponent_less_127~0#1 := ~bvsub32(~bvlshr32(~bvand32(2139095040bv32, round_float_~w~0#1), 23bv32), 127bv32); {206#(exists ((|ULTIMATE.start_round_float_~w~0#1| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (fp.neg (_ +zero 8 24))) (= (bvadd (_ bv4294967169 32) (bvlshr (bvand |ULTIMATE.start_round_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32))) |ULTIMATE.start_round_float_~exponent_less_127~0#1|)))} is VALID [2022-02-20 16:46:03,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {206#(exists ((|ULTIMATE.start_round_float_~w~0#1| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (fp.neg (_ +zero 8 24))) (= (bvadd (_ bv4294967169 32) (bvlshr (bvand |ULTIMATE.start_round_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32))) |ULTIMATE.start_round_float_~exponent_less_127~0#1|)))} assume !~bvslt32(round_float_~exponent_less_127~0#1, 23bv32); {188#false} is VALID [2022-02-20 16:46:03,801 INFO L290 TraceCheckUtils]: 6: Hoare triple {188#false} assume 128bv32 == round_float_~exponent_less_127~0#1;round_float_#res#1 := ~fp.add~FLOAT(currentRoundingMode, round_float_~x#1, round_float_~x#1); {188#false} is VALID [2022-02-20 16:46:03,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {188#false} main_#t~ret7#1 := round_float_#res#1;assume { :end_inline_round_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_#t~short9#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {188#false} is VALID [2022-02-20 16:46:03,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {188#false} assume !main_#t~short9#1; {188#false} is VALID [2022-02-20 16:46:03,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {188#false} assume !main_#t~short9#1;havoc main_#t~ret8#1;havoc main_#t~short9#1; {188#false} is VALID [2022-02-20 16:46:03,803 INFO L290 TraceCheckUtils]: 10: Hoare triple {188#false} assume !false; {188#false} is VALID [2022-02-20 16:46:03,803 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:46:03,803 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:03,803 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:03,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143463050] [2022-02-20 16:46:03,804 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1143463050] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:03,804 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:03,804 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:03,805 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321255618] [2022-02-20 16:46:03,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:03,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:46:03,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:03,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:03,832 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:46:03,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:03,834 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:03,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:03,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:03,836 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:03,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:03,989 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-02-20 16:46:03,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:46:03,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:46:03,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:03,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:03,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-02-20 16:46:03,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:03,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-02-20 16:46:03,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-02-20 16:46:04,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:04,046 INFO L225 Difference]: With dead ends: 31 [2022-02-20 16:46:04,046 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 16:46:04,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:04,048 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:04,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 66 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 8 Unchecked, 0.0s Time] [2022-02-20 16:46:04,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 16:46:04,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 16:46:04,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:04,051 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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:46:04,051 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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:46:04,052 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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:46:04,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:04,053 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-02-20 16:46:04,053 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-02-20 16:46:04,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:04,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:04,054 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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 21 states. [2022-02-20 16:46:04,054 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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 21 states. [2022-02-20 16:46:04,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:04,056 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-02-20 16:46:04,056 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-02-20 16:46:04,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:04,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:04,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:04,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:04,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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:46:04,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-02-20 16:46:04,059 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 11 [2022-02-20 16:46:04,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:04,059 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-02-20 16:46:04,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,059 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-02-20 16:46:04,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:46:04,060 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:04,060 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:04,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 16:46:04,271 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:46:04,272 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:04,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:04,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1636973854, now seen corresponding path program 1 times [2022-02-20 16:46:04,273 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:04,273 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1876740651] [2022-02-20 16:46:04,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:04,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:04,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:04,275 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:46:04,277 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:46:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:04,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:46:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:04,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:04,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {333#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); {333#true} is VALID [2022-02-20 16:46:04,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {333#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_#t~short9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());assume { :begin_inline_round_float } true;round_float_#in~x#1 := main_~x~0#1;havoc round_float_#res#1;havoc round_float_#t~mem4#1, round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, round_float_~exponent_mask~0#1, round_float_#t~mem5#1, round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset, round_float_~x#1, round_float_~w~0#1, round_float_~exponent_less_127~0#1;round_float_~x#1 := round_float_#in~x#1;havoc round_float_~w~0#1;havoc round_float_~exponent_less_127~0#1; {341#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_round_float_~x#1|)} is VALID [2022-02-20 16:46:04,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {341#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_round_float_~x#1|)} call round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(round_float_~x#1, round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, 4bv32);call round_float_#t~mem4#1 := read~intINTTYPE4(round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, 4bv32);round_float_~w~0#1 := round_float_#t~mem4#1;havoc round_float_#t~mem4#1;call ULTIMATE.dealloc(round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset);havoc round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset; {345#(= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:04,467 INFO L290 TraceCheckUtils]: 3: Hoare triple {345#(= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (fp.neg (_ +zero 8 24)))} goto; {345#(= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:04,469 INFO L290 TraceCheckUtils]: 4: Hoare triple {345#(= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (fp.neg (_ +zero 8 24)))} round_float_~exponent_less_127~0#1 := ~bvsub32(~bvlshr32(~bvand32(2139095040bv32, round_float_~w~0#1), 23bv32), 127bv32); {352#(exists ((|ULTIMATE.start_round_float_~w~0#1| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (fp.neg (_ +zero 8 24))) (= (bvadd (_ bv4294967169 32) (bvlshr (bvand |ULTIMATE.start_round_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32))) |ULTIMATE.start_round_float_~exponent_less_127~0#1|)))} is VALID [2022-02-20 16:46:04,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {352#(exists ((|ULTIMATE.start_round_float_~w~0#1| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (fp.neg (_ +zero 8 24))) (= (bvadd (_ bv4294967169 32) (bvlshr (bvand |ULTIMATE.start_round_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32))) |ULTIMATE.start_round_float_~exponent_less_127~0#1|)))} assume ~bvslt32(round_float_~exponent_less_127~0#1, 23bv32); {352#(exists ((|ULTIMATE.start_round_float_~w~0#1| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (fp.neg (_ +zero 8 24))) (= (bvadd (_ bv4294967169 32) (bvlshr (bvand |ULTIMATE.start_round_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32))) |ULTIMATE.start_round_float_~exponent_less_127~0#1|)))} is VALID [2022-02-20 16:46:04,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {352#(exists ((|ULTIMATE.start_round_float_~w~0#1| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (fp.neg (_ +zero 8 24))) (= (bvadd (_ bv4294967169 32) (bvlshr (bvand |ULTIMATE.start_round_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32))) |ULTIMATE.start_round_float_~exponent_less_127~0#1|)))} assume !~bvslt32(round_float_~exponent_less_127~0#1, 0bv32);round_float_~exponent_mask~0#1 := ~bvashr32(8388607bv32, round_float_~exponent_less_127~0#1); {334#false} is VALID [2022-02-20 16:46:04,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {334#false} assume 0bv32 == ~bvand32(round_float_~w~0#1, round_float_~exponent_mask~0#1);round_float_#res#1 := round_float_~x#1; {334#false} is VALID [2022-02-20 16:46:04,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {334#false} main_#t~ret7#1 := round_float_#res#1;assume { :end_inline_round_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_#t~short9#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {334#false} is VALID [2022-02-20 16:46:04,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {334#false} assume !main_#t~short9#1; {334#false} is VALID [2022-02-20 16:46:04,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {334#false} assume !main_#t~short9#1;havoc main_#t~ret8#1;havoc main_#t~short9#1; {334#false} is VALID [2022-02-20 16:46:04,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {334#false} assume !false; {334#false} is VALID [2022-02-20 16:46:04,473 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:46:04,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:04,473 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:04,473 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1876740651] [2022-02-20 16:46:04,474 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1876740651] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:04,474 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:04,474 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:04,474 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587636696] [2022-02-20 16:46:04,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:04,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:46:04,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:04,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:04,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:04,490 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:04,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:04,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:04,491 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:04,644 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-02-20 16:46:04,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:46:04,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:46:04,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:04,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-02-20 16:46:04,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-02-20 16:46:04,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-02-20 16:46:04,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:04,704 INFO L225 Difference]: With dead ends: 33 [2022-02-20 16:46:04,704 INFO L226 Difference]: Without dead ends: 20 [2022-02-20 16:46:04,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:04,705 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:04,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 57 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-02-20 16:46:04,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-02-20 16:46:04,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-20 16:46:04,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:04,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,708 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,709 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:04,710 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-02-20 16:46:04,710 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-02-20 16:46:04,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:04,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:04,711 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states. [2022-02-20 16:46:04,711 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states. [2022-02-20 16:46:04,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:04,712 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-02-20 16:46:04,712 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-02-20 16:46:04,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:04,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:04,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:04,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:04,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-02-20 16:46:04,714 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 12 [2022-02-20 16:46:04,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:04,715 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-02-20 16:46:04,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,715 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-02-20 16:46:04,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:46:04,716 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:04,716 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:04,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:04,926 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:46:04,926 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:04,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:04,927 INFO L85 PathProgramCache]: Analyzing trace with hash 812441883, now seen corresponding path program 1 times [2022-02-20 16:46:04,927 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:04,927 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1686078091] [2022-02-20 16:46:04,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:04,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:04,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:04,929 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:04,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 16:46:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:04,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:46:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:04,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:05,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {481#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); {481#true} is VALID [2022-02-20 16:46:05,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_#t~short9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());assume { :begin_inline_round_float } true;round_float_#in~x#1 := main_~x~0#1;havoc round_float_#res#1;havoc round_float_#t~mem4#1, round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, round_float_~exponent_mask~0#1, round_float_#t~mem5#1, round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset, round_float_~x#1, round_float_~w~0#1, round_float_~exponent_less_127~0#1;round_float_~x#1 := round_float_#in~x#1;havoc round_float_~w~0#1;havoc round_float_~exponent_less_127~0#1; {489#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_round_float_~x#1|)} is VALID [2022-02-20 16:46:05,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {489#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_round_float_~x#1|)} call round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(round_float_~x#1, round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, 4bv32);call round_float_#t~mem4#1 := read~intINTTYPE4(round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, 4bv32);round_float_~w~0#1 := round_float_#t~mem4#1;havoc round_float_#t~mem4#1;call ULTIMATE.dealloc(round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset);havoc round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset; {493#(= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:05,101 INFO L290 TraceCheckUtils]: 3: Hoare triple {493#(= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (fp.neg (_ +zero 8 24)))} goto; {493#(= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:05,102 INFO L290 TraceCheckUtils]: 4: Hoare triple {493#(= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (fp.neg (_ +zero 8 24)))} round_float_~exponent_less_127~0#1 := ~bvsub32(~bvlshr32(~bvand32(2139095040bv32, round_float_~w~0#1), 23bv32), 127bv32); {500#(exists ((|ULTIMATE.start_round_float_~w~0#1| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (fp.neg (_ +zero 8 24))) (= (bvadd (_ bv4294967169 32) (bvlshr (bvand |ULTIMATE.start_round_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32))) |ULTIMATE.start_round_float_~exponent_less_127~0#1|)))} is VALID [2022-02-20 16:46:05,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {500#(exists ((|ULTIMATE.start_round_float_~w~0#1| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (fp.neg (_ +zero 8 24))) (= (bvadd (_ bv4294967169 32) (bvlshr (bvand |ULTIMATE.start_round_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32))) |ULTIMATE.start_round_float_~exponent_less_127~0#1|)))} assume ~bvslt32(round_float_~exponent_less_127~0#1, 23bv32); {500#(exists ((|ULTIMATE.start_round_float_~w~0#1| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (fp.neg (_ +zero 8 24))) (= (bvadd (_ bv4294967169 32) (bvlshr (bvand |ULTIMATE.start_round_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32))) |ULTIMATE.start_round_float_~exponent_less_127~0#1|)))} is VALID [2022-02-20 16:46:05,105 INFO L290 TraceCheckUtils]: 6: Hoare triple {500#(exists ((|ULTIMATE.start_round_float_~w~0#1| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (fp.neg (_ +zero 8 24))) (= (bvadd (_ bv4294967169 32) (bvlshr (bvand |ULTIMATE.start_round_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32))) |ULTIMATE.start_round_float_~exponent_less_127~0#1|)))} assume ~bvslt32(round_float_~exponent_less_127~0#1, 0bv32);round_float_~w~0#1 := ~bvand32(2147483648bv32, round_float_~w~0#1); {500#(exists ((|ULTIMATE.start_round_float_~w~0#1| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (fp.neg (_ +zero 8 24))) (= (bvadd (_ bv4294967169 32) (bvlshr (bvand |ULTIMATE.start_round_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32))) |ULTIMATE.start_round_float_~exponent_less_127~0#1|)))} is VALID [2022-02-20 16:46:05,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {500#(exists ((|ULTIMATE.start_round_float_~w~0#1| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (fp.neg (_ +zero 8 24))) (= (bvadd (_ bv4294967169 32) (bvlshr (bvand |ULTIMATE.start_round_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32))) |ULTIMATE.start_round_float_~exponent_less_127~0#1|)))} assume 4294967295bv32 == round_float_~exponent_less_127~0#1;round_float_~w~0#1 := ~bvor32(1065353216bv32, round_float_~w~0#1); {482#false} is VALID [2022-02-20 16:46:05,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {482#false} call round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(round_float_~w~0#1, round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset, 4bv32);call round_float_#t~mem5#1 := read~intFLOATTYPE4(round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset, 4bv32);round_float_~x#1 := round_float_#t~mem5#1;havoc round_float_#t~mem5#1;call ULTIMATE.dealloc(round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset);havoc round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset; {482#false} is VALID [2022-02-20 16:46:05,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {482#false} goto; {482#false} is VALID [2022-02-20 16:46:05,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {482#false} round_float_#res#1 := round_float_~x#1; {482#false} is VALID [2022-02-20 16:46:05,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {482#false} main_#t~ret7#1 := round_float_#res#1;assume { :end_inline_round_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_#t~short9#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {482#false} is VALID [2022-02-20 16:46:05,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {482#false} assume !main_#t~short9#1; {482#false} is VALID [2022-02-20 16:46:05,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {482#false} assume !main_#t~short9#1;havoc main_#t~ret8#1;havoc main_#t~short9#1; {482#false} is VALID [2022-02-20 16:46:05,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {482#false} assume !false; {482#false} is VALID [2022-02-20 16:46:05,108 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:46:05,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:05,108 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:05,108 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1686078091] [2022-02-20 16:46:05,109 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1686078091] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:05,109 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:05,109 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:05,109 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605336302] [2022-02-20 16:46:05,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:05,110 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:46:05,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:05,110 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:46:05,127 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:46:05,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:05,127 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:05,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:05,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:05,128 INFO L87 Difference]: Start difference. First operand 20 states and 21 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:46:05,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:05,230 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-02-20 16:46:05,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:46:05,230 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:46:05,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:05,230 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:46:05,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-02-20 16:46:05,232 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:46:05,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-02-20 16:46:05,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 33 transitions. [2022-02-20 16:46:05,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:05,268 INFO L225 Difference]: With dead ends: 32 [2022-02-20 16:46:05,268 INFO L226 Difference]: Without dead ends: 20 [2022-02-20 16:46:05,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:05,269 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:05,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 52 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 5 Unchecked, 0.0s Time] [2022-02-20 16:46:05,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-02-20 16:46:05,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-20 16:46:05,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:05,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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:46:05,272 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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:46:05,272 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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:46:05,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:05,273 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-02-20 16:46:05,273 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-02-20 16:46:05,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:05,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:05,274 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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 20 states. [2022-02-20 16:46:05,274 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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 20 states. [2022-02-20 16:46:05,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:05,275 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-02-20 16:46:05,276 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-02-20 16:46:05,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:05,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:05,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:05,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:05,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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:46:05,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-02-20 16:46:05,277 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 15 [2022-02-20 16:46:05,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:05,277 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-02-20 16:46:05,278 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:46:05,278 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-02-20 16:46:05,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:46:05,278 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:05,278 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:05,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:05,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:05,489 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:05,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:05,489 INFO L85 PathProgramCache]: Analyzing trace with hash 3095257, now seen corresponding path program 1 times [2022-02-20 16:46:05,490 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:05,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569447672] [2022-02-20 16:46:05,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:05,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:05,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:05,491 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:05,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 16:46:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:05,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 16:46:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:05,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:05,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {637#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); {637#true} is VALID [2022-02-20 16:46:05,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {637#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_#t~short9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());assume { :begin_inline_round_float } true;round_float_#in~x#1 := main_~x~0#1;havoc round_float_#res#1;havoc round_float_#t~mem4#1, round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, round_float_~exponent_mask~0#1, round_float_#t~mem5#1, round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset, round_float_~x#1, round_float_~w~0#1, round_float_~exponent_less_127~0#1;round_float_~x#1 := round_float_#in~x#1;havoc round_float_~w~0#1;havoc round_float_~exponent_less_127~0#1; {637#true} is VALID [2022-02-20 16:46:05,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {637#true} call round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(round_float_~x#1, round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, 4bv32);call round_float_#t~mem4#1 := read~intINTTYPE4(round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, 4bv32);round_float_~w~0#1 := round_float_#t~mem4#1;havoc round_float_#t~mem4#1;call ULTIMATE.dealloc(round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset);havoc round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset; {637#true} is VALID [2022-02-20 16:46:05,672 INFO L290 TraceCheckUtils]: 3: Hoare triple {637#true} goto; {637#true} is VALID [2022-02-20 16:46:05,672 INFO L290 TraceCheckUtils]: 4: Hoare triple {637#true} round_float_~exponent_less_127~0#1 := ~bvsub32(~bvlshr32(~bvand32(2139095040bv32, round_float_~w~0#1), 23bv32), 127bv32); {637#true} is VALID [2022-02-20 16:46:05,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {637#true} assume ~bvslt32(round_float_~exponent_less_127~0#1, 23bv32); {637#true} is VALID [2022-02-20 16:46:05,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {637#true} assume ~bvslt32(round_float_~exponent_less_127~0#1, 0bv32);round_float_~w~0#1 := ~bvand32(2147483648bv32, round_float_~w~0#1); {660#(exists ((|v_ULTIMATE.start_round_float_~w~0#1_14| (_ BitVec 32))) (= |ULTIMATE.start_round_float_~w~0#1| (bvand |v_ULTIMATE.start_round_float_~w~0#1_14| (_ bv2147483648 32))))} is VALID [2022-02-20 16:46:05,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {660#(exists ((|v_ULTIMATE.start_round_float_~w~0#1_14| (_ BitVec 32))) (= |ULTIMATE.start_round_float_~w~0#1| (bvand |v_ULTIMATE.start_round_float_~w~0#1_14| (_ bv2147483648 32))))} assume !(4294967295bv32 == round_float_~exponent_less_127~0#1); {660#(exists ((|v_ULTIMATE.start_round_float_~w~0#1_14| (_ BitVec 32))) (= |ULTIMATE.start_round_float_~w~0#1| (bvand |v_ULTIMATE.start_round_float_~w~0#1_14| (_ bv2147483648 32))))} is VALID [2022-02-20 16:46:05,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {660#(exists ((|v_ULTIMATE.start_round_float_~w~0#1_14| (_ BitVec 32))) (= |ULTIMATE.start_round_float_~w~0#1| (bvand |v_ULTIMATE.start_round_float_~w~0#1_14| (_ bv2147483648 32))))} call round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(round_float_~w~0#1, round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset, 4bv32);call round_float_#t~mem5#1 := read~intFLOATTYPE4(round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset, 4bv32);round_float_~x#1 := round_float_#t~mem5#1;havoc round_float_#t~mem5#1;call ULTIMATE.dealloc(round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset);havoc round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset; {667#(exists ((|v_ULTIMATE.start_round_float_~w~0#1_14| (_ BitVec 32))) (= (fp ((_ extract 31 31) (bvand |v_ULTIMATE.start_round_float_~w~0#1_14| (_ bv2147483648 32))) ((_ extract 30 23) (bvand |v_ULTIMATE.start_round_float_~w~0#1_14| (_ bv2147483648 32))) ((_ extract 22 0) (bvand |v_ULTIMATE.start_round_float_~w~0#1_14| (_ bv2147483648 32)))) |ULTIMATE.start_round_float_~x#1|))} is VALID [2022-02-20 16:46:05,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {667#(exists ((|v_ULTIMATE.start_round_float_~w~0#1_14| (_ BitVec 32))) (= (fp ((_ extract 31 31) (bvand |v_ULTIMATE.start_round_float_~w~0#1_14| (_ bv2147483648 32))) ((_ extract 30 23) (bvand |v_ULTIMATE.start_round_float_~w~0#1_14| (_ bv2147483648 32))) ((_ extract 22 0) (bvand |v_ULTIMATE.start_round_float_~w~0#1_14| (_ bv2147483648 32)))) |ULTIMATE.start_round_float_~x#1|))} goto; {667#(exists ((|v_ULTIMATE.start_round_float_~w~0#1_14| (_ BitVec 32))) (= (fp ((_ extract 31 31) (bvand |v_ULTIMATE.start_round_float_~w~0#1_14| (_ bv2147483648 32))) ((_ extract 30 23) (bvand |v_ULTIMATE.start_round_float_~w~0#1_14| (_ bv2147483648 32))) ((_ extract 22 0) (bvand |v_ULTIMATE.start_round_float_~w~0#1_14| (_ bv2147483648 32)))) |ULTIMATE.start_round_float_~x#1|))} is VALID [2022-02-20 16:46:05,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {667#(exists ((|v_ULTIMATE.start_round_float_~w~0#1_14| (_ BitVec 32))) (= (fp ((_ extract 31 31) (bvand |v_ULTIMATE.start_round_float_~w~0#1_14| (_ bv2147483648 32))) ((_ extract 30 23) (bvand |v_ULTIMATE.start_round_float_~w~0#1_14| (_ bv2147483648 32))) ((_ extract 22 0) (bvand |v_ULTIMATE.start_round_float_~w~0#1_14| (_ bv2147483648 32)))) |ULTIMATE.start_round_float_~x#1|))} round_float_#res#1 := round_float_~x#1; {674#(exists ((|v_ULTIMATE.start_round_float_~w~0#1_14| (_ BitVec 32))) (= |ULTIMATE.start_round_float_#res#1| (fp ((_ extract 31 31) (bvand |v_ULTIMATE.start_round_float_~w~0#1_14| (_ bv2147483648 32))) ((_ extract 30 23) (bvand |v_ULTIMATE.start_round_float_~w~0#1_14| (_ bv2147483648 32))) ((_ extract 22 0) (bvand |v_ULTIMATE.start_round_float_~w~0#1_14| (_ bv2147483648 32))))))} is VALID [2022-02-20 16:46:05,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {674#(exists ((|v_ULTIMATE.start_round_float_~w~0#1_14| (_ BitVec 32))) (= |ULTIMATE.start_round_float_#res#1| (fp ((_ extract 31 31) (bvand |v_ULTIMATE.start_round_float_~w~0#1_14| (_ bv2147483648 32))) ((_ extract 30 23) (bvand |v_ULTIMATE.start_round_float_~w~0#1_14| (_ bv2147483648 32))) ((_ extract 22 0) (bvand |v_ULTIMATE.start_round_float_~w~0#1_14| (_ bv2147483648 32))))))} main_#t~ret7#1 := round_float_#res#1;assume { :end_inline_round_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_#t~short9#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {678#|ULTIMATE.start_main_#t~short9#1|} is VALID [2022-02-20 16:46:05,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {678#|ULTIMATE.start_main_#t~short9#1|} assume !main_#t~short9#1; {638#false} is VALID [2022-02-20 16:46:05,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {638#false} assume !main_#t~short9#1;havoc main_#t~ret8#1;havoc main_#t~short9#1; {638#false} is VALID [2022-02-20 16:46:05,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {638#false} assume !false; {638#false} is VALID [2022-02-20 16:46:05,685 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:46:05,685 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:05,685 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:05,685 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569447672] [2022-02-20 16:46:05,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1569447672] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:05,686 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:05,686 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:46:05,686 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025140743] [2022-02-20 16:46:05,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:05,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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:46:05,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:05,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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:46:05,714 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:46:05,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:46:05,715 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:05,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:46:05,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:46:05,715 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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:46:05,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:05,805 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2022-02-20 16:46:05,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:46:05,805 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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:46:05,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:05,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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:46:05,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-02-20 16:46:05,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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:46:05,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-02-20 16:46:05,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 22 transitions. [2022-02-20 16:46:05,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:05,829 INFO L225 Difference]: With dead ends: 23 [2022-02-20 16:46:05,830 INFO L226 Difference]: Without dead ends: 20 [2022-02-20 16:46:05,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:46:05,831 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:05,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 60 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 12 Unchecked, 0.0s Time] [2022-02-20 16:46:05,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-02-20 16:46:05,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-20 16:46:05,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:05,833 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.0) internal successors, (19), 19 states have internal predecessors, (19), 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:46:05,833 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.0) internal successors, (19), 19 states have internal predecessors, (19), 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:46:05,833 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.0) internal successors, (19), 19 states have internal predecessors, (19), 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:46:05,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:05,834 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2022-02-20 16:46:05,834 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2022-02-20 16:46:05,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:05,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:05,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 19 states have (on average 1.0) internal successors, (19), 19 states have internal predecessors, (19), 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 20 states. [2022-02-20 16:46:05,835 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.0) internal successors, (19), 19 states have internal predecessors, (19), 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 20 states. [2022-02-20 16:46:05,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:05,836 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2022-02-20 16:46:05,836 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2022-02-20 16:46:05,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:05,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:05,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:05,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:05,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.0) internal successors, (19), 19 states have internal predecessors, (19), 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:46:05,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 19 transitions. [2022-02-20 16:46:05,837 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 19 transitions. Word has length 15 [2022-02-20 16:46:05,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:05,837 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 19 transitions. [2022-02-20 16:46:05,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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:46:05,838 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2022-02-20 16:46:05,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 16:46:05,838 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:05,838 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:05,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:06,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:06,048 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:06,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:06,048 INFO L85 PathProgramCache]: Analyzing trace with hash -318448082, now seen corresponding path program 1 times [2022-02-20 16:46:06,049 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:06,049 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [651993903] [2022-02-20 16:46:06,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:06,049 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:06,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:06,050 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:06,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 16:46:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:06,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-20 16:46:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:06,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:06,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 16:46:06,285 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-02-20 16:46:06,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2022-02-20 16:46:06,460 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 16:46:06,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 29 [2022-02-20 16:46:06,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {778#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); {778#true} is VALID [2022-02-20 16:46:06,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {778#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_#t~short9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());assume { :begin_inline_round_float } true;round_float_#in~x#1 := main_~x~0#1;havoc round_float_#res#1;havoc round_float_#t~mem4#1, round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, round_float_~exponent_mask~0#1, round_float_#t~mem5#1, round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset, round_float_~x#1, round_float_~w~0#1, round_float_~exponent_less_127~0#1;round_float_~x#1 := round_float_#in~x#1;havoc round_float_~w~0#1;havoc round_float_~exponent_less_127~0#1; {786#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_round_float_~x#1|)} is VALID [2022-02-20 16:46:06,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {786#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_round_float_~x#1|)} call round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(round_float_~x#1, round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, 4bv32);call round_float_#t~mem4#1 := read~intINTTYPE4(round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, 4bv32);round_float_~w~0#1 := round_float_#t~mem4#1;havoc round_float_#t~mem4#1;call ULTIMATE.dealloc(round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset);havoc round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset; {790#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)) |ULTIMATE.start_round_float_~w~0#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)))) (fp.neg (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:06,661 INFO L290 TraceCheckUtils]: 3: Hoare triple {790#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)) |ULTIMATE.start_round_float_~w~0#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)))) (fp.neg (_ +zero 8 24)))))} goto; {790#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)) |ULTIMATE.start_round_float_~w~0#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)))) (fp.neg (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:06,662 INFO L290 TraceCheckUtils]: 4: Hoare triple {790#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)) |ULTIMATE.start_round_float_~w~0#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)))) (fp.neg (_ +zero 8 24)))))} round_float_~exponent_less_127~0#1 := ~bvsub32(~bvlshr32(~bvand32(2139095040bv32, round_float_~w~0#1), 23bv32), 127bv32); {790#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)) |ULTIMATE.start_round_float_~w~0#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)))) (fp.neg (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:06,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {790#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)) |ULTIMATE.start_round_float_~w~0#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)))) (fp.neg (_ +zero 8 24)))))} assume ~bvslt32(round_float_~exponent_less_127~0#1, 23bv32); {790#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)) |ULTIMATE.start_round_float_~w~0#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)))) (fp.neg (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:06,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {790#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)) |ULTIMATE.start_round_float_~w~0#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)))) (fp.neg (_ +zero 8 24)))))} assume ~bvslt32(round_float_~exponent_less_127~0#1, 0bv32);round_float_~w~0#1 := ~bvand32(2147483648bv32, round_float_~w~0#1); {790#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)) |ULTIMATE.start_round_float_~w~0#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)))) (fp.neg (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:06,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {790#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)) |ULTIMATE.start_round_float_~w~0#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)))) (fp.neg (_ +zero 8 24)))))} assume !(4294967295bv32 == round_float_~exponent_less_127~0#1); {790#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)) |ULTIMATE.start_round_float_~w~0#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)))) (fp.neg (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:06,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {790#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)) |ULTIMATE.start_round_float_~w~0#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)))) (fp.neg (_ +zero 8 24)))))} call round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(round_float_~w~0#1, round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset, 4bv32);call round_float_#t~mem5#1 := read~intFLOATTYPE4(round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset, 4bv32);round_float_~x#1 := round_float_#t~mem5#1;havoc round_float_#t~mem5#1;call ULTIMATE.dealloc(round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset);havoc round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset; {809#(exists ((|v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9| (_ BitVec 32)) (|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) |ULTIMATE.start_round_float_~x#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) (fp.neg (_ +zero 8 24))) (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))))} is VALID [2022-02-20 16:46:06,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {809#(exists ((|v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9| (_ BitVec 32)) (|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) |ULTIMATE.start_round_float_~x#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) (fp.neg (_ +zero 8 24))) (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))))} goto; {809#(exists ((|v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9| (_ BitVec 32)) (|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) |ULTIMATE.start_round_float_~x#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) (fp.neg (_ +zero 8 24))) (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))))} is VALID [2022-02-20 16:46:06,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {809#(exists ((|v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9| (_ BitVec 32)) (|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) |ULTIMATE.start_round_float_~x#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) (fp.neg (_ +zero 8 24))) (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))))} round_float_#res#1 := round_float_~x#1; {816#(exists ((|v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9| (_ BitVec 32)) (|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) (fp.neg (_ +zero 8 24))) (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) |ULTIMATE.start_round_float_#res#1|)))} is VALID [2022-02-20 16:46:06,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {816#(exists ((|v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9| (_ BitVec 32)) (|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) (fp.neg (_ +zero 8 24))) (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) |ULTIMATE.start_round_float_#res#1|)))} main_#t~ret7#1 := round_float_#res#1;assume { :end_inline_round_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_#t~short9#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {820#(exists ((|v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9| (_ BitVec 32)) (|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13| (_ BitVec 32))) (and (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) (fp.neg (_ +zero 8 24))) (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))))} is VALID [2022-02-20 16:46:06,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {820#(exists ((|v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9| (_ BitVec 32)) (|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13| (_ BitVec 32))) (and (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) (fp.neg (_ +zero 8 24))) (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))))} assume main_#t~short9#1;assume { :begin_inline___signbit_float } true;__signbit_float_#in~x#1 := main_~res~0#1;havoc __signbit_float_#res#1;havoc __signbit_float_#t~mem6#1, __signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset, __signbit_float_~x#1, __signbit_float_~w~1#1;__signbit_float_~x#1 := __signbit_float_#in~x#1;havoc __signbit_float_~w~1#1; {824#(exists ((|v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9| (_ BitVec 32)) (|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) (fp.neg (_ +zero 8 24))) (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) |ULTIMATE.start___signbit_float_~x#1|)))} is VALID [2022-02-20 16:46:06,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {824#(exists ((|v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9| (_ BitVec 32)) (|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) (fp.neg (_ +zero 8 24))) (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) |ULTIMATE.start___signbit_float_~x#1|)))} call __signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__signbit_float_~x#1, __signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset, 4bv32);call __signbit_float_#t~mem6#1 := read~intINTTYPE4(__signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset, 4bv32);__signbit_float_~w~1#1 := __signbit_float_#t~mem6#1;havoc __signbit_float_#t~mem6#1;call ULTIMATE.dealloc(__signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset);havoc __signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset; {828#(exists ((v_arrayElimCell_3 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) (fp.neg (_ +zero 8 24))) (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~1#1|)))))} is VALID [2022-02-20 16:46:06,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {828#(exists ((v_arrayElimCell_3 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) (fp.neg (_ +zero 8 24))) (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~1#1|)))))} goto; {828#(exists ((v_arrayElimCell_3 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) (fp.neg (_ +zero 8 24))) (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~1#1|)))))} is VALID [2022-02-20 16:46:06,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {828#(exists ((v_arrayElimCell_3 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) (fp.neg (_ +zero 8 24))) (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~1#1|)))))} __signbit_float_#res#1 := (if 0bv32 != ~bvand32(2147483648bv32, __signbit_float_~w~1#1) then 1bv32 else 0bv32); {835#(exists ((|ULTIMATE.start___signbit_float_~w~1#1| (_ BitVec 32))) (and (or (and (not (= (bvand |ULTIMATE.start___signbit_float_~w~1#1| (_ bv2147483648 32)) (_ bv0 32))) (= |ULTIMATE.start___signbit_float_#res#1| (_ bv1 32))) (and (= |ULTIMATE.start___signbit_float_#res#1| (_ bv0 32)) (= (bvand |ULTIMATE.start___signbit_float_~w~1#1| (_ bv2147483648 32)) (_ bv0 32)))) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) (fp.neg (_ +zero 8 24))) (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~1#1|)))))))} is VALID [2022-02-20 16:46:06,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {835#(exists ((|ULTIMATE.start___signbit_float_~w~1#1| (_ BitVec 32))) (and (or (and (not (= (bvand |ULTIMATE.start___signbit_float_~w~1#1| (_ bv2147483648 32)) (_ bv0 32))) (= |ULTIMATE.start___signbit_float_#res#1| (_ bv1 32))) (and (= |ULTIMATE.start___signbit_float_#res#1| (_ bv0 32)) (= (bvand |ULTIMATE.start___signbit_float_~w~1#1| (_ bv2147483648 32)) (_ bv0 32)))) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) (fp.neg (_ +zero 8 24))) (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~1#1|)))))))} main_#t~ret8#1 := __signbit_float_#res#1;assume { :end_inline___signbit_float } true;main_#t~short9#1 := 1bv32 == main_#t~ret8#1; {839#|ULTIMATE.start_main_#t~short9#1|} is VALID [2022-02-20 16:46:06,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {839#|ULTIMATE.start_main_#t~short9#1|} assume !main_#t~short9#1;havoc main_#t~ret8#1;havoc main_#t~short9#1; {779#false} is VALID [2022-02-20 16:46:06,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {779#false} assume !false; {779#false} is VALID [2022-02-20 16:46:06,680 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:46:06,680 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:06,680 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:06,680 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [651993903] [2022-02-20 16:46:06,680 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [651993903] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:06,680 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:06,681 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 16:46:06,681 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041304936] [2022-02-20 16:46:06,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:06,681 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 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 19 [2022-02-20 16:46:06,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:06,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 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:46:06,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:06,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 16:46:06,710 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:06,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 16:46:06,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-02-20 16:46:06,710 INFO L87 Difference]: Start difference. First operand 20 states and 19 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 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:46:06,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:06,848 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2022-02-20 16:46:06,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 16:46:06,848 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 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 19 [2022-02-20 16:46:06,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:06,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 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:46:06,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 19 transitions. [2022-02-20 16:46:06,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 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:46:06,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 19 transitions. [2022-02-20 16:46:06,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 19 transitions. [2022-02-20 16:46:06,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:06,879 INFO L225 Difference]: With dead ends: 20 [2022-02-20 16:46:06,879 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:46:06,880 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-02-20 16:46:06,881 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:06,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 51 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 24 Unchecked, 0.0s Time] [2022-02-20 16:46:06,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:46:06,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:46:06,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:06,882 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:46:06,882 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:46:06,882 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:46:06,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:06,882 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:06,882 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:06,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:06,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:06,882 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:46:06,882 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:46:06,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:06,883 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:06,883 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:06,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:06,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:06,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:06,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:06,884 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:46:06,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:46:06,884 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2022-02-20 16:46:06,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:06,884 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:46:06,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 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:46:06,885 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:06,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:06,886 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:06,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:07,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:07,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:46:07,137 INFO L858 garLoopResultBuilder]: For program point L27(lines 27 48) no Hoare annotation was computed. [2022-02-20 16:46:07,137 INFO L858 garLoopResultBuilder]: For program point L60-1(lines 60 64) no Hoare annotation was computed. [2022-02-20 16:46:07,137 INFO L854 garLoopResultBuilder]: At program point L60-2(lines 60 64) the Hoare annotation is: (and (exists ((|v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9| (_ BitVec 32)) (|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13| (_ BitVec 32))) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) (let ((.cse0 (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (and (= .cse0 (fp.neg (_ +zero 8 24))) (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)) .cse1) (= .cse0 |ULTIMATE.start___signbit_float_~x#1|))))) |ULTIMATE.start_main_#t~short9#1|) [2022-02-20 16:46:07,137 INFO L858 garLoopResultBuilder]: For program point L60-3(lines 60 64) no Hoare annotation was computed. [2022-02-20 16:46:07,137 INFO L858 garLoopResultBuilder]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2022-02-20 16:46:07,138 INFO L854 garLoopResultBuilder]: At program point L19-2(lines 19 23) the Hoare annotation is: (= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_round_float_~x#1|) [2022-02-20 16:46:07,138 INFO L858 garLoopResultBuilder]: For program point L81(line 81) no Hoare annotation was computed. [2022-02-20 16:46:07,138 INFO L858 garLoopResultBuilder]: For program point L19-3(lines 19 23) no Hoare annotation was computed. [2022-02-20 16:46:07,138 INFO L858 garLoopResultBuilder]: For program point L81-2(lines 81 84) no Hoare annotation was computed. [2022-02-20 16:46:07,138 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:46:07,138 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:46:07,138 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:46:07,138 INFO L858 garLoopResultBuilder]: For program point L28(lines 28 41) no Hoare annotation was computed. [2022-02-20 16:46:07,138 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 82) no Hoare annotation was computed. [2022-02-20 16:46:07,138 INFO L861 garLoopResultBuilder]: At program point L86(lines 69 87) the Hoare annotation is: true [2022-02-20 16:46:07,138 INFO L858 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2022-02-20 16:46:07,139 INFO L858 garLoopResultBuilder]: For program point L49(lines 49 53) no Hoare annotation was computed. [2022-02-20 16:46:07,139 INFO L858 garLoopResultBuilder]: For program point L49-1(lines 14 55) no Hoare annotation was computed. [2022-02-20 16:46:07,139 INFO L858 garLoopResultBuilder]: For program point L49-2(lines 49 53) no Hoare annotation was computed. [2022-02-20 16:46:07,139 INFO L854 garLoopResultBuilder]: At program point L66(lines 57 67) the Hoare annotation is: (and (exists ((|ULTIMATE.start___signbit_float_~w~1#1| (_ BitVec 32))) (and (let ((.cse0 (= (bvand |ULTIMATE.start___signbit_float_~w~1#1| (_ bv2147483648 32)) (_ bv0 32)))) (or (and (not .cse0) (= |ULTIMATE.start___signbit_float_#res#1| (_ bv1 32))) (and (= |ULTIMATE.start___signbit_float_#res#1| (_ bv0 32)) .cse0))) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= .cse1 (fp.neg (_ +zero 8 24))) (= .cse1 (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~1#1|)))))))) |ULTIMATE.start_main_#t~short9#1|) [2022-02-20 16:46:07,139 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:46:07,139 INFO L854 garLoopResultBuilder]: At program point L54(lines 14 55) the Hoare annotation is: (exists ((|v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9| (_ BitVec 32)) (|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13| (_ BitVec 32))) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) (let ((.cse0 (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (and (= .cse0 (fp.neg (_ +zero 8 24))) (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13|) (_ bv0 32)) .cse1) (= .cse0 |ULTIMATE.start_round_float_#res#1|))))) [2022-02-20 16:46:07,139 INFO L858 garLoopResultBuilder]: For program point L30(lines 30 32) no Hoare annotation was computed. [2022-02-20 16:46:07,139 INFO L858 garLoopResultBuilder]: For program point L43(lines 43 47) no Hoare annotation was computed. [2022-02-20 16:46:07,139 INFO L858 garLoopResultBuilder]: For program point L35(lines 35 37) no Hoare annotation was computed. [2022-02-20 16:46:07,142 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 16:46:07,143 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:07,146 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:07,146 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:07,146 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-20 16:46:07,146 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-02-20 16:46:07,146 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-20 16:46:07,146 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-20 16:46:07,146 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-02-20 16:46:07,146 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:07,146 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:07,146 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:46:07,146 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:46:07,146 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:46:07,146 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:46:07,146 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:46:07,146 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:46:07,146 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 16:46:07,146 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 16:46:07,146 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-02-20 16:46:07,147 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-02-20 16:46:07,147 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-02-20 16:46:07,147 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-02-20 16:46:07,147 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-02-20 16:46:07,147 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-02-20 16:46:07,147 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-02-20 16:46:07,147 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-02-20 16:46:07,147 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2022-02-20 16:46:07,147 WARN L170 areAnnotationChecker]: L60-3 has no Hoare annotation [2022-02-20 16:46:07,147 WARN L170 areAnnotationChecker]: L81-2 has no Hoare annotation [2022-02-20 16:46:07,147 WARN L170 areAnnotationChecker]: L81-2 has no Hoare annotation [2022-02-20 16:46:07,147 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2022-02-20 16:46:07,147 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2022-02-20 16:46:07,147 WARN L170 areAnnotationChecker]: L60-3 has no Hoare annotation [2022-02-20 16:46:07,147 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-20 16:46:07,147 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-20 16:46:07,147 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:07,147 WARN L170 areAnnotationChecker]: L81-2 has no Hoare annotation [2022-02-20 16:46:07,147 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:07,148 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:46:07,154 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,154 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,154 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,154 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13,QUANTIFIED] [2022-02-20 16:46:07,155 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,155 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,155 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,155 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,156 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,156 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,156 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,156 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13,QUANTIFIED] [2022-02-20 16:46:07,156 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,156 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,157 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,157 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,158 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,158 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,158 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-02-20 16:46:07,158 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-02-20 16:46:07,158 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-02-20 16:46:07,163 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-02-20 16:46:07,163 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-02-20 16:46:07,163 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-02-20 16:46:07,163 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,164 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,164 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,164 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,165 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,165 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-02-20 16:46:07,165 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-02-20 16:46:07,166 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-02-20 16:46:07,166 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-02-20 16:46:07,166 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-02-20 16:46:07,166 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-02-20 16:46:07,166 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,166 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,166 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,168 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,168 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,168 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,171 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13,QUANTIFIED] [2022-02-20 16:46:07,171 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,171 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,172 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,172 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,175 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13,QUANTIFIED] [2022-02-20 16:46:07,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,181 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,182 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,182 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:07 BoogieIcfgContainer [2022-02-20 16:46:07,182 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:07,183 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:07,183 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:07,183 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:07,184 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:02" (3/4) ... [2022-02-20 16:46:07,185 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:46:07,193 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-02-20 16:46:07,193 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-02-20 16:46:07,193 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:46:07,193 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:46:07,214 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9 : bv32, v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13 : bv32 :: (~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][22:0]) == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13][0bv32] == unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32]) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][22:0]) == \result) [2022-02-20 16:46:07,215 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9 : bv32, v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13 : bv32 :: (~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][22:0]) == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13][0bv32] == unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32]) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][22:0]) == x) && aux-res == -0.0f && __signbit_float(res) == 1-aux [2022-02-20 16:46:07,215 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists ULTIMATE.start___signbit_float_~w~1#1 : bv32 :: ((!(~bvand32(ULTIMATE.start___signbit_float_~w~1#1, 2147483648bv32) == 0bv32) && \result == 1bv32) || (\result == 0bv32 && ~bvand32(ULTIMATE.start___signbit_float_~w~1#1, 2147483648bv32) == 0bv32)) && (\exists v_arrayElimCell_3 : bv32 :: ~fp~LONGDOUBLE(v_arrayElimCell_3[31:31], v_arrayElimCell_3[30:23], v_arrayElimCell_3[22:0]) == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && ~fp~LONGDOUBLE(v_arrayElimCell_3[31:31], v_arrayElimCell_3[30:23], v_arrayElimCell_3[22:0]) == ~fp~LONGDOUBLE(ULTIMATE.start___signbit_float_~w~1#1[31:31], ULTIMATE.start___signbit_float_~w~1#1[30:23], ULTIMATE.start___signbit_float_~w~1#1[22:0]))) && aux-res == -0.0f && __signbit_float(res) == 1-aux [2022-02-20 16:46:07,224 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:46:07,224 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:07,225 INFO L158 Benchmark]: Toolchain (without parser) took 5240.71ms. Allocated memory was 48.2MB in the beginning and 81.8MB in the end (delta: 33.6MB). Free memory was 24.0MB in the beginning and 39.7MB in the end (delta: -15.7MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2022-02-20 16:46:07,225 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 48.2MB. Free memory was 30.5MB in the beginning and 30.4MB in the end (delta: 31.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:07,225 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.52ms. Allocated memory was 48.2MB in the beginning and 65.0MB in the end (delta: 16.8MB). Free memory was 23.8MB in the beginning and 47.9MB in the end (delta: -24.1MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2022-02-20 16:46:07,225 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.24ms. Allocated memory is still 65.0MB. Free memory was 47.9MB in the beginning and 45.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:07,226 INFO L158 Benchmark]: Boogie Preprocessor took 25.73ms. Allocated memory is still 65.0MB. Free memory was 45.9MB in the beginning and 44.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:07,226 INFO L158 Benchmark]: RCFGBuilder took 442.82ms. Allocated memory is still 65.0MB. Free memory was 44.2MB in the beginning and 46.5MB in the end (delta: -2.4MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2022-02-20 16:46:07,226 INFO L158 Benchmark]: TraceAbstraction took 4433.11ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 45.9MB in the beginning and 42.6MB in the end (delta: 3.4MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2022-02-20 16:46:07,227 INFO L158 Benchmark]: Witness Printer took 40.92ms. Allocated memory is still 81.8MB. Free memory was 42.6MB in the beginning and 39.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:07,228 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.20ms. Allocated memory is still 48.2MB. Free memory was 30.5MB in the beginning and 30.4MB in the end (delta: 31.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.52ms. Allocated memory was 48.2MB in the beginning and 65.0MB in the end (delta: 16.8MB). Free memory was 23.8MB in the beginning and 47.9MB in the end (delta: -24.1MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.24ms. Allocated memory is still 65.0MB. Free memory was 47.9MB in the beginning and 45.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.73ms. Allocated memory is still 65.0MB. Free memory was 45.9MB in the beginning and 44.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 442.82ms. Allocated memory is still 65.0MB. Free memory was 44.2MB in the beginning and 46.5MB in the end (delta: -2.4MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4433.11ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 45.9MB in the beginning and 42.6MB in the end (delta: 3.4MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. * Witness Printer took 40.92ms. Allocated memory is still 81.8MB. Free memory was 42.6MB in the beginning and 39.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] * 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: 82]: 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, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 316 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 55 IncrementalHoareTripleChecker+Unchecked, 211 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31 IncrementalHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 105 mSDtfsCounter, 31 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 37, 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 10 NumberOfFragments, 170 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 17 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 76 ConstructedInterpolants, 25 QuantifiedInterpolants, 872 SizeOfPredicates, 36 NumberOfNonLiveVariables, 291 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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: 19]: Loop Invariant Derived loop invariant: ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == x - InvariantResult [Line: 14]: Loop Invariant [2022-02-20 16:46:07,242 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,242 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,242 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,242 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13,QUANTIFIED] [2022-02-20 16:46:07,242 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,242 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,243 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,243 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,243 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,243 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,243 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,244 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13,QUANTIFIED] [2022-02-20 16:46:07,244 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,244 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,244 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,244 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] Derived loop invariant: (\exists v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9 : bv32, v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13 : bv32 :: (~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][22:0]) == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13][0bv32] == unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32]) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][22:0]) == \result) - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 57]: Loop Invariant [2022-02-20 16:46:07,245 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,245 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,245 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-02-20 16:46:07,245 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-02-20 16:46:07,245 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-02-20 16:46:07,246 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-02-20 16:46:07,246 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-02-20 16:46:07,246 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-02-20 16:46:07,246 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,246 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,246 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,246 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,247 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,247 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-02-20 16:46:07,247 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-02-20 16:46:07,247 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-02-20 16:46:07,247 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-02-20 16:46:07,247 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-02-20 16:46:07,247 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_3,QUANTIFIED] [2022-02-20 16:46:07,247 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,248 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,248 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] Derived loop invariant: (\exists ULTIMATE.start___signbit_float_~w~1#1 : bv32 :: ((!(~bvand32(ULTIMATE.start___signbit_float_~w~1#1, 2147483648bv32) == 0bv32) && \result == 1bv32) || (\result == 0bv32 && ~bvand32(ULTIMATE.start___signbit_float_~w~1#1, 2147483648bv32) == 0bv32)) && (\exists v_arrayElimCell_3 : bv32 :: ~fp~LONGDOUBLE(v_arrayElimCell_3[31:31], v_arrayElimCell_3[30:23], v_arrayElimCell_3[22:0]) == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && ~fp~LONGDOUBLE(v_arrayElimCell_3[31:31], v_arrayElimCell_3[30:23], v_arrayElimCell_3[22:0]) == ~fp~LONGDOUBLE(ULTIMATE.start___signbit_float_~w~1#1[31:31], ULTIMATE.start___signbit_float_~w~1#1[30:23], ULTIMATE.start___signbit_float_~w~1#1[22:0]))) && aux-res == -0.0f && __signbit_float(res) == 1-aux - InvariantResult [Line: 60]: Loop Invariant [2022-02-20 16:46:07,248 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,248 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,248 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,249 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13,QUANTIFIED] [2022-02-20 16:46:07,249 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,249 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,249 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,249 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,250 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,250 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,250 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,250 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13,QUANTIFIED] [2022-02-20 16:46:07,250 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,250 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,250 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,252 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] Derived loop invariant: (\exists v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9 : bv32, v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13 : bv32 :: (~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][22:0]) == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#gf_u~0#1.base_13][0bv32] == unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32]) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][22:0]) == x) && aux-res == -0.0f && __signbit_float(res) == 1-aux RESULT: Ultimate proved your program to be correct! [2022-02-20 16:46:07,282 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