./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_0683b.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_0683b.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 6672481a7838a56be1f1fe8bf2e494e3680a5c6a5ddaa173ab670073cd565312 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:41:47,298 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:41:47,299 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:41:47,326 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:41:47,326 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:41:47,327 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:41:47,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:41:47,332 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:41:47,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:41:47,334 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:41:47,335 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:41:47,336 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:41:47,337 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:41:47,339 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:41:47,340 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:41:47,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:41:47,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:41:47,345 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:41:47,346 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:41:47,352 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:41:47,356 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:41:47,357 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:41:47,358 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:41:47,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:41:47,360 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:41:47,363 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:41:47,363 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:41:47,364 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:41:47,365 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:41:47,365 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:41:47,366 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:41:47,366 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:41:47,367 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:41:47,368 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:41:47,369 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:41:47,369 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:41:47,370 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:41:47,370 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:41:47,370 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:41:47,371 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:41:47,371 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:41:47,372 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:41:47,390 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:41:47,392 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:41:47,393 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:41:47,393 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:41:47,393 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:41:47,394 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:41:47,394 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:41:47,394 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:41:47,395 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:41:47,395 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:41:47,395 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:41:47,396 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:41:47,396 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:41:47,396 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:41:47,396 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:41:47,396 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:41:47,396 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:41:47,396 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:41:47,397 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:41:47,397 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:41:47,397 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:41:47,397 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:41:47,397 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:41:47,397 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:41:47,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:41:47,398 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:41:47,398 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:41:47,398 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:41:47,398 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:41:47,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:41:47,398 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:41:47,399 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:41:47,399 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:41:47,399 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 -> 6672481a7838a56be1f1fe8bf2e494e3680a5c6a5ddaa173ab670073cd565312 [2022-02-20 16:41:47,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:41:47,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:41:47,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:41:47,601 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:41:47,602 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:41:47,603 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0683b.c [2022-02-20 16:41:47,676 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c12b54e77/bc0be9a8e2b14b41a57d6b1ed9bdb92f/FLAG10257d515 [2022-02-20 16:41:48,052 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:41:48,053 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0683b.c [2022-02-20 16:41:48,058 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c12b54e77/bc0be9a8e2b14b41a57d6b1ed9bdb92f/FLAG10257d515 [2022-02-20 16:41:48,067 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c12b54e77/bc0be9a8e2b14b41a57d6b1ed9bdb92f [2022-02-20 16:41:48,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:41:48,084 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:41:48,085 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:41:48,085 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:41:48,088 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:41:48,089 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:41:48" (1/1) ... [2022-02-20 16:41:48,090 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d878479 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:48, skipping insertion in model container [2022-02-20 16:41:48,090 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:41:48" (1/1) ... [2022-02-20 16:41:48,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:41:48,123 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:41:48,289 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_0683b.c[5824,5837] [2022-02-20 16:41:48,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:41:48,309 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:41:48,351 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_0683b.c[5824,5837] [2022-02-20 16:41:48,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:41:48,364 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:41:48,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:48 WrapperNode [2022-02-20 16:41:48,365 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:41:48,366 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:41:48,366 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:41:48,366 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:41:48,370 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:41:48" (1/1) ... [2022-02-20 16:41:48,379 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:41:48" (1/1) ... [2022-02-20 16:41:48,423 INFO L137 Inliner]: procedures = 21, calls = 89, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 298 [2022-02-20 16:41:48,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:41:48,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:41:48,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:41:48,430 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:41:48,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:48" (1/1) ... [2022-02-20 16:41:48,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:48" (1/1) ... [2022-02-20 16:41:48,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:48" (1/1) ... [2022-02-20 16:41:48,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:48" (1/1) ... [2022-02-20 16:41:48,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:48" (1/1) ... [2022-02-20 16:41:48,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:41:48" (1/1) ... [2022-02-20 16:41:48,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:48" (1/1) ... [2022-02-20 16:41:48,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:41:48,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:41:48,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:41:48,483 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:41:48,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:48" (1/1) ... [2022-02-20 16:41:48,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:41:48,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:41:48,523 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:41:48,524 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:41:48,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:41:48,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:41:48,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:41:48,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:41:48,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:41:48,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:41:48,556 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2022-02-20 16:41:48,559 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2022-02-20 16:41:48,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:41:48,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:41:48,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:41:48,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-02-20 16:41:48,560 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2022-02-20 16:41:48,560 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2022-02-20 16:41:48,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:41:48,749 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:41:48,764 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:41:49,209 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:41:49,215 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:41:49,215 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2022-02-20 16:41:49,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:41:49 BoogieIcfgContainer [2022-02-20 16:41:49,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:41:49,218 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:41:49,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:41:49,220 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:41:49,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:41:48" (1/3) ... [2022-02-20 16:41:49,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@225be941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:41:49, skipping insertion in model container [2022-02-20 16:41:49,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:48" (2/3) ... [2022-02-20 16:41:49,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@225be941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:41:49, skipping insertion in model container [2022-02-20 16:41:49,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:41:49" (3/3) ... [2022-02-20 16:41:49,222 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0683b.c [2022-02-20 16:41:49,225 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:41:49,225 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:41:49,254 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:41:49,259 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:41:49,259 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:41:49,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 106 states have (on average 1.7169811320754718) internal successors, (182), 107 states have internal predecessors, (182), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:41:49,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:41:49,277 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:41:49,277 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:41:49,278 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:41:49,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:41:49,281 INFO L85 PathProgramCache]: Analyzing trace with hash -56628681, now seen corresponding path program 1 times [2022-02-20 16:41:49,288 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:41:49,289 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152176705] [2022-02-20 16:41:49,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:41:49,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:41:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:41:49,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {117#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);~#atanhi_atan~0.base, ~#atanhi_atan~0.offset := 4, 0;call #Ultimate.allocInit(16, 4);call write~init~real(0.46364760399, ~#atanhi_atan~0.base, ~#atanhi_atan~0.offset, 4);call write~init~real(0.78539812565, ~#atanhi_atan~0.base, 4 + ~#atanhi_atan~0.offset, 4);call write~init~real(0.98279368877, ~#atanhi_atan~0.base, 8 + ~#atanhi_atan~0.offset, 4);call write~init~real(1.5707962513, ~#atanhi_atan~0.base, 12 + ~#atanhi_atan~0.offset, 4);~#atanlo_atan~0.base, ~#atanlo_atan~0.offset := 5, 0;call #Ultimate.allocInit(16, 5);call write~init~real(5.012158244E-9, ~#atanlo_atan~0.base, ~#atanlo_atan~0.offset, 4);call write~init~real(3.7748947079E-8, ~#atanlo_atan~0.base, 4 + ~#atanlo_atan~0.offset, 4);call write~init~real(3.447321717E-8, ~#atanlo_atan~0.base, 8 + ~#atanlo_atan~0.offset, 4);call write~init~real(7.5497894159E-8, ~#atanlo_atan~0.base, 12 + ~#atanlo_atan~0.offset, 4);~#aT_atan~0.base, ~#aT_atan~0.offset := 6, 0;call #Ultimate.allocInit(44, 6);call write~init~real(0.33333334327, ~#aT_atan~0.base, ~#aT_atan~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.20000000298), ~#aT_atan~0.base, 4 + ~#aT_atan~0.offset, 4);call write~init~real(0.14285714924, ~#aT_atan~0.base, 8 + ~#aT_atan~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.11111110449), ~#aT_atan~0.base, 12 + ~#aT_atan~0.offset, 4);call write~init~real(0.090908870101, ~#aT_atan~0.base, 16 + ~#aT_atan~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.076918758452), ~#aT_atan~0.base, 20 + ~#aT_atan~0.offset, 4);call write~init~real(0.066610731184, ~#aT_atan~0.base, 24 + ~#aT_atan~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.058335702866), ~#aT_atan~0.base, 28 + ~#aT_atan~0.offset, 4);call write~init~real(0.049768779427, ~#aT_atan~0.base, 32 + ~#aT_atan~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.036531571299), ~#aT_atan~0.base, 36 + ~#aT_atan~0.offset, 4);call write~init~real(0.016285819933, ~#aT_atan~0.base, 40 + ~#aT_atan~0.offset, 4);~one_atan~0 := 1.0;~huge_atan~0 := 1.0E30;~pi_o_4~0 := 0.78539818525;~pi_o_2~0 := 1.5707963705;~pi~0 := 3.141592741;~tiny_atan2~0 := 1.0E-30;~zero_atan2~0 := 0.0;~pi_lo_atan2~0 := ~someUnaryDOUBLEoperation(8.7422776573E-8); {117#true} is VALID [2022-02-20 16:41:49,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {117#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~short49#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0);main_~y~0#1 := main_#t~nondet45#1;havoc main_#t~nondet45#1;assume { :begin_inline_isfinite_float } true;isfinite_float_#in~x#1 := main_~y~0#1;havoc isfinite_float_#res#1;havoc isfinite_float_#t~mem44#1, isfinite_float_~#gf_u~6#1.base, isfinite_float_~#gf_u~6#1.offset, isfinite_float_~x#1, isfinite_float_~ix~3#1;isfinite_float_~x#1 := isfinite_float_#in~x#1;havoc isfinite_float_~ix~3#1; {117#true} is VALID [2022-02-20 16:41:49,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {117#true} assume !true; {118#false} is VALID [2022-02-20 16:41:49,454 INFO L290 TraceCheckUtils]: 3: Hoare triple {118#false} isfinite_float_~ix~3#1 := (if 0 == isfinite_float_~ix~3#1 then 0 else (if 1 == isfinite_float_~ix~3#1 then 1 else ~bitwiseAnd(isfinite_float_~ix~3#1, 2147483647)));isfinite_float_#res#1 := (if isfinite_float_~ix~3#1 < 2139095040 then 1 else 0); {118#false} is VALID [2022-02-20 16:41:49,454 INFO L290 TraceCheckUtils]: 4: Hoare triple {118#false} main_#t~ret46#1 := isfinite_float_#res#1;assume { :end_inline_isfinite_float } true;assume -2147483648 <= main_#t~ret46#1 && main_#t~ret46#1 <= 2147483647; {118#false} is VALID [2022-02-20 16:41:49,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {118#false} assume 0 != main_#t~ret46#1 && ~someBinaryFLOATComparisonOperation(main_~y~0#1, 0.0);havoc main_#t~ret46#1;assume { :begin_inline___ieee754_atan2f } true;__ieee754_atan2f_#in~y#1, __ieee754_atan2f_#in~x#1 := main_~y~0#1, main_~x~0#1;havoc __ieee754_atan2f_#res#1;havoc __ieee754_atan2f_#t~mem27#1, __ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset, __ieee754_atan2f_#t~mem29#1, __ieee754_atan2f_~#gf_u~3#1.base, __ieee754_atan2f_~#gf_u~3#1.offset, __ieee754_atan2f_#t~ret31#1, __ieee754_atan2f_#t~switch33#1, __ieee754_atan2f_#t~ite34#1, __ieee754_atan2f_#t~switch35#1, __ieee754_atan2f_#t~switch36#1, __ieee754_atan2f_#t~ite37#1, __ieee754_atan2f_#t~ret38#1, __ieee754_atan2f_#t~ret39#1, __ieee754_atan2f_#t~switch40#1, __ieee754_atan2f_#t~mem41#1, __ieee754_atan2f_~#gf_u~4#1.base, __ieee754_atan2f_~#gf_u~4#1.offset, __ieee754_atan2f_#t~mem42#1, __ieee754_atan2f_~#sf_u~1#1.base, __ieee754_atan2f_~#sf_u~1#1.offset, __ieee754_atan2f_~zh~0#1, __ieee754_atan2f_~y#1, __ieee754_atan2f_~x#1, __ieee754_atan2f_~z~1#1, __ieee754_atan2f_~k~0#1, __ieee754_atan2f_~m~0#1, __ieee754_atan2f_~hx~1#1, __ieee754_atan2f_~hy~0#1, __ieee754_atan2f_~ix~2#1, __ieee754_atan2f_~iy~0#1, __ieee754_atan2f_#t~nondet28#1, __ieee754_atan2f_#t~nondet30#1, __ieee754_atan2f_#t~nondet32#1;__ieee754_atan2f_~y#1 := __ieee754_atan2f_#in~y#1;__ieee754_atan2f_~x#1 := __ieee754_atan2f_#in~x#1;havoc __ieee754_atan2f_~z~1#1;havoc __ieee754_atan2f_~k~0#1;havoc __ieee754_atan2f_~m~0#1;havoc __ieee754_atan2f_~hx~1#1;havoc __ieee754_atan2f_~hy~0#1;havoc __ieee754_atan2f_~ix~2#1;havoc __ieee754_atan2f_~iy~0#1; {118#false} is VALID [2022-02-20 16:41:49,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {118#false} assume !true; {118#false} is VALID [2022-02-20 16:41:49,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {118#false} assume 0 == __ieee754_atan2f_~hx~1#1;__ieee754_atan2f_~ix~2#1 := 0; {118#false} is VALID [2022-02-20 16:41:49,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {118#false} assume !true; {118#false} is VALID [2022-02-20 16:41:49,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {118#false} assume 0 == __ieee754_atan2f_~hy~0#1;__ieee754_atan2f_~iy~0#1 := 0; {118#false} is VALID [2022-02-20 16:41:49,456 INFO L290 TraceCheckUtils]: 10: Hoare triple {118#false} assume __ieee754_atan2f_~ix~2#1 > 2139095040 || __ieee754_atan2f_~iy~0#1 > 2139095040;__ieee754_atan2f_#res#1 := ~someBinaryArithmeticFLOAToperation(__ieee754_atan2f_~x#1, __ieee754_atan2f_~y#1); {118#false} is VALID [2022-02-20 16:41:49,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {118#false} main_#t~ret47#1 := __ieee754_atan2f_#res#1;assume { :end_inline___ieee754_atan2f } true;main_~res~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;main_#t~short49#1 := ~someBinaryFLOATComparisonOperation(main_~res~0#1, 0.0); {118#false} is VALID [2022-02-20 16:41:49,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {118#false} assume !main_#t~short49#1; {118#false} is VALID [2022-02-20 16:41:49,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {118#false} assume !main_#t~short49#1;havoc main_#t~ret48#1;havoc main_#t~short49#1; {118#false} is VALID [2022-02-20 16:41:49,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {118#false} assume !false; {118#false} is VALID [2022-02-20 16:41:49,458 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:41:49,458 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:41:49,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152176705] [2022-02-20 16:41:49,459 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152176705] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:41:49,459 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:41:49,459 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:41:49,461 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555303458] [2022-02-20 16:41:49,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:41:49,466 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 16:41:49,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:41:49,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:41:49,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:41:49,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:41:49,485 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:41:49,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:41:49,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:41:49,507 INFO L87 Difference]: Start difference. First operand has 114 states, 106 states have (on average 1.7169811320754718) internal successors, (182), 107 states have internal predecessors, (182), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:41:49,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:41:49,644 INFO L93 Difference]: Finished difference Result 226 states and 382 transitions. [2022-02-20 16:41:49,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:41:49,645 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 16:41:49,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:41:49,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:41:49,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 382 transitions. [2022-02-20 16:41:49,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:41:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 382 transitions. [2022-02-20 16:41:49,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 382 transitions. [2022-02-20 16:41:49,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 382 edges. 382 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:41:49,938 INFO L225 Difference]: With dead ends: 226 [2022-02-20 16:41:49,939 INFO L226 Difference]: Without dead ends: 110 [2022-02-20 16:41:49,941 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:41:49,943 INFO L933 BasicCegarLoop]: 165 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, 165 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:41:49,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:41:49,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-02-20 16:41:49,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-02-20 16:41:49,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:41:49,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 110 states, 103 states have (on average 1.4757281553398058) internal successors, (152), 103 states have internal predecessors, (152), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:41:49,968 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 110 states, 103 states have (on average 1.4757281553398058) internal successors, (152), 103 states have internal predecessors, (152), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:41:49,969 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 110 states, 103 states have (on average 1.4757281553398058) internal successors, (152), 103 states have internal predecessors, (152), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:41:49,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:41:49,973 INFO L93 Difference]: Finished difference Result 110 states and 160 transitions. [2022-02-20 16:41:49,974 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 160 transitions. [2022-02-20 16:41:49,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:41:49,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:41:49,975 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 103 states have (on average 1.4757281553398058) internal successors, (152), 103 states have internal predecessors, (152), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 110 states. [2022-02-20 16:41:49,975 INFO L87 Difference]: Start difference. First operand has 110 states, 103 states have (on average 1.4757281553398058) internal successors, (152), 103 states have internal predecessors, (152), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 110 states. [2022-02-20 16:41:49,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:41:49,979 INFO L93 Difference]: Finished difference Result 110 states and 160 transitions. [2022-02-20 16:41:49,980 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 160 transitions. [2022-02-20 16:41:49,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:41:49,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:41:49,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:41:49,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:41:49,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 103 states have (on average 1.4757281553398058) internal successors, (152), 103 states have internal predecessors, (152), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:41:49,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 160 transitions. [2022-02-20 16:41:49,985 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 160 transitions. Word has length 15 [2022-02-20 16:41:49,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:41:49,986 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 160 transitions. [2022-02-20 16:41:49,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:41:49,986 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 160 transitions. [2022-02-20 16:41:49,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 16:41:49,987 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:41:49,987 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:41:49,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:41:49,987 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:41:49,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:41:49,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1407760766, now seen corresponding path program 1 times [2022-02-20 16:41:49,988 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:41:49,988 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923581868] [2022-02-20 16:41:49,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:41:49,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:41:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:41:50,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {724#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);~#atanhi_atan~0.base, ~#atanhi_atan~0.offset := 4, 0;call #Ultimate.allocInit(16, 4);call write~init~real(0.46364760399, ~#atanhi_atan~0.base, ~#atanhi_atan~0.offset, 4);call write~init~real(0.78539812565, ~#atanhi_atan~0.base, 4 + ~#atanhi_atan~0.offset, 4);call write~init~real(0.98279368877, ~#atanhi_atan~0.base, 8 + ~#atanhi_atan~0.offset, 4);call write~init~real(1.5707962513, ~#atanhi_atan~0.base, 12 + ~#atanhi_atan~0.offset, 4);~#atanlo_atan~0.base, ~#atanlo_atan~0.offset := 5, 0;call #Ultimate.allocInit(16, 5);call write~init~real(5.012158244E-9, ~#atanlo_atan~0.base, ~#atanlo_atan~0.offset, 4);call write~init~real(3.7748947079E-8, ~#atanlo_atan~0.base, 4 + ~#atanlo_atan~0.offset, 4);call write~init~real(3.447321717E-8, ~#atanlo_atan~0.base, 8 + ~#atanlo_atan~0.offset, 4);call write~init~real(7.5497894159E-8, ~#atanlo_atan~0.base, 12 + ~#atanlo_atan~0.offset, 4);~#aT_atan~0.base, ~#aT_atan~0.offset := 6, 0;call #Ultimate.allocInit(44, 6);call write~init~real(0.33333334327, ~#aT_atan~0.base, ~#aT_atan~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.20000000298), ~#aT_atan~0.base, 4 + ~#aT_atan~0.offset, 4);call write~init~real(0.14285714924, ~#aT_atan~0.base, 8 + ~#aT_atan~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.11111110449), ~#aT_atan~0.base, 12 + ~#aT_atan~0.offset, 4);call write~init~real(0.090908870101, ~#aT_atan~0.base, 16 + ~#aT_atan~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.076918758452), ~#aT_atan~0.base, 20 + ~#aT_atan~0.offset, 4);call write~init~real(0.066610731184, ~#aT_atan~0.base, 24 + ~#aT_atan~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.058335702866), ~#aT_atan~0.base, 28 + ~#aT_atan~0.offset, 4);call write~init~real(0.049768779427, ~#aT_atan~0.base, 32 + ~#aT_atan~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.036531571299), ~#aT_atan~0.base, 36 + ~#aT_atan~0.offset, 4);call write~init~real(0.016285819933, ~#aT_atan~0.base, 40 + ~#aT_atan~0.offset, 4);~one_atan~0 := 1.0;~huge_atan~0 := 1.0E30;~pi_o_4~0 := 0.78539818525;~pi_o_2~0 := 1.5707963705;~pi~0 := 3.141592741;~tiny_atan2~0 := 1.0E-30;~zero_atan2~0 := 0.0;~pi_lo_atan2~0 := ~someUnaryDOUBLEoperation(8.7422776573E-8); {724#true} is VALID [2022-02-20 16:41:50,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {724#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet45#1, main_#t~ret46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~short49#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0);main_~y~0#1 := main_#t~nondet45#1;havoc main_#t~nondet45#1;assume { :begin_inline_isfinite_float } true;isfinite_float_#in~x#1 := main_~y~0#1;havoc isfinite_float_#res#1;havoc isfinite_float_#t~mem44#1, isfinite_float_~#gf_u~6#1.base, isfinite_float_~#gf_u~6#1.offset, isfinite_float_~x#1, isfinite_float_~ix~3#1;isfinite_float_~x#1 := isfinite_float_#in~x#1;havoc isfinite_float_~ix~3#1; {724#true} is VALID [2022-02-20 16:41:50,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {724#true} call isfinite_float_~#gf_u~6#1.base, isfinite_float_~#gf_u~6#1.offset := #Ultimate.allocOnStack(4);call write~real(isfinite_float_~x#1, isfinite_float_~#gf_u~6#1.base, isfinite_float_~#gf_u~6#1.offset, 4);call isfinite_float_#t~mem44#1 := read~int(isfinite_float_~#gf_u~6#1.base, isfinite_float_~#gf_u~6#1.offset, 4);isfinite_float_~ix~3#1 := (if isfinite_float_#t~mem44#1 % 4294967296 % 4294967296 <= 2147483647 then isfinite_float_#t~mem44#1 % 4294967296 % 4294967296 else isfinite_float_#t~mem44#1 % 4294967296 % 4294967296 - 4294967296);havoc isfinite_float_#t~mem44#1;call ULTIMATE.dealloc(isfinite_float_~#gf_u~6#1.base, isfinite_float_~#gf_u~6#1.offset);havoc isfinite_float_~#gf_u~6#1.base, isfinite_float_~#gf_u~6#1.offset; {724#true} is VALID [2022-02-20 16:41:50,080 INFO L290 TraceCheckUtils]: 3: Hoare triple {724#true} goto; {724#true} is VALID [2022-02-20 16:41:50,080 INFO L290 TraceCheckUtils]: 4: Hoare triple {724#true} isfinite_float_~ix~3#1 := (if 0 == isfinite_float_~ix~3#1 then 0 else (if 1 == isfinite_float_~ix~3#1 then 1 else ~bitwiseAnd(isfinite_float_~ix~3#1, 2147483647)));isfinite_float_#res#1 := (if isfinite_float_~ix~3#1 < 2139095040 then 1 else 0); {724#true} is VALID [2022-02-20 16:41:50,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {724#true} main_#t~ret46#1 := isfinite_float_#res#1;assume { :end_inline_isfinite_float } true;assume -2147483648 <= main_#t~ret46#1 && main_#t~ret46#1 <= 2147483647; {724#true} is VALID [2022-02-20 16:41:50,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {724#true} assume 0 != main_#t~ret46#1 && ~someBinaryFLOATComparisonOperation(main_~y~0#1, 0.0);havoc main_#t~ret46#1;assume { :begin_inline___ieee754_atan2f } true;__ieee754_atan2f_#in~y#1, __ieee754_atan2f_#in~x#1 := main_~y~0#1, main_~x~0#1;havoc __ieee754_atan2f_#res#1;havoc __ieee754_atan2f_#t~mem27#1, __ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset, __ieee754_atan2f_#t~mem29#1, __ieee754_atan2f_~#gf_u~3#1.base, __ieee754_atan2f_~#gf_u~3#1.offset, __ieee754_atan2f_#t~ret31#1, __ieee754_atan2f_#t~switch33#1, __ieee754_atan2f_#t~ite34#1, __ieee754_atan2f_#t~switch35#1, __ieee754_atan2f_#t~switch36#1, __ieee754_atan2f_#t~ite37#1, __ieee754_atan2f_#t~ret38#1, __ieee754_atan2f_#t~ret39#1, __ieee754_atan2f_#t~switch40#1, __ieee754_atan2f_#t~mem41#1, __ieee754_atan2f_~#gf_u~4#1.base, __ieee754_atan2f_~#gf_u~4#1.offset, __ieee754_atan2f_#t~mem42#1, __ieee754_atan2f_~#sf_u~1#1.base, __ieee754_atan2f_~#sf_u~1#1.offset, __ieee754_atan2f_~zh~0#1, __ieee754_atan2f_~y#1, __ieee754_atan2f_~x#1, __ieee754_atan2f_~z~1#1, __ieee754_atan2f_~k~0#1, __ieee754_atan2f_~m~0#1, __ieee754_atan2f_~hx~1#1, __ieee754_atan2f_~hy~0#1, __ieee754_atan2f_~ix~2#1, __ieee754_atan2f_~iy~0#1, __ieee754_atan2f_#t~nondet28#1, __ieee754_atan2f_#t~nondet30#1, __ieee754_atan2f_#t~nondet32#1;__ieee754_atan2f_~y#1 := __ieee754_atan2f_#in~y#1;__ieee754_atan2f_~x#1 := __ieee754_atan2f_#in~x#1;havoc __ieee754_atan2f_~z~1#1;havoc __ieee754_atan2f_~k~0#1;havoc __ieee754_atan2f_~m~0#1;havoc __ieee754_atan2f_~hx~1#1;havoc __ieee754_atan2f_~hy~0#1;havoc __ieee754_atan2f_~ix~2#1;havoc __ieee754_atan2f_~iy~0#1; {724#true} is VALID [2022-02-20 16:41:50,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {724#true} call __ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset := #Ultimate.allocOnStack(4);call write~real(__ieee754_atan2f_~x#1, __ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset, 4);call __ieee754_atan2f_#t~mem27#1 := read~int(__ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset, 4);__ieee754_atan2f_~hx~1#1 := (if __ieee754_atan2f_#t~mem27#1 % 4294967296 % 4294967296 <= 2147483647 then __ieee754_atan2f_#t~mem27#1 % 4294967296 % 4294967296 else __ieee754_atan2f_#t~mem27#1 % 4294967296 % 4294967296 - 4294967296);havoc __ieee754_atan2f_#t~mem27#1;call ULTIMATE.dealloc(__ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset);havoc __ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset; {724#true} is VALID [2022-02-20 16:41:50,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {724#true} goto; {724#true} is VALID [2022-02-20 16:41:50,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {724#true} assume 0 == __ieee754_atan2f_~hx~1#1;__ieee754_atan2f_~ix~2#1 := 0; {726#(= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0)} is VALID [2022-02-20 16:41:50,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {726#(= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0)} call __ieee754_atan2f_~#gf_u~3#1.base, __ieee754_atan2f_~#gf_u~3#1.offset := #Ultimate.allocOnStack(4);call write~real(__ieee754_atan2f_~y#1, __ieee754_atan2f_~#gf_u~3#1.base, __ieee754_atan2f_~#gf_u~3#1.offset, 4);call __ieee754_atan2f_#t~mem29#1 := read~int(__ieee754_atan2f_~#gf_u~3#1.base, __ieee754_atan2f_~#gf_u~3#1.offset, 4);__ieee754_atan2f_~hy~0#1 := (if __ieee754_atan2f_#t~mem29#1 % 4294967296 % 4294967296 <= 2147483647 then __ieee754_atan2f_#t~mem29#1 % 4294967296 % 4294967296 else __ieee754_atan2f_#t~mem29#1 % 4294967296 % 4294967296 - 4294967296);havoc __ieee754_atan2f_#t~mem29#1;call ULTIMATE.dealloc(__ieee754_atan2f_~#gf_u~3#1.base, __ieee754_atan2f_~#gf_u~3#1.offset);havoc __ieee754_atan2f_~#gf_u~3#1.base, __ieee754_atan2f_~#gf_u~3#1.offset; {726#(= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0)} is VALID [2022-02-20 16:41:50,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {726#(= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0)} goto; {726#(= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0)} is VALID [2022-02-20 16:41:50,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {726#(= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0)} assume 0 == __ieee754_atan2f_~hy~0#1;__ieee754_atan2f_~iy~0#1 := 0; {727#(and (= |ULTIMATE.start___ieee754_atan2f_~iy~0#1| 0) (= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0))} is VALID [2022-02-20 16:41:50,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {727#(and (= |ULTIMATE.start___ieee754_atan2f_~iy~0#1| 0) (= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0))} assume __ieee754_atan2f_~ix~2#1 > 2139095040 || __ieee754_atan2f_~iy~0#1 > 2139095040;__ieee754_atan2f_#res#1 := ~someBinaryArithmeticFLOAToperation(__ieee754_atan2f_~x#1, __ieee754_atan2f_~y#1); {725#false} is VALID [2022-02-20 16:41:50,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {725#false} main_#t~ret47#1 := __ieee754_atan2f_#res#1;assume { :end_inline___ieee754_atan2f } true;main_~res~0#1 := main_#t~ret47#1;havoc main_#t~ret47#1;main_#t~short49#1 := ~someBinaryFLOATComparisonOperation(main_~res~0#1, 0.0); {725#false} is VALID [2022-02-20 16:41:50,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {725#false} assume !main_#t~short49#1; {725#false} is VALID [2022-02-20 16:41:50,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {725#false} assume !main_#t~short49#1;havoc main_#t~ret48#1;havoc main_#t~short49#1; {725#false} is VALID [2022-02-20 16:41:50,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {725#false} assume !false; {725#false} is VALID [2022-02-20 16:41:50,093 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:41:50,094 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:41:50,094 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923581868] [2022-02-20 16:41:50,094 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923581868] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:41:50,094 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:41:50,095 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:41:50,095 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925920487] [2022-02-20 16:41:50,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:41:50,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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:41:50,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:41:50,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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:41:50,113 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:41:50,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:41:50,113 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:41:50,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:41:50,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:41:50,114 INFO L87 Difference]: Start difference. First operand 110 states and 160 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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:41:50,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:41:50,434 INFO L93 Difference]: Finished difference Result 238 states and 347 transitions. [2022-02-20 16:41:50,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:41:50,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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:41:50,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:41:50,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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:41:50,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 347 transitions. [2022-02-20 16:41:50,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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:41:50,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 347 transitions. [2022-02-20 16:41:50,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 347 transitions. [2022-02-20 16:41:50,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 347 edges. 347 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:41:50,687 INFO L225 Difference]: With dead ends: 238 [2022-02-20 16:41:50,687 INFO L226 Difference]: Without dead ends: 162 [2022-02-20 16:41:50,688 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:41:50,689 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 69 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:41:50,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 457 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:41:50,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-02-20 16:41:50,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 137. [2022-02-20 16:41:50,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:41:50,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand has 137 states, 130 states have (on average 1.5153846153846153) internal successors, (197), 130 states have internal predecessors, (197), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:41:50,697 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand has 137 states, 130 states have (on average 1.5153846153846153) internal successors, (197), 130 states have internal predecessors, (197), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:41:50,697 INFO L87 Difference]: Start difference. First operand 162 states. Second operand has 137 states, 130 states have (on average 1.5153846153846153) internal successors, (197), 130 states have internal predecessors, (197), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:41:50,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:41:50,702 INFO L93 Difference]: Finished difference Result 162 states and 233 transitions. [2022-02-20 16:41:50,702 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 233 transitions. [2022-02-20 16:41:50,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:41:50,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:41:50,704 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 130 states have (on average 1.5153846153846153) internal successors, (197), 130 states have internal predecessors, (197), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 162 states. [2022-02-20 16:41:50,704 INFO L87 Difference]: Start difference. First operand has 137 states, 130 states have (on average 1.5153846153846153) internal successors, (197), 130 states have internal predecessors, (197), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 162 states. [2022-02-20 16:41:50,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:41:50,709 INFO L93 Difference]: Finished difference Result 162 states and 233 transitions. [2022-02-20 16:41:50,710 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 233 transitions. [2022-02-20 16:41:50,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:41:50,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:41:50,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:41:50,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:41:50,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 130 states have (on average 1.5153846153846153) internal successors, (197), 130 states have internal predecessors, (197), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:41:50,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 205 transitions. [2022-02-20 16:41:50,716 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 205 transitions. Word has length 18 [2022-02-20 16:41:50,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:41:50,716 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 205 transitions. [2022-02-20 16:41:50,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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:41:50,717 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 205 transitions. [2022-02-20 16:41:50,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 16:41:50,717 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:41:50,717 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:41:50,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:41:50,718 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:41:50,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:41:50,718 INFO L85 PathProgramCache]: Analyzing trace with hash -2133161209, now seen corresponding path program 1 times [2022-02-20 16:41:50,719 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:41:50,719 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082094047] [2022-02-20 16:41:50,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:41:50,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:41:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:41:50,797 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:41:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:41:50,908 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:41:50,908 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:41:50,909 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:41:50,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:41:50,913 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:41:50,915 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:41:50,968 WARN L170 areAnnotationChecker]: fabs_floatENTRY has no Hoare annotation [2022-02-20 16:41:50,968 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:41:50,969 WARN L170 areAnnotationChecker]: atan_floatENTRY has no Hoare annotation [2022-02-20 16:41:50,969 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-02-20 16:41:50,969 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-02-20 16:41:50,969 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:41:50,969 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2022-02-20 16:41:50,969 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2022-02-20 16:41:50,969 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 16:41:50,969 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 16:41:50,970 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:41:50,970 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:41:50,970 WARN L170 areAnnotationChecker]: L232-2 has no Hoare annotation [2022-02-20 16:41:50,970 WARN L170 areAnnotationChecker]: L232-2 has no Hoare annotation [2022-02-20 16:41:50,970 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2022-02-20 16:41:50,970 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2022-02-20 16:41:50,970 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2022-02-20 16:41:50,970 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2022-02-20 16:41:50,970 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-20 16:41:50,970 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-20 16:41:50,971 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-02-20 16:41:50,971 WARN L170 areAnnotationChecker]: L232-1 has no Hoare annotation [2022-02-20 16:41:50,971 WARN L170 areAnnotationChecker]: L232-1 has no Hoare annotation [2022-02-20 16:41:50,971 WARN L170 areAnnotationChecker]: L232-3 has no Hoare annotation [2022-02-20 16:41:50,971 WARN L170 areAnnotationChecker]: L62-7 has no Hoare annotation [2022-02-20 16:41:50,971 WARN L170 areAnnotationChecker]: L62-7 has no Hoare annotation [2022-02-20 16:41:50,971 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-02-20 16:41:50,971 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-02-20 16:41:50,971 WARN L170 areAnnotationChecker]: fabs_floatFINAL has no Hoare annotation [2022-02-20 16:41:50,971 WARN L170 areAnnotationChecker]: L238 has no Hoare annotation [2022-02-20 16:41:50,972 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-02-20 16:41:50,972 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-02-20 16:41:50,972 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-02-20 16:41:50,972 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-02-20 16:41:50,972 WARN L170 areAnnotationChecker]: L62-3 has no Hoare annotation [2022-02-20 16:41:50,972 WARN L170 areAnnotationChecker]: L62-3 has no Hoare annotation [2022-02-20 16:41:50,972 WARN L170 areAnnotationChecker]: fabs_floatEXIT has no Hoare annotation [2022-02-20 16:41:50,972 WARN L170 areAnnotationChecker]: fabs_floatEXIT has no Hoare annotation [2022-02-20 16:41:50,972 WARN L170 areAnnotationChecker]: L251 has no Hoare annotation [2022-02-20 16:41:50,973 WARN L170 areAnnotationChecker]: L251 has no Hoare annotation [2022-02-20 16:41:50,973 WARN L170 areAnnotationChecker]: atan_floatFINAL has no Hoare annotation [2022-02-20 16:41:50,973 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:41:50,973 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:41:50,973 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:41:50,973 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:41:50,973 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:41:50,973 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:41:50,973 WARN L170 areAnnotationChecker]: L62-5 has no Hoare annotation [2022-02-20 16:41:50,973 WARN L170 areAnnotationChecker]: L62-5 has no Hoare annotation [2022-02-20 16:41:50,974 WARN L170 areAnnotationChecker]: L192-1 has no Hoare annotation [2022-02-20 16:41:50,974 WARN L170 areAnnotationChecker]: L192-1 has no Hoare annotation [2022-02-20 16:41:50,974 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:41:50,974 WARN L170 areAnnotationChecker]: L124-2 has no Hoare annotation [2022-02-20 16:41:50,974 WARN L170 areAnnotationChecker]: L124-2 has no Hoare annotation [2022-02-20 16:41:50,974 WARN L170 areAnnotationChecker]: L251-2 has no Hoare annotation [2022-02-20 16:41:50,974 WARN L170 areAnnotationChecker]: atan_floatEXIT has no Hoare annotation [2022-02-20 16:41:50,974 WARN L170 areAnnotationChecker]: atan_floatEXIT has no Hoare annotation [2022-02-20 16:41:50,974 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:41:50,975 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:41:50,975 WARN L170 areAnnotationChecker]: L72-2 has no Hoare annotation [2022-02-20 16:41:50,975 WARN L170 areAnnotationChecker]: L192-2 has no Hoare annotation [2022-02-20 16:41:50,975 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-02-20 16:41:50,975 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-02-20 16:41:50,975 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2022-02-20 16:41:50,975 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2022-02-20 16:41:50,975 WARN L170 areAnnotationChecker]: L124-3 has no Hoare annotation [2022-02-20 16:41:50,975 WARN L170 areAnnotationChecker]: L124-3 has no Hoare annotation [2022-02-20 16:41:50,975 WARN L170 areAnnotationChecker]: L262 has no Hoare annotation [2022-02-20 16:41:50,976 WARN L170 areAnnotationChecker]: L139-1 has no Hoare annotation [2022-02-20 16:41:50,976 WARN L170 areAnnotationChecker]: L88-2 has no Hoare annotation [2022-02-20 16:41:50,976 WARN L170 areAnnotationChecker]: L189-2 has no Hoare annotation [2022-02-20 16:41:50,976 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:41:50,976 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:41:50,976 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:41:50,976 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:41:50,976 WARN L170 areAnnotationChecker]: L130-1 has no Hoare annotation [2022-02-20 16:41:50,976 WARN L170 areAnnotationChecker]: L130-1 has no Hoare annotation [2022-02-20 16:41:50,977 WARN L170 areAnnotationChecker]: L129-1 has no Hoare annotation [2022-02-20 16:41:50,977 WARN L170 areAnnotationChecker]: L129-1 has no Hoare annotation [2022-02-20 16:41:50,977 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:41:50,977 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2022-02-20 16:41:50,977 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:41:50,977 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:41:50,977 WARN L170 areAnnotationChecker]: L194 has no Hoare annotation [2022-02-20 16:41:50,977 WARN L170 areAnnotationChecker]: L194 has no Hoare annotation [2022-02-20 16:41:50,977 WARN L170 areAnnotationChecker]: L130 has no Hoare annotation [2022-02-20 16:41:50,977 WARN L170 areAnnotationChecker]: L130 has no Hoare annotation [2022-02-20 16:41:50,978 WARN L170 areAnnotationChecker]: L130-2 has no Hoare annotation [2022-02-20 16:41:50,978 WARN L170 areAnnotationChecker]: L130-2 has no Hoare annotation [2022-02-20 16:41:50,978 WARN L170 areAnnotationChecker]: L129-3 has no Hoare annotation [2022-02-20 16:41:50,978 WARN L170 areAnnotationChecker]: L129-3 has no Hoare annotation [2022-02-20 16:41:50,978 WARN L170 areAnnotationChecker]: L256 has no Hoare annotation [2022-02-20 16:41:50,978 WARN L170 areAnnotationChecker]: L256 has no Hoare annotation [2022-02-20 16:41:50,978 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-02-20 16:41:50,978 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-02-20 16:41:50,978 WARN L170 areAnnotationChecker]: L196 has no Hoare annotation [2022-02-20 16:41:50,978 WARN L170 areAnnotationChecker]: L196 has no Hoare annotation [2022-02-20 16:41:50,979 WARN L170 areAnnotationChecker]: L135-7 has no Hoare annotation [2022-02-20 16:41:50,979 WARN L170 areAnnotationChecker]: L135-7 has no Hoare annotation [2022-02-20 16:41:50,979 WARN L170 areAnnotationChecker]: L135-1 has no Hoare annotation [2022-02-20 16:41:50,979 WARN L170 areAnnotationChecker]: L135-1 has no Hoare annotation [2022-02-20 16:41:50,979 WARN L170 areAnnotationChecker]: L129-5 has no Hoare annotation [2022-02-20 16:41:50,979 WARN L170 areAnnotationChecker]: L129-5 has no Hoare annotation [2022-02-20 16:41:50,979 WARN L170 areAnnotationChecker]: L220-2 has no Hoare annotation [2022-02-20 16:41:50,979 WARN L170 areAnnotationChecker]: L220-2 has no Hoare annotation [2022-02-20 16:41:50,979 WARN L170 areAnnotationChecker]: L256-2 has no Hoare annotation [2022-02-20 16:41:50,979 WARN L170 areAnnotationChecker]: L256-2 has no Hoare annotation [2022-02-20 16:41:50,980 WARN L170 areAnnotationChecker]: L113-2 has no Hoare annotation [2022-02-20 16:41:50,980 WARN L170 areAnnotationChecker]: L198-2 has no Hoare annotation [2022-02-20 16:41:50,980 WARN L170 areAnnotationChecker]: L198-2 has no Hoare annotation [2022-02-20 16:41:50,980 WARN L170 areAnnotationChecker]: L210 has no Hoare annotation [2022-02-20 16:41:50,980 WARN L170 areAnnotationChecker]: L210 has no Hoare annotation [2022-02-20 16:41:50,980 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2022-02-20 16:41:50,980 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2022-02-20 16:41:50,980 WARN L170 areAnnotationChecker]: L135-3 has no Hoare annotation [2022-02-20 16:41:50,980 WARN L170 areAnnotationChecker]: L135-3 has no Hoare annotation [2022-02-20 16:41:50,980 WARN L170 areAnnotationChecker]: L220-1 has no Hoare annotation [2022-02-20 16:41:50,981 WARN L170 areAnnotationChecker]: L220-1 has no Hoare annotation [2022-02-20 16:41:50,981 WARN L170 areAnnotationChecker]: L220-3 has no Hoare annotation [2022-02-20 16:41:50,981 WARN L170 areAnnotationChecker]: L257 has no Hoare annotation [2022-02-20 16:41:50,981 WARN L170 areAnnotationChecker]: L257 has no Hoare annotation [2022-02-20 16:41:50,981 WARN L170 areAnnotationChecker]: L198-1 has no Hoare annotation [2022-02-20 16:41:50,981 WARN L170 areAnnotationChecker]: L198-1 has no Hoare annotation [2022-02-20 16:41:50,981 WARN L170 areAnnotationChecker]: L203-1 has no Hoare annotation [2022-02-20 16:41:50,981 WARN L170 areAnnotationChecker]: L203-1 has no Hoare annotation [2022-02-20 16:41:50,981 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2022-02-20 16:41:50,981 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2022-02-20 16:41:50,982 WARN L170 areAnnotationChecker]: L139 has no Hoare annotation [2022-02-20 16:41:50,982 WARN L170 areAnnotationChecker]: L139 has no Hoare annotation [2022-02-20 16:41:50,982 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2022-02-20 16:41:50,982 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2022-02-20 16:41:50,982 WARN L170 areAnnotationChecker]: L135-5 has no Hoare annotation [2022-02-20 16:41:50,982 WARN L170 areAnnotationChecker]: L135-5 has no Hoare annotation [2022-02-20 16:41:50,982 WARN L170 areAnnotationChecker]: L226 has no Hoare annotation [2022-02-20 16:41:50,982 WARN L170 areAnnotationChecker]: L203 has no Hoare annotation [2022-02-20 16:41:50,982 WARN L170 areAnnotationChecker]: L203 has no Hoare annotation [2022-02-20 16:41:50,983 WARN L170 areAnnotationChecker]: L203-2 has no Hoare annotation [2022-02-20 16:41:50,983 WARN L170 areAnnotationChecker]: L193 has no Hoare annotation [2022-02-20 16:41:50,983 WARN L170 areAnnotationChecker]: L140-8 has no Hoare annotation [2022-02-20 16:41:50,983 WARN L170 areAnnotationChecker]: L140-8 has no Hoare annotation [2022-02-20 16:41:50,983 WARN L170 areAnnotationChecker]: L140-2 has no Hoare annotation [2022-02-20 16:41:50,983 WARN L170 areAnnotationChecker]: L140-2 has no Hoare annotation [2022-02-20 16:41:50,983 WARN L170 areAnnotationChecker]: L144 has no Hoare annotation [2022-02-20 16:41:50,983 WARN L170 areAnnotationChecker]: L144 has no Hoare annotation [2022-02-20 16:41:50,983 WARN L170 areAnnotationChecker]: L142-1 has no Hoare annotation [2022-02-20 16:41:50,984 WARN L170 areAnnotationChecker]: L142-1 has no Hoare annotation [2022-02-20 16:41:50,984 WARN L170 areAnnotationChecker]: L140-4 has no Hoare annotation [2022-02-20 16:41:50,984 WARN L170 areAnnotationChecker]: L140-4 has no Hoare annotation [2022-02-20 16:41:50,984 WARN L170 areAnnotationChecker]: L144-2 has no Hoare annotation [2022-02-20 16:41:50,984 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2022-02-20 16:41:50,984 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2022-02-20 16:41:50,984 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2022-02-20 16:41:50,984 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2022-02-20 16:41:50,984 WARN L170 areAnnotationChecker]: L140-6 has no Hoare annotation [2022-02-20 16:41:50,984 WARN L170 areAnnotationChecker]: L140-6 has no Hoare annotation [2022-02-20 16:41:50,985 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2022-02-20 16:41:50,985 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2022-02-20 16:41:50,985 WARN L170 areAnnotationChecker]: L155-2 has no Hoare annotation [2022-02-20 16:41:50,985 WARN L170 areAnnotationChecker]: L158 has no Hoare annotation [2022-02-20 16:41:50,985 WARN L170 areAnnotationChecker]: L158 has no Hoare annotation [2022-02-20 16:41:50,985 WARN L170 areAnnotationChecker]: L157-1 has no Hoare annotation [2022-02-20 16:41:50,985 WARN L170 areAnnotationChecker]: L157-1 has no Hoare annotation [2022-02-20 16:41:50,985 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-02-20 16:41:50,985 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-02-20 16:41:50,985 WARN L170 areAnnotationChecker]: L160 has no Hoare annotation [2022-02-20 16:41:50,986 WARN L170 areAnnotationChecker]: L160 has no Hoare annotation [2022-02-20 16:41:50,986 WARN L170 areAnnotationChecker]: L171 has no Hoare annotation [2022-02-20 16:41:50,986 WARN L170 areAnnotationChecker]: L171 has no Hoare annotation [2022-02-20 16:41:50,986 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2022-02-20 16:41:50,986 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2022-02-20 16:41:50,986 WARN L170 areAnnotationChecker]: L187 has no Hoare annotation [2022-02-20 16:41:50,986 WARN L170 areAnnotationChecker]: L187 has no Hoare annotation [2022-02-20 16:41:50,986 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2022-02-20 16:41:50,986 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2022-02-20 16:41:50,986 WARN L170 areAnnotationChecker]: L162 has no Hoare annotation [2022-02-20 16:41:50,987 WARN L170 areAnnotationChecker]: L162 has no Hoare annotation [2022-02-20 16:41:50,987 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2022-02-20 16:41:50,987 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2022-02-20 16:41:50,987 WARN L170 areAnnotationChecker]: L184-2 has no Hoare annotation [2022-02-20 16:41:50,987 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2022-02-20 16:41:50,987 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2022-02-20 16:41:50,987 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-02-20 16:41:50,987 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2022-02-20 16:41:50,987 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2022-02-20 16:41:50,987 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2022-02-20 16:41:50,988 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2022-02-20 16:41:50,988 WARN L170 areAnnotationChecker]: L192 has no Hoare annotation [2022-02-20 16:41:50,988 WARN L170 areAnnotationChecker]: L192 has no Hoare annotation [2022-02-20 16:41:50,988 WARN L170 areAnnotationChecker]: L166 has no Hoare annotation [2022-02-20 16:41:50,988 WARN L170 areAnnotationChecker]: L166 has no Hoare annotation [2022-02-20 16:41:50,988 WARN L170 areAnnotationChecker]: L177 has no Hoare annotation [2022-02-20 16:41:50,988 WARN L170 areAnnotationChecker]: L177 has no Hoare annotation [2022-02-20 16:41:50,988 WARN L170 areAnnotationChecker]: L159 has no Hoare annotation [2022-02-20 16:41:50,988 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2022-02-20 16:41:50,988 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:41:50,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:41:50 BoogieIcfgContainer [2022-02-20 16:41:50,990 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:41:50,990 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:41:50,990 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:41:50,990 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:41:50,991 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:41:49" (3/4) ... [2022-02-20 16:41:50,993 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:41:50,993 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:41:50,994 INFO L158 Benchmark]: Toolchain (without parser) took 2910.64ms. Allocated memory was 83.9MB in the beginning and 134.2MB in the end (delta: 50.3MB). Free memory was 52.8MB in the beginning and 68.6MB in the end (delta: -15.9MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2022-02-20 16:41:50,995 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory was 55.3MB in the beginning and 55.3MB in the end (delta: 29.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:41:50,995 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.27ms. Allocated memory was 83.9MB in the beginning and 104.9MB in the end (delta: 21.0MB). Free memory was 52.6MB in the beginning and 74.9MB in the end (delta: -22.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:41:50,995 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.08ms. Allocated memory is still 104.9MB. Free memory was 74.9MB in the beginning and 71.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:41:50,996 INFO L158 Benchmark]: Boogie Preprocessor took 50.98ms. Allocated memory is still 104.9MB. Free memory was 71.3MB in the beginning and 68.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:41:50,996 INFO L158 Benchmark]: RCFGBuilder took 733.99ms. Allocated memory is still 104.9MB. Free memory was 67.6MB in the beginning and 71.6MB in the end (delta: -4.0MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2022-02-20 16:41:50,996 INFO L158 Benchmark]: TraceAbstraction took 1771.75ms. Allocated memory was 104.9MB in the beginning and 134.2MB in the end (delta: 29.4MB). Free memory was 71.6MB in the beginning and 68.8MB in the end (delta: 2.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-02-20 16:41:50,997 INFO L158 Benchmark]: Witness Printer took 3.10ms. Allocated memory is still 134.2MB. Free memory is still 68.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:41:51,002 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 83.9MB. Free memory was 55.3MB in the beginning and 55.3MB in the end (delta: 29.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.27ms. Allocated memory was 83.9MB in the beginning and 104.9MB in the end (delta: 21.0MB). Free memory was 52.6MB in the beginning and 74.9MB in the end (delta: -22.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.08ms. Allocated memory is still 104.9MB. Free memory was 74.9MB in the beginning and 71.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.98ms. Allocated memory is still 104.9MB. Free memory was 71.3MB in the beginning and 68.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 733.99ms. Allocated memory is still 104.9MB. Free memory was 67.6MB in the beginning and 71.6MB in the end (delta: -4.0MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1771.75ms. Allocated memory was 104.9MB in the beginning and 134.2MB in the end (delta: 29.4MB). Free memory was 71.6MB in the beginning and 68.8MB in the end (delta: 2.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Witness Printer took 3.10ms. Allocated memory is still 134.2MB. Free memory is still 68.8MB. 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: 257]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 256, overapproximation of someUnaryDOUBLEoperation at line 44, overapproximation of bitwiseAnd at line 237, overapproximation of someBinaryArithmeticFLOAToperation at line 137. Possible FailurePath: [L29-L34] static const float atanhi_atan[] = { 4.6364760399e-01, 7.8539812565e-01, 9.8279368877e-01, 1.5707962513e+00, }; [L36-L41] static const float atanlo_atan[] = { 5.0121582440e-09, 3.7748947079e-08, 3.4473217170e-08, 7.5497894159e-08, }; [L43-L47] static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L49-L51] static const float one_atan = 1.0, huge_atan = 1.0e30, pi_o_4 = 7.8539818525e-01, pi_o_2 = 1.5707963705e+00, pi = 3.1415927410e+00; [L117-L118] static const float tiny_atan2 = 1.0e-30, zero_atan2 = 0.0, pi_lo_atan2 = -8.7422776573e-08; VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, zero_atan2=0] [L248] float x = 1.0f / 0.0f; [L249] float y = __VERIFIER_nondet_float(); [L251] CALL, EXPR isfinite_float(y) [L231] __int32_t ix; VAL [\old(x)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000001, zero_atan2=0] [L233] ieee_float_shape_type gf_u; [L234] gf_u.value = (x) [L235] EXPR gf_u.word [L235] (ix) = gf_u.word [L237] ix &= 0x7fffffff [L238] return (((ix) < 0x7f800000L)); VAL [\old(x)=1000000000000000000000000000001, \result=1, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, ix=2139095039, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000001, zero_atan2=0] [L251] RET, EXPR isfinite_float(y) [L251] COND TRUE isfinite_float(y) && y > 0.0f [L253] CALL, EXPR __ieee754_atan2f(y, x) [L121] float z; [L122] __int32_t k, m, hx, hy, ix, iy; VAL [\old(x)=1000000000000000000000000000003, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000003, y=1000000000000000000000000000001, zero_atan2=0] [L125] ieee_float_shape_type gf_u; [L126] gf_u.value = (x) [L127] EXPR gf_u.word [L127] (hx) = gf_u.word [L129] ix = hx & 0x7fffffff VAL [\old(x)=1000000000000000000000000000003, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000003, y=1000000000000000000000000000001, zero_atan2=0] [L131] ieee_float_shape_type gf_u; [L132] gf_u.value = (y) [L133] EXPR gf_u.word [L133] (hy) = gf_u.word [L135] iy = hy & 0x7fffffff VAL [\old(x)=1000000000000000000000000000003, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=0, hy=2147483647, ix=0, iy=2147483646, iy = hy & 0x7fffffff=2147483647, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000003, y=1000000000000000000000000000001, zero_atan2=0] [L136] COND TRUE ((ix) > 0x7f800000L) || ((iy) > 0x7f800000L) [L137] return x + y; VAL [\old(x)=1000000000000000000000000000003, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=0, hy=2147483647, ix=0, iy=2147483646, iy = hy & 0x7fffffff=2147483647, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000003, y=1000000000000000000000000000001, zero_atan2=0] [L253] RET, EXPR __ieee754_atan2f(y, x) [L253] float res = __ieee754_atan2f(y, x); [L256] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, iy = hy & 0x7fffffff=2147483647, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=1000000000000000000000000000002, res == 0.0f && __signbit_float(res) == 0=0, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000003, y=1000000000000000000000000000001, zero_atan2=0] [L256] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L257] reach_error() VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, iy = hy & 0x7fffffff=2147483647, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=1000000000000000000000000000002, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000003, y=1000000000000000000000000000001, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 114 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 71 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69 mSDsluCounter, 622 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 287 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34 IncrementalHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 335 mSDtfsCounter, 34 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 25 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 43 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 16:41:51,034 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_0683b.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 6672481a7838a56be1f1fe8bf2e494e3680a5c6a5ddaa173ab670073cd565312 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:41:52,666 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:41:52,671 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:41:52,692 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:41:52,695 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:41:52,698 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:41:52,700 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:41:52,705 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:41:52,706 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:41:52,711 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:41:52,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:41:52,715 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:41:52,716 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:41:52,725 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:41:52,740 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:41:52,741 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:41:52,742 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:41:52,743 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:41:52,744 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:41:52,745 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:41:52,746 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:41:52,747 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:41:52,748 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:41:52,749 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:41:52,755 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:41:52,755 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:41:52,755 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:41:52,757 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:41:52,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:41:52,757 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:41:52,758 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:41:52,758 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:41:52,759 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:41:52,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:41:52,760 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:41:52,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:41:52,761 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:41:52,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:41:52,762 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:41:52,763 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:41:52,764 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:41:52,765 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:41:52,798 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:41:52,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:41:52,800 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:41:52,800 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:41:52,801 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:41:52,801 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:41:52,802 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:41:52,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:41:52,802 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:41:52,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:41:52,803 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:41:52,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:41:52,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:41:52,803 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:41:52,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:41:52,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:41:52,804 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:41:52,804 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:41:52,804 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:41:52,804 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:41:52,804 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:41:52,804 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:41:52,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:41:52,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:41:52,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:41:52,805 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:41:52,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:41:52,805 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:41:52,805 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:41:52,806 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:41:52,806 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:41:52,806 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:41:52,806 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:41:52,806 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:41:52,806 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:41:52,807 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:41:52,807 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 -> 6672481a7838a56be1f1fe8bf2e494e3680a5c6a5ddaa173ab670073cd565312 [2022-02-20 16:41:53,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:41:53,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:41:53,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:41:53,095 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:41:53,096 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:41:53,097 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0683b.c [2022-02-20 16:41:53,148 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b837072c/048c5ea0c8cf4f889864e72848d0682f/FLAG704683dc3 [2022-02-20 16:41:53,552 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:41:53,552 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0683b.c [2022-02-20 16:41:53,559 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b837072c/048c5ea0c8cf4f889864e72848d0682f/FLAG704683dc3 [2022-02-20 16:41:53,951 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b837072c/048c5ea0c8cf4f889864e72848d0682f [2022-02-20 16:41:53,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:41:53,955 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:41:53,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:41:53,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:41:53,958 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:41:53,959 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:41:53" (1/1) ... [2022-02-20 16:41:53,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68e6bd28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:53, skipping insertion in model container [2022-02-20 16:41:53,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:41:53" (1/1) ... [2022-02-20 16:41:53,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:41:53,996 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:41:54,150 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_0683b.c[5824,5837] [2022-02-20 16:41:54,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:41:54,187 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:41:54,230 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_0683b.c[5824,5837] [2022-02-20 16:41:54,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:41:54,245 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:41:54,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:54 WrapperNode [2022-02-20 16:41:54,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:41:54,246 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:41:54,246 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:41:54,247 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:41:54,251 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:41:54" (1/1) ... [2022-02-20 16:41:54,261 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:41:54" (1/1) ... [2022-02-20 16:41:54,295 INFO L137 Inliner]: procedures = 24, calls = 89, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 261 [2022-02-20 16:41:54,296 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:41:54,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:41:54,297 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:41:54,297 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:41:54,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:54" (1/1) ... [2022-02-20 16:41:54,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:54" (1/1) ... [2022-02-20 16:41:54,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:54" (1/1) ... [2022-02-20 16:41:54,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:54" (1/1) ... [2022-02-20 16:41:54,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:54" (1/1) ... [2022-02-20 16:41:54,329 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:54" (1/1) ... [2022-02-20 16:41:54,332 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:54" (1/1) ... [2022-02-20 16:41:54,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:41:54,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:41:54,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:41:54,336 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:41:54,337 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:54" (1/1) ... [2022-02-20 16:41:54,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:41:54,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:41:54,362 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:41:54,376 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:41:54,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:41:54,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-02-20 16:41:54,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:41:54,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:41:54,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:41:54,406 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2022-02-20 16:41:54,406 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2022-02-20 16:41:54,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:41:54,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:41:54,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:41:54,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:41:54,407 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2022-02-20 16:41:54,407 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2022-02-20 16:41:54,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:41:54,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:41:54,517 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:41:54,518 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:42:06,035 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:42:06,040 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:42:06,040 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2022-02-20 16:42:06,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:06 BoogieIcfgContainer [2022-02-20 16:42:06,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:42:06,045 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:42:06,045 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:42:06,047 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:42:06,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:41:53" (1/3) ... [2022-02-20 16:42:06,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e8b856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:42:06, skipping insertion in model container [2022-02-20 16:42:06,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:54" (2/3) ... [2022-02-20 16:42:06,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e8b856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:42:06, skipping insertion in model container [2022-02-20 16:42:06,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:06" (3/3) ... [2022-02-20 16:42:06,049 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0683b.c [2022-02-20 16:42:06,052 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:42:06,053 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:42:06,083 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:42:06,088 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:42:06,088 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:42:06,108 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 93 states have (on average 1.6451612903225807) internal successors, (153), 94 states have internal predecessors, (153), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:42:06,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:42:06,112 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:06,112 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:06,112 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:06,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:06,116 INFO L85 PathProgramCache]: Analyzing trace with hash 430940660, now seen corresponding path program 1 times [2022-02-20 16:42:06,125 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:42:06,125 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667241129] [2022-02-20 16:42:06,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:06,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:42:06,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:42:06,128 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:42:06,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:42:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:06,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:42:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:06,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:42:07,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {104#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);~#atanhi_atan~0.base, ~#atanhi_atan~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(16bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.46364760399)), ~#atanhi_atan~0.base, ~#atanhi_atan~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.78539812565)), ~#atanhi_atan~0.base, ~bvadd32(4bv32, ~#atanhi_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.98279368877)), ~#atanhi_atan~0.base, ~bvadd32(8bv32, ~#atanhi_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.5707962513)), ~#atanhi_atan~0.base, ~bvadd32(12bv32, ~#atanhi_atan~0.offset), 4bv32);~#atanlo_atan~0.base, ~#atanlo_atan~0.offset := 5bv32, 0bv32;call #Ultimate.allocInit(16bv32, 5bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 5.012158244E-9)), ~#atanlo_atan~0.base, ~#atanlo_atan~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.7748947079E-8)), ~#atanlo_atan~0.base, ~bvadd32(4bv32, ~#atanlo_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.447321717E-8)), ~#atanlo_atan~0.base, ~bvadd32(8bv32, ~#atanlo_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.5497894159E-8)), ~#atanlo_atan~0.base, ~bvadd32(12bv32, ~#atanlo_atan~0.offset), 4bv32);~#aT_atan~0.base, ~#aT_atan~0.offset := 6bv32, 0bv32;call #Ultimate.allocInit(44bv32, 6bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.33333334327)), ~#aT_atan~0.base, ~#aT_atan~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.20000000298))), ~#aT_atan~0.base, ~bvadd32(4bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.14285714924)), ~#aT_atan~0.base, ~bvadd32(8bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.11111110449))), ~#aT_atan~0.base, ~bvadd32(12bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.090908870101)), ~#aT_atan~0.base, ~bvadd32(16bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.076918758452))), ~#aT_atan~0.base, ~bvadd32(20bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.066610731184)), ~#aT_atan~0.base, ~bvadd32(24bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.058335702866))), ~#aT_atan~0.base, ~bvadd32(28bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.049768779427)), ~#aT_atan~0.base, ~bvadd32(32bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.036531571299))), ~#aT_atan~0.base, ~bvadd32(36bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.016285819933)), ~#aT_atan~0.base, ~bvadd32(40bv32, ~#aT_atan~0.offset), 4bv32);~one_atan~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~huge_atan~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30));~pi_o_4~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.78539818525));~pi_o_2~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.5707963705));~pi~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.141592741));~tiny_atan2~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E-30));~zero_atan2~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE());~pi_lo_atan2~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 8.7422776573E-8))); {104#true} is VALID [2022-02-20 16:42:07,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {104#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet41#1, main_#t~ret42#1, main_#t~ret43#1, main_#t~ret44#1, main_#t~short45#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~to_fp~FLOAT(currentRoundingMode, 1.0), ~Pluszero~FLOAT());main_~y~0#1 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume { :begin_inline_isfinite_float } true;isfinite_float_#in~x#1 := main_~y~0#1;havoc isfinite_float_#res#1;havoc isfinite_float_#t~mem40#1, isfinite_float_~#gf_u~6#1.base, isfinite_float_~#gf_u~6#1.offset, isfinite_float_~x#1, isfinite_float_~ix~3#1;isfinite_float_~x#1 := isfinite_float_#in~x#1;havoc isfinite_float_~ix~3#1; {104#true} is VALID [2022-02-20 16:42:07,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {104#true} assume !true; {105#false} is VALID [2022-02-20 16:42:07,088 INFO L290 TraceCheckUtils]: 3: Hoare triple {105#false} isfinite_float_~ix~3#1 := ~bvand32(2147483647bv32, isfinite_float_~ix~3#1);isfinite_float_#res#1 := (if ~bvslt32(isfinite_float_~ix~3#1, 2139095040bv32) then 1bv32 else 0bv32); {105#false} is VALID [2022-02-20 16:42:07,088 INFO L290 TraceCheckUtils]: 4: Hoare triple {105#false} main_#t~ret42#1 := isfinite_float_#res#1;assume { :end_inline_isfinite_float } true; {105#false} is VALID [2022-02-20 16:42:07,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {105#false} assume 0bv32 != main_#t~ret42#1 && ~fp.gt~FLOAT(main_~y~0#1, ~Pluszero~FLOAT());havoc main_#t~ret42#1;assume { :begin_inline___ieee754_atan2f } true;__ieee754_atan2f_#in~y#1, __ieee754_atan2f_#in~x#1 := main_~y~0#1, main_~x~0#1;havoc __ieee754_atan2f_#res#1;havoc __ieee754_atan2f_#t~mem26#1, __ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset, __ieee754_atan2f_#t~mem27#1, __ieee754_atan2f_~#gf_u~3#1.base, __ieee754_atan2f_~#gf_u~3#1.offset, __ieee754_atan2f_#t~ret28#1, __ieee754_atan2f_#t~switch29#1, __ieee754_atan2f_#t~ite30#1, __ieee754_atan2f_#t~switch31#1, __ieee754_atan2f_#t~switch32#1, __ieee754_atan2f_#t~ite33#1, __ieee754_atan2f_#t~ret34#1, __ieee754_atan2f_#t~ret35#1, __ieee754_atan2f_#t~switch36#1, __ieee754_atan2f_#t~mem37#1, __ieee754_atan2f_~#gf_u~4#1.base, __ieee754_atan2f_~#gf_u~4#1.offset, __ieee754_atan2f_#t~mem38#1, __ieee754_atan2f_~#sf_u~1#1.base, __ieee754_atan2f_~#sf_u~1#1.offset, __ieee754_atan2f_~zh~0#1, __ieee754_atan2f_~y#1, __ieee754_atan2f_~x#1, __ieee754_atan2f_~z~1#1, __ieee754_atan2f_~k~0#1, __ieee754_atan2f_~m~0#1, __ieee754_atan2f_~hx~1#1, __ieee754_atan2f_~hy~0#1, __ieee754_atan2f_~ix~2#1, __ieee754_atan2f_~iy~0#1;__ieee754_atan2f_~y#1 := __ieee754_atan2f_#in~y#1;__ieee754_atan2f_~x#1 := __ieee754_atan2f_#in~x#1;havoc __ieee754_atan2f_~z~1#1;havoc __ieee754_atan2f_~k~0#1;havoc __ieee754_atan2f_~m~0#1;havoc __ieee754_atan2f_~hx~1#1;havoc __ieee754_atan2f_~hy~0#1;havoc __ieee754_atan2f_~ix~2#1;havoc __ieee754_atan2f_~iy~0#1; {105#false} is VALID [2022-02-20 16:42:07,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {105#false} assume !true; {105#false} is VALID [2022-02-20 16:42:07,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {105#false} __ieee754_atan2f_~ix~2#1 := ~bvand32(2147483647bv32, __ieee754_atan2f_~hx~1#1); {105#false} is VALID [2022-02-20 16:42:07,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {105#false} assume !true; {105#false} is VALID [2022-02-20 16:42:07,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {105#false} __ieee754_atan2f_~iy~0#1 := ~bvand32(2147483647bv32, __ieee754_atan2f_~hy~0#1); {105#false} is VALID [2022-02-20 16:42:07,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {105#false} assume ~bvsgt32(__ieee754_atan2f_~ix~2#1, 2139095040bv32) || ~bvsgt32(__ieee754_atan2f_~iy~0#1, 2139095040bv32);__ieee754_atan2f_#res#1 := ~fp.add~FLOAT(currentRoundingMode, __ieee754_atan2f_~x#1, __ieee754_atan2f_~y#1); {105#false} is VALID [2022-02-20 16:42:07,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {105#false} main_#t~ret43#1 := __ieee754_atan2f_#res#1;assume { :end_inline___ieee754_atan2f } true;main_~res~0#1 := main_#t~ret43#1;havoc main_#t~ret43#1;main_#t~short45#1 := ~fp.eq~FLOAT(main_~res~0#1, ~Pluszero~FLOAT()); {105#false} is VALID [2022-02-20 16:42:07,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {105#false} assume !main_#t~short45#1; {105#false} is VALID [2022-02-20 16:42:07,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {105#false} assume !main_#t~short45#1;havoc main_#t~ret44#1;havoc main_#t~short45#1; {105#false} is VALID [2022-02-20 16:42:07,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {105#false} assume !false; {105#false} is VALID [2022-02-20 16:42:07,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:42:07,091 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:42:07,092 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:42:07,092 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667241129] [2022-02-20 16:42:07,093 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [667241129] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:07,093 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:07,093 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:42:07,095 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861146098] [2022-02-20 16:42:07,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:07,102 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 16:42:07,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:07,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:07,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:07,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:42:07,148 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:42:07,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:42:07,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:42:07,163 INFO L87 Difference]: Start difference. First operand has 101 states, 93 states have (on average 1.6451612903225807) internal successors, (153), 94 states have internal predecessors, (153), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:22,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:22,606 INFO L93 Difference]: Finished difference Result 200 states and 324 transitions. [2022-02-20 16:42:22,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:42:22,607 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 16:42:22,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:22,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 324 transitions. [2022-02-20 16:42:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:22,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 324 transitions. [2022-02-20 16:42:22,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 324 transitions. [2022-02-20 16:42:26,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 324 edges. 324 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:26,405 INFO L225 Difference]: With dead ends: 200 [2022-02-20 16:42:26,405 INFO L226 Difference]: Without dead ends: 97 [2022-02-20 16:42:26,408 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:42:26,413 INFO L933 BasicCegarLoop]: 142 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, 142 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:42:26,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:42:26,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-02-20 16:42:26,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-02-20 16:42:26,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:26,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 97 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 90 states have internal predecessors, (129), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:42:26,446 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 97 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 90 states have internal predecessors, (129), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:42:26,447 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 97 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 90 states have internal predecessors, (129), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:42:26,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:26,453 INFO L93 Difference]: Finished difference Result 97 states and 137 transitions. [2022-02-20 16:42:26,454 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 137 transitions. [2022-02-20 16:42:26,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:26,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:26,457 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 90 states have internal predecessors, (129), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 97 states. [2022-02-20 16:42:26,460 INFO L87 Difference]: Start difference. First operand has 97 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 90 states have internal predecessors, (129), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 97 states. [2022-02-20 16:42:26,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:26,464 INFO L93 Difference]: Finished difference Result 97 states and 137 transitions. [2022-02-20 16:42:26,464 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 137 transitions. [2022-02-20 16:42:26,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:26,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:26,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:26,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:26,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 90 states have internal predecessors, (129), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:42:26,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 137 transitions. [2022-02-20 16:42:26,473 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 137 transitions. Word has length 15 [2022-02-20 16:42:26,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:26,473 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 137 transitions. [2022-02-20 16:42:26,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:26,474 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 137 transitions. [2022-02-20 16:42:26,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 16:42:26,475 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:26,475 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:42:26,505 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:42:26,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:42:26,705 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:26,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:26,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1163254418, now seen corresponding path program 1 times [2022-02-20 16:42:26,706 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:42:26,706 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1813529409] [2022-02-20 16:42:26,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:26,710 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:42:26,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:42:26,712 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:42:26,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:42:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:27,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 30 conjunts are in the unsatisfiable core [2022-02-20 16:42:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:27,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:42:27,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 16:42:29,432 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-02-20 16:42:29,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 42 [2022-02-20 16:42:30,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2022-02-20 16:42:31,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {691#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);~#atanhi_atan~0.base, ~#atanhi_atan~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(16bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.46364760399)), ~#atanhi_atan~0.base, ~#atanhi_atan~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.78539812565)), ~#atanhi_atan~0.base, ~bvadd32(4bv32, ~#atanhi_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.98279368877)), ~#atanhi_atan~0.base, ~bvadd32(8bv32, ~#atanhi_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.5707962513)), ~#atanhi_atan~0.base, ~bvadd32(12bv32, ~#atanhi_atan~0.offset), 4bv32);~#atanlo_atan~0.base, ~#atanlo_atan~0.offset := 5bv32, 0bv32;call #Ultimate.allocInit(16bv32, 5bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 5.012158244E-9)), ~#atanlo_atan~0.base, ~#atanlo_atan~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.7748947079E-8)), ~#atanlo_atan~0.base, ~bvadd32(4bv32, ~#atanlo_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.447321717E-8)), ~#atanlo_atan~0.base, ~bvadd32(8bv32, ~#atanlo_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.5497894159E-8)), ~#atanlo_atan~0.base, ~bvadd32(12bv32, ~#atanlo_atan~0.offset), 4bv32);~#aT_atan~0.base, ~#aT_atan~0.offset := 6bv32, 0bv32;call #Ultimate.allocInit(44bv32, 6bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.33333334327)), ~#aT_atan~0.base, ~#aT_atan~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.20000000298))), ~#aT_atan~0.base, ~bvadd32(4bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.14285714924)), ~#aT_atan~0.base, ~bvadd32(8bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.11111110449))), ~#aT_atan~0.base, ~bvadd32(12bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.090908870101)), ~#aT_atan~0.base, ~bvadd32(16bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.076918758452))), ~#aT_atan~0.base, ~bvadd32(20bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.066610731184)), ~#aT_atan~0.base, ~bvadd32(24bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.058335702866))), ~#aT_atan~0.base, ~bvadd32(28bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.049768779427)), ~#aT_atan~0.base, ~bvadd32(32bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.036531571299))), ~#aT_atan~0.base, ~bvadd32(36bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.016285819933)), ~#aT_atan~0.base, ~bvadd32(40bv32, ~#aT_atan~0.offset), 4bv32);~one_atan~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~huge_atan~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30));~pi_o_4~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.78539818525));~pi_o_2~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.5707963705));~pi~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.141592741));~tiny_atan2~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E-30));~zero_atan2~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE());~pi_lo_atan2~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 8.7422776573E-8))); {691#true} is VALID [2022-02-20 16:42:31,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {691#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet41#1, main_#t~ret42#1, main_#t~ret43#1, main_#t~ret44#1, main_#t~short45#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~to_fp~FLOAT(currentRoundingMode, 1.0), ~Pluszero~FLOAT());main_~y~0#1 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume { :begin_inline_isfinite_float } true;isfinite_float_#in~x#1 := main_~y~0#1;havoc isfinite_float_#res#1;havoc isfinite_float_#t~mem40#1, isfinite_float_~#gf_u~6#1.base, isfinite_float_~#gf_u~6#1.offset, isfinite_float_~x#1, isfinite_float_~ix~3#1;isfinite_float_~x#1 := isfinite_float_#in~x#1;havoc isfinite_float_~ix~3#1; {699#(and (= |ULTIMATE.start_isfinite_float_~x#1| |ULTIMATE.start_main_~y~0#1|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-20 16:42:31,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {699#(and (= |ULTIMATE.start_isfinite_float_~x#1| |ULTIMATE.start_main_~y~0#1|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|)))} call isfinite_float_~#gf_u~6#1.base, isfinite_float_~#gf_u~6#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isfinite_float_~x#1, isfinite_float_~#gf_u~6#1.base, isfinite_float_~#gf_u~6#1.offset, 4bv32);call isfinite_float_#t~mem40#1 := read~intINTTYPE4(isfinite_float_~#gf_u~6#1.base, isfinite_float_~#gf_u~6#1.offset, 4bv32);isfinite_float_~ix~3#1 := isfinite_float_#t~mem40#1;havoc isfinite_float_#t~mem40#1;call ULTIMATE.dealloc(isfinite_float_~#gf_u~6#1.base, isfinite_float_~#gf_u~6#1.offset);havoc isfinite_float_~#gf_u~6#1.base, isfinite_float_~#gf_u~6#1.offset; {703#(and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|)) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_isfinite_float_~ix~3#1| (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))))))} is VALID [2022-02-20 16:42:31,871 INFO L290 TraceCheckUtils]: 3: Hoare triple {703#(and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|)) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_isfinite_float_~ix~3#1| (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))))))} goto; {703#(and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|)) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_isfinite_float_~ix~3#1| (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))))))} is VALID [2022-02-20 16:42:31,874 INFO L290 TraceCheckUtils]: 4: Hoare triple {703#(and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|)) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_isfinite_float_~ix~3#1| (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))))))} isfinite_float_~ix~3#1 := ~bvand32(2147483647bv32, isfinite_float_~ix~3#1);isfinite_float_#res#1 := (if ~bvslt32(isfinite_float_~ix~3#1, 2139095040bv32) then 1bv32 else 0bv32); {710#(and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|)) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_main_~y~0#1|) (or (and (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv0 32)) (not (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)))) (and (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv1 32)) (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)))))))} is VALID [2022-02-20 16:42:31,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {710#(and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|)) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_main_~y~0#1|) (or (and (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv0 32)) (not (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)))) (and (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv1 32)) (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)))))))} main_#t~ret42#1 := isfinite_float_#res#1;assume { :end_inline_isfinite_float } true; {714#(and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|)) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_main_~y~0#1|) (or (and (= |ULTIMATE.start_main_#t~ret42#1| (_ bv1 32)) (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) (_ bv2139095040 32))) (and (= |ULTIMATE.start_main_#t~ret42#1| (_ bv0 32)) (not (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) (_ bv2139095040 32))))))))} is VALID [2022-02-20 16:42:31,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {714#(and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|)) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_main_~y~0#1|) (or (and (= |ULTIMATE.start_main_#t~ret42#1| (_ bv1 32)) (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) (_ bv2139095040 32))) (and (= |ULTIMATE.start_main_#t~ret42#1| (_ bv0 32)) (not (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) (_ bv2139095040 32))))))))} assume 0bv32 != main_#t~ret42#1 && ~fp.gt~FLOAT(main_~y~0#1, ~Pluszero~FLOAT());havoc main_#t~ret42#1;assume { :begin_inline___ieee754_atan2f } true;__ieee754_atan2f_#in~y#1, __ieee754_atan2f_#in~x#1 := main_~y~0#1, main_~x~0#1;havoc __ieee754_atan2f_#res#1;havoc __ieee754_atan2f_#t~mem26#1, __ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset, __ieee754_atan2f_#t~mem27#1, __ieee754_atan2f_~#gf_u~3#1.base, __ieee754_atan2f_~#gf_u~3#1.offset, __ieee754_atan2f_#t~ret28#1, __ieee754_atan2f_#t~switch29#1, __ieee754_atan2f_#t~ite30#1, __ieee754_atan2f_#t~switch31#1, __ieee754_atan2f_#t~switch32#1, __ieee754_atan2f_#t~ite33#1, __ieee754_atan2f_#t~ret34#1, __ieee754_atan2f_#t~ret35#1, __ieee754_atan2f_#t~switch36#1, __ieee754_atan2f_#t~mem37#1, __ieee754_atan2f_~#gf_u~4#1.base, __ieee754_atan2f_~#gf_u~4#1.offset, __ieee754_atan2f_#t~mem38#1, __ieee754_atan2f_~#sf_u~1#1.base, __ieee754_atan2f_~#sf_u~1#1.offset, __ieee754_atan2f_~zh~0#1, __ieee754_atan2f_~y#1, __ieee754_atan2f_~x#1, __ieee754_atan2f_~z~1#1, __ieee754_atan2f_~k~0#1, __ieee754_atan2f_~m~0#1, __ieee754_atan2f_~hx~1#1, __ieee754_atan2f_~hy~0#1, __ieee754_atan2f_~ix~2#1, __ieee754_atan2f_~iy~0#1;__ieee754_atan2f_~y#1 := __ieee754_atan2f_#in~y#1;__ieee754_atan2f_~x#1 := __ieee754_atan2f_#in~x#1;havoc __ieee754_atan2f_~z~1#1;havoc __ieee754_atan2f_~k~0#1;havoc __ieee754_atan2f_~m~0#1;havoc __ieee754_atan2f_~hx~1#1;havoc __ieee754_atan2f_~hy~0#1;havoc __ieee754_atan2f_~ix~2#1;havoc __ieee754_atan2f_~iy~0#1; {718#(and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~x#1|)) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6| (_ BitVec 32))) (and (fp.gt (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32)))) (_ +zero 8 24)) (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32)))) |ULTIMATE.start___ieee754_atan2f_~y#1|))))} is VALID [2022-02-20 16:42:31,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {718#(and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~x#1|)) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6| (_ BitVec 32))) (and (fp.gt (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32)))) (_ +zero 8 24)) (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~6#1.base_6|) (_ bv0 32)))) |ULTIMATE.start___ieee754_atan2f_~y#1|))))} call __ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_atan2f_~x#1, __ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset, 4bv32);call __ieee754_atan2f_#t~mem26#1 := read~intINTTYPE4(__ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset, 4bv32);__ieee754_atan2f_~hx~1#1 := __ieee754_atan2f_#t~mem26#1;havoc __ieee754_atan2f_#t~mem26#1;call ULTIMATE.dealloc(__ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset);havoc __ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset; {722#(and (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32)) |ULTIMATE.start___ieee754_atan2f_~hx~1#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32)))) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (fp.gt (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (_ +zero 8 24)) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) |ULTIMATE.start___ieee754_atan2f_~y#1|) (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_1) (_ bv2139095040 32)))))} is VALID [2022-02-20 16:42:31,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {722#(and (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32)) |ULTIMATE.start___ieee754_atan2f_~hx~1#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32)))) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (fp.gt (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (_ +zero 8 24)) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) |ULTIMATE.start___ieee754_atan2f_~y#1|) (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_1) (_ bv2139095040 32)))))} goto; {722#(and (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32)) |ULTIMATE.start___ieee754_atan2f_~hx~1#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32)))) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (fp.gt (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (_ +zero 8 24)) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) |ULTIMATE.start___ieee754_atan2f_~y#1|) (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_1) (_ bv2139095040 32)))))} is VALID [2022-02-20 16:42:31,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {722#(and (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32)) |ULTIMATE.start___ieee754_atan2f_~hx~1#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32)))) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (fp.gt (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (_ +zero 8 24)) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) |ULTIMATE.start___ieee754_atan2f_~y#1|) (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_1) (_ bv2139095040 32)))))} __ieee754_atan2f_~ix~2#1 := ~bvand32(2147483647bv32, __ieee754_atan2f_~hx~1#1); {729#(and (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32)))) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (fp.gt (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (_ +zero 8 24)) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) |ULTIMATE.start___ieee754_atan2f_~y#1|) (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_1) (_ bv2139095040 32)))))} is VALID [2022-02-20 16:42:31,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {729#(and (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32)))) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (fp.gt (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (_ +zero 8 24)) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) |ULTIMATE.start___ieee754_atan2f_~y#1|) (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_1) (_ bv2139095040 32)))))} call __ieee754_atan2f_~#gf_u~3#1.base, __ieee754_atan2f_~#gf_u~3#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_atan2f_~y#1, __ieee754_atan2f_~#gf_u~3#1.base, __ieee754_atan2f_~#gf_u~3#1.offset, 4bv32);call __ieee754_atan2f_#t~mem27#1 := read~intINTTYPE4(__ieee754_atan2f_~#gf_u~3#1.base, __ieee754_atan2f_~#gf_u~3#1.offset, 4bv32);__ieee754_atan2f_~hy~0#1 := __ieee754_atan2f_#t~mem27#1;havoc __ieee754_atan2f_#t~mem27#1;call ULTIMATE.dealloc(__ieee754_atan2f_~#gf_u~3#1.base, __ieee754_atan2f_~#gf_u~3#1.offset);havoc __ieee754_atan2f_~#gf_u~3#1.base, __ieee754_atan2f_~#gf_u~3#1.offset; {733#(and (exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| (bvand (_ bv2147483647 32) v_arrayElimCell_2)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))))) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (fp.gt (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (_ +zero 8 24)) (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_1) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|))))))} is VALID [2022-02-20 16:42:31,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {733#(and (exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| (bvand (_ bv2147483647 32) v_arrayElimCell_2)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))))) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (fp.gt (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (_ +zero 8 24)) (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_1) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|))))))} goto; {733#(and (exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| (bvand (_ bv2147483647 32) v_arrayElimCell_2)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))))) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (fp.gt (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (_ +zero 8 24)) (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_1) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|))))))} is VALID [2022-02-20 16:42:31,918 INFO L290 TraceCheckUtils]: 12: Hoare triple {733#(and (exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| (bvand (_ bv2147483647 32) v_arrayElimCell_2)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))))) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (fp.gt (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (_ +zero 8 24)) (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_1) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|))))))} __ieee754_atan2f_~iy~0#1 := ~bvand32(2147483647bv32, __ieee754_atan2f_~hy~0#1); {740#(and (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start___ieee754_atan2f_~hy~0#1| (_ BitVec 32))) (and (fp.gt (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (_ +zero 8 24)) (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_1) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|))) (= |ULTIMATE.start___ieee754_atan2f_~iy~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|)))) (exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| (bvand (_ bv2147483647 32) v_arrayElimCell_2)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))))))} is VALID [2022-02-20 16:42:31,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {740#(and (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start___ieee754_atan2f_~hy~0#1| (_ BitVec 32))) (and (fp.gt (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (_ +zero 8 24)) (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_1) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|))) (= |ULTIMATE.start___ieee754_atan2f_~iy~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|)))) (exists ((currentRoundingMode RoundingMode) (v_arrayElimCell_2 (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| (bvand (_ bv2147483647 32) v_arrayElimCell_2)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))))))} assume ~bvsgt32(__ieee754_atan2f_~ix~2#1, 2139095040bv32) || ~bvsgt32(__ieee754_atan2f_~iy~0#1, 2139095040bv32);__ieee754_atan2f_#res#1 := ~fp.add~FLOAT(currentRoundingMode, __ieee754_atan2f_~x#1, __ieee754_atan2f_~y#1); {692#false} is VALID [2022-02-20 16:42:31,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {692#false} main_#t~ret43#1 := __ieee754_atan2f_#res#1;assume { :end_inline___ieee754_atan2f } true;main_~res~0#1 := main_#t~ret43#1;havoc main_#t~ret43#1;main_#t~short45#1 := ~fp.eq~FLOAT(main_~res~0#1, ~Pluszero~FLOAT()); {692#false} is VALID [2022-02-20 16:42:31,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {692#false} assume !main_#t~short45#1; {692#false} is VALID [2022-02-20 16:42:31,938 INFO L290 TraceCheckUtils]: 16: Hoare triple {692#false} assume !main_#t~short45#1;havoc main_#t~ret44#1;havoc main_#t~short45#1; {692#false} is VALID [2022-02-20 16:42:31,939 INFO L290 TraceCheckUtils]: 17: Hoare triple {692#false} assume !false; {692#false} is VALID [2022-02-20 16:42:31,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:42:31,939 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:42:31,939 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:42:31,939 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1813529409] [2022-02-20 16:42:31,939 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1813529409] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:31,940 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:31,940 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 16:42:31,940 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819355221] [2022-02-20 16:42:31,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:31,941 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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:42:31,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:31,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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:42:32,063 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:42:32,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 16:42:32,063 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:42:32,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 16:42:32,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-02-20 16:42:32,064 INFO L87 Difference]: Start difference. First operand 97 states and 137 transitions. Second operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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)