./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1052c.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_1052c.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 fe40b084b828df43825fca15d2dd06822fb39893b54cde36c5f06a988fda4d8b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:04,920 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:04,921 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:04,954 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:04,956 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:04,957 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:04,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:04,960 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:04,961 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:04,962 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:04,963 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:04,964 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:04,966 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:04,968 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:04,969 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:04,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:04,974 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:04,975 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:04,980 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:04,982 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:04,983 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:04,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:04,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:04,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:04,991 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:04,991 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:04,991 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:04,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:04,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:04,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:04,993 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:04,994 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:04,995 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:04,995 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:04,996 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:04,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:04,997 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:04,997 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:04,998 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:04,998 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:04,999 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:05,000 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:46:05,026 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:05,027 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:05,028 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:05,029 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:05,030 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:05,030 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:05,031 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:05,031 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:05,031 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:05,031 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:05,032 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:05,032 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:46:05,032 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:05,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:05,033 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:05,033 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:05,033 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:05,033 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:05,034 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:05,034 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:05,034 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:05,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:05,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:05,035 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:05,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:05,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:05,035 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:05,035 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:05,036 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:46:05,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:46:05,037 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:05,037 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:05,037 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:05,038 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 -> fe40b084b828df43825fca15d2dd06822fb39893b54cde36c5f06a988fda4d8b [2022-02-20 16:46:05,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:05,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:05,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:05,241 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:05,242 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:05,243 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1052c.c [2022-02-20 16:46:05,311 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba730c2c4/fb6ddfc379be40f8b54e35940631808c/FLAGaff8c5fa4 [2022-02-20 16:46:05,633 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:05,633 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1052c.c [2022-02-20 16:46:05,640 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba730c2c4/fb6ddfc379be40f8b54e35940631808c/FLAGaff8c5fa4 [2022-02-20 16:46:06,056 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba730c2c4/fb6ddfc379be40f8b54e35940631808c [2022-02-20 16:46:06,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:06,059 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:06,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:06,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:06,066 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:06,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:06" (1/1) ... [2022-02-20 16:46:06,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c9e2fde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:06, skipping insertion in model container [2022-02-20 16:46:06,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:06" (1/1) ... [2022-02-20 16:46:06,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:06,092 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:06,237 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_1052c.c[1741,1754] [2022-02-20 16:46:06,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:06,247 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:06,297 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_1052c.c[1741,1754] [2022-02-20 16:46:06,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:06,309 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:06,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:06 WrapperNode [2022-02-20 16:46:06,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:06,310 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:06,311 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:06,311 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:06,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:06" (1/1) ... [2022-02-20 16:46:06,333 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:06" (1/1) ... [2022-02-20 16:46:06,365 INFO L137 Inliner]: procedures = 16, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2022-02-20 16:46:06,366 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:06,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:06,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:06,367 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:06,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:06" (1/1) ... [2022-02-20 16:46:06,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:06" (1/1) ... [2022-02-20 16:46:06,381 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:06" (1/1) ... [2022-02-20 16:46:06,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:06" (1/1) ... [2022-02-20 16:46:06,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:06" (1/1) ... [2022-02-20 16:46:06,393 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:06" (1/1) ... [2022-02-20 16:46:06,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:06" (1/1) ... [2022-02-20 16:46:06,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:06,398 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:06,398 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:06,398 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:06,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:06" (1/1) ... [2022-02-20 16:46:06,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:06,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:06,428 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:46:06,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:46:06,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:06,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:46:06,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:06,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:46:06,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:46:06,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:46:06,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:06,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:06,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:46:06,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:06,513 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:06,514 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:06,740 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:06,745 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:06,745 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 16:46:06,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:06 BoogieIcfgContainer [2022-02-20 16:46:06,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:06,748 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:06,748 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:06,762 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:06,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:06" (1/3) ... [2022-02-20 16:46:06,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2570f4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:06, skipping insertion in model container [2022-02-20 16:46:06,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:06" (2/3) ... [2022-02-20 16:46:06,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2570f4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:06, skipping insertion in model container [2022-02-20 16:46:06,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:06" (3/3) ... [2022-02-20 16:46:06,765 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1052c.c [2022-02-20 16:46:06,769 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:06,769 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:06,812 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:06,817 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:46:06,818 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:06,830 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:06,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:46:06,834 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:06,835 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:06,835 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:06,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:06,840 INFO L85 PathProgramCache]: Analyzing trace with hash -2022248449, now seen corresponding path program 1 times [2022-02-20 16:46:06,854 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:06,854 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674541567] [2022-02-20 16:46:06,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:06,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:07,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#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);~huge_floor~0 := 1.0E30; {33#true} is VALID [2022-02-20 16:46:07,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_#t~short9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someUnaryFLOAToperation(0.0);assume { :begin_inline_floor_float } true;floor_float_#in~x#1 := main_~x~0#1;havoc floor_float_#res#1;havoc floor_float_#t~mem4#1, floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, floor_float_#t~mem5#1, floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset, floor_float_~x#1, floor_float_~i0~0#1, floor_float_~j0~0#1, floor_float_~i~0#1, floor_float_~ix~0#1;floor_float_~x#1 := floor_float_#in~x#1;havoc floor_float_~i0~0#1;havoc floor_float_~j0~0#1;havoc floor_float_~i~0#1;havoc floor_float_~ix~0#1; {33#true} is VALID [2022-02-20 16:46:07,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume !true; {34#false} is VALID [2022-02-20 16:46:07,017 INFO L290 TraceCheckUtils]: 3: Hoare triple {34#false} floor_float_~ix~0#1 := (if 0 == floor_float_~i0~0#1 then 0 else (if 1 == floor_float_~i0~0#1 then 1 else ~bitwiseAnd(floor_float_~i0~0#1, 2147483647)));floor_float_~j0~0#1 := (if (floor_float_~ix~0#1 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (floor_float_~ix~0#1 / 8388608 - 127) % 4294967296 % 4294967296 else (floor_float_~ix~0#1 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); {34#false} is VALID [2022-02-20 16:46:07,017 INFO L290 TraceCheckUtils]: 4: Hoare triple {34#false} assume !(floor_float_~j0~0#1 < 23); {34#false} is VALID [2022-02-20 16:46:07,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#false} assume !!(floor_float_~ix~0#1 % 4294967296 < 2139095040);floor_float_#res#1 := floor_float_~x#1; {34#false} is VALID [2022-02-20 16:46:07,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#false} main_#t~ret7#1 := floor_float_#res#1;assume { :end_inline_floor_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_#t~short9#1 := ~someBinaryFLOATComparisonOperation(main_~res~0#1, ~someUnaryFLOAToperation(0.0)); {34#false} is VALID [2022-02-20 16:46:07,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#false} assume !main_#t~short9#1; {34#false} is VALID [2022-02-20 16:46:07,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#false} assume !main_#t~short9#1;havoc main_#t~ret8#1;havoc main_#t~short9#1; {34#false} is VALID [2022-02-20 16:46:07,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-02-20 16:46:07,020 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:07,020 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:07,021 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674541567] [2022-02-20 16:46:07,022 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674541567] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:07,022 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:07,022 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:07,024 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105082995] [2022-02-20 16:46:07,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:07,030 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:46:07,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:07,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:07,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:07,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:07,058 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:07,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:07,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:07,087 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:07,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:07,162 INFO L93 Difference]: Finished difference Result 58 states and 90 transitions. [2022-02-20 16:46:07,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:07,163 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:46:07,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:07,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:07,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 90 transitions. [2022-02-20 16:46:07,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:07,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 90 transitions. [2022-02-20 16:46:07,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 90 transitions. [2022-02-20 16:46:07,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:07,277 INFO L225 Difference]: With dead ends: 58 [2022-02-20 16:46:07,278 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 16:46:07,280 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:46:07,284 INFO L933 BasicCegarLoop]: 39 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, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:07,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:07,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 16:46:07,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-20 16:46:07,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:07,312 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 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:07,313 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 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:07,314 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 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:07,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:07,317 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-02-20 16:46:07,318 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-02-20 16:46:07,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:07,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:07,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 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 27 states. [2022-02-20 16:46:07,320 INFO L87 Difference]: Start difference. First operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 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 27 states. [2022-02-20 16:46:07,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:07,323 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-02-20 16:46:07,323 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-02-20 16:46:07,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:07,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:07,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:07,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:07,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 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:07,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-02-20 16:46:07,328 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 10 [2022-02-20 16:46:07,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:07,328 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-02-20 16:46:07,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:07,328 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-02-20 16:46:07,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:46:07,329 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:07,330 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:07,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:46:07,333 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:07,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:07,337 INFO L85 PathProgramCache]: Analyzing trace with hash -62588350, now seen corresponding path program 1 times [2022-02-20 16:46:07,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:07,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731925007] [2022-02-20 16:46:07,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:07,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:07,440 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:46:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:07,490 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:46:07,491 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:46:07,492 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:07,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:46:07,496 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:46:07,498 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:07,526 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:07,527 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:07,527 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-02-20 16:46:07,527 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-02-20 16:46:07,527 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-20 16:46:07,527 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-20 16:46:07,527 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2022-02-20 16:46:07,528 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-20 16:46:07,528 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-20 16:46:07,528 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:46:07,528 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:46:07,528 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 16:46:07,528 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 16:46:07,529 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:07,529 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:07,529 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:07,530 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:07,530 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:46:07,530 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:46:07,530 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:46:07,530 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-02-20 16:46:07,530 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-02-20 16:46:07,530 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:07,530 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:07,531 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-02-20 16:46:07,531 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-02-20 16:46:07,531 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:46:07,531 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:46:07,531 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-02-20 16:46:07,531 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-02-20 16:46:07,532 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2022-02-20 16:46:07,532 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:46:07,532 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:46:07,532 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:46:07,532 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:46:07,532 WARN L170 areAnnotationChecker]: L81-2 has no Hoare annotation [2022-02-20 16:46:07,532 WARN L170 areAnnotationChecker]: L81-2 has no Hoare annotation [2022-02-20 16:46:07,533 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-02-20 16:46:07,533 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-02-20 16:46:07,533 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-02-20 16:46:07,533 WARN L170 areAnnotationChecker]: L61-3 has no Hoare annotation [2022-02-20 16:46:07,533 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-20 16:46:07,533 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-20 16:46:07,533 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2022-02-20 16:46:07,534 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-02-20 16:46:07,534 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:07,534 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:46:07,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:07 BoogieIcfgContainer [2022-02-20 16:46:07,536 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:07,537 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:07,537 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:07,537 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:07,538 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:06" (3/4) ... [2022-02-20 16:46:07,540 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:46:07,540 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:07,542 INFO L158 Benchmark]: Toolchain (without parser) took 1482.27ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 61.7MB in the beginning and 55.3MB in the end (delta: 6.4MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2022-02-20 16:46:07,542 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 94.4MB. Free memory is still 52.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:07,547 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.10ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 61.5MB in the beginning and 87.8MB in the end (delta: -26.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:46:07,547 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.74ms. Allocated memory is still 113.2MB. Free memory was 87.7MB in the beginning and 85.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:07,550 INFO L158 Benchmark]: Boogie Preprocessor took 29.32ms. Allocated memory is still 113.2MB. Free memory was 85.4MB in the beginning and 83.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:07,551 INFO L158 Benchmark]: RCFGBuilder took 348.64ms. Allocated memory is still 113.2MB. Free memory was 83.6MB in the beginning and 67.6MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 16:46:07,551 INFO L158 Benchmark]: TraceAbstraction took 787.65ms. Allocated memory is still 113.2MB. Free memory was 66.9MB in the beginning and 55.3MB in the end (delta: 11.6MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2022-02-20 16:46:07,551 INFO L158 Benchmark]: Witness Printer took 3.63ms. Allocated memory is still 113.2MB. Free memory is still 55.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:07,557 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 94.4MB. Free memory is still 52.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.10ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 61.5MB in the beginning and 87.8MB in the end (delta: -26.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.74ms. Allocated memory is still 113.2MB. Free memory was 87.7MB in the beginning and 85.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.32ms. Allocated memory is still 113.2MB. Free memory was 85.4MB in the beginning and 83.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 348.64ms. Allocated memory is still 113.2MB. Free memory was 83.6MB in the beginning and 67.6MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 787.65ms. Allocated memory is still 113.2MB. Free memory was 66.9MB in the beginning and 55.3MB in the end (delta: 11.6MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Witness Printer took 3.63ms. Allocated memory is still 113.2MB. Free memory is still 55.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 82]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someUnaryFLOAToperation at line 77, overapproximation of bitwiseAnd at line 23. Possible FailurePath: [L13] static const float huge_floor = 1.0e30; VAL [huge_floor=1000000000000000000000000000000] [L77] float x = -0.0f; [L78] CALL, EXPR floor_float(x) [L16] __int32_t i0, j0; [L17] __uint32_t i, ix; VAL [\old(x)=1000000000000000000000000000001, huge_floor=1000000000000000000000000000000, x=1000000000000000000000000000001] [L19] ieee_float_shape_type gf_u; [L20] gf_u.value = (x) [L21] EXPR gf_u.word [L21] (i0) = gf_u.word [L23] ix = (i0 & 0x7fffffff) [L24] j0 = (ix >> 23) - 0x7f VAL [\old(x)=1000000000000000000000000000001, huge_floor=1000000000000000000000000000000, i=-18014398509481984, i0=-1, j0=2147483521, x=1000000000000000000000000000001] [L25] COND FALSE !(j0 < 23) VAL [\old(x)=1000000000000000000000000000001, huge_floor=1000000000000000000000000000000, i=-18014398509481984, i0=-1, j0=2147483521, x=1000000000000000000000000000001] [L45] COND FALSE !(!((ix) < 0x7f800000L)) [L48] return x; VAL [\old(x)=1000000000000000000000000000001, \result=1000000000000000000000000000001, huge_floor=1000000000000000000000000000000, i=-18014398509481984, i0=-1, j0=2147483521, x=1000000000000000000000000000001] [L78] RET, EXPR floor_float(x) [L78] float res = floor_float(x); [L81] EXPR res == -0.0f && __signbit_float(res) == 1 VAL [huge_floor=1000000000000000000000000000000, res=1000000000000000000000000000001, res == -0.0f && __signbit_float(res) == 1=0, x=1000000000000000000000000000001] [L81] COND TRUE !(res == -0.0f && __signbit_float(res) == 1) [L82] reach_error() VAL [huge_floor=1000000000000000000000000000000, res=1000000000000000000000000000001, x=1000000000000000000000000000001] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, 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, 39 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, 39 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=30occurred 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, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 9 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 16:46:07,591 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_1052c.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 fe40b084b828df43825fca15d2dd06822fb39893b54cde36c5f06a988fda4d8b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:09,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:09,430 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:09,467 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:09,468 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:09,471 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:09,473 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:09,477 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:09,480 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:09,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:09,485 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:09,488 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:09,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:09,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:09,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:09,493 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:09,494 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:09,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:09,498 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:09,502 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:09,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:09,505 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:09,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:09,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:09,514 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:09,515 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:09,515 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:09,517 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:09,517 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:09,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:09,518 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:09,519 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:09,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:09,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:09,522 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:09,522 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:09,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:09,523 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:09,523 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:09,524 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:09,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:09,526 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:46:09,565 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:09,566 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:09,567 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:09,567 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:09,568 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:09,568 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:09,569 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:09,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:09,569 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:09,570 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:09,570 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:09,571 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:09,571 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:09,571 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:09,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:09,571 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:09,572 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:46:09,572 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:46:09,572 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:46:09,572 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:09,572 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:09,573 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:09,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:09,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:09,573 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:09,573 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:09,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:09,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:09,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:09,574 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:09,574 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:46:09,574 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:46:09,575 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:09,575 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:09,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:09,575 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:46:09,576 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 -> fe40b084b828df43825fca15d2dd06822fb39893b54cde36c5f06a988fda4d8b [2022-02-20 16:46:09,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:09,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:09,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:09,895 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:09,895 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:09,897 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1052c.c [2022-02-20 16:46:09,955 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/077bfcb58/e61013f5c7e1416cb40cb821e04169cb/FLAG4c76640c7 [2022-02-20 16:46:10,411 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:10,412 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1052c.c [2022-02-20 16:46:10,418 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/077bfcb58/e61013f5c7e1416cb40cb821e04169cb/FLAG4c76640c7 [2022-02-20 16:46:10,436 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/077bfcb58/e61013f5c7e1416cb40cb821e04169cb [2022-02-20 16:46:10,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:10,439 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:10,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:10,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:10,445 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:10,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:10" (1/1) ... [2022-02-20 16:46:10,447 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20f217d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:10, skipping insertion in model container [2022-02-20 16:46:10,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:10" (1/1) ... [2022-02-20 16:46:10,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:10,467 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:10,609 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_1052c.c[1741,1754] [2022-02-20 16:46:10,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:10,635 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:10,665 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_1052c.c[1741,1754] [2022-02-20 16:46:10,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:10,680 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:10,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:10 WrapperNode [2022-02-20 16:46:10,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:10,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:10,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:10,682 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:10,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:10" (1/1) ... [2022-02-20 16:46:10,695 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:10" (1/1) ... [2022-02-20 16:46:10,715 INFO L137 Inliner]: procedures = 19, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2022-02-20 16:46:10,715 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:10,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:10,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:10,716 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:10,723 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:10" (1/1) ... [2022-02-20 16:46:10,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:10" (1/1) ... [2022-02-20 16:46:10,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:10" (1/1) ... [2022-02-20 16:46:10,735 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:10" (1/1) ... [2022-02-20 16:46:10,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:10" (1/1) ... [2022-02-20 16:46:10,756 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:10" (1/1) ... [2022-02-20 16:46:10,760 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:10" (1/1) ... [2022-02-20 16:46:10,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:10,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:10,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:10,770 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:10,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:10" (1/1) ... [2022-02-20 16:46:10,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:10,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:10,803 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:46:10,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:46:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:46:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:10,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:46:10,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:46:10,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:10,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:10,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:46:10,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:46:10,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:10,896 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:10,897 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:11,460 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:11,466 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:11,466 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 16:46:11,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:11 BoogieIcfgContainer [2022-02-20 16:46:11,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:11,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:11,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:11,474 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:11,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:10" (1/3) ... [2022-02-20 16:46:11,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@748e91e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:11, skipping insertion in model container [2022-02-20 16:46:11,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:10" (2/3) ... [2022-02-20 16:46:11,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@748e91e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:11, skipping insertion in model container [2022-02-20 16:46:11,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:11" (3/3) ... [2022-02-20 16:46:11,477 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1052c.c [2022-02-20 16:46:11,482 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:11,482 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:11,527 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:11,536 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:46:11,536 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:11,555 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:11,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:46:11,559 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:11,559 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:11,560 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:11,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:11,565 INFO L85 PathProgramCache]: Analyzing trace with hash -2022248449, now seen corresponding path program 1 times [2022-02-20 16:46:11,575 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:11,575 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [372669536] [2022-02-20 16:46:11,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:11,576 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:11,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:11,579 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:11,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:46:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:11,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:46:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:11,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:11,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#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);~huge_floor~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30)); {33#true} is VALID [2022-02-20 16:46:11,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_#t~short9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());assume { :begin_inline_floor_float } true;floor_float_#in~x#1 := main_~x~0#1;havoc floor_float_#res#1;havoc floor_float_#t~mem4#1, floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, floor_float_#t~mem5#1, floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset, floor_float_~x#1, floor_float_~i0~0#1, floor_float_~j0~0#1, floor_float_~i~0#1, floor_float_~ix~0#1;floor_float_~x#1 := floor_float_#in~x#1;havoc floor_float_~i0~0#1;havoc floor_float_~j0~0#1;havoc floor_float_~i~0#1;havoc floor_float_~ix~0#1; {33#true} is VALID [2022-02-20 16:46:11,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume !true; {34#false} is VALID [2022-02-20 16:46:11,754 INFO L290 TraceCheckUtils]: 3: Hoare triple {34#false} floor_float_~ix~0#1 := ~bvand32(2147483647bv32, floor_float_~i0~0#1);floor_float_~j0~0#1 := ~bvsub32(~bvlshr32(floor_float_~ix~0#1, 23bv32), 127bv32); {34#false} is VALID [2022-02-20 16:46:11,754 INFO L290 TraceCheckUtils]: 4: Hoare triple {34#false} assume !~bvslt32(floor_float_~j0~0#1, 23bv32); {34#false} is VALID [2022-02-20 16:46:11,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#false} assume !!~bvult32(floor_float_~ix~0#1, 2139095040bv32);floor_float_#res#1 := floor_float_~x#1; {34#false} is VALID [2022-02-20 16:46:11,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#false} main_#t~ret7#1 := floor_float_#res#1;assume { :end_inline_floor_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_#t~short9#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {34#false} is VALID [2022-02-20 16:46:11,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#false} assume !main_#t~short9#1; {34#false} is VALID [2022-02-20 16:46:11,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#false} assume !main_#t~short9#1;havoc main_#t~ret8#1;havoc main_#t~short9#1; {34#false} is VALID [2022-02-20 16:46:11,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-02-20 16:46:11,763 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:11,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:11,764 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:11,765 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [372669536] [2022-02-20 16:46:11,765 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [372669536] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:11,765 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:11,766 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:11,767 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655769447] [2022-02-20 16:46:11,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:11,773 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:46:11,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:11,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:11,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:11,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:11,793 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:11,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:11,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:11,816 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:12,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:12,076 INFO L93 Difference]: Finished difference Result 58 states and 90 transitions. [2022-02-20 16:46:12,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:12,077 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:46:12,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:12,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:12,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 90 transitions. [2022-02-20 16:46:12,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:12,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 90 transitions. [2022-02-20 16:46:12,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 90 transitions. [2022-02-20 16:46:12,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:12,306 INFO L225 Difference]: With dead ends: 58 [2022-02-20 16:46:12,307 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 16:46:12,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:12,313 INFO L933 BasicCegarLoop]: 39 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, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:12,315 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:12,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 16:46:12,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-20 16:46:12,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:12,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 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:12,343 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 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:12,344 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 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:12,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:12,351 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-02-20 16:46:12,352 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-02-20 16:46:12,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:12,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:12,353 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 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 27 states. [2022-02-20 16:46:12,354 INFO L87 Difference]: Start difference. First operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 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 27 states. [2022-02-20 16:46:12,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:12,357 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-02-20 16:46:12,357 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-02-20 16:46:12,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:12,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:12,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:12,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:12,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 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:12,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-02-20 16:46:12,363 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 10 [2022-02-20 16:46:12,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:12,364 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-02-20 16:46:12,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:12,364 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-02-20 16:46:12,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:46:12,365 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:12,365 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:12,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:12,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:12,572 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:12,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:12,573 INFO L85 PathProgramCache]: Analyzing trace with hash -62588350, now seen corresponding path program 1 times [2022-02-20 16:46:12,574 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:12,574 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007888717] [2022-02-20 16:46:12,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:12,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:12,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:12,587 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:12,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:46:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:12,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 16:46:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:12,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:12,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {217#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);~huge_floor~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30)); {217#true} is VALID [2022-02-20 16:46:12,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {217#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_#t~short9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());assume { :begin_inline_floor_float } true;floor_float_#in~x#1 := main_~x~0#1;havoc floor_float_#res#1;havoc floor_float_#t~mem4#1, floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, floor_float_#t~mem5#1, floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset, floor_float_~x#1, floor_float_~i0~0#1, floor_float_~j0~0#1, floor_float_~i~0#1, floor_float_~ix~0#1;floor_float_~x#1 := floor_float_#in~x#1;havoc floor_float_~i0~0#1;havoc floor_float_~j0~0#1;havoc floor_float_~i~0#1;havoc floor_float_~ix~0#1; {225#(= |ULTIMATE.start_floor_float_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:12,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {225#(= |ULTIMATE.start_floor_float_~x#1| (fp.neg (_ +zero 8 24)))} call floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(floor_float_~x#1, floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, 4bv32);call floor_float_#t~mem4#1 := read~intINTTYPE4(floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, 4bv32);floor_float_~i0~0#1 := floor_float_#t~mem4#1;havoc floor_float_#t~mem4#1;call ULTIMATE.dealloc(floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset);havoc floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset; {229#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|)))} is VALID [2022-02-20 16:46:12,850 INFO L290 TraceCheckUtils]: 3: Hoare triple {229#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|)))} goto; {229#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|)))} is VALID [2022-02-20 16:46:12,852 INFO L290 TraceCheckUtils]: 4: Hoare triple {229#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|)))} floor_float_~ix~0#1 := ~bvand32(2147483647bv32, floor_float_~i0~0#1);floor_float_~j0~0#1 := ~bvsub32(~bvlshr32(floor_float_~ix~0#1, 23bv32), 127bv32); {236#(exists ((|ULTIMATE.start_floor_float_~i0~0#1| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|))) (= (bvadd (bvlshr (bvand (_ bv2147483647 32) |ULTIMATE.start_floor_float_~i0~0#1|) (_ bv23 32)) (_ bv4294967169 32)) |ULTIMATE.start_floor_float_~j0~0#1|)))} is VALID [2022-02-20 16:46:12,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {236#(exists ((|ULTIMATE.start_floor_float_~i0~0#1| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|))) (= (bvadd (bvlshr (bvand (_ bv2147483647 32) |ULTIMATE.start_floor_float_~i0~0#1|) (_ bv23 32)) (_ bv4294967169 32)) |ULTIMATE.start_floor_float_~j0~0#1|)))} assume !~bvslt32(floor_float_~j0~0#1, 23bv32); {218#false} is VALID [2022-02-20 16:46:12,853 INFO L290 TraceCheckUtils]: 6: Hoare triple {218#false} assume !!~bvult32(floor_float_~ix~0#1, 2139095040bv32);floor_float_#res#1 := floor_float_~x#1; {218#false} is VALID [2022-02-20 16:46:12,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {218#false} main_#t~ret7#1 := floor_float_#res#1;assume { :end_inline_floor_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_#t~short9#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {218#false} is VALID [2022-02-20 16:46:12,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {218#false} assume !main_#t~short9#1; {218#false} is VALID [2022-02-20 16:46:12,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {218#false} assume !main_#t~short9#1;havoc main_#t~ret8#1;havoc main_#t~short9#1; {218#false} is VALID [2022-02-20 16:46:12,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {218#false} assume !false; {218#false} is VALID [2022-02-20 16:46:12,855 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:12,855 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:12,855 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:12,856 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1007888717] [2022-02-20 16:46:12,856 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1007888717] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:12,856 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:12,856 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:12,857 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556735502] [2022-02-20 16:46:12,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:12,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:46:12,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:12,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:12,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:12,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:12,872 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:12,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:12,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:12,873 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:14,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:14,017 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-02-20 16:46:14,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:46:14,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:46:14,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:14,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:14,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-02-20 16:46:14,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:14,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-02-20 16:46:14,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-02-20 16:46:14,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:14,125 INFO L225 Difference]: With dead ends: 36 [2022-02-20 16:46:14,125 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 16:46:14,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:14,127 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:14,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 96 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 6 Unchecked, 0.2s Time] [2022-02-20 16:46:14,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 16:46:14,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 16:46:14,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:14,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 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:14,130 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 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:14,131 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 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:14,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:14,135 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-02-20 16:46:14,135 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-02-20 16:46:14,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:14,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:14,136 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 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 26 states. [2022-02-20 16:46:14,136 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 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 26 states. [2022-02-20 16:46:14,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:14,140 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-02-20 16:46:14,140 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-02-20 16:46:14,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:14,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:14,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:14,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:14,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 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:14,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-02-20 16:46:14,149 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 11 [2022-02-20 16:46:14,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:14,150 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-02-20 16:46:14,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:14,151 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-02-20 16:46:14,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:46:14,151 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:14,152 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:14,168 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:14,362 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:14,362 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:14,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:14,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1311186430, now seen corresponding path program 1 times [2022-02-20 16:46:14,364 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:14,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079873248] [2022-02-20 16:46:14,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:14,364 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:14,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:14,365 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:14,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:46:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:14,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 16:46:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:14,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:14,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {383#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);~huge_floor~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30)); {383#true} is VALID [2022-02-20 16:46:14,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {383#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_#t~short9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());assume { :begin_inline_floor_float } true;floor_float_#in~x#1 := main_~x~0#1;havoc floor_float_#res#1;havoc floor_float_#t~mem4#1, floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, floor_float_#t~mem5#1, floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset, floor_float_~x#1, floor_float_~i0~0#1, floor_float_~j0~0#1, floor_float_~i~0#1, floor_float_~ix~0#1;floor_float_~x#1 := floor_float_#in~x#1;havoc floor_float_~i0~0#1;havoc floor_float_~j0~0#1;havoc floor_float_~i~0#1;havoc floor_float_~ix~0#1; {391#(= |ULTIMATE.start_floor_float_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:14,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {391#(= |ULTIMATE.start_floor_float_~x#1| (fp.neg (_ +zero 8 24)))} call floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(floor_float_~x#1, floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, 4bv32);call floor_float_#t~mem4#1 := read~intINTTYPE4(floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, 4bv32);floor_float_~i0~0#1 := floor_float_#t~mem4#1;havoc floor_float_#t~mem4#1;call ULTIMATE.dealloc(floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset);havoc floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset; {395#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|)))} is VALID [2022-02-20 16:46:14,556 INFO L290 TraceCheckUtils]: 3: Hoare triple {395#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|)))} goto; {395#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|)))} is VALID [2022-02-20 16:46:14,557 INFO L290 TraceCheckUtils]: 4: Hoare triple {395#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|)))} floor_float_~ix~0#1 := ~bvand32(2147483647bv32, floor_float_~i0~0#1);floor_float_~j0~0#1 := ~bvsub32(~bvlshr32(floor_float_~ix~0#1, 23bv32), 127bv32); {402#(exists ((|ULTIMATE.start_floor_float_~i0~0#1| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|))) (= (bvadd (bvlshr (bvand (_ bv2147483647 32) |ULTIMATE.start_floor_float_~i0~0#1|) (_ bv23 32)) (_ bv4294967169 32)) |ULTIMATE.start_floor_float_~j0~0#1|)))} is VALID [2022-02-20 16:46:14,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {402#(exists ((|ULTIMATE.start_floor_float_~i0~0#1| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|))) (= (bvadd (bvlshr (bvand (_ bv2147483647 32) |ULTIMATE.start_floor_float_~i0~0#1|) (_ bv23 32)) (_ bv4294967169 32)) |ULTIMATE.start_floor_float_~j0~0#1|)))} assume ~bvslt32(floor_float_~j0~0#1, 23bv32); {402#(exists ((|ULTIMATE.start_floor_float_~i0~0#1| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|))) (= (bvadd (bvlshr (bvand (_ bv2147483647 32) |ULTIMATE.start_floor_float_~i0~0#1|) (_ bv23 32)) (_ bv4294967169 32)) |ULTIMATE.start_floor_float_~j0~0#1|)))} is VALID [2022-02-20 16:46:14,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {402#(exists ((|ULTIMATE.start_floor_float_~i0~0#1| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|))) (= (bvadd (bvlshr (bvand (_ bv2147483647 32) |ULTIMATE.start_floor_float_~i0~0#1|) (_ bv23 32)) (_ bv4294967169 32)) |ULTIMATE.start_floor_float_~j0~0#1|)))} assume !~bvslt32(floor_float_~j0~0#1, 0bv32);floor_float_~i~0#1 := ~bvashr32(8388607bv32, floor_float_~j0~0#1); {384#false} is VALID [2022-02-20 16:46:14,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {384#false} assume 0bv32 == ~bvand32(floor_float_~i0~0#1, floor_float_~i~0#1);floor_float_#res#1 := floor_float_~x#1; {384#false} is VALID [2022-02-20 16:46:14,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {384#false} main_#t~ret7#1 := floor_float_#res#1;assume { :end_inline_floor_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_#t~short9#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {384#false} is VALID [2022-02-20 16:46:14,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {384#false} assume !main_#t~short9#1; {384#false} is VALID [2022-02-20 16:46:14,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {384#false} assume !main_#t~short9#1;havoc main_#t~ret8#1;havoc main_#t~short9#1; {384#false} is VALID [2022-02-20 16:46:14,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {384#false} assume !false; {384#false} is VALID [2022-02-20 16:46:14,564 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:14,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:14,564 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:14,564 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079873248] [2022-02-20 16:46:14,565 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1079873248] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:14,565 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:14,566 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:14,568 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55514632] [2022-02-20 16:46:14,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:14,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:46:14,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:14,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:14,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:14,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:14,590 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:14,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:14,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:14,591 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:15,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:15,229 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-02-20 16:46:15,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:46:15,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:46:15,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:15,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:15,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-02-20 16:46:15,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:15,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-02-20 16:46:15,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-02-20 16:46:15,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:15,316 INFO L225 Difference]: With dead ends: 38 [2022-02-20 16:46:15,316 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 16:46:15,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:15,317 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:15,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 71 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 4 Unchecked, 0.1s Time] [2022-02-20 16:46:15,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 16:46:15,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 16:46:15,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:15,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 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:15,320 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 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:15,320 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 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:15,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:15,321 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-02-20 16:46:15,322 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 16:46:15,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:15,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:15,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states. [2022-02-20 16:46:15,323 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states. [2022-02-20 16:46:15,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:15,324 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-02-20 16:46:15,324 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 16:46:15,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:15,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:15,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:15,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:15,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 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:15,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-02-20 16:46:15,326 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 12 [2022-02-20 16:46:15,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:15,326 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-02-20 16:46:15,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:15,326 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 16:46:15,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:46:15,327 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:15,327 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:15,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:15,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:15,538 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:15,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:15,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1612307429, now seen corresponding path program 1 times [2022-02-20 16:46:15,540 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:15,540 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7137582] [2022-02-20 16:46:15,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:15,540 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:15,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:15,542 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:15,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 16:46:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:15,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 16:46:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:15,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:15,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {542#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);~huge_floor~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30)); {547#(and (= ~huge_floor~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:15,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {547#(and (= ~huge_floor~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_#t~short9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());assume { :begin_inline_floor_float } true;floor_float_#in~x#1 := main_~x~0#1;havoc floor_float_#res#1;havoc floor_float_#t~mem4#1, floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, floor_float_#t~mem5#1, floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset, floor_float_~x#1, floor_float_~i0~0#1, floor_float_~j0~0#1, floor_float_~i~0#1, floor_float_~ix~0#1;floor_float_~x#1 := floor_float_#in~x#1;havoc floor_float_~i0~0#1;havoc floor_float_~j0~0#1;havoc floor_float_~i~0#1;havoc floor_float_~ix~0#1; {551#(and (= |ULTIMATE.start_floor_float_~x#1| (fp.neg (_ +zero 8 24))) (= ~huge_floor~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:15,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {551#(and (= |ULTIMATE.start_floor_float_~x#1| (fp.neg (_ +zero 8 24))) (= ~huge_floor~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven))} call floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(floor_float_~x#1, floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, 4bv32);call floor_float_#t~mem4#1 := read~intINTTYPE4(floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, 4bv32);floor_float_~i0~0#1 := floor_float_#t~mem4#1;havoc floor_float_#t~mem4#1;call ULTIMATE.dealloc(floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset);havoc floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset; {551#(and (= |ULTIMATE.start_floor_float_~x#1| (fp.neg (_ +zero 8 24))) (= ~huge_floor~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:15,827 INFO L290 TraceCheckUtils]: 3: Hoare triple {551#(and (= |ULTIMATE.start_floor_float_~x#1| (fp.neg (_ +zero 8 24))) (= ~huge_floor~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven))} goto; {551#(and (= |ULTIMATE.start_floor_float_~x#1| (fp.neg (_ +zero 8 24))) (= ~huge_floor~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:15,828 INFO L290 TraceCheckUtils]: 4: Hoare triple {551#(and (= |ULTIMATE.start_floor_float_~x#1| (fp.neg (_ +zero 8 24))) (= ~huge_floor~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven))} floor_float_~ix~0#1 := ~bvand32(2147483647bv32, floor_float_~i0~0#1);floor_float_~j0~0#1 := ~bvsub32(~bvlshr32(floor_float_~ix~0#1, 23bv32), 127bv32); {551#(and (= |ULTIMATE.start_floor_float_~x#1| (fp.neg (_ +zero 8 24))) (= ~huge_floor~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:15,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {551#(and (= |ULTIMATE.start_floor_float_~x#1| (fp.neg (_ +zero 8 24))) (= ~huge_floor~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven))} assume ~bvslt32(floor_float_~j0~0#1, 23bv32); {551#(and (= |ULTIMATE.start_floor_float_~x#1| (fp.neg (_ +zero 8 24))) (= ~huge_floor~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:15,829 INFO L290 TraceCheckUtils]: 6: Hoare triple {551#(and (= |ULTIMATE.start_floor_float_~x#1| (fp.neg (_ +zero 8 24))) (= ~huge_floor~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven))} assume ~bvslt32(floor_float_~j0~0#1, 0bv32); {551#(and (= |ULTIMATE.start_floor_float_~x#1| (fp.neg (_ +zero 8 24))) (= ~huge_floor~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:15,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {551#(and (= |ULTIMATE.start_floor_float_~x#1| (fp.neg (_ +zero 8 24))) (= ~huge_floor~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven))} assume !~fp.gt~FLOAT(~fp.add~FLOAT(currentRoundingMode, ~huge_floor~0, floor_float_~x#1), ~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE())); {543#false} is VALID [2022-02-20 16:46:15,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {543#false} call floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(floor_float_~i0~0#1, floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset, 4bv32);call floor_float_#t~mem5#1 := read~intFLOATTYPE4(floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset, 4bv32);floor_float_~x#1 := floor_float_#t~mem5#1;havoc floor_float_#t~mem5#1;call ULTIMATE.dealloc(floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset);havoc floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset; {543#false} is VALID [2022-02-20 16:46:15,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {543#false} goto; {543#false} is VALID [2022-02-20 16:46:15,830 INFO L290 TraceCheckUtils]: 10: Hoare triple {543#false} floor_float_#res#1 := floor_float_~x#1; {543#false} is VALID [2022-02-20 16:46:15,830 INFO L290 TraceCheckUtils]: 11: Hoare triple {543#false} main_#t~ret7#1 := floor_float_#res#1;assume { :end_inline_floor_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_#t~short9#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {543#false} is VALID [2022-02-20 16:46:15,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {543#false} assume !main_#t~short9#1; {543#false} is VALID [2022-02-20 16:46:15,831 INFO L290 TraceCheckUtils]: 13: Hoare triple {543#false} assume !main_#t~short9#1;havoc main_#t~ret8#1;havoc main_#t~short9#1; {543#false} is VALID [2022-02-20 16:46:15,831 INFO L290 TraceCheckUtils]: 14: Hoare triple {543#false} assume !false; {543#false} is VALID [2022-02-20 16:46:15,831 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:15,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:15,831 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:15,831 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7137582] [2022-02-20 16:46:15,832 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [7137582] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:15,832 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:15,832 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:46:15,832 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088043901] [2022-02-20 16:46:15,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:15,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 16:46:15,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:15,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:15,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:15,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:46:15,867 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:15,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:46:15,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:46:15,868 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:15,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:15,946 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-02-20 16:46:15,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:46:15,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 16:46:15,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:15,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:15,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-02-20 16:46:15,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:15,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-02-20 16:46:15,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-02-20 16:46:16,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:16,016 INFO L225 Difference]: With dead ends: 34 [2022-02-20 16:46:16,016 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 16:46:16,016 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:46:16,017 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:16,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:16,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 16:46:16,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 16:46:16,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:16,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:16,020 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:16,021 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:16,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:16,021 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-02-20 16:46:16,022 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-02-20 16:46:16,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:16,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:16,022 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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 22 states. [2022-02-20 16:46:16,022 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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 22 states. [2022-02-20 16:46:16,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:16,026 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-02-20 16:46:16,026 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-02-20 16:46:16,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:16,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:16,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:16,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:16,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:16,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-02-20 16:46:16,028 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2022-02-20 16:46:16,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:16,028 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-02-20 16:46:16,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:16,028 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-02-20 16:46:16,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 16:46:16,029 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:16,029 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:16,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-02-20 16:46:16,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:16,241 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:16,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:16,242 INFO L85 PathProgramCache]: Analyzing trace with hash 879764433, now seen corresponding path program 1 times [2022-02-20 16:46:16,242 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:16,242 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034318215] [2022-02-20 16:46:16,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:16,243 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:16,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:16,244 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:16,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 16:46:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:16,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 16:46:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:16,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:16,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {701#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);~huge_floor~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30)); {701#true} is VALID [2022-02-20 16:46:16,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {701#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_#t~short9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());assume { :begin_inline_floor_float } true;floor_float_#in~x#1 := main_~x~0#1;havoc floor_float_#res#1;havoc floor_float_#t~mem4#1, floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, floor_float_#t~mem5#1, floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset, floor_float_~x#1, floor_float_~i0~0#1, floor_float_~j0~0#1, floor_float_~i~0#1, floor_float_~ix~0#1;floor_float_~x#1 := floor_float_#in~x#1;havoc floor_float_~i0~0#1;havoc floor_float_~j0~0#1;havoc floor_float_~i~0#1;havoc floor_float_~ix~0#1; {709#(= |ULTIMATE.start_floor_float_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:16,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {709#(= |ULTIMATE.start_floor_float_~x#1| (fp.neg (_ +zero 8 24)))} call floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(floor_float_~x#1, floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, 4bv32);call floor_float_#t~mem4#1 := read~intINTTYPE4(floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, 4bv32);floor_float_~i0~0#1 := floor_float_#t~mem4#1;havoc floor_float_#t~mem4#1;call ULTIMATE.dealloc(floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset);havoc floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset; {713#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|)))} is VALID [2022-02-20 16:46:16,436 INFO L290 TraceCheckUtils]: 3: Hoare triple {713#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|)))} goto; {713#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|)))} is VALID [2022-02-20 16:46:16,437 INFO L290 TraceCheckUtils]: 4: Hoare triple {713#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|)))} floor_float_~ix~0#1 := ~bvand32(2147483647bv32, floor_float_~i0~0#1);floor_float_~j0~0#1 := ~bvsub32(~bvlshr32(floor_float_~ix~0#1, 23bv32), 127bv32); {713#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|)))} is VALID [2022-02-20 16:46:16,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {713#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|)))} assume ~bvslt32(floor_float_~j0~0#1, 23bv32); {713#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|)))} is VALID [2022-02-20 16:46:16,438 INFO L290 TraceCheckUtils]: 6: Hoare triple {713#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|)))} assume ~bvslt32(floor_float_~j0~0#1, 0bv32); {713#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|)))} is VALID [2022-02-20 16:46:16,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {713#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|)))} assume ~fp.gt~FLOAT(~fp.add~FLOAT(currentRoundingMode, ~huge_floor~0, floor_float_~x#1), ~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE())); {713#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|)))} is VALID [2022-02-20 16:46:16,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {713#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|)))} assume ~bvsge32(floor_float_~i0~0#1, 0bv32);floor_float_~i0~0#1 := 0bv32; {702#false} is VALID [2022-02-20 16:46:16,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {702#false} call floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(floor_float_~i0~0#1, floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset, 4bv32);call floor_float_#t~mem5#1 := read~intFLOATTYPE4(floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset, 4bv32);floor_float_~x#1 := floor_float_#t~mem5#1;havoc floor_float_#t~mem5#1;call ULTIMATE.dealloc(floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset);havoc floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset; {702#false} is VALID [2022-02-20 16:46:16,442 INFO L290 TraceCheckUtils]: 10: Hoare triple {702#false} goto; {702#false} is VALID [2022-02-20 16:46:16,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {702#false} floor_float_#res#1 := floor_float_~x#1; {702#false} is VALID [2022-02-20 16:46:16,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {702#false} main_#t~ret7#1 := floor_float_#res#1;assume { :end_inline_floor_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_#t~short9#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {702#false} is VALID [2022-02-20 16:46:16,443 INFO L290 TraceCheckUtils]: 13: Hoare triple {702#false} assume !main_#t~short9#1; {702#false} is VALID [2022-02-20 16:46:16,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {702#false} assume !main_#t~short9#1;havoc main_#t~ret8#1;havoc main_#t~short9#1; {702#false} is VALID [2022-02-20 16:46:16,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {702#false} assume !false; {702#false} is VALID [2022-02-20 16:46:16,443 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:16,444 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:16,444 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:16,444 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034318215] [2022-02-20 16:46:16,444 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034318215] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:16,444 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:16,445 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:46:16,445 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910025214] [2022-02-20 16:46:16,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:16,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-02-20 16:46:16,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:16,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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:16,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:16,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:46:16,469 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:16,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:46:16,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:46:16,470 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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:16,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:16,588 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2022-02-20 16:46:16,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:46:16,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-02-20 16:46:16,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:16,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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:16,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-02-20 16:46:16,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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:16,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-02-20 16:46:16,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 48 transitions. [2022-02-20 16:46:16,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:16,646 INFO L225 Difference]: With dead ends: 46 [2022-02-20 16:46:16,646 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 16:46:16,647 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:16,648 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 33 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:16,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 52 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:16,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 16:46:16,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 22. [2022-02-20 16:46:16,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:16,651 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 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:16,651 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 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:16,651 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 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:16,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:16,652 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-02-20 16:46:16,652 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-02-20 16:46:16,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:16,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:16,653 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 34 states. [2022-02-20 16:46:16,653 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 34 states. [2022-02-20 16:46:16,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:16,654 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-02-20 16:46:16,654 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-02-20 16:46:16,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:16,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:16,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:16,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:16,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 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:16,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-02-20 16:46:16,656 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 16 [2022-02-20 16:46:16,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:16,656 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-02-20 16:46:16,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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:16,656 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-02-20 16:46:16,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 16:46:16,659 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:16,659 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:16,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:16,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:16,860 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:16,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:16,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1572128049, now seen corresponding path program 1 times [2022-02-20 16:46:16,861 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:16,861 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207383777] [2022-02-20 16:46:16,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:16,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:16,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:16,862 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:16,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 16:46:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:16,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:46:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:16,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:17,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {904#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);~huge_floor~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30)); {904#true} is VALID [2022-02-20 16:46:17,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {904#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_#t~short9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());assume { :begin_inline_floor_float } true;floor_float_#in~x#1 := main_~x~0#1;havoc floor_float_#res#1;havoc floor_float_#t~mem4#1, floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, floor_float_#t~mem5#1, floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset, floor_float_~x#1, floor_float_~i0~0#1, floor_float_~j0~0#1, floor_float_~i~0#1, floor_float_~ix~0#1;floor_float_~x#1 := floor_float_#in~x#1;havoc floor_float_~i0~0#1;havoc floor_float_~j0~0#1;havoc floor_float_~i~0#1;havoc floor_float_~ix~0#1; {912#(= |ULTIMATE.start_floor_float_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:17,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#(= |ULTIMATE.start_floor_float_~x#1| (fp.neg (_ +zero 8 24)))} call floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(floor_float_~x#1, floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, 4bv32);call floor_float_#t~mem4#1 := read~intINTTYPE4(floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, 4bv32);floor_float_~i0~0#1 := floor_float_#t~mem4#1;havoc floor_float_#t~mem4#1;call ULTIMATE.dealloc(floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset);havoc floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset; {916#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|)))} is VALID [2022-02-20 16:46:17,125 INFO L290 TraceCheckUtils]: 3: Hoare triple {916#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|)))} goto; {916#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|)))} is VALID [2022-02-20 16:46:17,127 INFO L290 TraceCheckUtils]: 4: Hoare triple {916#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|)))} floor_float_~ix~0#1 := ~bvand32(2147483647bv32, floor_float_~i0~0#1);floor_float_~j0~0#1 := ~bvsub32(~bvlshr32(floor_float_~ix~0#1, 23bv32), 127bv32); {923#(exists ((|ULTIMATE.start_floor_float_~i0~0#1| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|))) (= |ULTIMATE.start_floor_float_~ix~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start_floor_float_~i0~0#1|))))} is VALID [2022-02-20 16:46:17,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {923#(exists ((|ULTIMATE.start_floor_float_~i0~0#1| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|))) (= |ULTIMATE.start_floor_float_~ix~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start_floor_float_~i0~0#1|))))} assume ~bvslt32(floor_float_~j0~0#1, 23bv32); {923#(exists ((|ULTIMATE.start_floor_float_~i0~0#1| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|))) (= |ULTIMATE.start_floor_float_~ix~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start_floor_float_~i0~0#1|))))} is VALID [2022-02-20 16:46:17,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {923#(exists ((|ULTIMATE.start_floor_float_~i0~0#1| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|))) (= |ULTIMATE.start_floor_float_~ix~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start_floor_float_~i0~0#1|))))} assume ~bvslt32(floor_float_~j0~0#1, 0bv32); {923#(exists ((|ULTIMATE.start_floor_float_~i0~0#1| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|))) (= |ULTIMATE.start_floor_float_~ix~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start_floor_float_~i0~0#1|))))} is VALID [2022-02-20 16:46:17,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {923#(exists ((|ULTIMATE.start_floor_float_~i0~0#1| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|))) (= |ULTIMATE.start_floor_float_~ix~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start_floor_float_~i0~0#1|))))} assume ~fp.gt~FLOAT(~fp.add~FLOAT(currentRoundingMode, ~huge_floor~0, floor_float_~x#1), ~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE())); {923#(exists ((|ULTIMATE.start_floor_float_~i0~0#1| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|))) (= |ULTIMATE.start_floor_float_~ix~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start_floor_float_~i0~0#1|))))} is VALID [2022-02-20 16:46:17,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {923#(exists ((|ULTIMATE.start_floor_float_~i0~0#1| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|))) (= |ULTIMATE.start_floor_float_~ix~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start_floor_float_~i0~0#1|))))} assume !~bvsge32(floor_float_~i0~0#1, 0bv32); {923#(exists ((|ULTIMATE.start_floor_float_~i0~0#1| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|))) (= |ULTIMATE.start_floor_float_~ix~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start_floor_float_~i0~0#1|))))} is VALID [2022-02-20 16:46:17,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {923#(exists ((|ULTIMATE.start_floor_float_~i0~0#1| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|))) (= |ULTIMATE.start_floor_float_~ix~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start_floor_float_~i0~0#1|))))} assume !(0bv32 == floor_float_~ix~0#1);floor_float_~i0~0#1 := 3212836864bv32; {905#false} is VALID [2022-02-20 16:46:17,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {905#false} call floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(floor_float_~i0~0#1, floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset, 4bv32);call floor_float_#t~mem5#1 := read~intFLOATTYPE4(floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset, 4bv32);floor_float_~x#1 := floor_float_#t~mem5#1;havoc floor_float_#t~mem5#1;call ULTIMATE.dealloc(floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset);havoc floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset; {905#false} is VALID [2022-02-20 16:46:17,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {905#false} goto; {905#false} is VALID [2022-02-20 16:46:17,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {905#false} floor_float_#res#1 := floor_float_~x#1; {905#false} is VALID [2022-02-20 16:46:17,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {905#false} main_#t~ret7#1 := floor_float_#res#1;assume { :end_inline_floor_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_#t~short9#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {905#false} is VALID [2022-02-20 16:46:17,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {905#false} assume !main_#t~short9#1; {905#false} is VALID [2022-02-20 16:46:17,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {905#false} assume !main_#t~short9#1;havoc main_#t~ret8#1;havoc main_#t~short9#1; {905#false} is VALID [2022-02-20 16:46:17,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {905#false} assume !false; {905#false} is VALID [2022-02-20 16:46:17,131 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:17,131 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:17,131 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:17,131 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207383777] [2022-02-20 16:46:17,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207383777] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:17,132 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:17,132 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:17,132 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669230515] [2022-02-20 16:46:17,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:17,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-02-20 16:46:17,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:17,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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:17,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:17,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:17,163 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:17,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:17,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:17,164 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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:17,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:17,248 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-02-20 16:46:17,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:46:17,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-02-20 16:46:17,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:17,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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:17,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-02-20 16:46:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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:17,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-02-20 16:46:17,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2022-02-20 16:46:17,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:17,294 INFO L225 Difference]: With dead ends: 34 [2022-02-20 16:46:17,294 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 16:46:17,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:17,296 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:17,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 56 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 5 Unchecked, 0.0s Time] [2022-02-20 16:46:17,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 16:46:17,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 16:46:17,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:17,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 0 states have call successors, (0), 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:17,299 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 0 states have call successors, (0), 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:17,299 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 0 states have call successors, (0), 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:17,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:17,300 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-02-20 16:46:17,300 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-02-20 16:46:17,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:17,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:17,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states. [2022-02-20 16:46:17,301 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states. [2022-02-20 16:46:17,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:17,302 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-02-20 16:46:17,302 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-02-20 16:46:17,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:17,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:17,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:17,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:17,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 0 states have call successors, (0), 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:17,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-02-20 16:46:17,304 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 17 [2022-02-20 16:46:17,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:17,304 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-02-20 16:46:17,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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:17,304 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-02-20 16:46:17,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 16:46:17,305 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:17,305 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:17,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:17,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:17,516 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:17,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:17,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1913492621, now seen corresponding path program 1 times [2022-02-20 16:46:17,517 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:17,517 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [18039096] [2022-02-20 16:46:17,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:17,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:17,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:17,518 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:17,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 16:46:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:17,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 16:46:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:17,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:17,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 16:46:17,796 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 44 treesize of output 20 [2022-02-20 16:46:17,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {1074#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);~huge_floor~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30)); {1074#true} is VALID [2022-02-20 16:46:17,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {1074#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_#t~short9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());assume { :begin_inline_floor_float } true;floor_float_#in~x#1 := main_~x~0#1;havoc floor_float_#res#1;havoc floor_float_#t~mem4#1, floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, floor_float_#t~mem5#1, floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset, floor_float_~x#1, floor_float_~i0~0#1, floor_float_~j0~0#1, floor_float_~i~0#1, floor_float_~ix~0#1;floor_float_~x#1 := floor_float_#in~x#1;havoc floor_float_~i0~0#1;havoc floor_float_~j0~0#1;havoc floor_float_~i~0#1;havoc floor_float_~ix~0#1; {1082#(= |ULTIMATE.start_floor_float_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:17,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {1082#(= |ULTIMATE.start_floor_float_~x#1| (fp.neg (_ +zero 8 24)))} call floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(floor_float_~x#1, floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, 4bv32);call floor_float_#t~mem4#1 := read~intINTTYPE4(floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, 4bv32);floor_float_~i0~0#1 := floor_float_#t~mem4#1;havoc floor_float_#t~mem4#1;call ULTIMATE.dealloc(floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset);havoc floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset; {1086#(exists ((|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32)) |ULTIMATE.start_floor_float_~i0~0#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32)))) (fp.neg (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:17,841 INFO L290 TraceCheckUtils]: 3: Hoare triple {1086#(exists ((|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32)) |ULTIMATE.start_floor_float_~i0~0#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32)))) (fp.neg (_ +zero 8 24)))))} goto; {1086#(exists ((|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32)) |ULTIMATE.start_floor_float_~i0~0#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32)))) (fp.neg (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:17,842 INFO L290 TraceCheckUtils]: 4: Hoare triple {1086#(exists ((|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32)) |ULTIMATE.start_floor_float_~i0~0#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32)))) (fp.neg (_ +zero 8 24)))))} floor_float_~ix~0#1 := ~bvand32(2147483647bv32, floor_float_~i0~0#1);floor_float_~j0~0#1 := ~bvsub32(~bvlshr32(floor_float_~ix~0#1, 23bv32), 127bv32); {1086#(exists ((|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32)) |ULTIMATE.start_floor_float_~i0~0#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32)))) (fp.neg (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:17,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {1086#(exists ((|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32)) |ULTIMATE.start_floor_float_~i0~0#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32)))) (fp.neg (_ +zero 8 24)))))} assume ~bvslt32(floor_float_~j0~0#1, 23bv32); {1086#(exists ((|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32)) |ULTIMATE.start_floor_float_~i0~0#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32)))) (fp.neg (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:17,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {1086#(exists ((|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32)) |ULTIMATE.start_floor_float_~i0~0#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32)))) (fp.neg (_ +zero 8 24)))))} assume ~bvslt32(floor_float_~j0~0#1, 0bv32); {1086#(exists ((|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32)) |ULTIMATE.start_floor_float_~i0~0#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32)))) (fp.neg (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:17,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {1086#(exists ((|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32)) |ULTIMATE.start_floor_float_~i0~0#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32)))) (fp.neg (_ +zero 8 24)))))} assume ~fp.gt~FLOAT(~fp.add~FLOAT(currentRoundingMode, ~huge_floor~0, floor_float_~x#1), ~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE())); {1086#(exists ((|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32)) |ULTIMATE.start_floor_float_~i0~0#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32)))) (fp.neg (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:17,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {1086#(exists ((|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32)) |ULTIMATE.start_floor_float_~i0~0#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32)))) (fp.neg (_ +zero 8 24)))))} assume !~bvsge32(floor_float_~i0~0#1, 0bv32); {1086#(exists ((|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32)) |ULTIMATE.start_floor_float_~i0~0#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32)))) (fp.neg (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:17,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {1086#(exists ((|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32)) |ULTIMATE.start_floor_float_~i0~0#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32)))) (fp.neg (_ +zero 8 24)))))} assume !!(0bv32 == floor_float_~ix~0#1); {1086#(exists ((|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32)) |ULTIMATE.start_floor_float_~i0~0#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32)))) (fp.neg (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:17,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {1086#(exists ((|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32)) |ULTIMATE.start_floor_float_~i0~0#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_15|) (_ bv0 32)))) (fp.neg (_ +zero 8 24)))))} call floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(floor_float_~i0~0#1, floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset, 4bv32);call floor_float_#t~mem5#1 := read~intFLOATTYPE4(floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset, 4bv32);floor_float_~x#1 := floor_float_#t~mem5#1;havoc floor_float_#t~mem5#1;call ULTIMATE.dealloc(floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset);havoc floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset; {1082#(= |ULTIMATE.start_floor_float_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:17,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {1082#(= |ULTIMATE.start_floor_float_~x#1| (fp.neg (_ +zero 8 24)))} goto; {1082#(= |ULTIMATE.start_floor_float_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:17,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {1082#(= |ULTIMATE.start_floor_float_~x#1| (fp.neg (_ +zero 8 24)))} floor_float_#res#1 := floor_float_~x#1; {1117#(= |ULTIMATE.start_floor_float_#res#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:17,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {1117#(= |ULTIMATE.start_floor_float_#res#1| (fp.neg (_ +zero 8 24)))} main_#t~ret7#1 := floor_float_#res#1;assume { :end_inline_floor_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_#t~short9#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {1121#|ULTIMATE.start_main_#t~short9#1|} is VALID [2022-02-20 16:46:17,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {1121#|ULTIMATE.start_main_#t~short9#1|} assume !main_#t~short9#1; {1075#false} is VALID [2022-02-20 16:46:17,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {1075#false} assume !main_#t~short9#1;havoc main_#t~ret8#1;havoc main_#t~short9#1; {1075#false} is VALID [2022-02-20 16:46:17,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {1075#false} assume !false; {1075#false} is VALID [2022-02-20 16:46:17,862 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:17,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:17,863 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:17,863 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [18039096] [2022-02-20 16:46:17,863 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [18039096] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:17,863 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:17,863 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:46:17,863 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788696905] [2022-02-20 16:46:17,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:17,864 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-02-20 16:46:17,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:17,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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:17,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:17,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:46:17,902 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:17,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:46:17,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:46:17,903 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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:18,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:18,152 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2022-02-20 16:46:18,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:46:18,152 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-02-20 16:46:18,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:18,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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:18,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2022-02-20 16:46:18,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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:18,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2022-02-20 16:46:18,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 24 transitions. [2022-02-20 16:46:18,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:18,197 INFO L225 Difference]: With dead ends: 25 [2022-02-20 16:46:18,197 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 16:46:18,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:46:18,198 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 23 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:18,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 39 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 10 Unchecked, 0.0s Time] [2022-02-20 16:46:18,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 16:46:18,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 16:46:18,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:18,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.0) internal successors, (21), 21 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:18,201 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.0) internal successors, (21), 21 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:18,201 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.0) internal successors, (21), 21 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:18,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:18,202 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2022-02-20 16:46:18,202 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2022-02-20 16:46:18,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:18,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:18,203 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 21 states have (on average 1.0) internal successors, (21), 21 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states. [2022-02-20 16:46:18,203 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.0) internal successors, (21), 21 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states. [2022-02-20 16:46:18,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:18,203 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2022-02-20 16:46:18,204 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2022-02-20 16:46:18,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:18,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:18,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:18,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:18,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0) internal successors, (21), 21 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:18,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2022-02-20 16:46:18,205 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 17 [2022-02-20 16:46:18,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:18,205 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2022-02-20 16:46:18,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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:18,206 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2022-02-20 16:46:18,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 16:46:18,206 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:18,206 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:18,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:18,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:18,418 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:18,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:18,419 INFO L85 PathProgramCache]: Analyzing trace with hash 805440418, now seen corresponding path program 1 times [2022-02-20 16:46:18,419 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:18,419 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140774553] [2022-02-20 16:46:18,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:18,419 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:18,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:18,421 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:18,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 16:46:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:18,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 16:46:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:18,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:18,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 16:46:18,667 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-02-20 16:46:18,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2022-02-20 16:46:18,894 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 16:46:18,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 29 [2022-02-20 16:46:19,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {1235#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);~huge_floor~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30)); {1235#true} is VALID [2022-02-20 16:46:19,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {1235#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_#t~short9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());assume { :begin_inline_floor_float } true;floor_float_#in~x#1 := main_~x~0#1;havoc floor_float_#res#1;havoc floor_float_#t~mem4#1, floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, floor_float_#t~mem5#1, floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset, floor_float_~x#1, floor_float_~i0~0#1, floor_float_~j0~0#1, floor_float_~i~0#1, floor_float_~ix~0#1;floor_float_~x#1 := floor_float_#in~x#1;havoc floor_float_~i0~0#1;havoc floor_float_~j0~0#1;havoc floor_float_~i~0#1;havoc floor_float_~ix~0#1; {1243#(= |ULTIMATE.start_floor_float_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:19,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {1243#(= |ULTIMATE.start_floor_float_~x#1| (fp.neg (_ +zero 8 24)))} call floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(floor_float_~x#1, floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, 4bv32);call floor_float_#t~mem4#1 := read~intINTTYPE4(floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, 4bv32);floor_float_~i0~0#1 := floor_float_#t~mem4#1;havoc floor_float_#t~mem4#1;call ULTIMATE.dealloc(floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset);havoc floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset; {1247#(exists ((|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)) |ULTIMATE.start_floor_float_~i0~0#1|)))} is VALID [2022-02-20 16:46:19,102 INFO L290 TraceCheckUtils]: 3: Hoare triple {1247#(exists ((|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)) |ULTIMATE.start_floor_float_~i0~0#1|)))} goto; {1247#(exists ((|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)) |ULTIMATE.start_floor_float_~i0~0#1|)))} is VALID [2022-02-20 16:46:19,102 INFO L290 TraceCheckUtils]: 4: Hoare triple {1247#(exists ((|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)) |ULTIMATE.start_floor_float_~i0~0#1|)))} floor_float_~ix~0#1 := ~bvand32(2147483647bv32, floor_float_~i0~0#1);floor_float_~j0~0#1 := ~bvsub32(~bvlshr32(floor_float_~ix~0#1, 23bv32), 127bv32); {1247#(exists ((|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)) |ULTIMATE.start_floor_float_~i0~0#1|)))} is VALID [2022-02-20 16:46:19,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {1247#(exists ((|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)) |ULTIMATE.start_floor_float_~i0~0#1|)))} assume ~bvslt32(floor_float_~j0~0#1, 23bv32); {1247#(exists ((|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)) |ULTIMATE.start_floor_float_~i0~0#1|)))} is VALID [2022-02-20 16:46:19,103 INFO L290 TraceCheckUtils]: 6: Hoare triple {1247#(exists ((|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)) |ULTIMATE.start_floor_float_~i0~0#1|)))} assume ~bvslt32(floor_float_~j0~0#1, 0bv32); {1247#(exists ((|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)) |ULTIMATE.start_floor_float_~i0~0#1|)))} is VALID [2022-02-20 16:46:19,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {1247#(exists ((|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)) |ULTIMATE.start_floor_float_~i0~0#1|)))} assume ~fp.gt~FLOAT(~fp.add~FLOAT(currentRoundingMode, ~huge_floor~0, floor_float_~x#1), ~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE())); {1247#(exists ((|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)) |ULTIMATE.start_floor_float_~i0~0#1|)))} is VALID [2022-02-20 16:46:19,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {1247#(exists ((|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)) |ULTIMATE.start_floor_float_~i0~0#1|)))} assume !~bvsge32(floor_float_~i0~0#1, 0bv32); {1247#(exists ((|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)) |ULTIMATE.start_floor_float_~i0~0#1|)))} is VALID [2022-02-20 16:46:19,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {1247#(exists ((|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)) |ULTIMATE.start_floor_float_~i0~0#1|)))} assume !!(0bv32 == floor_float_~ix~0#1); {1247#(exists ((|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)) |ULTIMATE.start_floor_float_~i0~0#1|)))} is VALID [2022-02-20 16:46:19,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {1247#(exists ((|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)) |ULTIMATE.start_floor_float_~i0~0#1|)))} call floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(floor_float_~i0~0#1, floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset, 4bv32);call floor_float_#t~mem5#1 := read~intFLOATTYPE4(floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset, 4bv32);floor_float_~x#1 := floor_float_#t~mem5#1;havoc floor_float_#t~mem5#1;call ULTIMATE.dealloc(floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset);havoc floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset; {1272#(exists ((|v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11| (_ BitVec 32)) (|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17| (_ BitVec 32))) (and (= |ULTIMATE.start_floor_float_~x#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))) (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)))))))} is VALID [2022-02-20 16:46:19,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {1272#(exists ((|v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11| (_ BitVec 32)) (|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17| (_ BitVec 32))) (and (= |ULTIMATE.start_floor_float_~x#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))) (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)))))))} goto; {1272#(exists ((|v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11| (_ BitVec 32)) (|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17| (_ BitVec 32))) (and (= |ULTIMATE.start_floor_float_~x#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))) (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)))))))} is VALID [2022-02-20 16:46:19,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {1272#(exists ((|v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11| (_ BitVec 32)) (|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17| (_ BitVec 32))) (and (= |ULTIMATE.start_floor_float_~x#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))) (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)))))))} floor_float_#res#1 := floor_float_~x#1; {1279#(exists ((|v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11| (_ BitVec 32)) (|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))) (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))))) (= |ULTIMATE.start_floor_float_#res#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32)))))))} is VALID [2022-02-20 16:46:19,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {1279#(exists ((|v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11| (_ BitVec 32)) (|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))) (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))))) (= |ULTIMATE.start_floor_float_#res#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32)))))))} main_#t~ret7#1 := floor_float_#res#1;assume { :end_inline_floor_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_#t~short9#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {1283#(exists ((|v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11| (_ BitVec 32)) (|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))) (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))))) (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32)))))))} is VALID [2022-02-20 16:46:19,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {1283#(exists ((|v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11| (_ BitVec 32)) (|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))) (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))))) (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32)))))))} assume main_#t~short9#1;assume { :begin_inline___signbit_float } true;__signbit_float_#in~x#1 := main_~res~0#1;havoc __signbit_float_#res#1;havoc __signbit_float_#t~mem6#1, __signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset, __signbit_float_~x#1, __signbit_float_~w~0#1;__signbit_float_~x#1 := __signbit_float_#in~x#1;havoc __signbit_float_~w~0#1; {1287#(exists ((|v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11| (_ BitVec 32)) (|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17| (_ BitVec 32))) (and (= |ULTIMATE.start___signbit_float_~x#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))) (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)))))))} is VALID [2022-02-20 16:46:19,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {1287#(exists ((|v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11| (_ BitVec 32)) (|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17| (_ BitVec 32))) (and (= |ULTIMATE.start___signbit_float_~x#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))) (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)))))))} call __signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__signbit_float_~x#1, __signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset, 4bv32);call __signbit_float_#t~mem6#1 := read~intINTTYPE4(__signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset, 4bv32);__signbit_float_~w~0#1 := __signbit_float_#t~mem6#1;havoc __signbit_float_#t~mem6#1;call ULTIMATE.dealloc(__signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset);havoc __signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset; {1291#(exists ((v_arrayElimCell_4 (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (= (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|)) (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))))} is VALID [2022-02-20 16:46:19,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {1291#(exists ((v_arrayElimCell_4 (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (= (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|)) (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))))} goto; {1291#(exists ((v_arrayElimCell_4 (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (= (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|)) (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))))} is VALID [2022-02-20 16:46:19,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {1291#(exists ((v_arrayElimCell_4 (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (= (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|)) (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))))} __signbit_float_#res#1 := (if 0bv32 != ~bvand32(2147483648bv32, __signbit_float_~w~0#1) then 1bv32 else 0bv32); {1298#(exists ((|ULTIMATE.start___signbit_float_~w~0#1| (_ BitVec 32))) (and (or (and (= |ULTIMATE.start___signbit_float_#res#1| (_ bv0 32)) (= (bvand |ULTIMATE.start___signbit_float_~w~0#1| (_ bv2147483648 32)) (_ bv0 32))) (and (not (= (bvand |ULTIMATE.start___signbit_float_~w~0#1| (_ bv2147483648 32)) (_ bv0 32))) (= |ULTIMATE.start___signbit_float_#res#1| (_ bv1 32)))) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (= (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|)) (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))))))} is VALID [2022-02-20 16:46:19,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {1298#(exists ((|ULTIMATE.start___signbit_float_~w~0#1| (_ BitVec 32))) (and (or (and (= |ULTIMATE.start___signbit_float_#res#1| (_ bv0 32)) (= (bvand |ULTIMATE.start___signbit_float_~w~0#1| (_ bv2147483648 32)) (_ bv0 32))) (and (not (= (bvand |ULTIMATE.start___signbit_float_~w~0#1| (_ bv2147483648 32)) (_ bv0 32))) (= |ULTIMATE.start___signbit_float_#res#1| (_ bv1 32)))) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (= (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|)) (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))))))} main_#t~ret8#1 := __signbit_float_#res#1;assume { :end_inline___signbit_float } true;main_#t~short9#1 := 1bv32 == main_#t~ret8#1; {1302#|ULTIMATE.start_main_#t~short9#1|} is VALID [2022-02-20 16:46:19,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {1302#|ULTIMATE.start_main_#t~short9#1|} assume !main_#t~short9#1;havoc main_#t~ret8#1;havoc main_#t~short9#1; {1236#false} is VALID [2022-02-20 16:46:19,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {1236#false} assume !false; {1236#false} is VALID [2022-02-20 16:46:19,122 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:19,122 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:19,122 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:19,122 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140774553] [2022-02-20 16:46:19,123 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140774553] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:19,123 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:19,123 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 16:46:19,123 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790859461] [2022-02-20 16:46:19,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:19,123 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 16:46:19,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:19,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:19,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:19,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 16:46:19,165 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:19,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 16:46:19,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-02-20 16:46:19,165 INFO L87 Difference]: Start difference. First operand 22 states and 21 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:21,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:21,521 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2022-02-20 16:46:21,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 16:46:21,522 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 16:46:21,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:21,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:21,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 21 transitions. [2022-02-20 16:46:21,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:21,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 21 transitions. [2022-02-20 16:46:21,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 21 transitions. [2022-02-20 16:46:21,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:21,563 INFO L225 Difference]: With dead ends: 22 [2022-02-20 16:46:21,563 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:46:21,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-02-20 16:46:21,564 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:21,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 68 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 25 Unchecked, 0.0s Time] [2022-02-20 16:46:21,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:46:21,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:46:21,565 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:21,565 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:21,565 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:21,565 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:21,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:21,565 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:21,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:21,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:21,566 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:21,566 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:21,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:21,566 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:21,567 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:21,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:21,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:21,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:21,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:21,567 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:21,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:46:21,567 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2022-02-20 16:46:21,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:21,568 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:46:21,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:21,568 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:21,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:21,570 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:21,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:21,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:21,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:46:22,380 INFO L858 garLoopResultBuilder]: For program point L27(lines 27 33) no Hoare annotation was computed. [2022-02-20 16:46:22,380 INFO L858 garLoopResultBuilder]: For program point L81(line 81) no Hoare annotation was computed. [2022-02-20 16:46:22,380 INFO L858 garLoopResultBuilder]: For program point L81-2(lines 81 84) no Hoare annotation was computed. [2022-02-20 16:46:22,380 INFO L858 garLoopResultBuilder]: For program point L36(lines 36 37) no Hoare annotation was computed. [2022-02-20 16:46:22,380 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:46:22,380 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:46:22,381 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:46:22,381 INFO L858 garLoopResultBuilder]: For program point L28(lines 28 32) no Hoare annotation was computed. [2022-02-20 16:46:22,381 INFO L858 garLoopResultBuilder]: For program point L61-1(lines 61 65) no Hoare annotation was computed. [2022-02-20 16:46:22,381 INFO L854 garLoopResultBuilder]: At program point L61-2(lines 61 65) the Hoare annotation is: (let ((.cse2 (fp.neg (_ +zero 8 24)))) (and (exists ((|v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11| (_ BitVec 32)) (|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17| (_ BitVec 32))) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32))) (.cse1 (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32)))) (and (= |ULTIMATE.start___signbit_float_~x#1| (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (= .cse1 .cse0) (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))))) (= |ULTIMATE.start_floor_float_~x#1| .cse2) (= ~huge_floor~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) |ULTIMATE.start_main_#t~short9#1| (= |ULTIMATE.start_floor_float_#res#1| .cse2) (= currentRoundingMode roundNearestTiesToEven))) [2022-02-20 16:46:22,381 INFO L858 garLoopResultBuilder]: For program point L61-3(lines 61 65) no Hoare annotation was computed. [2022-02-20 16:46:22,381 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 82) no Hoare annotation was computed. [2022-02-20 16:46:22,381 INFO L861 garLoopResultBuilder]: At program point L86(lines 70 87) the Hoare annotation is: true [2022-02-20 16:46:22,381 INFO L858 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2022-02-20 16:46:22,381 INFO L858 garLoopResultBuilder]: For program point L45(lines 45 48) no Hoare annotation was computed. [2022-02-20 16:46:22,381 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:46:22,381 INFO L858 garLoopResultBuilder]: For program point L25(lines 25 49) no Hoare annotation was computed. [2022-02-20 16:46:22,382 INFO L858 garLoopResultBuilder]: For program point L50(lines 50 54) no Hoare annotation was computed. [2022-02-20 16:46:22,382 INFO L858 garLoopResultBuilder]: For program point L50-1(lines 15 56) no Hoare annotation was computed. [2022-02-20 16:46:22,382 INFO L858 garLoopResultBuilder]: For program point L50-2(lines 50 54) no Hoare annotation was computed. [2022-02-20 16:46:22,382 INFO L858 garLoopResultBuilder]: For program point L38(lines 38 42) no Hoare annotation was computed. [2022-02-20 16:46:22,382 INFO L854 garLoopResultBuilder]: At program point L67(lines 58 68) the Hoare annotation is: (let ((.cse2 (fp.neg (_ +zero 8 24)))) (and (exists ((|ULTIMATE.start___signbit_float_~w~0#1| (_ BitVec 32))) (and (let ((.cse0 (= (bvand |ULTIMATE.start___signbit_float_~w~0#1| (_ bv2147483648 32)) (_ bv0 32)))) (or (and (= |ULTIMATE.start___signbit_float_#res#1| (_ bv0 32)) .cse0) (and (not .cse0) (= |ULTIMATE.start___signbit_float_#res#1| (_ bv1 32))))) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= (fp.neg (_ +zero 8 24)) .cse1) (= (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|)) .cse1)))))) (= |ULTIMATE.start_floor_float_~x#1| .cse2) (= ~huge_floor~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) |ULTIMATE.start_main_#t~short9#1| (= |ULTIMATE.start_floor_float_#res#1| .cse2) (= currentRoundingMode roundNearestTiesToEven))) [2022-02-20 16:46:22,382 INFO L858 garLoopResultBuilder]: For program point L30(lines 30 32) no Hoare annotation was computed. [2022-02-20 16:46:22,382 INFO L858 garLoopResultBuilder]: For program point L26(lines 26 43) no Hoare annotation was computed. [2022-02-20 16:46:22,383 INFO L854 garLoopResultBuilder]: At program point L55(lines 15 56) the Hoare annotation is: (and (= |ULTIMATE.start_floor_float_~x#1| (fp.neg (_ +zero 8 24))) (= ~huge_floor~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (exists ((|v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11| (_ BitVec 32)) (|v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17| (_ BitVec 32))) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17|) (_ bv0 32))) (.cse1 (select (select |#memory_int| |v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11|) (_ bv0 32)))) (and (= .cse0 .cse1) (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (= |ULTIMATE.start_floor_float_#res#1| (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2022-02-20 16:46:22,383 INFO L858 garLoopResultBuilder]: For program point L18-1(lines 18 22) no Hoare annotation was computed. [2022-02-20 16:46:22,383 INFO L854 garLoopResultBuilder]: At program point L18-2(lines 18 22) the Hoare annotation is: (and (= |ULTIMATE.start_floor_float_~x#1| (fp.neg (_ +zero 8 24))) (= ~huge_floor~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven)) [2022-02-20 16:46:22,383 INFO L858 garLoopResultBuilder]: For program point L18-3(lines 18 22) no Hoare annotation was computed. [2022-02-20 16:46:22,383 INFO L858 garLoopResultBuilder]: For program point L39(lines 39 40) no Hoare annotation was computed. [2022-02-20 16:46:22,383 INFO L858 garLoopResultBuilder]: For program point L39-2(lines 39 40) no Hoare annotation was computed. [2022-02-20 16:46:22,385 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:22,386 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:22,389 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:22,389 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:22,389 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-20 16:46:22,389 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2022-02-20 16:46:22,389 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-20 16:46:22,389 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-20 16:46:22,389 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2022-02-20 16:46:22,389 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-20 16:46:22,389 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-20 16:46:22,389 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:46:22,390 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:46:22,390 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 16:46:22,390 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 16:46:22,390 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:22,390 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:22,390 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:22,390 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:22,390 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-02-20 16:46:22,390 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:46:22,390 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:46:22,391 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-02-20 16:46:22,391 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-02-20 16:46:22,391 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:22,391 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:22,391 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-02-20 16:46:22,391 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-02-20 16:46:22,391 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:46:22,391 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:46:22,391 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-02-20 16:46:22,391 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-02-20 16:46:22,392 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2022-02-20 16:46:22,392 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:46:22,392 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:46:22,392 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-02-20 16:46:22,392 WARN L170 areAnnotationChecker]: L61-3 has no Hoare annotation [2022-02-20 16:46:22,392 WARN L170 areAnnotationChecker]: L81-2 has no Hoare annotation [2022-02-20 16:46:22,392 WARN L170 areAnnotationChecker]: L81-2 has no Hoare annotation [2022-02-20 16:46:22,392 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-02-20 16:46:22,392 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-02-20 16:46:22,392 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-02-20 16:46:22,393 WARN L170 areAnnotationChecker]: L61-3 has no Hoare annotation [2022-02-20 16:46:22,393 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-20 16:46:22,393 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-20 16:46:22,393 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:22,393 WARN L170 areAnnotationChecker]: L81-2 has no Hoare annotation [2022-02-20 16:46:22,393 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:22,393 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:46:22,397 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:22,398 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:22,398 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,398 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,399 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,399 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:22,399 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:22,399 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:22,399 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,399 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,399 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,400 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:22,402 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:22,402 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:22,402 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,403 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,403 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,403 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:22,403 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:22,403 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:22,403 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,403 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,404 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,404 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:22,405 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:22,405 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:22,406 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-02-20 16:46:22,406 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-02-20 16:46:22,406 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-02-20 16:46:22,406 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-02-20 16:46:22,407 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-02-20 16:46:22,407 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-02-20 16:46:22,407 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-02-20 16:46:22,407 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-02-20 16:46:22,407 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:22,408 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-02-20 16:46:22,408 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-02-20 16:46:22,408 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-02-20 16:46:22,409 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-02-20 16:46:22,409 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-02-20 16:46:22,409 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-02-20 16:46:22,409 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-02-20 16:46:22,409 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-02-20 16:46:22,409 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:22,410 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-02-20 16:46:22,411 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-02-20 16:46:22,411 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-02-20 16:46:22,411 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-02-20 16:46:22,411 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-02-20 16:46:22,411 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-02-20 16:46:22,411 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-02-20 16:46:22,412 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-02-20 16:46:22,412 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:22,413 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-02-20 16:46:22,413 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-02-20 16:46:22,413 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-02-20 16:46:22,413 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-02-20 16:46:22,413 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-02-20 16:46:22,413 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-02-20 16:46:22,414 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-02-20 16:46:22,414 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-02-20 16:46:22,414 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:22,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:22 BoogieIcfgContainer [2022-02-20 16:46:22,415 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:22,415 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:22,415 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:22,416 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:22,416 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:11" (3/4) ... [2022-02-20 16:46:22,418 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:46:22,426 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-02-20 16:46:22,426 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-02-20 16:46:22,426 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:46:22,426 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:46:22,445 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && huge_floor == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E30))) && (\exists v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11 : bv32, v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17 : bv32 :: (unknown-#memory_int-unknown[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17][0bv32] == unknown-#memory_int-unknown[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11][0bv32] && ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17][0bv32][22:0])) && \result == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11][0bv32][22:0]))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-02-20 16:46:22,446 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\exists v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11 : bv32, v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17 : bv32 :: (x == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11][0bv32][22:0]) && unknown-#memory_int-unknown[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17][0bv32] == unknown-#memory_int-unknown[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11][0bv32]) && ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17][0bv32][22:0])) && x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && huge_floor == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E30))) && aux-res == -0.0f && __signbit_float(res) == 1-aux) && \result == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-02-20 16:46:22,446 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\exists ULTIMATE.start___signbit_float_~w~0#1 : bv32 :: ((\result == 0bv32 && ~bvand32(ULTIMATE.start___signbit_float_~w~0#1, 2147483648bv32) == 0bv32) || (!(~bvand32(ULTIMATE.start___signbit_float_~w~0#1, 2147483648bv32) == 0bv32) && \result == 1bv32)) && (\exists v_arrayElimCell_4 : bv32 :: ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_arrayElimCell_4[31:31], v_arrayElimCell_4[30:23], v_arrayElimCell_4[22:0]) && ~fp~LONGDOUBLE(ULTIMATE.start___signbit_float_~w~0#1[31:31], ULTIMATE.start___signbit_float_~w~0#1[30:23], ULTIMATE.start___signbit_float_~w~0#1[22:0]) == ~fp~LONGDOUBLE(v_arrayElimCell_4[31:31], v_arrayElimCell_4[30:23], v_arrayElimCell_4[22:0]))) && x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && huge_floor == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E30))) && aux-res == -0.0f && __signbit_float(res) == 1-aux) && \result == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-02-20 16:46:22,454 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:46:22,454 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:22,455 INFO L158 Benchmark]: Toolchain (without parser) took 12015.74ms. Allocated memory was 54.5MB in the beginning and 81.8MB in the end (delta: 27.3MB). Free memory was 31.2MB in the beginning and 49.6MB in the end (delta: -18.4MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2022-02-20 16:46:22,455 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 54.5MB. Free memory was 36.0MB in the beginning and 35.9MB in the end (delta: 60.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:22,456 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.93ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 31.1MB in the beginning and 48.9MB in the end (delta: -17.8MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2022-02-20 16:46:22,456 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.57ms. Allocated memory is still 67.1MB. Free memory was 48.9MB in the beginning and 46.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:22,456 INFO L158 Benchmark]: Boogie Preprocessor took 49.53ms. Allocated memory is still 67.1MB. Free memory was 46.9MB in the beginning and 45.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:22,457 INFO L158 Benchmark]: RCFGBuilder took 700.18ms. Allocated memory is still 67.1MB. Free memory was 45.1MB in the beginning and 46.6MB in the end (delta: -1.5MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2022-02-20 16:46:22,457 INFO L158 Benchmark]: TraceAbstraction took 10943.29ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 46.0MB in the beginning and 52.5MB in the end (delta: -6.5MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:22,457 INFO L158 Benchmark]: Witness Printer took 39.12ms. Allocated memory is still 81.8MB. Free memory was 52.5MB in the beginning and 49.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:22,459 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.16ms. Allocated memory is still 54.5MB. Free memory was 36.0MB in the beginning and 35.9MB in the end (delta: 60.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.93ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 31.1MB in the beginning and 48.9MB in the end (delta: -17.8MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.57ms. Allocated memory is still 67.1MB. Free memory was 48.9MB in the beginning and 46.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.53ms. Allocated memory is still 67.1MB. Free memory was 46.9MB in the beginning and 45.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 700.18ms. Allocated memory is still 67.1MB. Free memory was 45.1MB in the beginning and 46.6MB in the end (delta: -1.5MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * TraceAbstraction took 10943.29ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 46.0MB in the beginning and 52.5MB in the end (delta: -6.5MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. * Witness Printer took 39.12ms. Allocated memory is still 81.8MB. Free memory was 52.5MB in the beginning and 49.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 82]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.9s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 96 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 96 mSDsluCounter, 453 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 50 IncrementalHoareTripleChecker+Unchecked, 271 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 66 IncrementalHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 182 mSDtfsCounter, 66 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 10 NumberOfFragments, 232 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 85 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 111 ConstructedInterpolants, 32 QuantifiedInterpolants, 1335 SizeOfPredicates, 50 NumberOfNonLiveVariables, 418 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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: 70]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 58]: Loop Invariant [2022-02-20 16:46:22,481 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:22,482 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:22,482 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,482 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,482 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,482 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:22,482 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:22,483 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:22,483 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,483 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,483 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,483 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:22,484 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:22,484 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:22,484 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,484 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,484 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,485 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:22,485 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:22,485 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~0#1,QUANTIFIED] [2022-02-20 16:46:22,485 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,485 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,485 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:22,485 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((\exists ULTIMATE.start___signbit_float_~w~0#1 : bv32 :: ((\result == 0bv32 && ~bvand32(ULTIMATE.start___signbit_float_~w~0#1, 2147483648bv32) == 0bv32) || (!(~bvand32(ULTIMATE.start___signbit_float_~w~0#1, 2147483648bv32) == 0bv32) && \result == 1bv32)) && (\exists v_arrayElimCell_4 : bv32 :: ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_arrayElimCell_4[31:31], v_arrayElimCell_4[30:23], v_arrayElimCell_4[22:0]) && ~fp~LONGDOUBLE(ULTIMATE.start___signbit_float_~w~0#1[31:31], ULTIMATE.start___signbit_float_~w~0#1[30:23], ULTIMATE.start___signbit_float_~w~0#1[22:0]) == ~fp~LONGDOUBLE(v_arrayElimCell_4[31:31], v_arrayElimCell_4[30:23], v_arrayElimCell_4[22:0]))) && x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && huge_floor == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E30))) && aux-res == -0.0f && __signbit_float(res) == 1-aux) && \result == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 18]: Loop Invariant [2022-02-20 16:46:22,486 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:22,486 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && huge_floor == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E30))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 61]: Loop Invariant [2022-02-20 16:46:22,487 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-02-20 16:46:22,487 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-02-20 16:46:22,487 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-02-20 16:46:22,487 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-02-20 16:46:22,488 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-02-20 16:46:22,488 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-02-20 16:46:22,488 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-02-20 16:46:22,488 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-02-20 16:46:22,488 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:22,489 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-02-20 16:46:22,489 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-02-20 16:46:22,489 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-02-20 16:46:22,489 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-02-20 16:46:22,489 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-02-20 16:46:22,490 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-02-20 16:46:22,490 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-02-20 16:46:22,490 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-02-20 16:46:22,490 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((\exists v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11 : bv32, v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17 : bv32 :: (x == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11][0bv32][22:0]) && unknown-#memory_int-unknown[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17][0bv32] == unknown-#memory_int-unknown[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11][0bv32]) && ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17][0bv32][22:0])) && x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && huge_floor == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E30))) && aux-res == -0.0f && __signbit_float(res) == 1-aux) && \result == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 15]: Loop Invariant [2022-02-20 16:46:22,491 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-02-20 16:46:22,491 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-02-20 16:46:22,491 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-02-20 16:46:22,491 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-02-20 16:46:22,492 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-02-20 16:46:22,492 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-02-20 16:46:22,492 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-02-20 16:46:22,492 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-02-20 16:46:22,492 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:22,493 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-02-20 16:46:22,493 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-02-20 16:46:22,493 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-02-20 16:46:22,493 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-02-20 16:46:22,493 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-02-20 16:46:22,493 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-02-20 16:46:22,494 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-02-20 16:46:22,494 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-02-20 16:46:22,494 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && huge_floor == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E30))) && (\exists v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11 : bv32, v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17 : bv32 :: (unknown-#memory_int-unknown[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17][0bv32] == unknown-#memory_int-unknown[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11][0bv32] && ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_floor_float_~#gf_u~0#1.base_17][0bv32][22:0])) && \result == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_floor_float_~#sf_u~0#1.base_11][0bv32][22:0]))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven RESULT: Ultimate proved your program to be correct! [2022-02-20 16:46:22,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE