./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_0670.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_0670.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 ef3aead09e1d04146222ba824ba5fd2f951ea3a53aa52ba41e6fea5dd6ebb3d5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:40:37,884 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:40:37,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:40:37,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:40:37,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:40:37,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:40:37,906 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:40:37,908 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:40:37,909 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:40:37,909 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:40:37,910 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:40:37,911 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:40:37,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:40:37,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:40:37,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:40:37,914 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:40:37,914 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:40:37,915 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:40:37,916 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:40:37,917 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:40:37,918 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:40:37,919 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:40:37,920 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:40:37,920 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:40:37,922 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:40:37,922 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:40:37,923 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:40:37,923 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:40:37,924 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:40:37,924 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:40:37,925 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:40:37,925 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:40:37,926 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:40:37,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:40:37,927 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:40:37,927 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:40:37,928 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:40:37,928 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:40:37,928 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:40:37,929 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:40:37,929 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:40:37,930 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:40:37,944 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:40:37,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:40:37,945 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:40:37,945 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:40:37,946 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:40:37,946 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:40:37,946 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:40:37,946 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:40:37,947 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:40:37,947 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:40:37,947 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:40:37,947 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:40:37,947 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:40:37,948 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:40:37,948 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:40:37,948 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:40:37,948 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:40:37,948 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:40:37,948 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:40:37,949 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:40:37,949 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:40:37,949 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:40:37,949 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:40:37,949 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:40:37,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:40:37,950 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:40:37,950 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:40:37,950 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:40:37,950 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:40:37,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:40:37,951 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:40:37,951 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:40:37,951 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:40:37,951 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 -> ef3aead09e1d04146222ba824ba5fd2f951ea3a53aa52ba41e6fea5dd6ebb3d5 [2022-02-20 16:40:38,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:40:38,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:40:38,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:40:38,106 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:40:38,107 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:40:38,107 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0670.c [2022-02-20 16:40:38,143 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a648a2116/1cca4b92f4424d97aeeafeeb4e24e986/FLAG6759b6cc9 [2022-02-20 16:40:38,555 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:40:38,556 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0670.c [2022-02-20 16:40:38,574 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a648a2116/1cca4b92f4424d97aeeafeeb4e24e986/FLAG6759b6cc9 [2022-02-20 16:40:38,970 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a648a2116/1cca4b92f4424d97aeeafeeb4e24e986 [2022-02-20 16:40:38,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:40:38,980 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:40:38,999 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:40:39,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:40:39,002 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:40:39,003 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:40:38" (1/1) ... [2022-02-20 16:40:39,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e079e56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:39, skipping insertion in model container [2022-02-20 16:40:39,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:40:38" (1/1) ... [2022-02-20 16:40:39,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:40:39,021 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:40:39,170 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_0670.c[5373,5386] [2022-02-20 16:40:39,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:40:39,185 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:40:39,243 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_0670.c[5373,5386] [2022-02-20 16:40:39,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:40:39,260 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:40:39,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:39 WrapperNode [2022-02-20 16:40:39,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:40:39,261 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:40:39,261 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:40:39,262 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:40:39,277 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:40:39" (1/1) ... [2022-02-20 16:40:39,295 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:40:39" (1/1) ... [2022-02-20 16:40:39,327 INFO L137 Inliner]: procedures = 20, calls = 82, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 272 [2022-02-20 16:40:39,328 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:40:39,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:40:39,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:40:39,328 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:40:39,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:39" (1/1) ... [2022-02-20 16:40:39,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:39" (1/1) ... [2022-02-20 16:40:39,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:39" (1/1) ... [2022-02-20 16:40:39,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:39" (1/1) ... [2022-02-20 16:40:39,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:39" (1/1) ... [2022-02-20 16:40:39,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:39" (1/1) ... [2022-02-20 16:40:39,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:39" (1/1) ... [2022-02-20 16:40:39,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:40:39,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:40:39,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:40:39,363 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:40:39,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:39" (1/1) ... [2022-02-20 16:40:39,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:40:39,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:40:39,389 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:40:39,398 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:40:39,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:40:39,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:40:39,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:40:39,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:40:39,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:40:39,414 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2022-02-20 16:40:39,415 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2022-02-20 16:40:39,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:40:39,415 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2022-02-20 16:40:39,415 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2022-02-20 16:40:39,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:40:39,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:40:39,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:40:39,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-02-20 16:40:39,416 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2022-02-20 16:40:39,416 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2022-02-20 16:40:39,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:40:39,481 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:40:39,482 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:40:39,955 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:40:39,964 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:40:39,967 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-02-20 16:40:39,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:40:39 BoogieIcfgContainer [2022-02-20 16:40:39,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:40:39,972 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:40:39,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:40:39,975 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:40:39,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:40:38" (1/3) ... [2022-02-20 16:40:39,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@375ffb21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:40:39, skipping insertion in model container [2022-02-20 16:40:39,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:39" (2/3) ... [2022-02-20 16:40:39,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@375ffb21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:40:39, skipping insertion in model container [2022-02-20 16:40:39,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:40:39" (3/3) ... [2022-02-20 16:40:39,981 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0670.c [2022-02-20 16:40:39,985 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:40:39,986 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:40:40,021 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:40:40,027 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:40:40,027 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:40:40,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 103 states have (on average 1.6990291262135921) internal successors, (175), 104 states have internal predecessors, (175), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 16:40:40,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 16:40:40,052 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:40:40,052 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:40:40,053 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:40:40,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:40:40,057 INFO L85 PathProgramCache]: Analyzing trace with hash -40193531, now seen corresponding path program 1 times [2022-02-20 16:40:40,063 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:40:40,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090339324] [2022-02-20 16:40:40,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:40:40,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:40:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:40:40,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:40:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:40:40,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {118#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {118#true} is VALID [2022-02-20 16:40:40,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#true} assume true; {118#true} is VALID [2022-02-20 16:40:40,229 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118#true} {118#true} #426#return; {118#true} is VALID [2022-02-20 16:40:40,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-20 16:40:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:40:40,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {118#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {118#true} is VALID [2022-02-20 16:40:40,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#true} assume true; {118#true} is VALID [2022-02-20 16:40:40,245 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118#true} {119#false} #436#return; {119#false} is VALID [2022-02-20 16:40:40,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {118#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(20, 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); {118#true} is VALID [2022-02-20 16:40:40,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_#t~short47#1, main_#t~ret48#1, main_#t~ret49#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := main_#t~nondet43#1;havoc main_#t~nondet43#1;main_~y~0#1 := main_#t~nondet44#1;havoc main_#t~nondet44#1; {118#true} is VALID [2022-02-20 16:40:40,246 INFO L272 TraceCheckUtils]: 2: Hoare triple {118#true} call main_#t~ret45#1 := isnan_float(main_~x~0#1); {118#true} is VALID [2022-02-20 16:40:40,246 INFO L290 TraceCheckUtils]: 3: Hoare triple {118#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {118#true} is VALID [2022-02-20 16:40:40,247 INFO L290 TraceCheckUtils]: 4: Hoare triple {118#true} assume true; {118#true} is VALID [2022-02-20 16:40:40,247 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {118#true} {118#true} #426#return; {118#true} is VALID [2022-02-20 16:40:40,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {118#true} assume -2147483648 <= main_#t~ret45#1 && main_#t~ret45#1 <= 2147483647;main_#t~short47#1 := 0 != main_#t~ret45#1; {118#true} is VALID [2022-02-20 16:40:40,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {118#true} assume main_#t~short47#1; {118#true} is VALID [2022-02-20 16:40:40,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {118#true} assume main_#t~short47#1;havoc main_#t~ret45#1;havoc main_#t~ret46#1;havoc main_#t~short47#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#true} is VALID [2022-02-20 16:40:40,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {118#true} assume !true; {119#false} is VALID [2022-02-20 16:40:40,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {119#false} assume 0 == __ieee754_atan2f_~hx~1#1;__ieee754_atan2f_~ix~2#1 := 0; {119#false} is VALID [2022-02-20 16:40:40,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {119#false} assume !true; {119#false} is VALID [2022-02-20 16:40:40,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {119#false} assume 0 == __ieee754_atan2f_~hy~0#1;__ieee754_atan2f_~iy~0#1 := 0; {119#false} is VALID [2022-02-20 16:40:40,249 INFO L290 TraceCheckUtils]: 13: Hoare triple {119#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); {119#false} is VALID [2022-02-20 16:40:40,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {119#false} main_#t~ret48#1 := __ieee754_atan2f_#res#1;assume { :end_inline___ieee754_atan2f } true;main_~res~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1; {119#false} is VALID [2022-02-20 16:40:40,250 INFO L272 TraceCheckUtils]: 15: Hoare triple {119#false} call main_#t~ret49#1 := isnan_float(main_~res~0#1); {118#true} is VALID [2022-02-20 16:40:40,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {118#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {118#true} is VALID [2022-02-20 16:40:40,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {118#true} assume true; {118#true} is VALID [2022-02-20 16:40:40,250 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {118#true} {119#false} #436#return; {119#false} is VALID [2022-02-20 16:40:40,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {119#false} assume -2147483648 <= main_#t~ret49#1 && main_#t~ret49#1 <= 2147483647; {119#false} is VALID [2022-02-20 16:40:40,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {119#false} assume 0 == main_#t~ret49#1;havoc main_#t~ret49#1; {119#false} is VALID [2022-02-20 16:40:40,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {119#false} assume !false; {119#false} is VALID [2022-02-20 16:40:40,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 16:40:40,253 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:40:40,253 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090339324] [2022-02-20 16:40:40,253 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090339324] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:40:40,254 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:40:40,254 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:40:40,256 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304145317] [2022-02-20 16:40:40,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:40:40,261 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-02-20 16:40:40,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:40:40,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:40:40,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:40:40,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:40:40,286 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:40:40,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:40:40,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:40:40,311 INFO L87 Difference]: Start difference. First operand has 115 states, 103 states have (on average 1.6990291262135921) internal successors, (175), 104 states have internal predecessors, (175), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:40:40,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:40,454 INFO L93 Difference]: Finished difference Result 222 states and 370 transitions. [2022-02-20 16:40:40,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:40:40,454 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-02-20 16:40:40,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:40:40,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:40:40,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 370 transitions. [2022-02-20 16:40:40,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:40:40,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 370 transitions. [2022-02-20 16:40:40,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 370 transitions. [2022-02-20 16:40:40,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 370 edges. 370 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:40:40,733 INFO L225 Difference]: With dead ends: 222 [2022-02-20 16:40:40,734 INFO L226 Difference]: Without dead ends: 111 [2022-02-20 16:40:40,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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:40:40,738 INFO L933 BasicCegarLoop]: 168 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, 168 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:40:40,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:40:40,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-02-20 16:40:40,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-02-20 16:40:40,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:40:40,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 111 states, 100 states have (on average 1.49) internal successors, (149), 100 states have internal predecessors, (149), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 16:40:40,764 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 111 states, 100 states have (on average 1.49) internal successors, (149), 100 states have internal predecessors, (149), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 16:40:40,764 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 111 states, 100 states have (on average 1.49) internal successors, (149), 100 states have internal predecessors, (149), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 16:40:40,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:40,769 INFO L93 Difference]: Finished difference Result 111 states and 163 transitions. [2022-02-20 16:40:40,769 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2022-02-20 16:40:40,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:40:40,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:40:40,771 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 100 states have (on average 1.49) internal successors, (149), 100 states have internal predecessors, (149), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 111 states. [2022-02-20 16:40:40,771 INFO L87 Difference]: Start difference. First operand has 111 states, 100 states have (on average 1.49) internal successors, (149), 100 states have internal predecessors, (149), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 111 states. [2022-02-20 16:40:40,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:40,775 INFO L93 Difference]: Finished difference Result 111 states and 163 transitions. [2022-02-20 16:40:40,775 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2022-02-20 16:40:40,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:40:40,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:40:40,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:40:40,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:40:40,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 100 states have (on average 1.49) internal successors, (149), 100 states have internal predecessors, (149), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 16:40:40,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2022-02-20 16:40:40,782 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 22 [2022-02-20 16:40:40,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:40:40,782 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2022-02-20 16:40:40,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:40:40,782 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2022-02-20 16:40:40,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:40:40,783 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:40:40,783 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:40:40,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:40:40,784 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:40:40,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:40:40,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1680535149, now seen corresponding path program 1 times [2022-02-20 16:40:40,785 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:40:40,785 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961504970] [2022-02-20 16:40:40,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:40:40,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:40:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:40:40,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:40:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:40:40,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {728#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {728#true} is VALID [2022-02-20 16:40:40,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {728#true} assume true; {728#true} is VALID [2022-02-20 16:40:40,882 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {728#true} {728#true} #426#return; {728#true} is VALID [2022-02-20 16:40:40,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 16:40:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:40:40,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {728#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {728#true} is VALID [2022-02-20 16:40:40,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {728#true} assume true; {728#true} is VALID [2022-02-20 16:40:40,888 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {728#true} {729#false} #436#return; {729#false} is VALID [2022-02-20 16:40:40,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {728#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(20, 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); {728#true} is VALID [2022-02-20 16:40:40,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {728#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_#t~short47#1, main_#t~ret48#1, main_#t~ret49#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := main_#t~nondet43#1;havoc main_#t~nondet43#1;main_~y~0#1 := main_#t~nondet44#1;havoc main_#t~nondet44#1; {728#true} is VALID [2022-02-20 16:40:40,888 INFO L272 TraceCheckUtils]: 2: Hoare triple {728#true} call main_#t~ret45#1 := isnan_float(main_~x~0#1); {728#true} is VALID [2022-02-20 16:40:40,889 INFO L290 TraceCheckUtils]: 3: Hoare triple {728#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {728#true} is VALID [2022-02-20 16:40:40,889 INFO L290 TraceCheckUtils]: 4: Hoare triple {728#true} assume true; {728#true} is VALID [2022-02-20 16:40:40,889 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {728#true} {728#true} #426#return; {728#true} is VALID [2022-02-20 16:40:40,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {728#true} assume -2147483648 <= main_#t~ret45#1 && main_#t~ret45#1 <= 2147483647;main_#t~short47#1 := 0 != main_#t~ret45#1; {728#true} is VALID [2022-02-20 16:40:40,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {728#true} assume main_#t~short47#1; {728#true} is VALID [2022-02-20 16:40:40,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {728#true} assume main_#t~short47#1;havoc main_#t~ret45#1;havoc main_#t~ret46#1;havoc main_#t~short47#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; {728#true} is VALID [2022-02-20 16:40:40,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {728#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; {728#true} is VALID [2022-02-20 16:40:40,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {728#true} goto; {728#true} is VALID [2022-02-20 16:40:40,890 INFO L290 TraceCheckUtils]: 11: Hoare triple {728#true} assume 0 == __ieee754_atan2f_~hx~1#1;__ieee754_atan2f_~ix~2#1 := 0; {733#(= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0)} is VALID [2022-02-20 16:40:40,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {733#(= |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; {733#(= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0)} is VALID [2022-02-20 16:40:40,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {733#(= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0)} goto; {733#(= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0)} is VALID [2022-02-20 16:40:40,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {733#(= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0)} assume 0 == __ieee754_atan2f_~hy~0#1;__ieee754_atan2f_~iy~0#1 := 0; {734#(and (= |ULTIMATE.start___ieee754_atan2f_~iy~0#1| 0) (= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0))} is VALID [2022-02-20 16:40:40,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {734#(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); {729#false} is VALID [2022-02-20 16:40:40,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {729#false} main_#t~ret48#1 := __ieee754_atan2f_#res#1;assume { :end_inline___ieee754_atan2f } true;main_~res~0#1 := main_#t~ret48#1;havoc main_#t~ret48#1; {729#false} is VALID [2022-02-20 16:40:40,892 INFO L272 TraceCheckUtils]: 17: Hoare triple {729#false} call main_#t~ret49#1 := isnan_float(main_~res~0#1); {728#true} is VALID [2022-02-20 16:40:40,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {728#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {728#true} is VALID [2022-02-20 16:40:40,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {728#true} assume true; {728#true} is VALID [2022-02-20 16:40:40,893 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {728#true} {729#false} #436#return; {729#false} is VALID [2022-02-20 16:40:40,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {729#false} assume -2147483648 <= main_#t~ret49#1 && main_#t~ret49#1 <= 2147483647; {729#false} is VALID [2022-02-20 16:40:40,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {729#false} assume 0 == main_#t~ret49#1;havoc main_#t~ret49#1; {729#false} is VALID [2022-02-20 16:40:40,893 INFO L290 TraceCheckUtils]: 23: Hoare triple {729#false} assume !false; {729#false} is VALID [2022-02-20 16:40:40,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 16:40:40,894 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:40:40,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961504970] [2022-02-20 16:40:40,894 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961504970] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:40:40,894 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:40:40,894 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:40:40,894 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588950771] [2022-02-20 16:40:40,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:40:40,896 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-02-20 16:40:40,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:40:40,896 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:40:40,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:40:40,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:40:40,912 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:40:40,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:40:40,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:40:40,912 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:40:41,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:41,184 INFO L93 Difference]: Finished difference Result 233 states and 343 transitions. [2022-02-20 16:40:41,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:40:41,184 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-02-20 16:40:41,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:40:41,184 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:40:41,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 343 transitions. [2022-02-20 16:40:41,188 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:40:41,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 343 transitions. [2022-02-20 16:40:41,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 343 transitions. [2022-02-20 16:40:41,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 343 edges. 343 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:40:41,391 INFO L225 Difference]: With dead ends: 233 [2022-02-20 16:40:41,391 INFO L226 Difference]: Without dead ends: 157 [2022-02-20 16:40:41,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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:40:41,392 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 59 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:40:41,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 467 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:40:41,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-02-20 16:40:41,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 138. [2022-02-20 16:40:41,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:40:41,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 138 states, 127 states have (on average 1.5275590551181102) internal successors, (194), 127 states have internal predecessors, (194), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 16:40:41,400 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 138 states, 127 states have (on average 1.5275590551181102) internal successors, (194), 127 states have internal predecessors, (194), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 16:40:41,401 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 138 states, 127 states have (on average 1.5275590551181102) internal successors, (194), 127 states have internal predecessors, (194), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 16:40:41,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:41,405 INFO L93 Difference]: Finished difference Result 157 states and 230 transitions. [2022-02-20 16:40:41,405 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 230 transitions. [2022-02-20 16:40:41,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:40:41,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:40:41,407 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 127 states have (on average 1.5275590551181102) internal successors, (194), 127 states have internal predecessors, (194), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 157 states. [2022-02-20 16:40:41,407 INFO L87 Difference]: Start difference. First operand has 138 states, 127 states have (on average 1.5275590551181102) internal successors, (194), 127 states have internal predecessors, (194), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 157 states. [2022-02-20 16:40:41,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:41,412 INFO L93 Difference]: Finished difference Result 157 states and 230 transitions. [2022-02-20 16:40:41,412 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 230 transitions. [2022-02-20 16:40:41,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:40:41,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:40:41,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:40:41,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:40:41,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 127 states have (on average 1.5275590551181102) internal successors, (194), 127 states have internal predecessors, (194), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 16:40:41,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 208 transitions. [2022-02-20 16:40:41,417 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 208 transitions. Word has length 24 [2022-02-20 16:40:41,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:40:41,417 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 208 transitions. [2022-02-20 16:40:41,417 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:40:41,417 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 208 transitions. [2022-02-20 16:40:41,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 16:40:41,418 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:40:41,418 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 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:40:41,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:40:41,418 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:40:41,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:40:41,419 INFO L85 PathProgramCache]: Analyzing trace with hash -943081483, now seen corresponding path program 1 times [2022-02-20 16:40:41,419 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:40:41,419 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683913314] [2022-02-20 16:40:41,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:40:41,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:40:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:40:41,467 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:40:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:40:41,544 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:40:41,544 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:40:41,545 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:40:41,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:40:41,548 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:40:41,550 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:40:41,566 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret45 := isnan_float(~x~0); [2022-02-20 16:40:41,567 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getProgramExecutionAsString(UnprovableResult.java:132) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getLongDescription(UnprovableResult.java:125) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 16:40:41,569 INFO L158 Benchmark]: Toolchain (without parser) took 2589.55ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 82.5MB in the beginning and 58.4MB in the end (delta: 24.1MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. [2022-02-20 16:40:41,570 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 113.2MB. Free memory was 67.3MB in the beginning and 67.2MB in the end (delta: 45.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:40:41,570 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.32ms. Allocated memory is still 113.2MB. Free memory was 82.2MB in the beginning and 83.3MB in the end (delta: -1.1MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2022-02-20 16:40:41,571 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.40ms. Allocated memory is still 113.2MB. Free memory was 83.3MB in the beginning and 80.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:40:41,571 INFO L158 Benchmark]: Boogie Preprocessor took 33.76ms. Allocated memory is still 113.2MB. Free memory was 80.0MB in the beginning and 76.5MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:40:41,571 INFO L158 Benchmark]: RCFGBuilder took 607.58ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 76.5MB in the beginning and 105.6MB in the end (delta: -29.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-02-20 16:40:41,572 INFO L158 Benchmark]: TraceAbstraction took 1596.30ms. Allocated memory is still 136.3MB. Free memory was 104.9MB in the beginning and 58.4MB in the end (delta: 46.5MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. [2022-02-20 16:40:41,573 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 113.2MB. Free memory was 67.3MB in the beginning and 67.2MB in the end (delta: 45.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.32ms. Allocated memory is still 113.2MB. Free memory was 82.2MB in the beginning and 83.3MB in the end (delta: -1.1MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.40ms. Allocated memory is still 113.2MB. Free memory was 83.3MB in the beginning and 80.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.76ms. Allocated memory is still 113.2MB. Free memory was 80.0MB in the beginning and 76.5MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 607.58ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 76.5MB in the beginning and 105.6MB in the end (delta: -29.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1596.30ms. Allocated memory is still 136.3MB. Free memory was 104.9MB in the beginning and 58.4MB in the end (delta: 46.5MB). Peak memory consumption was 45.9MB. 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 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 16:40:41,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_0670.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 ef3aead09e1d04146222ba824ba5fd2f951ea3a53aa52ba41e6fea5dd6ebb3d5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:40:43,322 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:40:43,324 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:40:43,362 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:40:43,363 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:40:43,365 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:40:43,366 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:40:43,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:40:43,371 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:40:43,375 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:40:43,376 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:40:43,377 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:40:43,377 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:40:43,379 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:40:43,380 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:40:43,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:40:43,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:40:43,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:40:43,386 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:40:43,390 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:40:43,391 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:40:43,392 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:40:43,393 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:40:43,394 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:40:43,398 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:40:43,398 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:40:43,398 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:40:43,399 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:40:43,400 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:40:43,400 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:40:43,401 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:40:43,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:40:43,402 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:40:43,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:40:43,403 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:40:43,404 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:40:43,404 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:40:43,404 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:40:43,405 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:40:43,406 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:40:43,406 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:40:43,409 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:40:43,438 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:40:43,438 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:40:43,439 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:40:43,439 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:40:43,440 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:40:43,440 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:40:43,441 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:40:43,441 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:40:43,441 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:40:43,441 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:40:43,442 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:40:43,442 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:40:43,442 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:40:43,442 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:40:43,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:40:43,443 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:40:43,443 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:40:43,443 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:40:43,443 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:40:43,443 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:40:43,443 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:40:43,443 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:40:43,444 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:40:43,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:40:43,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:40:43,444 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:40:43,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:40:43,444 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:40:43,444 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:40:43,445 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:40:43,445 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:40:43,445 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:40:43,445 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:40:43,445 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:40:43,445 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:40:43,446 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:40:43,446 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 -> ef3aead09e1d04146222ba824ba5fd2f951ea3a53aa52ba41e6fea5dd6ebb3d5 [2022-02-20 16:40:43,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:40:43,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:40:43,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:40:43,754 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:40:43,755 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:40:43,756 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0670.c [2022-02-20 16:40:43,805 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/334482779/12780ffd302d4fac8903b83cb63e55f5/FLAG1701523a8 [2022-02-20 16:40:44,181 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:40:44,182 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0670.c [2022-02-20 16:40:44,187 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/334482779/12780ffd302d4fac8903b83cb63e55f5/FLAG1701523a8 [2022-02-20 16:40:44,595 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/334482779/12780ffd302d4fac8903b83cb63e55f5 [2022-02-20 16:40:44,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:40:44,598 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:40:44,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:40:44,600 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:40:44,602 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:40:44,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:40:44" (1/1) ... [2022-02-20 16:40:44,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ba23e19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:44, skipping insertion in model container [2022-02-20 16:40:44,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:40:44" (1/1) ... [2022-02-20 16:40:44,612 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:40:44,637 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:40:44,836 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_0670.c[5373,5386] [2022-02-20 16:40:44,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:40:44,890 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:40:44,923 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_0670.c[5373,5386] [2022-02-20 16:40:44,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:40:44,937 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:40:44,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:44 WrapperNode [2022-02-20 16:40:44,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:40:44,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:40:44,938 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:40:44,939 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:40:44,943 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:40:44" (1/1) ... [2022-02-20 16:40:44,953 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:40:44" (1/1) ... [2022-02-20 16:40:44,980 INFO L137 Inliner]: procedures = 23, calls = 82, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 234 [2022-02-20 16:40:44,981 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:40:44,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:40:44,981 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:40:44,981 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:40:44,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:44" (1/1) ... [2022-02-20 16:40:44,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:44" (1/1) ... [2022-02-20 16:40:44,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:44" (1/1) ... [2022-02-20 16:40:44,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:44" (1/1) ... [2022-02-20 16:40:45,007 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:44" (1/1) ... [2022-02-20 16:40:45,012 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:44" (1/1) ... [2022-02-20 16:40:45,014 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:44" (1/1) ... [2022-02-20 16:40:45,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:40:45,018 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:40:45,018 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:40:45,019 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:40:45,019 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:44" (1/1) ... [2022-02-20 16:40:45,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:40:45,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:40:45,050 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:40:45,067 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:40:45,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:40:45,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-02-20 16:40:45,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:40:45,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:40:45,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:40:45,084 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2022-02-20 16:40:45,084 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2022-02-20 16:40:45,084 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2022-02-20 16:40:45,084 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2022-02-20 16:40:45,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:40:45,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:40:45,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:40:45,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:40:45,085 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2022-02-20 16:40:45,085 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2022-02-20 16:40:45,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:40:45,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:40:45,151 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:40:45,152 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:40:57,154 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:40:57,163 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:40:57,163 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-02-20 16:40:57,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:40:57 BoogieIcfgContainer [2022-02-20 16:40:57,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:40:57,166 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:40:57,166 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:40:57,168 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:40:57,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:40:44" (1/3) ... [2022-02-20 16:40:57,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3e3f51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:40:57, skipping insertion in model container [2022-02-20 16:40:57,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:44" (2/3) ... [2022-02-20 16:40:57,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3e3f51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:40:57, skipping insertion in model container [2022-02-20 16:40:57,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:40:57" (3/3) ... [2022-02-20 16:40:57,185 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0670.c [2022-02-20 16:40:57,188 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:40:57,188 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:40:57,218 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:40:57,223 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:40:57,223 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:40:57,237 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 89 states have (on average 1.6292134831460674) internal successors, (145), 90 states have internal predecessors, (145), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 16:40:57,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 16:40:57,241 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:40:57,242 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:40:57,242 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:40:57,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:40:57,246 INFO L85 PathProgramCache]: Analyzing trace with hash 187834432, now seen corresponding path program 1 times [2022-02-20 16:40:57,264 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:40:57,264 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781312394] [2022-02-20 16:40:57,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:40:57,265 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:40:57,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:40:57,267 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:40:57,275 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:40:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:40:58,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:40:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:40:58,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:40:58,199 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(20bv32, 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:40:58,200 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~nondet39#1, main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~short43#1, main_#t~ret44#1, main_#t~ret45#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := main_#t~nondet39#1;havoc main_#t~nondet39#1;main_~y~0#1 := main_#t~nondet40#1;havoc main_#t~nondet40#1; {104#true} is VALID [2022-02-20 16:40:58,200 INFO L272 TraceCheckUtils]: 2: Hoare triple {104#true} call main_#t~ret41#1 := isnan_float(main_~x~0#1); {104#true} is VALID [2022-02-20 16:40:58,201 INFO L290 TraceCheckUtils]: 3: Hoare triple {104#true} ~x := #in~x;#res := (if !~fp.eq~FLOAT(~x, ~x) then 1bv32 else 0bv32); {104#true} is VALID [2022-02-20 16:40:58,201 INFO L290 TraceCheckUtils]: 4: Hoare triple {104#true} assume true; {104#true} is VALID [2022-02-20 16:40:58,201 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {104#true} {104#true} #345#return; {104#true} is VALID [2022-02-20 16:40:58,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {104#true} main_#t~short43#1 := 0bv32 != main_#t~ret41#1; {104#true} is VALID [2022-02-20 16:40:58,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {104#true} assume main_#t~short43#1; {104#true} is VALID [2022-02-20 16:40:58,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {104#true} assume main_#t~short43#1;havoc main_#t~ret41#1;havoc main_#t~ret42#1;havoc main_#t~short43#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; {104#true} is VALID [2022-02-20 16:40:58,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {104#true} assume !true; {105#false} is VALID [2022-02-20 16:40:58,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {105#false} __ieee754_atan2f_~ix~2#1 := ~bvand32(2147483647bv32, __ieee754_atan2f_~hx~1#1); {105#false} is VALID [2022-02-20 16:40:58,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {105#false} assume !true; {105#false} is VALID [2022-02-20 16:40:58,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {105#false} __ieee754_atan2f_~iy~0#1 := ~bvand32(2147483647bv32, __ieee754_atan2f_~hy~0#1); {105#false} is VALID [2022-02-20 16:40:58,203 INFO L290 TraceCheckUtils]: 13: 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:40:58,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {105#false} main_#t~ret44#1 := __ieee754_atan2f_#res#1;assume { :end_inline___ieee754_atan2f } true;main_~res~0#1 := main_#t~ret44#1;havoc main_#t~ret44#1; {105#false} is VALID [2022-02-20 16:40:58,204 INFO L272 TraceCheckUtils]: 15: Hoare triple {105#false} call main_#t~ret45#1 := isnan_float(main_~res~0#1); {105#false} is VALID [2022-02-20 16:40:58,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {105#false} ~x := #in~x;#res := (if !~fp.eq~FLOAT(~x, ~x) then 1bv32 else 0bv32); {105#false} is VALID [2022-02-20 16:40:58,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {105#false} assume true; {105#false} is VALID [2022-02-20 16:40:58,204 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {105#false} {105#false} #355#return; {105#false} is VALID [2022-02-20 16:40:58,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {105#false} assume 0bv32 == main_#t~ret45#1;havoc main_#t~ret45#1; {105#false} is VALID [2022-02-20 16:40:58,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {105#false} assume !false; {105#false} is VALID [2022-02-20 16:40:58,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:40:58,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:40:58,206 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:40:58,206 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [781312394] [2022-02-20 16:40:58,207 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [781312394] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:40:58,207 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:40:58,207 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:40:58,208 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651508228] [2022-02-20 16:40:58,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:40:58,212 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-02-20 16:40:58,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:40:58,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:40:58,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:40:58,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:40:58,260 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:40:58,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:40:58,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:40:58,276 INFO L87 Difference]: Start difference. First operand has 101 states, 89 states have (on average 1.6292134831460674) internal successors, (145), 90 states have internal predecessors, (145), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:41:11,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:41:11,169 INFO L93 Difference]: Finished difference Result 194 states and 310 transitions. [2022-02-20 16:41:11,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:41:11,170 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-02-20 16:41:11,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:41:11,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:41:11,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 310 transitions. [2022-02-20 16:41:11,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:41:11,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 310 transitions. [2022-02-20 16:41:11,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 310 transitions. [2022-02-20 16:41:14,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 310 edges. 310 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:41:14,856 INFO L225 Difference]: With dead ends: 194 [2022-02-20 16:41:14,856 INFO L226 Difference]: Without dead ends: 97 [2022-02-20 16:41:14,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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:14,860 INFO L933 BasicCegarLoop]: 144 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, 144 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:14,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 144 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:14,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-02-20 16:41:14,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-02-20 16:41:14,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:41:14,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 97 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 86 states have internal predecessors, (125), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 16:41:14,884 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 97 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 86 states have internal predecessors, (125), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 16:41:14,884 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 97 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 86 states have internal predecessors, (125), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 16:41:14,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:41:14,890 INFO L93 Difference]: Finished difference Result 97 states and 139 transitions. [2022-02-20 16:41:14,890 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2022-02-20 16:41:14,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:41:14,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:41:14,891 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 86 states have internal predecessors, (125), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 97 states. [2022-02-20 16:41:14,891 INFO L87 Difference]: Start difference. First operand has 97 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 86 states have internal predecessors, (125), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 97 states. [2022-02-20 16:41:14,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:41:14,896 INFO L93 Difference]: Finished difference Result 97 states and 139 transitions. [2022-02-20 16:41:14,896 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2022-02-20 16:41:14,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:41:14,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:41:14,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:41:14,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:41:14,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 86 states have internal predecessors, (125), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 16:41:14,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2022-02-20 16:41:14,901 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 21 [2022-02-20 16:41:14,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:41:14,902 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2022-02-20 16:41:14,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:41:14,902 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2022-02-20 16:41:14,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 16:41:14,903 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:41:14,903 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:41:14,928 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:41:15,127 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:41:15,127 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:41:15,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:41:15,128 INFO L85 PathProgramCache]: Analyzing trace with hash 769881417, now seen corresponding path program 1 times [2022-02-20 16:41:15,128 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:41:15,128 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1827280212] [2022-02-20 16:41:15,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:41:15,129 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:41:15,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:41:15,130 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:41:15,135 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:41:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:41:15,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 16:41:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:41:15,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:41:19,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {701#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 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))); {706#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:41:19,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {706#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet39#1, main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~short43#1, main_#t~ret44#1, main_#t~ret45#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := main_#t~nondet39#1;havoc main_#t~nondet39#1;main_~y~0#1 := main_#t~nondet40#1;havoc main_#t~nondet40#1; {706#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:41:19,688 INFO L272 TraceCheckUtils]: 2: Hoare triple {706#(= currentRoundingMode roundNearestTiesToEven)} call main_#t~ret41#1 := isnan_float(main_~x~0#1); {706#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:41:19,690 INFO L290 TraceCheckUtils]: 3: Hoare triple {706#(= currentRoundingMode roundNearestTiesToEven)} ~x := #in~x;#res := (if !~fp.eq~FLOAT(~x, ~x) then 1bv32 else 0bv32); {716#(and (or (and (= |isnan_float_#res| (_ bv0 32)) (fp.eq |isnan_float_#in~x| |isnan_float_#in~x|)) (and (not (fp.eq |isnan_float_#in~x| |isnan_float_#in~x|)) (= |isnan_float_#res| (_ bv1 32)))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:41:19,690 INFO L290 TraceCheckUtils]: 4: Hoare triple {716#(and (or (and (= |isnan_float_#res| (_ bv0 32)) (fp.eq |isnan_float_#in~x| |isnan_float_#in~x|)) (and (not (fp.eq |isnan_float_#in~x| |isnan_float_#in~x|)) (= |isnan_float_#res| (_ bv1 32)))) (= currentRoundingMode roundNearestTiesToEven))} assume true; {716#(and (or (and (= |isnan_float_#res| (_ bv0 32)) (fp.eq |isnan_float_#in~x| |isnan_float_#in~x|)) (and (not (fp.eq |isnan_float_#in~x| |isnan_float_#in~x|)) (= |isnan_float_#res| (_ bv1 32)))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:41:19,692 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {716#(and (or (and (= |isnan_float_#res| (_ bv0 32)) (fp.eq |isnan_float_#in~x| |isnan_float_#in~x|)) (and (not (fp.eq |isnan_float_#in~x| |isnan_float_#in~x|)) (= |isnan_float_#res| (_ bv1 32)))) (= currentRoundingMode roundNearestTiesToEven))} {706#(= currentRoundingMode roundNearestTiesToEven)} #345#return; {723#(and (or (and (= |ULTIMATE.start_main_#t~ret41#1| (_ bv0 32)) (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|)) (and (= |ULTIMATE.start_main_#t~ret41#1| (_ bv1 32)) (not (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|)))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:41:19,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {723#(and (or (and (= |ULTIMATE.start_main_#t~ret41#1| (_ bv0 32)) (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|)) (and (= |ULTIMATE.start_main_#t~ret41#1| (_ bv1 32)) (not (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|)))) (= currentRoundingMode roundNearestTiesToEven))} main_#t~short43#1 := 0bv32 != main_#t~ret41#1; {727#(and (or (and |ULTIMATE.start_main_#t~short43#1| (not (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|))) (and (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|) (not |ULTIMATE.start_main_#t~short43#1|))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:41:19,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {727#(and (or (and |ULTIMATE.start_main_#t~short43#1| (not (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|))) (and (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|) (not |ULTIMATE.start_main_#t~short43#1|))) (= currentRoundingMode roundNearestTiesToEven))} assume main_#t~short43#1; {731#(and (not (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:41:19,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {731#(and (not (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|)) (= currentRoundingMode roundNearestTiesToEven))} assume main_#t~short43#1;havoc main_#t~ret41#1;havoc main_#t~ret42#1;havoc main_#t~short43#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; {735#(and (not (fp.eq |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~x#1|)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:41:19,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {735#(and (not (fp.eq |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~x#1|)) (= currentRoundingMode roundNearestTiesToEven))} 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; {735#(and (not (fp.eq |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~x#1|)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:41:19,694 INFO L290 TraceCheckUtils]: 10: Hoare triple {735#(and (not (fp.eq |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~x#1|)) (= currentRoundingMode roundNearestTiesToEven))} goto; {735#(and (not (fp.eq |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~x#1|)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:41:19,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {735#(and (not (fp.eq |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~x#1|)) (= currentRoundingMode roundNearestTiesToEven))} __ieee754_atan2f_~ix~2#1 := ~bvand32(2147483647bv32, __ieee754_atan2f_~hx~1#1); {735#(and (not (fp.eq |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~x#1|)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:41:19,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {735#(and (not (fp.eq |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~x#1|)) (= currentRoundingMode roundNearestTiesToEven))} 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; {735#(and (not (fp.eq |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~x#1|)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:41:19,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {735#(and (not (fp.eq |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~x#1|)) (= currentRoundingMode roundNearestTiesToEven))} goto; {735#(and (not (fp.eq |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~x#1|)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:41:19,701 INFO L290 TraceCheckUtils]: 14: Hoare triple {735#(and (not (fp.eq |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~x#1|)) (= currentRoundingMode roundNearestTiesToEven))} __ieee754_atan2f_~iy~0#1 := ~bvand32(2147483647bv32, __ieee754_atan2f_~hy~0#1); {735#(and (not (fp.eq |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~x#1|)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:41:19,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {735#(and (not (fp.eq |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~x#1|)) (= currentRoundingMode roundNearestTiesToEven))} 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); {757#(exists ((|ULTIMATE.start___ieee754_atan2f_~x#1| (_ FloatingPoint 8 24)) (|ULTIMATE.start___ieee754_atan2f_~y#1| (_ FloatingPoint 8 24))) (and (not (fp.eq |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~x#1|)) (= |ULTIMATE.start___ieee754_atan2f_#res#1| (fp.add roundNearestTiesToEven |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~y#1|))))} is VALID [2022-02-20 16:41:19,717 INFO L290 TraceCheckUtils]: 16: Hoare triple {757#(exists ((|ULTIMATE.start___ieee754_atan2f_~x#1| (_ FloatingPoint 8 24)) (|ULTIMATE.start___ieee754_atan2f_~y#1| (_ FloatingPoint 8 24))) (and (not (fp.eq |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~x#1|)) (= |ULTIMATE.start___ieee754_atan2f_#res#1| (fp.add roundNearestTiesToEven |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~y#1|))))} main_#t~ret44#1 := __ieee754_atan2f_#res#1;assume { :end_inline___ieee754_atan2f } true;main_~res~0#1 := main_#t~ret44#1;havoc main_#t~ret44#1; {761#(exists ((|ULTIMATE.start___ieee754_atan2f_~x#1| (_ FloatingPoint 8 24)) (|ULTIMATE.start___ieee754_atan2f_~y#1| (_ FloatingPoint 8 24))) (and (not (fp.eq |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~x#1|)) (= |ULTIMATE.start_main_~res~0#1| (fp.add roundNearestTiesToEven |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~y#1|))))} is VALID [2022-02-20 16:41:19,717 INFO L272 TraceCheckUtils]: 17: Hoare triple {761#(exists ((|ULTIMATE.start___ieee754_atan2f_~x#1| (_ FloatingPoint 8 24)) (|ULTIMATE.start___ieee754_atan2f_~y#1| (_ FloatingPoint 8 24))) (and (not (fp.eq |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~x#1|)) (= |ULTIMATE.start_main_~res~0#1| (fp.add roundNearestTiesToEven |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~y#1|))))} call main_#t~ret45#1 := isnan_float(main_~res~0#1); {701#true} is VALID [2022-02-20 16:41:19,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {701#true} ~x := #in~x;#res := (if !~fp.eq~FLOAT(~x, ~x) then 1bv32 else 0bv32); {768#(or (and (= |isnan_float_#res| (_ bv0 32)) (fp.eq |isnan_float_#in~x| |isnan_float_#in~x|)) (and (not (fp.eq |isnan_float_#in~x| |isnan_float_#in~x|)) (= |isnan_float_#res| (_ bv1 32))))} is VALID [2022-02-20 16:41:19,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {768#(or (and (= |isnan_float_#res| (_ bv0 32)) (fp.eq |isnan_float_#in~x| |isnan_float_#in~x|)) (and (not (fp.eq |isnan_float_#in~x| |isnan_float_#in~x|)) (= |isnan_float_#res| (_ bv1 32))))} assume true; {768#(or (and (= |isnan_float_#res| (_ bv0 32)) (fp.eq |isnan_float_#in~x| |isnan_float_#in~x|)) (and (not (fp.eq |isnan_float_#in~x| |isnan_float_#in~x|)) (= |isnan_float_#res| (_ bv1 32))))} is VALID [2022-02-20 16:41:19,730 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {768#(or (and (= |isnan_float_#res| (_ bv0 32)) (fp.eq |isnan_float_#in~x| |isnan_float_#in~x|)) (and (not (fp.eq |isnan_float_#in~x| |isnan_float_#in~x|)) (= |isnan_float_#res| (_ bv1 32))))} {761#(exists ((|ULTIMATE.start___ieee754_atan2f_~x#1| (_ FloatingPoint 8 24)) (|ULTIMATE.start___ieee754_atan2f_~y#1| (_ FloatingPoint 8 24))) (and (not (fp.eq |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~x#1|)) (= |ULTIMATE.start_main_~res~0#1| (fp.add roundNearestTiesToEven |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~y#1|))))} #355#return; {775#(= |ULTIMATE.start_main_#t~ret45#1| (_ bv1 32))} is VALID [2022-02-20 16:41:19,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {775#(= |ULTIMATE.start_main_#t~ret45#1| (_ bv1 32))} assume 0bv32 == main_#t~ret45#1;havoc main_#t~ret45#1; {702#false} is VALID [2022-02-20 16:41:19,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {702#false} assume !false; {702#false} is VALID [2022-02-20 16:41:19,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:41:19,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:41:32,308 INFO L290 TraceCheckUtils]: 22: Hoare triple {702#false} assume !false; {702#false} is VALID [2022-02-20 16:41:32,309 INFO L290 TraceCheckUtils]: 21: Hoare triple {785#(not (= |ULTIMATE.start_main_#t~ret45#1| (_ bv0 32)))} assume 0bv32 == main_#t~ret45#1;havoc main_#t~ret45#1; {702#false} is VALID [2022-02-20 16:41:32,310 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {793#(or (fp.eq |isnan_float_#in~x| |isnan_float_#in~x|) (not (= |isnan_float_#res| (_ bv0 32))))} {789#(not (fp.eq |ULTIMATE.start_main_~res~0#1| |ULTIMATE.start_main_~res~0#1|))} #355#return; {785#(not (= |ULTIMATE.start_main_#t~ret45#1| (_ bv0 32)))} is VALID [2022-02-20 16:41:32,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {793#(or (fp.eq |isnan_float_#in~x| |isnan_float_#in~x|) (not (= |isnan_float_#res| (_ bv0 32))))} assume true; {793#(or (fp.eq |isnan_float_#in~x| |isnan_float_#in~x|) (not (= |isnan_float_#res| (_ bv0 32))))} is VALID [2022-02-20 16:41:32,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {701#true} ~x := #in~x;#res := (if !~fp.eq~FLOAT(~x, ~x) then 1bv32 else 0bv32); {793#(or (fp.eq |isnan_float_#in~x| |isnan_float_#in~x|) (not (= |isnan_float_#res| (_ bv0 32))))} is VALID [2022-02-20 16:41:32,311 INFO L272 TraceCheckUtils]: 17: Hoare triple {789#(not (fp.eq |ULTIMATE.start_main_~res~0#1| |ULTIMATE.start_main_~res~0#1|))} call main_#t~ret45#1 := isnan_float(main_~res~0#1); {701#true} is VALID [2022-02-20 16:41:32,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {803#(not (fp.eq |ULTIMATE.start___ieee754_atan2f_#res#1| |ULTIMATE.start___ieee754_atan2f_#res#1|))} main_#t~ret44#1 := __ieee754_atan2f_#res#1;assume { :end_inline___ieee754_atan2f } true;main_~res~0#1 := main_#t~ret44#1;havoc main_#t~ret44#1; {789#(not (fp.eq |ULTIMATE.start_main_~res~0#1| |ULTIMATE.start_main_~res~0#1|))} is VALID [2022-02-20 16:41:32,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {807#(forall ((|ULTIMATE.start___ieee754_atan2f_~y#1| (_ FloatingPoint 8 24))) (not (fp.eq (fp.add currentRoundingMode |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~y#1|) (fp.add currentRoundingMode |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~y#1|))))} 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); {803#(not (fp.eq |ULTIMATE.start___ieee754_atan2f_#res#1| |ULTIMATE.start___ieee754_atan2f_#res#1|))} is VALID [2022-02-20 16:41:32,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {807#(forall ((|ULTIMATE.start___ieee754_atan2f_~y#1| (_ FloatingPoint 8 24))) (not (fp.eq (fp.add currentRoundingMode |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~y#1|) (fp.add currentRoundingMode |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~y#1|))))} __ieee754_atan2f_~iy~0#1 := ~bvand32(2147483647bv32, __ieee754_atan2f_~hy~0#1); {807#(forall ((|ULTIMATE.start___ieee754_atan2f_~y#1| (_ FloatingPoint 8 24))) (not (fp.eq (fp.add currentRoundingMode |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~y#1|) (fp.add currentRoundingMode |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~y#1|))))} is VALID [2022-02-20 16:41:32,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {807#(forall ((|ULTIMATE.start___ieee754_atan2f_~y#1| (_ FloatingPoint 8 24))) (not (fp.eq (fp.add currentRoundingMode |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~y#1|) (fp.add currentRoundingMode |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~y#1|))))} goto; {807#(forall ((|ULTIMATE.start___ieee754_atan2f_~y#1| (_ FloatingPoint 8 24))) (not (fp.eq (fp.add currentRoundingMode |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~y#1|) (fp.add currentRoundingMode |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~y#1|))))} is VALID [2022-02-20 16:41:32,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {807#(forall ((|ULTIMATE.start___ieee754_atan2f_~y#1| (_ FloatingPoint 8 24))) (not (fp.eq (fp.add currentRoundingMode |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~y#1|) (fp.add currentRoundingMode |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~y#1|))))} 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; {807#(forall ((|ULTIMATE.start___ieee754_atan2f_~y#1| (_ FloatingPoint 8 24))) (not (fp.eq (fp.add currentRoundingMode |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~y#1|) (fp.add currentRoundingMode |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~y#1|))))} is VALID [2022-02-20 16:41:32,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {807#(forall ((|ULTIMATE.start___ieee754_atan2f_~y#1| (_ FloatingPoint 8 24))) (not (fp.eq (fp.add currentRoundingMode |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~y#1|) (fp.add currentRoundingMode |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~y#1|))))} __ieee754_atan2f_~ix~2#1 := ~bvand32(2147483647bv32, __ieee754_atan2f_~hx~1#1); {807#(forall ((|ULTIMATE.start___ieee754_atan2f_~y#1| (_ FloatingPoint 8 24))) (not (fp.eq (fp.add currentRoundingMode |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~y#1|) (fp.add currentRoundingMode |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~y#1|))))} is VALID [2022-02-20 16:41:32,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {807#(forall ((|ULTIMATE.start___ieee754_atan2f_~y#1| (_ FloatingPoint 8 24))) (not (fp.eq (fp.add currentRoundingMode |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~y#1|) (fp.add currentRoundingMode |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~y#1|))))} goto; {807#(forall ((|ULTIMATE.start___ieee754_atan2f_~y#1| (_ FloatingPoint 8 24))) (not (fp.eq (fp.add currentRoundingMode |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~y#1|) (fp.add currentRoundingMode |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~y#1|))))} is VALID [2022-02-20 16:41:32,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {807#(forall ((|ULTIMATE.start___ieee754_atan2f_~y#1| (_ FloatingPoint 8 24))) (not (fp.eq (fp.add currentRoundingMode |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~y#1|) (fp.add currentRoundingMode |ULTIMATE.start___ieee754_atan2f_~x#1| |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; {807#(forall ((|ULTIMATE.start___ieee754_atan2f_~y#1| (_ FloatingPoint 8 24))) (not (fp.eq (fp.add currentRoundingMode |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~y#1|) (fp.add currentRoundingMode |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~y#1|))))} is VALID [2022-02-20 16:41:32,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {829#(forall ((|ULTIMATE.start___ieee754_atan2f_~y#1| (_ FloatingPoint 8 24))) (not (fp.eq (fp.add currentRoundingMode |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start___ieee754_atan2f_~y#1|) (fp.add currentRoundingMode |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start___ieee754_atan2f_~y#1|))))} assume main_#t~short43#1;havoc main_#t~ret41#1;havoc main_#t~ret42#1;havoc main_#t~short43#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; {807#(forall ((|ULTIMATE.start___ieee754_atan2f_~y#1| (_ FloatingPoint 8 24))) (not (fp.eq (fp.add currentRoundingMode |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~y#1|) (fp.add currentRoundingMode |ULTIMATE.start___ieee754_atan2f_~x#1| |ULTIMATE.start___ieee754_atan2f_~y#1|))))} is VALID [2022-02-20 16:41:32,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {833#(or (forall ((|ULTIMATE.start___ieee754_atan2f_~y#1| (_ FloatingPoint 8 24))) (not (fp.eq (fp.add currentRoundingMode |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start___ieee754_atan2f_~y#1|) (fp.add currentRoundingMode |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start___ieee754_atan2f_~y#1|)))) (not |ULTIMATE.start_main_#t~short43#1|))} assume main_#t~short43#1; {829#(forall ((|ULTIMATE.start___ieee754_atan2f_~y#1| (_ FloatingPoint 8 24))) (not (fp.eq (fp.add currentRoundingMode |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start___ieee754_atan2f_~y#1|) (fp.add currentRoundingMode |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start___ieee754_atan2f_~y#1|))))} is VALID [2022-02-20 16:41:32,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {837#(or (forall ((|ULTIMATE.start___ieee754_atan2f_~y#1| (_ FloatingPoint 8 24))) (not (fp.eq (fp.add currentRoundingMode |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start___ieee754_atan2f_~y#1|) (fp.add currentRoundingMode |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start___ieee754_atan2f_~y#1|)))) (= |ULTIMATE.start_main_#t~ret41#1| (_ bv0 32)))} main_#t~short43#1 := 0bv32 != main_#t~ret41#1; {833#(or (forall ((|ULTIMATE.start___ieee754_atan2f_~y#1| (_ FloatingPoint 8 24))) (not (fp.eq (fp.add currentRoundingMode |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start___ieee754_atan2f_~y#1|) (fp.add currentRoundingMode |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start___ieee754_atan2f_~y#1|)))) (not |ULTIMATE.start_main_#t~short43#1|))} is VALID [2022-02-20 16:41:32,355 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {844#(or (= |isnan_float_#res| (_ bv0 32)) (forall ((|ULTIMATE.start___ieee754_atan2f_~y#1| (_ FloatingPoint 8 24))) (not (fp.eq (fp.add currentRoundingMode |isnan_float_#in~x| |ULTIMATE.start___ieee754_atan2f_~y#1|) (fp.add currentRoundingMode |isnan_float_#in~x| |ULTIMATE.start___ieee754_atan2f_~y#1|)))))} {701#true} #345#return; {837#(or (forall ((|ULTIMATE.start___ieee754_atan2f_~y#1| (_ FloatingPoint 8 24))) (not (fp.eq (fp.add currentRoundingMode |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start___ieee754_atan2f_~y#1|) (fp.add currentRoundingMode |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start___ieee754_atan2f_~y#1|)))) (= |ULTIMATE.start_main_#t~ret41#1| (_ bv0 32)))} is VALID [2022-02-20 16:41:32,358 INFO L290 TraceCheckUtils]: 4: Hoare triple {844#(or (= |isnan_float_#res| (_ bv0 32)) (forall ((|ULTIMATE.start___ieee754_atan2f_~y#1| (_ FloatingPoint 8 24))) (not (fp.eq (fp.add currentRoundingMode |isnan_float_#in~x| |ULTIMATE.start___ieee754_atan2f_~y#1|) (fp.add currentRoundingMode |isnan_float_#in~x| |ULTIMATE.start___ieee754_atan2f_~y#1|)))))} assume true; {844#(or (= |isnan_float_#res| (_ bv0 32)) (forall ((|ULTIMATE.start___ieee754_atan2f_~y#1| (_ FloatingPoint 8 24))) (not (fp.eq (fp.add currentRoundingMode |isnan_float_#in~x| |ULTIMATE.start___ieee754_atan2f_~y#1|) (fp.add currentRoundingMode |isnan_float_#in~x| |ULTIMATE.start___ieee754_atan2f_~y#1|)))))} is VALID [2022-02-20 16:41:32,382 INFO L290 TraceCheckUtils]: 3: Hoare triple {701#true} ~x := #in~x;#res := (if !~fp.eq~FLOAT(~x, ~x) then 1bv32 else 0bv32); {844#(or (= |isnan_float_#res| (_ bv0 32)) (forall ((|ULTIMATE.start___ieee754_atan2f_~y#1| (_ FloatingPoint 8 24))) (not (fp.eq (fp.add currentRoundingMode |isnan_float_#in~x| |ULTIMATE.start___ieee754_atan2f_~y#1|) (fp.add currentRoundingMode |isnan_float_#in~x| |ULTIMATE.start___ieee754_atan2f_~y#1|)))))} is VALID [2022-02-20 16:41:32,382 INFO L272 TraceCheckUtils]: 2: Hoare triple {701#true} call main_#t~ret41#1 := isnan_float(main_~x~0#1); {701#true} is VALID [2022-02-20 16:41:32,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {701#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet39#1, main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~short43#1, main_#t~ret44#1, main_#t~ret45#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := main_#t~nondet39#1;havoc main_#t~nondet39#1;main_~y~0#1 := main_#t~nondet40#1;havoc main_#t~nondet40#1; {701#true} is VALID [2022-02-20 16:41:32,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {701#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 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))); {701#true} is VALID [2022-02-20 16:41:32,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 16:41:32,383 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:41:32,383 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1827280212] [2022-02-20 16:41:32,383 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1827280212] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:41:32,383 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:41:32,383 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2022-02-20 16:41:32,384 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021774060] [2022-02-20 16:41:32,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:41:32,385 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 23 [2022-02-20 16:41:32,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:41:32,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:41:32,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:41:32,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-20 16:41:32,751 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:41:32,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-20 16:41:32,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2022-02-20 16:41:32,752 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)