./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1032d.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_1032d.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 5463c0227f502c4f65ae7bbf2b837d9391dfb26d5bc0061bf2040d731aef09b4 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:03,195 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:03,196 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:03,257 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:03,257 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:03,260 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:03,261 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:03,263 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:03,264 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:03,268 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:03,269 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:03,270 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:03,270 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:03,272 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:03,273 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:03,276 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:03,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:03,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:03,279 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:03,283 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:03,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:03,284 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:03,286 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:03,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:03,289 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:03,289 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:03,289 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:03,290 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:03,291 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:03,291 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:03,292 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:03,292 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:03,293 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:03,294 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:03,295 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:03,295 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:03,296 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:03,296 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:03,296 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:03,296 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:03,297 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:03,297 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:03,325 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:03,325 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:03,325 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:03,326 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:03,326 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:03,326 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:03,327 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:03,327 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:03,327 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:03,327 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:03,328 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:03,328 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:46:03,328 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:03,328 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:03,328 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:03,329 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:03,329 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:03,329 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:03,329 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:03,329 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:03,329 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:03,329 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:03,330 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:03,330 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:03,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:03,330 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:03,330 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:03,330 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:03,330 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:46:03,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:46:03,331 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:03,331 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:03,331 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:03,331 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 -> 5463c0227f502c4f65ae7bbf2b837d9391dfb26d5bc0061bf2040d731aef09b4 [2022-02-20 16:46:03,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:03,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:03,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:03,533 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:03,533 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:03,534 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1032d.c [2022-02-20 16:46:03,630 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76d7e7061/8b15221876b048edb1bfd34eac89e8d0/FLAG9a9d183d9 [2022-02-20 16:46:03,992 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:03,992 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1032d.c [2022-02-20 16:46:04,000 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76d7e7061/8b15221876b048edb1bfd34eac89e8d0/FLAG9a9d183d9 [2022-02-20 16:46:04,012 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76d7e7061/8b15221876b048edb1bfd34eac89e8d0 [2022-02-20 16:46:04,014 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:04,017 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:04,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:04,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:04,021 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:04,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:04" (1/1) ... [2022-02-20 16:46:04,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@409836c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:04, skipping insertion in model container [2022-02-20 16:46:04,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:04" (1/1) ... [2022-02-20 16:46:04,027 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:04,038 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:04,185 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_1032d.c[1744,1757] [2022-02-20 16:46:04,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:04,192 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:04,208 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_1032d.c[1744,1757] [2022-02-20 16:46:04,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:04,223 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:04,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:04 WrapperNode [2022-02-20 16:46:04,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:04,224 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:04,224 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:04,224 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:04,229 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:04" (1/1) ... [2022-02-20 16:46:04,235 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:04" (1/1) ... [2022-02-20 16:46:04,270 INFO L137 Inliner]: procedures = 16, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 84 [2022-02-20 16:46:04,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:04,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:04,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:04,273 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:04,277 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:04" (1/1) ... [2022-02-20 16:46:04,278 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:04" (1/1) ... [2022-02-20 16:46:04,281 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:04" (1/1) ... [2022-02-20 16:46:04,281 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:04" (1/1) ... [2022-02-20 16:46:04,290 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:04" (1/1) ... [2022-02-20 16:46:04,302 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:04" (1/1) ... [2022-02-20 16:46:04,303 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:04" (1/1) ... [2022-02-20 16:46:04,305 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:04,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:04,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:04,306 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:04,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:04" (1/1) ... [2022-02-20 16:46:04,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:04,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:04,338 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:04,356 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:04,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:04,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:46:04,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:04,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:46:04,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:46:04,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:46:04,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:04,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:04,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:46:04,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:04,413 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:04,414 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:04,572 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:04,576 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:04,577 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 16:46:04,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:04 BoogieIcfgContainer [2022-02-20 16:46:04,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:04,579 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:04,579 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:04,581 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:04,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:04" (1/3) ... [2022-02-20 16:46:04,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@377946da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:04, skipping insertion in model container [2022-02-20 16:46:04,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:04" (2/3) ... [2022-02-20 16:46:04,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@377946da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:04, skipping insertion in model container [2022-02-20 16:46:04,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:04" (3/3) ... [2022-02-20 16:46:04,583 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1032d.c [2022-02-20 16:46:04,586 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:04,586 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:04,614 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:04,618 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:04,618 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:04,628 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:46:04,631 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:04,632 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:04,632 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:04,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:04,635 INFO L85 PathProgramCache]: Analyzing trace with hash -592327338, now seen corresponding path program 1 times [2022-02-20 16:46:04,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:04,645 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642336629] [2022-02-20 16:46:04,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:04,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:04,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#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); {27#true} is VALID [2022-02-20 16:46:04,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0);assume { :begin_inline_round_float } true;round_float_#in~x#1 := main_~x~0#1;havoc round_float_#res#1;havoc round_float_#t~mem4#1, round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, round_float_~exponent_mask~0#1, round_float_#t~mem5#1, round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset, round_float_~x#1, round_float_~w~0#1, round_float_~exponent_less_127~0#1;round_float_~x#1 := round_float_#in~x#1;havoc round_float_~w~0#1;havoc round_float_~exponent_less_127~0#1; {27#true} is VALID [2022-02-20 16:46:04,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-02-20 16:46:04,748 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#false} round_float_~exponent_less_127~0#1 := (if (if 0 == round_float_~w~0#1 then 0 else (if 1 == round_float_~w~0#1 then 0 else ~bitwiseAnd(round_float_~w~0#1, 2139095040))) / 8388608 % 4294967296 % 4294967296 <= 2147483647 then (if 0 == round_float_~w~0#1 then 0 else (if 1 == round_float_~w~0#1 then 0 else ~bitwiseAnd(round_float_~w~0#1, 2139095040))) / 8388608 % 4294967296 % 4294967296 else (if 0 == round_float_~w~0#1 then 0 else (if 1 == round_float_~w~0#1 then 0 else ~bitwiseAnd(round_float_~w~0#1, 2139095040))) / 8388608 % 4294967296 % 4294967296 - 4294967296) - 127; {28#false} is VALID [2022-02-20 16:46:04,749 INFO L290 TraceCheckUtils]: 4: Hoare triple {28#false} assume !(round_float_~exponent_less_127~0#1 < 23); {28#false} is VALID [2022-02-20 16:46:04,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#false} assume 128 == round_float_~exponent_less_127~0#1;round_float_#res#1 := ~someBinaryArithmeticFLOAToperation(round_float_~x#1, round_float_~x#1); {28#false} is VALID [2022-02-20 16:46:04,749 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#false} main_#t~ret7#1 := round_float_#res#1;assume { :end_inline_round_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_~res~0#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem6#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, isinf_float_~x#1, isinf_float_~ix~0#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~0#1; {28#false} is VALID [2022-02-20 16:46:04,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#false} assume !true; {28#false} is VALID [2022-02-20 16:46:04,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#false} isinf_float_~ix~0#1 := (if 0 == isinf_float_~ix~0#1 then 0 else (if 1 == isinf_float_~ix~0#1 then 1 else ~bitwiseAnd(isinf_float_~ix~0#1, 2147483647)));isinf_float_#res#1 := (if 2139095040 == isinf_float_~ix~0#1 then 1 else 0); {28#false} is VALID [2022-02-20 16:46:04,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} main_#t~ret8#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647; {28#false} is VALID [2022-02-20 16:46:04,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} assume 0 == main_#t~ret8#1;havoc main_#t~ret8#1; {28#false} is VALID [2022-02-20 16:46:04,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-02-20 16:46:04,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:46:04,751 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:04,751 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642336629] [2022-02-20 16:46:04,752 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642336629] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:04,752 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:04,752 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:04,753 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332433340] [2022-02-20 16:46:04,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:04,757 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:46:04,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:04,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:04,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:04,773 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:04,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:04,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:04,796 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:04,838 INFO L93 Difference]: Finished difference Result 46 states and 68 transitions. [2022-02-20 16:46:04,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:04,839 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:46:04,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:04,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2022-02-20 16:46:04,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2022-02-20 16:46:04,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 68 transitions. [2022-02-20 16:46:04,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:04,940 INFO L225 Difference]: With dead ends: 46 [2022-02-20 16:46:04,940 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 16:46:04,942 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:04,947 INFO L933 BasicCegarLoop]: 28 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, 28 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:04,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 28 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:04,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 16:46:04,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 16:46:04,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:04,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 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:04,970 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 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:04,970 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 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:04,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:04,973 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-02-20 16:46:04,973 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-20 16:46:04,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:04,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:04,974 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 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 21 states. [2022-02-20 16:46:04,975 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 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 21 states. [2022-02-20 16:46:04,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:04,977 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-02-20 16:46:04,977 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-20 16:46:04,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:04,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:04,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:04,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:04,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 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:04,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-02-20 16:46:04,981 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 12 [2022-02-20 16:46:04,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:04,981 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-02-20 16:46:04,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,982 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-20 16:46:04,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:46:04,983 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:04,984 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:04,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:46:04,985 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:04,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:04,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1651159701, now seen corresponding path program 1 times [2022-02-20 16:46:04,989 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:04,989 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763904050] [2022-02-20 16:46:04,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:04,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:05,101 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:46:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:05,161 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:46:05,164 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:46:05,165 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:05,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:46:05,169 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:46:05,170 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:05,194 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:05,195 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:05,195 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-02-20 16:46:05,195 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-02-20 16:46:05,195 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-20 16:46:05,196 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-20 16:46:05,196 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2022-02-20 16:46:05,196 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:46:05,196 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:46:05,196 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:05,196 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:05,196 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:05,196 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:05,196 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 16:46:05,196 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 16:46:05,197 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 16:46:05,197 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 16:46:05,197 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-02-20 16:46:05,197 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-02-20 16:46:05,197 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-02-20 16:46:05,197 WARN L170 areAnnotationChecker]: L59-2 has no Hoare annotation [2022-02-20 16:46:05,197 WARN L170 areAnnotationChecker]: L59-2 has no Hoare annotation [2022-02-20 16:46:05,197 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:05,197 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:05,197 WARN L170 areAnnotationChecker]: L48-2 has no Hoare annotation [2022-02-20 16:46:05,197 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2022-02-20 16:46:05,198 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2022-02-20 16:46:05,198 WARN L170 areAnnotationChecker]: L59-3 has no Hoare annotation [2022-02-20 16:46:05,198 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-02-20 16:46:05,198 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-02-20 16:46:05,198 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-02-20 16:46:05,198 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:46:05,198 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:46:05,198 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-02-20 16:46:05,199 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:05,199 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:05,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:05 BoogieIcfgContainer [2022-02-20 16:46:05,199 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:05,200 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:05,200 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:05,200 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:05,201 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:04" (3/4) ... [2022-02-20 16:46:05,202 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:46:05,203 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:05,204 INFO L158 Benchmark]: Toolchain (without parser) took 1186.18ms. Allocated memory is still 107.0MB. Free memory was 68.1MB in the beginning and 60.2MB in the end (delta: 7.9MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2022-02-20 16:46:05,204 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 107.0MB. Free memory was 84.9MB in the beginning and 84.8MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:05,205 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.40ms. Allocated memory is still 107.0MB. Free memory was 67.9MB in the beginning and 80.9MB in the end (delta: -13.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 16:46:05,207 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.55ms. Allocated memory is still 107.0MB. Free memory was 80.9MB in the beginning and 78.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:05,209 INFO L158 Benchmark]: Boogie Preprocessor took 32.76ms. Allocated memory is still 107.0MB. Free memory was 78.8MB in the beginning and 77.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:05,209 INFO L158 Benchmark]: RCFGBuilder took 272.45ms. Allocated memory is still 107.0MB. Free memory was 77.1MB in the beginning and 62.1MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 16:46:05,210 INFO L158 Benchmark]: TraceAbstraction took 620.36ms. Allocated memory is still 107.0MB. Free memory was 61.7MB in the beginning and 60.7MB in the end (delta: 957.8kB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2022-02-20 16:46:05,210 INFO L158 Benchmark]: Witness Printer took 2.52ms. Allocated memory is still 107.0MB. Free memory was 60.7MB in the beginning and 60.2MB in the end (delta: 544.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:05,215 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 107.0MB. Free memory was 84.9MB in the beginning and 84.8MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.40ms. Allocated memory is still 107.0MB. Free memory was 67.9MB in the beginning and 80.9MB in the end (delta: -13.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.55ms. Allocated memory is still 107.0MB. Free memory was 80.9MB in the beginning and 78.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.76ms. Allocated memory is still 107.0MB. Free memory was 78.8MB in the beginning and 77.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 272.45ms. Allocated memory is still 107.0MB. Free memory was 77.1MB in the beginning and 62.1MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 620.36ms. Allocated memory is still 107.0MB. Free memory was 61.7MB in the beginning and 60.7MB in the end (delta: 957.8kB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. * Witness Printer took 2.52ms. Allocated memory is still 107.0MB. Free memory was 60.7MB in the beginning and 60.2MB in the end (delta: 544.7kB). 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: 80]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticFLOAToperation at line 44, overapproximation of bitwiseAnd at line 64. Possible FailurePath: [L75] float x = -1.0f / 0.0f; [L76] CALL, EXPR round_float(x) [L14] __uint32_t w; [L16] int exponent_less_127; VAL [\old(x)=4294967297, x=4294967297] [L19] ieee_float_shape_type gf_u; [L20] gf_u.value = (x) [L21] EXPR gf_u.word [L21] (w) = gf_u.word [L24] exponent_less_127 = (int)((w & 0x7f800000) >> 23) - 127 VAL [\old(x)=4294967297, exponent_less_127=128, w=0, x=4294967297] [L26] COND FALSE !(exponent_less_127 < 23) VAL [\old(x)=4294967297, exponent_less_127=128, w=0, x=4294967297] [L42] COND TRUE exponent_less_127 == 128 [L44] return x + x; VAL [\old(x)=4294967297, exponent_less_127=128, w=0, x=4294967297] [L76] RET, EXPR round_float(x) [L76] float res = round_float(x); [L79] CALL, EXPR isinf_float(res) [L58] __int32_t ix; VAL [\old(x)=4294967298, x=4294967298] [L60] ieee_float_shape_type gf_u; [L61] gf_u.value = (x) [L62] EXPR gf_u.word [L62] (ix) = gf_u.word [L64] ix &= 0x7fffffff [L65] return ((ix) == 0x7f800000L); VAL [\old(x)=4294967298, \result=0, ix=0, x=4294967298] [L79] RET, EXPR isinf_float(res) [L79] COND TRUE !isinf_float(res) [L80] reach_error() VAL [res=4294967298, x=4294967297] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 28 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, 28 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=24occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 11 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:05,243 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 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_1032d.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 5463c0227f502c4f65ae7bbf2b837d9391dfb26d5bc0061bf2040d731aef09b4 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:07,046 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:07,047 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:07,070 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:07,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:07,073 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:07,075 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:07,079 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:07,081 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:07,085 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:07,085 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:07,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:07,087 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:07,089 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:07,090 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:07,092 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:07,093 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:07,093 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:07,097 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:07,101 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:07,102 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:07,103 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:07,104 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:07,105 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:07,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:07,110 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:07,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:07,111 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:07,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:07,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:07,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:07,113 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:07,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:07,115 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:07,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:07,116 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:07,116 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:07,116 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:07,117 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:07,119 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:07,119 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:07,120 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:07,145 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:07,147 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:07,148 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:07,148 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:07,149 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:07,149 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:07,149 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:07,150 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:07,150 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:07,150 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:07,151 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:07,151 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:07,151 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:07,151 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:07,151 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:07,151 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:07,152 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:46:07,152 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:46:07,152 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:46:07,152 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:07,152 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:07,152 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:07,152 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:07,153 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:07,153 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:07,153 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:07,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:07,153 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:07,153 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:07,153 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:07,154 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:46:07,154 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:46:07,154 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:07,154 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:07,154 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:07,154 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:46:07,155 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 -> 5463c0227f502c4f65ae7bbf2b837d9391dfb26d5bc0061bf2040d731aef09b4 [2022-02-20 16:46:07,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:07,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:07,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:07,433 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:07,434 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:07,435 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1032d.c [2022-02-20 16:46:07,480 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/384c2da8c/d90c312f338f4d00a61998a4761da34b/FLAG2d16e1bf9 [2022-02-20 16:46:07,801 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:07,801 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1032d.c [2022-02-20 16:46:07,811 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/384c2da8c/d90c312f338f4d00a61998a4761da34b/FLAG2d16e1bf9 [2022-02-20 16:46:08,231 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/384c2da8c/d90c312f338f4d00a61998a4761da34b [2022-02-20 16:46:08,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:08,234 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:08,237 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:08,237 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:08,240 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:08,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:08" (1/1) ... [2022-02-20 16:46:08,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab79c1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:08, skipping insertion in model container [2022-02-20 16:46:08,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:08" (1/1) ... [2022-02-20 16:46:08,247 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:08,259 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:08,362 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_1032d.c[1744,1757] [2022-02-20 16:46:08,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:08,373 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:08,405 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_1032d.c[1744,1757] [2022-02-20 16:46:08,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:08,429 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:08,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:08 WrapperNode [2022-02-20 16:46:08,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:08,430 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:08,430 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:08,430 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:08,434 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:08" (1/1) ... [2022-02-20 16:46:08,440 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:08" (1/1) ... [2022-02-20 16:46:08,454 INFO L137 Inliner]: procedures = 19, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 84 [2022-02-20 16:46:08,455 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:08,455 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:08,455 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:08,456 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:08,460 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:08" (1/1) ... [2022-02-20 16:46:08,461 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:08" (1/1) ... [2022-02-20 16:46:08,463 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:08" (1/1) ... [2022-02-20 16:46:08,463 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:08" (1/1) ... [2022-02-20 16:46:08,469 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:08" (1/1) ... [2022-02-20 16:46:08,472 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:08" (1/1) ... [2022-02-20 16:46:08,473 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:08" (1/1) ... [2022-02-20 16:46:08,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:08,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:08,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:08,476 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:08,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:08" (1/1) ... [2022-02-20 16:46:08,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:08,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:08,518 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:08,557 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:08,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:08,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:46:08,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:08,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:46:08,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:46:08,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:08,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:46:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:46:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:08,639 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:08,641 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:08,859 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:08,864 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:08,864 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 16:46:08,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:08 BoogieIcfgContainer [2022-02-20 16:46:08,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:08,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:08,867 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:08,868 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:08,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:08" (1/3) ... [2022-02-20 16:46:08,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74679f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:08, skipping insertion in model container [2022-02-20 16:46:08,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:08" (2/3) ... [2022-02-20 16:46:08,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74679f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:08, skipping insertion in model container [2022-02-20 16:46:08,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:08" (3/3) ... [2022-02-20 16:46:08,871 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1032d.c [2022-02-20 16:46:08,874 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:08,874 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:08,914 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:08,921 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:08,922 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:08,932 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call 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:08,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:46:08,936 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:08,936 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:08,937 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:08,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:08,940 INFO L85 PathProgramCache]: Analyzing trace with hash -592327338, now seen corresponding path program 1 times [2022-02-20 16:46:08,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:08,949 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1653316068] [2022-02-20 16:46:08,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:08,950 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:08,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:08,991 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:09,028 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:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:09,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:46:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:09,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:09,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#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); {27#true} is VALID [2022-02-20 16:46:09,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());assume { :begin_inline_round_float } true;round_float_#in~x#1 := main_~x~0#1;havoc round_float_#res#1;havoc round_float_#t~mem4#1, round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, round_float_~exponent_mask~0#1, round_float_#t~mem5#1, round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset, round_float_~x#1, round_float_~w~0#1, round_float_~exponent_less_127~0#1;round_float_~x#1 := round_float_#in~x#1;havoc round_float_~w~0#1;havoc round_float_~exponent_less_127~0#1; {27#true} is VALID [2022-02-20 16:46:09,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-02-20 16:46:09,200 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#false} round_float_~exponent_less_127~0#1 := ~bvsub32(~bvlshr32(~bvand32(2139095040bv32, round_float_~w~0#1), 23bv32), 127bv32); {28#false} is VALID [2022-02-20 16:46:09,200 INFO L290 TraceCheckUtils]: 4: Hoare triple {28#false} assume !~bvslt32(round_float_~exponent_less_127~0#1, 23bv32); {28#false} is VALID [2022-02-20 16:46:09,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#false} assume 128bv32 == round_float_~exponent_less_127~0#1;round_float_#res#1 := ~fp.add~FLOAT(currentRoundingMode, round_float_~x#1, round_float_~x#1); {28#false} is VALID [2022-02-20 16:46:09,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#false} main_#t~ret7#1 := round_float_#res#1;assume { :end_inline_round_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_~res~0#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem6#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, isinf_float_~x#1, isinf_float_~ix~0#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~0#1; {28#false} is VALID [2022-02-20 16:46:09,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#false} assume !true; {28#false} is VALID [2022-02-20 16:46:09,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#false} isinf_float_~ix~0#1 := ~bvand32(2147483647bv32, isinf_float_~ix~0#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~0#1 then 1bv32 else 0bv32); {28#false} is VALID [2022-02-20 16:46:09,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} main_#t~ret8#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true; {28#false} is VALID [2022-02-20 16:46:09,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} assume 0bv32 == main_#t~ret8#1;havoc main_#t~ret8#1; {28#false} is VALID [2022-02-20 16:46:09,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-02-20 16:46:09,203 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:09,203 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:09,203 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:09,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1653316068] [2022-02-20 16:46:09,204 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1653316068] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:09,204 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:09,204 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:09,206 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117384854] [2022-02-20 16:46:09,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:09,216 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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:09,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:09,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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:09,247 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:09,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:09,248 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:09,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:09,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:09,266 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 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 6.0) internal successors, (12), 2 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:09,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:09,326 INFO L93 Difference]: Finished difference Result 46 states and 68 transitions. [2022-02-20 16:46:09,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:09,326 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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:09,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:09,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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:09,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2022-02-20 16:46:09,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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:09,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2022-02-20 16:46:09,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 68 transitions. [2022-02-20 16:46:09,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:09,405 INFO L225 Difference]: With dead ends: 46 [2022-02-20 16:46:09,406 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 16:46:09,408 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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:09,412 INFO L933 BasicCegarLoop]: 28 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, 28 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:09,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 28 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:09,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 16:46:09,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 16:46:09,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:09,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 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:09,430 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 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:09,431 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 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:09,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:09,433 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-02-20 16:46:09,433 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-20 16:46:09,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:09,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:09,434 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 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 21 states. [2022-02-20 16:46:09,435 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 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 21 states. [2022-02-20 16:46:09,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:09,437 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-02-20 16:46:09,437 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-20 16:46:09,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:09,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:09,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:09,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:09,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 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:09,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-02-20 16:46:09,441 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 12 [2022-02-20 16:46:09,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:09,442 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-02-20 16:46:09,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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:09,442 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-20 16:46:09,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:46:09,443 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:09,443 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:09,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 16:46:09,672 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:09,673 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:09,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:09,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1651159701, now seen corresponding path program 1 times [2022-02-20 16:46:09,679 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:09,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [804106836] [2022-02-20 16:46:09,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:09,681 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:09,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:09,682 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:09,684 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:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:09,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 16:46:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:09,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:10,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {187#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {192#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:46:10,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {192#(= 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_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());assume { :begin_inline_round_float } true;round_float_#in~x#1 := main_~x~0#1;havoc round_float_#res#1;havoc round_float_#t~mem4#1, round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, round_float_~exponent_mask~0#1, round_float_#t~mem5#1, round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset, round_float_~x#1, round_float_~w~0#1, round_float_~exponent_less_127~0#1;round_float_~x#1 := round_float_#in~x#1;havoc round_float_~w~0#1;havoc round_float_~exponent_less_127~0#1; {196#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_round_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:10,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_round_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} call round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(round_float_~x#1, round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, 4bv32);call round_float_#t~mem4#1 := read~intINTTYPE4(round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, 4bv32);round_float_~w~0#1 := round_float_#t~mem4#1;havoc round_float_#t~mem4#1;call ULTIMATE.dealloc(round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset);havoc round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset; {196#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_round_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:10,047 INFO L290 TraceCheckUtils]: 3: Hoare triple {196#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_round_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} goto; {196#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_round_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:10,048 INFO L290 TraceCheckUtils]: 4: Hoare triple {196#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_round_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} round_float_~exponent_less_127~0#1 := ~bvsub32(~bvlshr32(~bvand32(2139095040bv32, round_float_~w~0#1), 23bv32), 127bv32); {196#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_round_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:10,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {196#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_round_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} assume !~bvslt32(round_float_~exponent_less_127~0#1, 23bv32); {196#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_round_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:10,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {196#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_round_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} assume 128bv32 == round_float_~exponent_less_127~0#1;round_float_#res#1 := ~fp.add~FLOAT(currentRoundingMode, round_float_~x#1, round_float_~x#1); {212#(= (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) |ULTIMATE.start_round_float_#res#1|)} is VALID [2022-02-20 16:46:10,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {212#(= (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) |ULTIMATE.start_round_float_#res#1|)} main_#t~ret7#1 := round_float_#res#1;assume { :end_inline_round_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_~res~0#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem6#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, isinf_float_~x#1, isinf_float_~ix~0#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~0#1; {216#(= (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) |ULTIMATE.start_isinf_float_~x#1|)} is VALID [2022-02-20 16:46:10,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {216#(= (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) |ULTIMATE.start_isinf_float_~x#1|)} call isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isinf_float_~x#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, 4bv32);call isinf_float_#t~mem6#1 := read~intINTTYPE4(isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, 4bv32);isinf_float_~ix~0#1 := isinf_float_#t~mem6#1;havoc isinf_float_#t~mem6#1;call ULTIMATE.dealloc(isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset);havoc isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset; {220#(= (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~0#1|)))} is VALID [2022-02-20 16:46:10,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {220#(= (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~0#1|)))} goto; {220#(= (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~0#1|)))} is VALID [2022-02-20 16:46:10,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {220#(= (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~0#1|)))} isinf_float_~ix~0#1 := ~bvand32(2147483647bv32, isinf_float_~ix~0#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~0#1 then 1bv32 else 0bv32); {227#(= |ULTIMATE.start_isinf_float_#res#1| (_ bv1 32))} is VALID [2022-02-20 16:46:10,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {227#(= |ULTIMATE.start_isinf_float_#res#1| (_ bv1 32))} main_#t~ret8#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true; {231#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret8#1|)} is VALID [2022-02-20 16:46:10,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {231#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret8#1|)} assume 0bv32 == main_#t~ret8#1;havoc main_#t~ret8#1; {188#false} is VALID [2022-02-20 16:46:10,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {188#false} assume !false; {188#false} is VALID [2022-02-20 16:46:10,054 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:10,054 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:10,054 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:10,054 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [804106836] [2022-02-20 16:46:10,055 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [804106836] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:10,055 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:10,055 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 16:46:10,055 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705869426] [2022-02-20 16:46:10,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:10,056 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:46:10,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:10,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:10,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:10,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 16:46:10,093 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:10,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 16:46:10,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:46:10,094 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:10,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:10,445 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-02-20 16:46:10,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 16:46:10,446 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:46:10,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:10,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:10,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-02-20 16:46:10,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:10,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-02-20 16:46:10,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 32 transitions. [2022-02-20 16:46:10,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:10,492 INFO L225 Difference]: With dead ends: 29 [2022-02-20 16:46:10,492 INFO L226 Difference]: Without dead ends: 20 [2022-02-20 16:46:10,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-02-20 16:46:10,493 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 49 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:10,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 107 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:46:10,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-02-20 16:46:10,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-20 16:46:10,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:10,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:10,496 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:10,496 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:10,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:10,497 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-02-20 16:46:10,497 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-02-20 16:46:10,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:10,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:10,498 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states. [2022-02-20 16:46:10,499 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states. [2022-02-20 16:46:10,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:10,500 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-02-20 16:46:10,500 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-02-20 16:46:10,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:10,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:10,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:10,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:10,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:10,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-02-20 16:46:10,502 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2022-02-20 16:46:10,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:10,502 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-02-20 16:46:10,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:10,503 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-02-20 16:46:10,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 16:46:10,503 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:10,503 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:10,514 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:10,712 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:10,712 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:10,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:10,712 INFO L85 PathProgramCache]: Analyzing trace with hash 842294842, now seen corresponding path program 1 times [2022-02-20 16:46:10,713 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:10,713 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197433986] [2022-02-20 16:46:10,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:10,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:10,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:10,716 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:10,718 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:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:10,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:46:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:10,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:10,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {347#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); {347#true} is VALID [2022-02-20 16:46:10,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {347#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());assume { :begin_inline_round_float } true;round_float_#in~x#1 := main_~x~0#1;havoc round_float_#res#1;havoc round_float_#t~mem4#1, round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, round_float_~exponent_mask~0#1, round_float_#t~mem5#1, round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset, round_float_~x#1, round_float_~w~0#1, round_float_~exponent_less_127~0#1;round_float_~x#1 := round_float_#in~x#1;havoc round_float_~w~0#1;havoc round_float_~exponent_less_127~0#1; {355#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_round_float_~x#1|))} is VALID [2022-02-20 16:46:10,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {355#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_round_float_~x#1|))} call round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(round_float_~x#1, round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, 4bv32);call round_float_#t~mem4#1 := read~intINTTYPE4(round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, 4bv32);round_float_~w~0#1 := round_float_#t~mem4#1;havoc round_float_#t~mem4#1;call ULTIMATE.dealloc(round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset);havoc round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset; {359#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|))))} is VALID [2022-02-20 16:46:10,923 INFO L290 TraceCheckUtils]: 3: Hoare triple {359#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|))))} goto; {359#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|))))} is VALID [2022-02-20 16:46:10,926 INFO L290 TraceCheckUtils]: 4: Hoare triple {359#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|))))} round_float_~exponent_less_127~0#1 := ~bvsub32(~bvlshr32(~bvand32(2139095040bv32, round_float_~w~0#1), 23bv32), 127bv32); {366#(exists ((|ULTIMATE.start_round_float_~w~0#1| (_ BitVec 32))) (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)))) (= (bvadd (_ bv4294967169 32) (bvlshr (bvand |ULTIMATE.start_round_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32))) |ULTIMATE.start_round_float_~exponent_less_127~0#1|)))} is VALID [2022-02-20 16:46:10,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {366#(exists ((|ULTIMATE.start_round_float_~w~0#1| (_ BitVec 32))) (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)))) (= (bvadd (_ bv4294967169 32) (bvlshr (bvand |ULTIMATE.start_round_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32))) |ULTIMATE.start_round_float_~exponent_less_127~0#1|)))} assume ~bvslt32(round_float_~exponent_less_127~0#1, 23bv32); {348#false} is VALID [2022-02-20 16:46:10,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {348#false} assume ~bvslt32(round_float_~exponent_less_127~0#1, 0bv32);round_float_~w~0#1 := ~bvand32(2147483648bv32, round_float_~w~0#1); {348#false} is VALID [2022-02-20 16:46:10,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {348#false} assume 4294967295bv32 == round_float_~exponent_less_127~0#1;round_float_~w~0#1 := ~bvor32(1065353216bv32, round_float_~w~0#1); {348#false} is VALID [2022-02-20 16:46:10,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {348#false} call round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(round_float_~w~0#1, round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset, 4bv32);call round_float_#t~mem5#1 := read~intFLOATTYPE4(round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset, 4bv32);round_float_~x#1 := round_float_#t~mem5#1;havoc round_float_#t~mem5#1;call ULTIMATE.dealloc(round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset);havoc round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset; {348#false} is VALID [2022-02-20 16:46:10,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {348#false} goto; {348#false} is VALID [2022-02-20 16:46:10,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {348#false} round_float_#res#1 := round_float_~x#1; {348#false} is VALID [2022-02-20 16:46:10,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {348#false} main_#t~ret7#1 := round_float_#res#1;assume { :end_inline_round_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_~res~0#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem6#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, isinf_float_~x#1, isinf_float_~ix~0#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~0#1; {348#false} is VALID [2022-02-20 16:46:10,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {348#false} call isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isinf_float_~x#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, 4bv32);call isinf_float_#t~mem6#1 := read~intINTTYPE4(isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, 4bv32);isinf_float_~ix~0#1 := isinf_float_#t~mem6#1;havoc isinf_float_#t~mem6#1;call ULTIMATE.dealloc(isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset);havoc isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset; {348#false} is VALID [2022-02-20 16:46:10,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {348#false} goto; {348#false} is VALID [2022-02-20 16:46:10,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {348#false} isinf_float_~ix~0#1 := ~bvand32(2147483647bv32, isinf_float_~ix~0#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~0#1 then 1bv32 else 0bv32); {348#false} is VALID [2022-02-20 16:46:10,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {348#false} main_#t~ret8#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true; {348#false} is VALID [2022-02-20 16:46:10,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {348#false} assume 0bv32 == main_#t~ret8#1;havoc main_#t~ret8#1; {348#false} is VALID [2022-02-20 16:46:10,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {348#false} assume !false; {348#false} is VALID [2022-02-20 16:46:10,931 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:10,931 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:10,931 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:10,931 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197433986] [2022-02-20 16:46:10,931 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197433986] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:10,932 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:10,932 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:10,932 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495329883] [2022-02-20 16:46:10,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:10,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-02-20 16:46:10,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:10,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call 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:10,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:10,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:10,955 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:10,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:10,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:10,956 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call 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:10,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:10,973 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-02-20 16:46:10,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:46:10,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-02-20 16:46:10,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:10,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call 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:10,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-02-20 16:46:10,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call 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:10,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-02-20 16:46:10,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 21 transitions. [2022-02-20 16:46:10,998 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:10,998 INFO L225 Difference]: With dead ends: 20 [2022-02-20 16:46:10,998 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:46:10,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:11,000 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:11,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-02-20 16:46:11,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:46:11,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:46:11,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:11,001 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:11,001 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:11,001 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:11,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:11,001 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:11,002 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:11,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:11,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:11,002 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:11,002 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:11,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:11,002 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:11,002 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:11,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:11,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:11,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:11,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:11,003 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:11,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:46:11,003 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-02-20 16:46:11,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:11,003 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:46:11,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call 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,004 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:11,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:11,006 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:11,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-02-20 16:46:11,214 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:11,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:46:11,263 INFO L858 garLoopResultBuilder]: For program point L27(lines 27 40) no Hoare annotation was computed. [2022-02-20 16:46:11,263 INFO L858 garLoopResultBuilder]: For program point L48(lines 48 52) no Hoare annotation was computed. [2022-02-20 16:46:11,263 INFO L858 garLoopResultBuilder]: For program point L48-1(lines 13 54) no Hoare annotation was computed. [2022-02-20 16:46:11,264 INFO L858 garLoopResultBuilder]: For program point L48-2(lines 48 52) no Hoare annotation was computed. [2022-02-20 16:46:11,264 INFO L854 garLoopResultBuilder]: At program point L65(lines 57 66) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_round_float_~x#1|) (= .cse0 |ULTIMATE.start_round_float_#res#1|) (= |ULTIMATE.start_isinf_float_#res#1| (_ bv1 32)) (= .cse0 |ULTIMATE.start_isinf_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))) [2022-02-20 16:46:11,264 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:46:11,264 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:46:11,264 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:46:11,264 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2022-02-20 16:46:11,264 INFO L854 garLoopResultBuilder]: At program point L53(lines 13 54) the Hoare annotation is: (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_round_float_~x#1|) (= (let ((.cse0 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))) (fp.add roundNearestTiesToEven .cse0 .cse0)) |ULTIMATE.start_round_float_#res#1|) (= currentRoundingMode roundNearestTiesToEven)) [2022-02-20 16:46:11,264 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:46:11,264 INFO L858 garLoopResultBuilder]: For program point L29(lines 29 31) no Hoare annotation was computed. [2022-02-20 16:46:11,264 INFO L858 garLoopResultBuilder]: For program point L79(lines 79 82) no Hoare annotation was computed. [2022-02-20 16:46:11,265 INFO L858 garLoopResultBuilder]: For program point L42(lines 42 46) no Hoare annotation was computed. [2022-02-20 16:46:11,265 INFO L858 garLoopResultBuilder]: For program point L34(lines 34 36) no Hoare annotation was computed. [2022-02-20 16:46:11,265 INFO L858 garLoopResultBuilder]: For program point L26(lines 26 47) no Hoare annotation was computed. [2022-02-20 16:46:11,265 INFO L858 garLoopResultBuilder]: For program point L59-1(lines 59 63) no Hoare annotation was computed. [2022-02-20 16:46:11,265 INFO L854 garLoopResultBuilder]: At program point L59-2(lines 59 63) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_round_float_~x#1|) (= .cse0 |ULTIMATE.start_round_float_#res#1|) (= .cse0 |ULTIMATE.start_isinf_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))) [2022-02-20 16:46:11,265 INFO L858 garLoopResultBuilder]: For program point L59-3(lines 59 63) no Hoare annotation was computed. [2022-02-20 16:46:11,265 INFO L861 garLoopResultBuilder]: At program point L84(lines 67 85) the Hoare annotation is: true [2022-02-20 16:46:11,265 INFO L858 garLoopResultBuilder]: For program point L18-1(lines 18 22) no Hoare annotation was computed. [2022-02-20 16:46:11,266 INFO L854 garLoopResultBuilder]: At program point L18-2(lines 18 22) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_round_float_~x#1|)) (= currentRoundingMode roundNearestTiesToEven)) [2022-02-20 16:46:11,266 INFO L858 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2022-02-20 16:46:11,266 INFO L858 garLoopResultBuilder]: For program point L18-3(lines 18 22) no Hoare annotation was computed. [2022-02-20 16:46:11,268 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:46:11,274 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:11,278 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:11,278 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:11,279 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-20 16:46:11,279 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2022-02-20 16:46:11,279 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-20 16:46:11,279 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-20 16:46:11,279 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2022-02-20 16:46:11,279 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:46:11,280 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:46:11,280 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:11,280 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:11,280 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:11,280 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:11,280 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 16:46:11,280 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 16:46:11,280 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 16:46:11,280 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 16:46:11,282 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-02-20 16:46:11,282 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-02-20 16:46:11,282 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2022-02-20 16:46:11,282 WARN L170 areAnnotationChecker]: L59-3 has no Hoare annotation [2022-02-20 16:46:11,289 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:11,290 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:11,290 WARN L170 areAnnotationChecker]: L48-2 has no Hoare annotation [2022-02-20 16:46:11,290 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2022-02-20 16:46:11,290 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2022-02-20 16:46:11,290 WARN L170 areAnnotationChecker]: L59-3 has no Hoare annotation [2022-02-20 16:46:11,290 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-02-20 16:46:11,290 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-02-20 16:46:11,290 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-02-20 16:46:11,290 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:46:11,290 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:46:11,291 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:11,291 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:11,291 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:46:11,294 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:11,295 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:11,295 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,297 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:11,297 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:11,297 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,298 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,298 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,298 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,298 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,298 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,299 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,299 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,299 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,299 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,299 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,299 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,300 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,300 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,300 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,300 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,300 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,301 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,301 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,301 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,301 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,301 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,301 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,302 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,302 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,302 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,302 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,302 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,303 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,303 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,303 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,303 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,304 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,304 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,304 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,304 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,305 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,305 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,305 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,305 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,305 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,305 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,305 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,305 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,306 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,306 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,306 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,306 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,306 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,307 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,307 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,307 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,307 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,307 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,307 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,307 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,307 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:11 BoogieIcfgContainer [2022-02-20 16:46:11,308 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:11,309 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:11,309 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:11,309 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:11,309 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:08" (3/4) ... [2022-02-20 16:46:11,311 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:46:11,317 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-02-20 16:46:11,318 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-02-20 16:46:11,318 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:46:11,318 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:46:11,333 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-02-20 16:46:11,334 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)), ~Pluszero~LONGDOUBLE()) == x && ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == \result) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-02-20 16:46:11,334 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)), ~Pluszero~LONGDOUBLE()) == x && ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == \result) && ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == x) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-02-20 16:46:11,334 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)), ~Pluszero~LONGDOUBLE()) == x && ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == \result) && \result == 1bv32) && ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == x) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-02-20 16:46:11,341 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:46:11,341 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:11,342 INFO L158 Benchmark]: Toolchain (without parser) took 3107.89ms. Allocated memory was 88.1MB in the beginning and 134.2MB in the end (delta: 46.1MB). Free memory was 64.7MB in the beginning and 106.5MB in the end (delta: -41.8MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. [2022-02-20 16:46:11,342 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 52.4MB. Free memory was 33.9MB in the beginning and 33.8MB in the end (delta: 32.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:11,343 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.79ms. Allocated memory is still 88.1MB. Free memory was 64.6MB in the beginning and 70.0MB in the end (delta: -5.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 16:46:11,343 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.77ms. Allocated memory is still 88.1MB. Free memory was 70.0MB in the beginning and 68.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:11,343 INFO L158 Benchmark]: Boogie Preprocessor took 20.02ms. Allocated memory is still 88.1MB. Free memory was 68.0MB in the beginning and 66.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:11,343 INFO L158 Benchmark]: RCFGBuilder took 389.57ms. Allocated memory is still 88.1MB. Free memory was 66.2MB in the beginning and 53.6MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 16:46:11,344 INFO L158 Benchmark]: TraceAbstraction took 2441.91ms. Allocated memory was 88.1MB in the beginning and 134.2MB in the end (delta: 46.1MB). Free memory was 53.2MB in the beginning and 109.7MB in the end (delta: -56.5MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. [2022-02-20 16:46:11,344 INFO L158 Benchmark]: Witness Printer took 32.79ms. Allocated memory is still 134.2MB. Free memory was 109.7MB in the beginning and 106.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:46:11,345 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 52.4MB. Free memory was 33.9MB in the beginning and 33.8MB in the end (delta: 32.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.79ms. Allocated memory is still 88.1MB. Free memory was 64.6MB in the beginning and 70.0MB in the end (delta: -5.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.77ms. Allocated memory is still 88.1MB. Free memory was 70.0MB in the beginning and 68.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.02ms. Allocated memory is still 88.1MB. Free memory was 68.0MB in the beginning and 66.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 389.57ms. Allocated memory is still 88.1MB. Free memory was 66.2MB in the beginning and 53.6MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2441.91ms. Allocated memory was 88.1MB in the beginning and 134.2MB in the end (delta: 46.1MB). Free memory was 53.2MB in the beginning and 109.7MB in the end (delta: -56.5MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. * Witness Printer took 32.79ms. Allocated memory is still 134.2MB. Free memory was 109.7MB in the beginning and 106.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 80]: 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, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 143 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4 IncrementalHoareTripleChecker+Unchecked, 96 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51 IncrementalHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 47 mSDtfsCounter, 51 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=0, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 10 NumberOfFragments, 147 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 9 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 41 ConstructedInterpolants, 4 QuantifiedInterpolants, 252 SizeOfPredicates, 18 NumberOfNonLiveVariables, 159 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 18]: Loop Invariant [2022-02-20 16:46:11,357 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:11,357 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:11,357 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,358 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:11,358 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:11,358 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 59]: Loop Invariant [2022-02-20 16:46:11,359 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,359 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,359 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,359 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,359 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,359 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,359 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,359 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,359 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,360 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,360 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,360 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,360 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,360 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,361 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,361 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,361 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,361 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,361 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,361 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,361 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,361 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)), ~Pluszero~LONGDOUBLE()) == x && ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == \result) && ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == x) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 13]: Loop Invariant [2022-02-20 16:46:11,362 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,362 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,362 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,362 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,362 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,363 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,363 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,363 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,363 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,363 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,363 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,364 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)), ~Pluszero~LONGDOUBLE()) == x && ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == \result) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 57]: Loop Invariant [2022-02-20 16:46:11,364 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,364 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,364 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,364 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,364 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,365 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,365 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,365 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,365 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,365 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,365 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,366 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,366 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,366 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,366 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,366 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,366 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,366 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,366 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,367 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,367 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,367 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)), ~Pluszero~LONGDOUBLE()) == x && ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == \result) && \result == 1bv32) && ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == x) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven RESULT: Ultimate proved your program to be correct! [2022-02-20 16:46:11,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE