./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1012b.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_1012b.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 e833158a76fcb6c2772449e786bfe7e91a3ec1f9488e1d61542cc7f9c3dece0e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:45:52,972 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:45:52,974 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:45:53,006 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:45:53,007 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:45:53,009 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:45:53,010 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:45:53,012 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:45:53,014 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:45:53,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:45:53,018 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:45:53,019 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:45:53,019 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:45:53,021 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:45:53,022 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:45:53,024 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:45:53,025 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:45:53,026 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:45:53,027 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:45:53,033 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:45:53,033 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:45:53,034 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:45:53,035 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:45:53,036 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:45:53,040 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:45:53,041 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:45:53,041 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:45:53,042 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:45:53,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:45:53,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:45:53,043 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:45:53,044 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:45:53,045 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:45:53,045 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:45:53,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:45:53,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:45:53,047 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:45:53,047 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:45:53,047 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:45:53,048 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:45:53,048 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:45:53,049 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:53,077 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:45:53,077 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:45:53,078 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:45:53,078 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:45:53,078 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:45:53,078 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:45:53,079 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:45:53,079 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:45:53,079 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:45:53,079 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:45:53,080 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:45:53,080 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:45:53,080 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:45:53,080 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:45:53,080 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:45:53,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:45:53,081 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:45:53,081 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:45:53,081 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:45:53,081 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:45:53,081 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:45:53,081 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:45:53,082 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:45:53,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:45:53,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:45:53,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:45:53,082 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:45:53,082 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:45:53,082 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:45:53,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:45:53,083 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:45:53,083 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:45:53,083 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:45:53,083 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 -> e833158a76fcb6c2772449e786bfe7e91a3ec1f9488e1d61542cc7f9c3dece0e [2022-02-20 16:45:53,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:45:53,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:45:53,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:45:53,277 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:45:53,277 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:45:53,278 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1012b.c [2022-02-20 16:45:53,339 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5511bab71/63cac273ffa748218e0da607b71ea6f9/FLAG6b57e4a63 [2022-02-20 16:45:53,682 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:45:53,683 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1012b.c [2022-02-20 16:45:53,700 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5511bab71/63cac273ffa748218e0da607b71ea6f9/FLAG6b57e4a63 [2022-02-20 16:45:54,114 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5511bab71/63cac273ffa748218e0da607b71ea6f9 [2022-02-20 16:45:54,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:45:54,117 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:45:54,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:45:54,119 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:45:54,121 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:45:54,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:45:54" (1/1) ... [2022-02-20 16:45:54,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b8f151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:45:54, skipping insertion in model container [2022-02-20 16:45:54,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:45:54" (1/1) ... [2022-02-20 16:45:54,128 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:45:54,138 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:45:54,284 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_1012b.c[1158,1171] [2022-02-20 16:45:54,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:45:54,297 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:45:54,318 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_1012b.c[1158,1171] [2022-02-20 16:45:54,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:45:54,341 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:45:54,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:45:54 WrapperNode [2022-02-20 16:45:54,341 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:45:54,342 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:45:54,342 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:45:54,343 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:45:54,347 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:54" (1/1) ... [2022-02-20 16:45:54,352 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:54" (1/1) ... [2022-02-20 16:45:54,365 INFO L137 Inliner]: procedures = 16, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66 [2022-02-20 16:45:54,366 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:45:54,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:45:54,366 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:45:54,366 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:45:54,372 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:54" (1/1) ... [2022-02-20 16:45:54,372 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:54" (1/1) ... [2022-02-20 16:45:54,373 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:54" (1/1) ... [2022-02-20 16:45:54,374 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:54" (1/1) ... [2022-02-20 16:45:54,378 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:54" (1/1) ... [2022-02-20 16:45:54,381 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:54" (1/1) ... [2022-02-20 16:45:54,381 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:54" (1/1) ... [2022-02-20 16:45:54,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:45:54,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:45:54,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:45:54,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:45:54,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:45:54" (1/1) ... [2022-02-20 16:45:54,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:45:54,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:45:54,412 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:54,429 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:54,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:45:54,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:45:54,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:45:54,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:45:54,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:45:54,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:45:54,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:45:54,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:45:54,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:45:54,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:45:54,528 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:45:54,536 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:45:54,734 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:45:54,738 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:45:54,739 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 16:45:54,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:45:54 BoogieIcfgContainer [2022-02-20 16:45:54,740 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:45:54,741 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:45:54,741 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:45:54,747 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:45:54,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:45:54" (1/3) ... [2022-02-20 16:45:54,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cdf3a61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:45:54, skipping insertion in model container [2022-02-20 16:45:54,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:45:54" (2/3) ... [2022-02-20 16:45:54,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cdf3a61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:45:54, skipping insertion in model container [2022-02-20 16:45:54,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:45:54" (3/3) ... [2022-02-20 16:45:54,749 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1012b.c [2022-02-20 16:45:54,757 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:45:54,757 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:45:54,789 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:45:54,794 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:54,794 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:45:54,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5) internal successors, (24), 17 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:45:54,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:45:54,809 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:45:54,809 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:45:54,809 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:45:54,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:45:54,813 INFO L85 PathProgramCache]: Analyzing trace with hash -969083750, now seen corresponding path program 1 times [2022-02-20 16:45:54,820 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:45:54,820 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718870353] [2022-02-20 16:45:54,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:45:54,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:45:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:45:54,946 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#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); {21#true} is VALID [2022-02-20 16:45:54,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#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_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0);assume { :begin_inline_fabs_float } true;fabs_float_#in~x#1 := main_~x~0#1;havoc fabs_float_#res#1;havoc fabs_float_#t~mem4#1, fabs_float_~#gf_u~0#1.base, fabs_float_~#gf_u~0#1.offset, fabs_float_#t~mem5#1, fabs_float_~#sf_u~0#1.base, fabs_float_~#sf_u~0#1.offset, fabs_float_~x#1, fabs_float_~ix~0#1;fabs_float_~x#1 := fabs_float_#in~x#1;havoc fabs_float_~ix~0#1; {21#true} is VALID [2022-02-20 16:45:54,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-02-20 16:45:54,948 INFO L290 TraceCheckUtils]: 3: Hoare triple {22#false} assume !true; {22#false} is VALID [2022-02-20 16:45:54,949 INFO L290 TraceCheckUtils]: 4: Hoare triple {22#false} fabs_float_#res#1 := fabs_float_~x#1; {22#false} is VALID [2022-02-20 16:45:54,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#false} main_#t~ret7#1 := fabs_float_#res#1;assume { :end_inline_fabs_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_~res~0#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem6#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, isinf_float_~x#1, isinf_float_~ix~1#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~1#1; {22#false} is VALID [2022-02-20 16:45:54,949 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#false} assume !true; {22#false} is VALID [2022-02-20 16:45:54,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {22#false} isinf_float_~ix~1#1 := (if 0 == isinf_float_~ix~1#1 then 0 else (if 1 == isinf_float_~ix~1#1 then 1 else ~bitwiseAnd(isinf_float_~ix~1#1, 2147483647)));isinf_float_#res#1 := (if 2139095040 == isinf_float_~ix~1#1 then 1 else 0); {22#false} is VALID [2022-02-20 16:45:54,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} main_#t~ret8#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647; {22#false} is VALID [2022-02-20 16:45:54,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume 0 == main_#t~ret8#1;havoc main_#t~ret8#1; {22#false} is VALID [2022-02-20 16:45:54,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-02-20 16:45:54,953 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:54,954 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:45:54,955 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718870353] [2022-02-20 16:45:54,956 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718870353] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:45:54,956 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:45:54,957 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:45:54,959 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181553104] [2022-02-20 16:45:54,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:45:54,964 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:45:54,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:45:54,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:45:54,990 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:45:54,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:45:54,990 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:45:55,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:45:55,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:45:55,022 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5) internal successors, (24), 17 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 has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:45:55,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:45:55,062 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-02-20 16:45:55,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:45:55,063 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:45:55,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:45:55,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:45:55,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2022-02-20 16:45:55,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:45:55,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2022-02-20 16:45:55,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 46 transitions. [2022-02-20 16:45:55,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:45:55,142 INFO L225 Difference]: With dead ends: 34 [2022-02-20 16:45:55,143 INFO L226 Difference]: Without dead ends: 15 [2022-02-20 16:45:55,145 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:55,148 INFO L933 BasicCegarLoop]: 17 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, 17 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:55,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 17 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:55,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-20 16:45:55,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-20 16:45:55,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:45:55,174 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 0 states have call successors, (0), 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:55,175 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 0 states have call successors, (0), 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:55,175 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 0 states have call successors, (0), 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:55,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:45:55,180 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2022-02-20 16:45:55,180 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2022-02-20 16:45:55,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:45:55,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:45:55,182 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 0 states have call successors, (0), 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 15 states. [2022-02-20 16:45:55,182 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 0 states have call successors, (0), 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 15 states. [2022-02-20 16:45:55,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:45:55,184 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2022-02-20 16:45:55,185 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2022-02-20 16:45:55,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:45:55,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:45:55,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:45:55,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:45:55,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 0 states have call successors, (0), 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:55,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 14 transitions. [2022-02-20 16:45:55,188 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 14 transitions. Word has length 11 [2022-02-20 16:45:55,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:45:55,188 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 14 transitions. [2022-02-20 16:45:55,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:45:55,189 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2022-02-20 16:45:55,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:45:55,190 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:45:55,190 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:45:55,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:45:55,193 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:45:55,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:45:55,195 INFO L85 PathProgramCache]: Analyzing trace with hash 657368916, now seen corresponding path program 1 times [2022-02-20 16:45:55,195 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:45:55,195 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277590444] [2022-02-20 16:45:55,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:45:55,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:45:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:45:55,287 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:45:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:45:55,335 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:45:55,335 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:45:55,336 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:45:55,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:45:55,340 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:45:55,342 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:45:55,361 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:45:55,362 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:45:55,362 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-02-20 16:45:55,362 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-02-20 16:45:55,362 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2022-02-20 16:45:55,362 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2022-02-20 16:45:55,362 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-20 16:45:55,362 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-20 16:45:55,362 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-20 16:45:55,362 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-20 16:45:55,362 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2022-02-20 16:45:55,363 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-20 16:45:55,363 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2022-02-20 16:45:55,363 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2022-02-20 16:45:55,364 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2022-02-20 16:45:55,364 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2022-02-20 16:45:55,364 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-02-20 16:45:55,364 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 16:45:55,364 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-20 16:45:55,364 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-20 16:45:55,364 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-02-20 16:45:55,364 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-02-20 16:45:55,364 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:45:55,365 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:45:55,365 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:55,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:45:55 BoogieIcfgContainer [2022-02-20 16:45:55,366 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:45:55,367 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:45:55,367 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:45:55,367 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:45:55,368 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:54" (3/4) ... [2022-02-20 16:45:55,370 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:45:55,370 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:45:55,371 INFO L158 Benchmark]: Toolchain (without parser) took 1253.55ms. Allocated memory is still 123.7MB. Free memory was 92.5MB in the beginning and 95.5MB in the end (delta: -2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:45:55,371 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 90.2MB. Free memory was 45.3MB in the beginning and 45.3MB in the end (delta: 47.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:45:55,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.51ms. Allocated memory is still 123.7MB. Free memory was 92.3MB in the beginning and 100.1MB in the end (delta: -7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:45:55,375 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.44ms. Allocated memory is still 123.7MB. Free memory was 100.1MB in the beginning and 98.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:45:55,376 INFO L158 Benchmark]: Boogie Preprocessor took 16.37ms. Allocated memory is still 123.7MB. Free memory was 98.4MB in the beginning and 97.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:45:55,377 INFO L158 Benchmark]: RCFGBuilder took 357.06ms. Allocated memory is still 123.7MB. Free memory was 97.0MB in the beginning and 84.8MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 16:45:55,377 INFO L158 Benchmark]: TraceAbstraction took 625.03ms. Allocated memory is still 123.7MB. Free memory was 84.1MB in the beginning and 96.1MB in the end (delta: -11.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:45:55,377 INFO L158 Benchmark]: Witness Printer took 3.24ms. Allocated memory is still 123.7MB. Free memory was 96.1MB in the beginning and 95.5MB in the end (delta: 591.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:45:55,379 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.14ms. Allocated memory is still 90.2MB. Free memory was 45.3MB in the beginning and 45.3MB in the end (delta: 47.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.51ms. Allocated memory is still 123.7MB. Free memory was 92.3MB in the beginning and 100.1MB in the end (delta: -7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.44ms. Allocated memory is still 123.7MB. Free memory was 100.1MB in the beginning and 98.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.37ms. Allocated memory is still 123.7MB. Free memory was 98.4MB in the beginning and 97.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 357.06ms. Allocated memory is still 123.7MB. Free memory was 97.0MB in the beginning and 84.8MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 625.03ms. Allocated memory is still 123.7MB. Free memory was 84.1MB in the beginning and 96.1MB in the end (delta: -11.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.24ms. Allocated memory is still 123.7MB. Free memory was 96.1MB in the beginning and 95.5MB in the end (delta: 591.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.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: 53]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticFLOAToperation at line 48, overapproximation of bitwiseAnd at line 36. Possible FailurePath: [L48] float x = -1.0f / 0.0f; [L49] CALL, EXPR fabs_float(x) [L14] __uint32_t ix; VAL [\old(x)=4294967298, x=4294967298] [L16] ieee_float_shape_type gf_u; [L17] gf_u.value = (x) [L18] EXPR gf_u.word [L18] (ix) = gf_u.word [L21] ieee_float_shape_type sf_u; [L22] sf_u.word = (ix & 0x7fffffff) [L23] EXPR sf_u.value [L23] (x) = sf_u.value [L25] return x; VAL [\old(x)=4294967298, \result=4294967296, ix=1, x=4294967296] [L49] RET, EXPR fabs_float(x) [L49] float res = fabs_float(x); [L52] CALL, EXPR isinf_float(res) [L30] __int32_t ix; VAL [\old(x)=4294967296, x=4294967296] [L32] ieee_float_shape_type gf_u; [L33] gf_u.value = (x) [L34] EXPR gf_u.word [L34] (ix) = gf_u.word [L36] ix &= 0x7fffffff [L37] return ((ix) == 0x7f800000L); VAL [\old(x)=4294967296, \result=0, ix=0, x=4294967296] [L52] RET, EXPR isinf_float(res) [L52] COND TRUE !isinf_float(res) [L53] reach_error() VAL [res=4294967296, x=4294967298] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, 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, 17 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, 17 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=18occurred 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.1s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 10 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:55,414 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_1012b.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 e833158a76fcb6c2772449e786bfe7e91a3ec1f9488e1d61542cc7f9c3dece0e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:45:57,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:45:57,012 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:45:57,043 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:45:57,043 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:45:57,046 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:45:57,048 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:45:57,053 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:45:57,055 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:45:57,059 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:45:57,060 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:45:57,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:45:57,066 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:45:57,068 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:45:57,069 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:45:57,075 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:45:57,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:45:57,079 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:45:57,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:45:57,082 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:45:57,085 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:45:57,086 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:45:57,087 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:45:57,088 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:45:57,090 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:45:57,091 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:45:57,091 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:45:57,092 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:45:57,093 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:45:57,093 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:45:57,094 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:45:57,094 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:45:57,096 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:45:57,096 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:45:57,097 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:45:57,097 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:45:57,098 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:45:57,098 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:45:57,098 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:45:57,099 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:45:57,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:45:57,103 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:45:57,130 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:45:57,131 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:45:57,132 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:45:57,132 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:45:57,133 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:45:57,133 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:45:57,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:45:57,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:45:57,134 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:45:57,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:45:57,135 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:45:57,135 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:45:57,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:45:57,135 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:45:57,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:45:57,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:45:57,136 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:45:57,136 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:45:57,136 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:45:57,136 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:45:57,136 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:45:57,137 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:45:57,137 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:45:57,137 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:45:57,137 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:45:57,137 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:45:57,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:45:57,138 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:45:57,138 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:45:57,138 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:45:57,138 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:45:57,138 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:45:57,139 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:45:57,139 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:45:57,139 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:45:57,139 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:45:57,139 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e833158a76fcb6c2772449e786bfe7e91a3ec1f9488e1d61542cc7f9c3dece0e [2022-02-20 16:45:57,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:45:57,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:45:57,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:45:57,409 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:45:57,410 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:45:57,411 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1012b.c [2022-02-20 16:45:57,466 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dac4d6b80/dd2eef4aba394a6ca387a37576e8a7fe/FLAG838b0de1b [2022-02-20 16:45:57,837 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:45:57,837 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1012b.c [2022-02-20 16:45:57,843 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dac4d6b80/dd2eef4aba394a6ca387a37576e8a7fe/FLAG838b0de1b [2022-02-20 16:45:57,855 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dac4d6b80/dd2eef4aba394a6ca387a37576e8a7fe [2022-02-20 16:45:57,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:45:57,858 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:45:57,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:45:57,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:45:57,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:45:57,863 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,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f624090 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,864 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,869 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:45:57,884 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:45:58,002 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_1012b.c[1158,1171] [2022-02-20 16:45:58,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:45:58,018 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:45:58,050 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_1012b.c[1158,1171] [2022-02-20 16:45:58,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:45:58,083 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:45:58,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:45:58 WrapperNode [2022-02-20 16:45:58,085 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:45:58,086 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:45:58,086 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:45:58,086 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:45:58,091 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:58" (1/1) ... [2022-02-20 16:45:58,109 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:58" (1/1) ... [2022-02-20 16:45:58,133 INFO L137 Inliner]: procedures = 19, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66 [2022-02-20 16:45:58,134 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:45:58,135 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:45:58,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:45:58,135 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:45:58,141 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:58" (1/1) ... [2022-02-20 16:45:58,142 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:58" (1/1) ... [2022-02-20 16:45:58,149 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:58" (1/1) ... [2022-02-20 16:45:58,150 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:58" (1/1) ... [2022-02-20 16:45:58,156 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:58" (1/1) ... [2022-02-20 16:45:58,159 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:58" (1/1) ... [2022-02-20 16:45:58,163 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:58" (1/1) ... [2022-02-20 16:45:58,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:45:58,168 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:45:58,169 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:45:58,169 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:45:58,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:45:58" (1/1) ... [2022-02-20 16:45:58,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:45:58,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:45:58,192 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:58,194 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:58,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:45:58,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:45:58,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:45:58,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:45:58,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:45:58,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:45:58,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:45:58,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:45:58,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:45:58,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:45:58,297 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:45:58,298 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:45:58,508 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:45:58,514 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:45:58,521 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 16:45:58,523 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,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:45:58,526 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:45:58,526 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:45:58,527 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:45:58,528 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,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec2233e 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,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:45:58" (2/3) ... [2022-02-20 16:45:58,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec2233e 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,563 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,565 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1012b.c [2022-02-20 16:45:58,574 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:45:58,575 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:45:58,631 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:45:58,649 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,649 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:45:58,659 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5) internal successors, (24), 17 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:45:58,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:45:58,662 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:45:58,663 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:45:58,663 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:45:58,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:45:58,668 INFO L85 PathProgramCache]: Analyzing trace with hash -969083750, now seen corresponding path program 1 times [2022-02-20 16:45:58,677 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:45:58,678 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133842718] [2022-02-20 16:45:58,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:45:58,679 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:45:58,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:45:58,685 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:45:58,687 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:45:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:45:58,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:45:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:45:58,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:45:58,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#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); {21#true} is VALID [2022-02-20 16:45:58,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#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_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());assume { :begin_inline_fabs_float } true;fabs_float_#in~x#1 := main_~x~0#1;havoc fabs_float_#res#1;havoc fabs_float_#t~mem4#1, fabs_float_~#gf_u~0#1.base, fabs_float_~#gf_u~0#1.offset, fabs_float_#t~mem5#1, fabs_float_~#sf_u~0#1.base, fabs_float_~#sf_u~0#1.offset, fabs_float_~x#1, fabs_float_~ix~0#1;fabs_float_~x#1 := fabs_float_#in~x#1;havoc fabs_float_~ix~0#1; {21#true} is VALID [2022-02-20 16:45:58,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-02-20 16:45:58,803 INFO L290 TraceCheckUtils]: 3: Hoare triple {22#false} assume !true; {22#false} is VALID [2022-02-20 16:45:58,803 INFO L290 TraceCheckUtils]: 4: Hoare triple {22#false} fabs_float_#res#1 := fabs_float_~x#1; {22#false} is VALID [2022-02-20 16:45:58,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#false} main_#t~ret7#1 := fabs_float_#res#1;assume { :end_inline_fabs_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_~res~0#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem6#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, isinf_float_~x#1, isinf_float_~ix~1#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~1#1; {22#false} is VALID [2022-02-20 16:45:58,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#false} assume !true; {22#false} is VALID [2022-02-20 16:45:58,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {22#false} isinf_float_~ix~1#1 := ~bvand32(2147483647bv32, isinf_float_~ix~1#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~1#1 then 1bv32 else 0bv32); {22#false} is VALID [2022-02-20 16:45:58,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} main_#t~ret8#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true; {22#false} is VALID [2022-02-20 16:45:58,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume 0bv32 == main_#t~ret8#1;havoc main_#t~ret8#1; {22#false} is VALID [2022-02-20 16:45:58,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-02-20 16:45:58,806 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,806 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:45:58,807 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:45:58,807 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133842718] [2022-02-20 16:45:58,807 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [133842718] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:45:58,807 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:45:58,808 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:45:58,810 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388387328] [2022-02-20 16:45:58,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:45:58,814 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:45:58,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:45:58,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:45:58,839 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:45:58,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:45:58,840 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:45:58,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:45:58,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:45:58,864 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5) internal successors, (24), 17 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 has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:45:58,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:45:58,902 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-02-20 16:45:58,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:45:58,903 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:45:58,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:45:58,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:45:58,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2022-02-20 16:45:58,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:45:58,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2022-02-20 16:45:58,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 46 transitions. [2022-02-20 16:45:58,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:45:58,968 INFO L225 Difference]: With dead ends: 34 [2022-02-20 16:45:58,969 INFO L226 Difference]: Without dead ends: 15 [2022-02-20 16:45:58,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:45:58,975 INFO L933 BasicCegarLoop]: 17 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, 17 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,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 17 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,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-20 16:45:58,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-20 16:45:58,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:45:58,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 0 states have call successors, (0), 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,995 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 0 states have call successors, (0), 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,995 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 0 states have call successors, (0), 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,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:45:58,996 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2022-02-20 16:45:58,996 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2022-02-20 16:45:58,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:45:58,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:45:58,997 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 0 states have call successors, (0), 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 15 states. [2022-02-20 16:45:58,997 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 0 states have call successors, (0), 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 15 states. [2022-02-20 16:45:58,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:45:58,998 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2022-02-20 16:45:58,998 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2022-02-20 16:45:58,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:45:58,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:45:58,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:45:58,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:45:58,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 0 states have call successors, (0), 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:59,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 14 transitions. [2022-02-20 16:45:59,001 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 14 transitions. Word has length 11 [2022-02-20 16:45:59,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:45:59,001 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 14 transitions. [2022-02-20 16:45:59,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:45:59,001 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2022-02-20 16:45:59,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:45:59,002 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:45:59,002 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:45:59,012 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:45:59,209 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:45:59,210 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:45:59,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:45:59,210 INFO L85 PathProgramCache]: Analyzing trace with hash 657368916, now seen corresponding path program 1 times [2022-02-20 16:45:59,211 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:45:59,211 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31346548] [2022-02-20 16:45:59,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:45:59,212 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:45:59,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:45:59,213 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:45:59,214 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:45:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:45:59,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 16:45:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:45:59,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:45:59,405 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:45:59,520 INFO L356 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2022-02-20 16:45:59,521 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 45 treesize of output 36 [2022-02-20 16:45:59,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2022-02-20 16:46:00,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#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); {148#true} is VALID [2022-02-20 16:46:00,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#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_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());assume { :begin_inline_fabs_float } true;fabs_float_#in~x#1 := main_~x~0#1;havoc fabs_float_#res#1;havoc fabs_float_#t~mem4#1, fabs_float_~#gf_u~0#1.base, fabs_float_~#gf_u~0#1.offset, fabs_float_#t~mem5#1, fabs_float_~#sf_u~0#1.base, fabs_float_~#sf_u~0#1.offset, fabs_float_~x#1, fabs_float_~ix~0#1;fabs_float_~x#1 := fabs_float_#in~x#1;havoc fabs_float_~ix~0#1; {156#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fabs_float_~x#1|))} is VALID [2022-02-20 16:46:00,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fabs_float_~x#1|))} call fabs_float_~#gf_u~0#1.base, fabs_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fabs_float_~x#1, fabs_float_~#gf_u~0#1.base, fabs_float_~#gf_u~0#1.offset, 4bv32);call fabs_float_#t~mem4#1 := read~intINTTYPE4(fabs_float_~#gf_u~0#1.base, fabs_float_~#gf_u~0#1.offset, 4bv32);fabs_float_~ix~0#1 := fabs_float_#t~mem4#1;havoc fabs_float_#t~mem4#1;call ULTIMATE.dealloc(fabs_float_~#gf_u~0#1.base, fabs_float_~#gf_u~0#1.offset);havoc fabs_float_~#gf_u~0#1.base, fabs_float_~#gf_u~0#1.offset; {160#(exists ((|v_ULTIMATE.start_fabs_float_~#gf_u~0#1.base_6| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#gf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#gf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#gf_u~0#1.base_6|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#gf_u~0#1.base_6|) (_ bv0 32)) |ULTIMATE.start_fabs_float_~ix~0#1|)))} is VALID [2022-02-20 16:46:00,169 INFO L290 TraceCheckUtils]: 3: Hoare triple {160#(exists ((|v_ULTIMATE.start_fabs_float_~#gf_u~0#1.base_6| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#gf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#gf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#gf_u~0#1.base_6|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#gf_u~0#1.base_6|) (_ bv0 32)) |ULTIMATE.start_fabs_float_~ix~0#1|)))} goto; {160#(exists ((|v_ULTIMATE.start_fabs_float_~#gf_u~0#1.base_6| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#gf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#gf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#gf_u~0#1.base_6|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#gf_u~0#1.base_6|) (_ bv0 32)) |ULTIMATE.start_fabs_float_~ix~0#1|)))} is VALID [2022-02-20 16:46:00,172 INFO L290 TraceCheckUtils]: 4: Hoare triple {160#(exists ((|v_ULTIMATE.start_fabs_float_~#gf_u~0#1.base_6| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#gf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#gf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#gf_u~0#1.base_6|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#gf_u~0#1.base_6|) (_ bv0 32)) |ULTIMATE.start_fabs_float_~ix~0#1|)))} call fabs_float_~#sf_u~0#1.base, fabs_float_~#sf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(~bvand32(2147483647bv32, fabs_float_~ix~0#1), fabs_float_~#sf_u~0#1.base, fabs_float_~#sf_u~0#1.offset, 4bv32);call fabs_float_#t~mem5#1 := read~intFLOATTYPE4(fabs_float_~#sf_u~0#1.base, fabs_float_~#sf_u~0#1.offset, 4bv32);fabs_float_~x#1 := fabs_float_#t~mem5#1;havoc fabs_float_#t~mem5#1;call ULTIMATE.dealloc(fabs_float_~#sf_u~0#1.base, fabs_float_~#sf_u~0#1.offset);havoc fabs_float_~#sf_u~0#1.base, fabs_float_~#sf_u~0#1.offset; {167#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (|v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_1) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_fabs_float_~x#1|) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:00,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {167#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (|v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_1) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_fabs_float_~x#1|) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))))} goto; {167#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (|v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_1) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_fabs_float_~x#1|) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:00,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {167#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (|v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_1) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_fabs_float_~x#1|) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))))} fabs_float_#res#1 := fabs_float_~x#1; {174#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (|v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_1) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_fabs_float_#res#1|)))} is VALID [2022-02-20 16:46:00,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {174#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (|v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_1) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_fabs_float_#res#1|)))} main_#t~ret7#1 := fabs_float_#res#1;assume { :end_inline_fabs_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_~res~0#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem6#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, isinf_float_~x#1, isinf_float_~ix~1#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~1#1; {178#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (|v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_1) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_isinf_float_~x#1|) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:00,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {178#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (|v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_1) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_isinf_float_~x#1|) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))))} call isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isinf_float_~x#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, 4bv32);call isinf_float_#t~mem6#1 := read~intINTTYPE4(isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, 4bv32);isinf_float_~ix~1#1 := isinf_float_#t~mem6#1;havoc isinf_float_#t~mem6#1;call ULTIMATE.dealloc(isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset);havoc isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset; {182#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~1#1|)) (fp ((_ extract 31 31) (bvand (_ bv2147483647 32) v_arrayElimCell_1)) ((_ extract 30 23) (bvand (_ bv2147483647 32) v_arrayElimCell_1)) ((_ extract 22 0) (bvand (_ bv2147483647 32) v_arrayElimCell_1)))) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:00,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {182#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~1#1|)) (fp ((_ extract 31 31) (bvand (_ bv2147483647 32) v_arrayElimCell_1)) ((_ extract 30 23) (bvand (_ bv2147483647 32) v_arrayElimCell_1)) ((_ extract 22 0) (bvand (_ bv2147483647 32) v_arrayElimCell_1)))) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))))} goto; {182#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~1#1|)) (fp ((_ extract 31 31) (bvand (_ bv2147483647 32) v_arrayElimCell_1)) ((_ extract 30 23) (bvand (_ bv2147483647 32) v_arrayElimCell_1)) ((_ extract 22 0) (bvand (_ bv2147483647 32) v_arrayElimCell_1)))) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:00,182 INFO L290 TraceCheckUtils]: 10: Hoare triple {182#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~1#1|)) (fp ((_ extract 31 31) (bvand (_ bv2147483647 32) v_arrayElimCell_1)) ((_ extract 30 23) (bvand (_ bv2147483647 32) v_arrayElimCell_1)) ((_ extract 22 0) (bvand (_ bv2147483647 32) v_arrayElimCell_1)))) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))))} isinf_float_~ix~1#1 := ~bvand32(2147483647bv32, isinf_float_~ix~1#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~1#1 then 1bv32 else 0bv32); {189#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (|v_ULTIMATE.start_isinf_float_~ix~1#1_6| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) (bvand (_ bv2147483647 32) v_arrayElimCell_1)) ((_ extract 30 23) (bvand (_ bv2147483647 32) v_arrayElimCell_1)) ((_ extract 22 0) (bvand (_ bv2147483647 32) v_arrayElimCell_1))) (fp ((_ extract 31 31) |v_ULTIMATE.start_isinf_float_~ix~1#1_6|) ((_ extract 30 23) |v_ULTIMATE.start_isinf_float_~ix~1#1_6|) ((_ extract 22 0) |v_ULTIMATE.start_isinf_float_~ix~1#1_6|))) (= |ULTIMATE.start_isinf_float_#res#1| (_ bv1 32)) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:00,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {189#(exists ((v_arrayElimCell_1 (_ BitVec 32)) (|v_ULTIMATE.start_isinf_float_~ix~1#1_6| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) (bvand (_ bv2147483647 32) v_arrayElimCell_1)) ((_ extract 30 23) (bvand (_ bv2147483647 32) v_arrayElimCell_1)) ((_ extract 22 0) (bvand (_ bv2147483647 32) v_arrayElimCell_1))) (fp ((_ extract 31 31) |v_ULTIMATE.start_isinf_float_~ix~1#1_6|) ((_ extract 30 23) |v_ULTIMATE.start_isinf_float_~ix~1#1_6|) ((_ extract 22 0) |v_ULTIMATE.start_isinf_float_~ix~1#1_6|))) (= |ULTIMATE.start_isinf_float_#res#1| (_ bv1 32)) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))))} main_#t~ret8#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true; {193#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret8#1|)} is VALID [2022-02-20 16:46:00,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {193#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret8#1|)} assume 0bv32 == main_#t~ret8#1;havoc main_#t~ret8#1; {149#false} is VALID [2022-02-20 16:46:00,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {149#false} assume !false; {149#false} is VALID [2022-02-20 16:46:00,184 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:00,184 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:00,184 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:00,184 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31346548] [2022-02-20 16:46:00,185 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [31346548] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:00,185 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:00,185 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 16:46:00,185 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068271980] [2022-02-20 16:46:00,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:00,186 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-02-20 16:46:00,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:00,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 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:00,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:00,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 16:46:00,214 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:00,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 16:46:00,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:46:00,215 INFO L87 Difference]: Start difference. First operand 15 states and 14 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 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:00,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:00,293 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2022-02-20 16:46:00,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 16:46:00,293 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-02-20 16:46:00,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:00,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 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:00,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2022-02-20 16:46:00,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 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:00,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2022-02-20 16:46:00,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 14 transitions. [2022-02-20 16:46:00,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:00,324 INFO L225 Difference]: With dead ends: 15 [2022-02-20 16:46:00,324 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:46:00,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:46:00,325 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:00,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 14 Unchecked, 0.0s Time] [2022-02-20 16:46:00,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:46:00,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:46:00,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:00,326 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:00,326 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:00,326 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:00,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:00,326 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:00,326 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:00,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:00,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:00,327 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:00,327 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:00,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:00,327 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:00,327 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:00,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:00,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:00,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:00,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:00,327 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:00,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:46:00,327 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-02-20 16:46:00,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:00,328 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:46:00,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 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:00,328 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:00,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:00,330 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:00,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:00,538 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:00,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:46:00,566 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:46:00,566 INFO L858 garLoopResultBuilder]: For program point L31-1(lines 31 35) no Hoare annotation was computed. [2022-02-20 16:46:00,566 INFO L854 garLoopResultBuilder]: At program point L31-2(lines 31 35) the Hoare annotation is: (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32)))) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_1) .cse0) (= (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)) |ULTIMATE.start_isinf_float_~x#1|) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))))) [2022-02-20 16:46:00,566 INFO L858 garLoopResultBuilder]: For program point L31-3(lines 31 35) no Hoare annotation was computed. [2022-02-20 16:46:00,566 INFO L854 garLoopResultBuilder]: At program point L25(lines 13 26) the Hoare annotation is: (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6|) (_ bv0 32)))) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_1) .cse0) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))) (= (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)) |ULTIMATE.start_fabs_float_#res#1|)))) [2022-02-20 16:46:00,567 INFO L858 garLoopResultBuilder]: For program point L52(lines 52 55) no Hoare annotation was computed. [2022-02-20 16:46:00,567 INFO L858 garLoopResultBuilder]: For program point L15-1(lines 15 19) no Hoare annotation was computed. [2022-02-20 16:46:00,569 INFO L854 garLoopResultBuilder]: At program point L15-2(lines 15 19) the Hoare annotation is: (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fabs_float_~x#1|)) [2022-02-20 16:46:00,569 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:46:00,569 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:46:00,569 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:46:00,569 INFO L861 garLoopResultBuilder]: At program point L57(lines 40 58) the Hoare annotation is: true [2022-02-20 16:46:00,569 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 53) no Hoare annotation was computed. [2022-02-20 16:46:00,570 INFO L858 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2022-02-20 16:46:00,570 INFO L858 garLoopResultBuilder]: For program point L20(lines 20 24) no Hoare annotation was computed. [2022-02-20 16:46:00,571 INFO L858 garLoopResultBuilder]: For program point L20-1(lines 13 26) no Hoare annotation was computed. [2022-02-20 16:46:00,572 INFO L858 garLoopResultBuilder]: For program point L20-2(lines 20 24) no Hoare annotation was computed. [2022-02-20 16:46:00,572 INFO L854 garLoopResultBuilder]: At program point L37(lines 29 38) the Hoare annotation is: (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|v_ULTIMATE.start_isinf_float_~ix~1#1_6| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse0 (bvand (_ bv2147483647 32) v_arrayElimCell_1))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp ((_ extract 31 31) |v_ULTIMATE.start_isinf_float_~ix~1#1_6|) ((_ extract 30 23) |v_ULTIMATE.start_isinf_float_~ix~1#1_6|) ((_ extract 22 0) |v_ULTIMATE.start_isinf_float_~ix~1#1_6|))) (= |ULTIMATE.start_isinf_float_#res#1| (_ bv1 32)) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))) [2022-02-20 16:46:00,576 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:46:00,578 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:00,581 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:00,581 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:00,581 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2022-02-20 16:46:00,581 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-20 16:46:00,581 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2022-02-20 16:46:00,581 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2022-02-20 16:46:00,581 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-20 16:46:00,585 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-20 16:46:00,585 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-20 16:46:00,585 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-20 16:46:00,585 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2022-02-20 16:46:00,595 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2022-02-20 16:46:00,595 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-02-20 16:46:00,595 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2022-02-20 16:46:00,595 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2022-02-20 16:46:00,596 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-02-20 16:46:00,596 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-20 16:46:00,596 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-20 16:46:00,596 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-20 16:46:00,597 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-02-20 16:46:00,597 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-02-20 16:46:00,597 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:00,597 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:00,597 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:46:00,599 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,600 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] [2022-02-20 16:46:00,600 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,600 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,600 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,601 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:00,601 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:00,601 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] [2022-02-20 16:46:00,601 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] [2022-02-20 16:46:00,601 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] [2022-02-20 16:46:00,605 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,605 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] [2022-02-20 16:46:00,606 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,606 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,606 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,606 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:00,606 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:00,606 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] [2022-02-20 16:46:00,606 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] [2022-02-20 16:46:00,607 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] [2022-02-20 16:46:00,609 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,610 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] [2022-02-20 16:46:00,610 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] [2022-02-20 16:46:00,610 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] [2022-02-20 16:46:00,610 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] [2022-02-20 16:46:00,610 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,610 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,610 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,611 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:00,611 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:00,611 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,612 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] [2022-02-20 16:46:00,612 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] [2022-02-20 16:46:00,612 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] [2022-02-20 16:46:00,612 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] [2022-02-20 16:46:00,612 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,612 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,612 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,612 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:00,613 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:00,619 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,620 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,620 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,620 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_float_~ix~1#1_6,QUANTIFIED] [2022-02-20 16:46:00,620 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_float_~ix~1#1_6,QUANTIFIED] [2022-02-20 16:46:00,621 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_float_~ix~1#1_6,QUANTIFIED] [2022-02-20 16:46:00,621 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,621 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,621 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,621 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:00,621 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:00,622 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,622 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,622 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,622 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_float_~ix~1#1_6,QUANTIFIED] [2022-02-20 16:46:00,624 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_float_~ix~1#1_6,QUANTIFIED] [2022-02-20 16:46:00,624 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_float_~ix~1#1_6,QUANTIFIED] [2022-02-20 16:46:00,624 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,624 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,624 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,624 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:00,624 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:00,626 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:00,626 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:00,626 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:00,627 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:00,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:00 BoogieIcfgContainer [2022-02-20 16:46:00,627 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:00,628 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:00,628 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:00,628 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:00,628 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:46:00,630 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:46:00,636 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-02-20 16:46:00,636 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 16:46:00,636 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:46:00,636 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:46:00,651 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) [2022-02-20 16:46:00,654 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:46:00,654 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:00,655 INFO L158 Benchmark]: Toolchain (without parser) took 2796.33ms. Allocated memory was 48.2MB in the beginning and 71.3MB in the end (delta: 23.1MB). Free memory was 24.0MB in the beginning and 50.0MB in the end (delta: -26.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:00,655 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 48.2MB. Free memory was 30.5MB in the beginning and 30.5MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:00,655 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.17ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 23.8MB in the beginning and 41.6MB in the end (delta: -17.9MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2022-02-20 16:46:00,655 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.86ms. Allocated memory is still 58.7MB. Free memory was 41.4MB in the beginning and 39.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:00,655 INFO L158 Benchmark]: Boogie Preprocessor took 33.21ms. Allocated memory is still 58.7MB. Free memory was 39.8MB in the beginning and 38.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:00,656 INFO L158 Benchmark]: RCFGBuilder took 354.66ms. Allocated memory is still 58.7MB. Free memory was 38.1MB in the beginning and 42.1MB in the end (delta: -4.0MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:00,656 INFO L158 Benchmark]: TraceAbstraction took 2101.57ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 41.5MB in the beginning and 52.1MB in the end (delta: -10.6MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2022-02-20 16:46:00,656 INFO L158 Benchmark]: Witness Printer took 26.26ms. Allocated memory is still 71.3MB. Free memory was 52.1MB in the beginning and 50.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:00,657 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.13ms. Allocated memory is still 48.2MB. Free memory was 30.5MB in the beginning and 30.5MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.17ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 23.8MB in the beginning and 41.6MB in the end (delta: -17.9MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.86ms. Allocated memory is still 58.7MB. Free memory was 41.4MB in the beginning and 39.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.21ms. Allocated memory is still 58.7MB. Free memory was 39.8MB in the beginning and 38.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 354.66ms. Allocated memory is still 58.7MB. Free memory was 38.1MB in the beginning and 42.1MB in the end (delta: -4.0MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2101.57ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 41.5MB in the beginning and 52.1MB in the end (delta: -10.6MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. * Witness Printer took 26.26ms. Allocated memory is still 71.3MB. Free memory was 52.1MB in the beginning and 50.0MB in the end (delta: 2.1MB). 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_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_float_~ix~1#1_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_float_~ix~1#1_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_float_~ix~1#1_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_float_~ix~1#1_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_float_~ix~1#1_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_float_~ix~1#1_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] * 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: 53]: 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, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, 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, 50 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 14 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1 IncrementalHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 22 mSDtfsCounter, 1 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 12, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 10 NumberOfFragments, 146 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 23 ConstructedInterpolants, 10 QuantifiedInterpolants, 402 SizeOfPredicates, 13 NumberOfNonLiveVariables, 95 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant [2022-02-20 16:46:00,669 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,669 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] [2022-02-20 16:46:00,669 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,669 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,670 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,670 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:00,670 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:00,670 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] [2022-02-20 16:46:00,670 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] [2022-02-20 16:46:00,670 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] [2022-02-20 16:46:00,671 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,671 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] [2022-02-20 16:46:00,671 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,671 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,671 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,671 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:00,671 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:00,671 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] [2022-02-20 16:46:00,672 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] [2022-02-20 16:46:00,672 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] Derived loop invariant: (\exists v_arrayElimCell_1 : bv32, v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6 : bv32, currentRoundingMode : FloatRoundingMode :: (~bvand32(2147483647bv32, v_arrayElimCell_1) == unknown-#memory_int-unknown[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6][0bv32] && ~fp~LONGDOUBLE(v_arrayElimCell_1[31:31], v_arrayElimCell_1[30:23], v_arrayElimCell_1[22:0]) == ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE())) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6][0bv32][22:0]) == \result) - InvariantResult [Line: 31]: Loop Invariant [2022-02-20 16:46:00,672 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,672 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] [2022-02-20 16:46:00,672 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] [2022-02-20 16:46:00,672 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] [2022-02-20 16:46:00,673 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] [2022-02-20 16:46:00,673 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,673 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,673 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,673 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:00,673 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:00,674 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,674 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] [2022-02-20 16:46:00,674 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] [2022-02-20 16:46:00,674 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] [2022-02-20 16:46:00,674 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6,QUANTIFIED] [2022-02-20 16:46:00,674 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,674 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,674 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,674 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:00,675 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists v_arrayElimCell_1 : bv32, v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6 : bv32, currentRoundingMode : FloatRoundingMode :: (~bvand32(2147483647bv32, v_arrayElimCell_1) == unknown-#memory_int-unknown[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6][0bv32] && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_fabs_float_~#sf_u~0#1.base_6][0bv32][22:0]) == x) && ~fp~LONGDOUBLE(v_arrayElimCell_1[31:31], v_arrayElimCell_1[30:23], v_arrayElimCell_1[22:0]) == ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 29]: Loop Invariant [2022-02-20 16:46:00,675 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,675 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,676 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,676 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_float_~ix~1#1_6,QUANTIFIED] [2022-02-20 16:46:00,676 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_float_~ix~1#1_6,QUANTIFIED] [2022-02-20 16:46:00,676 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_float_~ix~1#1_6,QUANTIFIED] [2022-02-20 16:46:00,676 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,676 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,676 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,677 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:00,677 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:00,677 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,677 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,677 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,677 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_float_~ix~1#1_6,QUANTIFIED] [2022-02-20 16:46:00,678 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_float_~ix~1#1_6,QUANTIFIED] [2022-02-20 16:46:00,678 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_float_~ix~1#1_6,QUANTIFIED] [2022-02-20 16:46:00,678 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,678 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,678 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_1,QUANTIFIED] [2022-02-20 16:46:00,678 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:00,678 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists v_arrayElimCell_1 : bv32, v_ULTIMATE.start_isinf_float_~ix~1#1_6 : bv32, currentRoundingMode : FloatRoundingMode :: (~fp~LONGDOUBLE(~bvand32(2147483647bv32, v_arrayElimCell_1)[31:31], ~bvand32(2147483647bv32, v_arrayElimCell_1)[30:23], ~bvand32(2147483647bv32, v_arrayElimCell_1)[22:0]) == ~fp~LONGDOUBLE(v_ULTIMATE.start_isinf_float_~ix~1#1_6[31:31], v_ULTIMATE.start_isinf_float_~ix~1#1_6[30:23], v_ULTIMATE.start_isinf_float_~ix~1#1_6[22:0]) && \result == 1bv32) && ~fp~LONGDOUBLE(v_arrayElimCell_1[31:31], v_arrayElimCell_1[30:23], v_arrayElimCell_1[22:0]) == ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 15]: Loop Invariant [2022-02-20 16:46:00,679 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:00,679 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:00,679 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:00,679 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) RESULT: Ultimate proved your program to be correct! [2022-02-20 16:46:00,703 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