./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_0682a.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_0682a.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 2a0b335900eb7ac8340f6fa1728e72682341270c88357da83af9b58560bc536f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:41:37,943 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:41:37,945 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:41:37,970 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:41:37,974 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:41:37,977 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:41:37,979 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:41:37,984 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:41:37,986 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:41:37,987 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:41:37,989 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:41:37,991 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:41:37,991 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:41:37,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:41:37,998 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:41:37,999 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:41:38,000 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:41:38,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:41:38,005 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:41:38,008 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:41:38,010 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:41:38,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:41:38,013 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:41:38,013 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:41:38,021 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:41:38,021 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:41:38,022 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:41:38,023 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:41:38,024 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:41:38,024 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:41:38,025 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:41:38,026 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:41:38,027 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:41:38,028 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:41:38,029 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:41:38,029 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:41:38,030 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:41:38,030 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:41:38,030 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:41:38,031 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:41:38,032 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:41:38,033 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:41:38,066 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:41:38,066 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:41:38,067 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:41:38,067 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:41:38,068 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:41:38,068 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:41:38,069 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:41:38,069 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:41:38,069 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:41:38,069 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:41:38,070 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:41:38,070 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:41:38,070 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:41:38,071 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:41:38,071 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:41:38,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:41:38,071 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:41:38,071 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:41:38,072 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:41:38,072 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:41:38,072 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:41:38,072 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:41:38,072 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:41:38,073 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:41:38,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:41:38,073 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:41:38,073 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:41:38,073 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:41:38,074 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:41:38,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:41:38,074 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:41:38,074 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:41:38,075 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:41:38,075 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 -> 2a0b335900eb7ac8340f6fa1728e72682341270c88357da83af9b58560bc536f [2022-02-20 16:41:38,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:41:38,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:41:38,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:41:38,386 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:41:38,387 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:41:38,388 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0682a.c [2022-02-20 16:41:38,440 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd1666c6c/e905481305dd46638d4ae706d1f11a3c/FLAG1bddbad68 [2022-02-20 16:41:38,859 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:41:38,862 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0682a.c [2022-02-20 16:41:38,876 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd1666c6c/e905481305dd46638d4ae706d1f11a3c/FLAG1bddbad68 [2022-02-20 16:41:38,893 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd1666c6c/e905481305dd46638d4ae706d1f11a3c [2022-02-20 16:41:38,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:41:38,899 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:41:38,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:41:38,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:41:38,906 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:41:38,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:41:38" (1/1) ... [2022-02-20 16:41:38,908 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27c801dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:38, skipping insertion in model container [2022-02-20 16:41:38,908 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:41:38" (1/1) ... [2022-02-20 16:41:38,915 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:41:38,948 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:41:39,217 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_0682a.c[5568,5581] [2022-02-20 16:41:39,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:41:39,242 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:41:39,288 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_0682a.c[5568,5581] [2022-02-20 16:41:39,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:41:39,303 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:41:39,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:39 WrapperNode [2022-02-20 16:41:39,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:41:39,305 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:41:39,305 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:41:39,305 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:41:39,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:39" (1/1) ... [2022-02-20 16:41:39,328 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:39" (1/1) ... [2022-02-20 16:41:39,375 INFO L137 Inliner]: procedures = 20, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 274 [2022-02-20 16:41:39,376 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:41:39,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:41:39,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:41:39,377 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:41:39,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:39" (1/1) ... [2022-02-20 16:41:39,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:39" (1/1) ... [2022-02-20 16:41:39,389 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:39" (1/1) ... [2022-02-20 16:41:39,389 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:39" (1/1) ... [2022-02-20 16:41:39,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:39" (1/1) ... [2022-02-20 16:41:39,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:39" (1/1) ... [2022-02-20 16:41:39,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:39" (1/1) ... [2022-02-20 16:41:39,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:41:39,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:41:39,430 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:41:39,430 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:41:39,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:39" (1/1) ... [2022-02-20 16:41:39,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:41:39,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:41:39,464 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:41:39,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:41:39,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:41:39,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:41:39,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:41:39,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:41:39,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:41:39,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:41:39,515 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2022-02-20 16:41:39,515 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2022-02-20 16:41:39,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:41:39,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:41:39,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:41:39,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-02-20 16:41:39,516 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2022-02-20 16:41:39,516 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2022-02-20 16:41:39,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:41:39,658 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:41:39,659 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:41:40,255 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:41:40,261 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:41:40,262 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-02-20 16:41:40,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:41:40 BoogieIcfgContainer [2022-02-20 16:41:40,264 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:41:40,265 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:41:40,265 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:41:40,268 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:41:40,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:41:38" (1/3) ... [2022-02-20 16:41:40,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280897d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:41:40, skipping insertion in model container [2022-02-20 16:41:40,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:39" (2/3) ... [2022-02-20 16:41:40,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280897d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:41:40, skipping insertion in model container [2022-02-20 16:41:40,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:41:40" (3/3) ... [2022-02-20 16:41:40,271 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0682a.c [2022-02-20 16:41:40,275 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:41:40,276 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:41:40,313 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:41:40,319 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:41:40,320 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:41:40,339 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 101 states have (on average 1.7227722772277227) internal successors, (174), 102 states have internal predecessors, (174), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:41:40,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:41:40,343 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:41:40,344 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:41:40,344 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:41:40,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:41:40,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1799288028, now seen corresponding path program 1 times [2022-02-20 16:41:40,357 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:41:40,357 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543929649] [2022-02-20 16:41:40,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:41:40,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:41:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:41:40,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {112#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~#atanhi_atan~0.base, ~#atanhi_atan~0.offset := 4, 0;call #Ultimate.allocInit(16, 4);call write~init~real(0.46364760399, ~#atanhi_atan~0.base, ~#atanhi_atan~0.offset, 4);call write~init~real(0.78539812565, ~#atanhi_atan~0.base, 4 + ~#atanhi_atan~0.offset, 4);call write~init~real(0.98279368877, ~#atanhi_atan~0.base, 8 + ~#atanhi_atan~0.offset, 4);call write~init~real(1.5707962513, ~#atanhi_atan~0.base, 12 + ~#atanhi_atan~0.offset, 4);~#atanlo_atan~0.base, ~#atanlo_atan~0.offset := 5, 0;call #Ultimate.allocInit(16, 5);call write~init~real(5.012158244E-9, ~#atanlo_atan~0.base, ~#atanlo_atan~0.offset, 4);call write~init~real(3.7748947079E-8, ~#atanlo_atan~0.base, 4 + ~#atanlo_atan~0.offset, 4);call write~init~real(3.447321717E-8, ~#atanlo_atan~0.base, 8 + ~#atanlo_atan~0.offset, 4);call write~init~real(7.5497894159E-8, ~#atanlo_atan~0.base, 12 + ~#atanlo_atan~0.offset, 4);~#aT_atan~0.base, ~#aT_atan~0.offset := 6, 0;call #Ultimate.allocInit(44, 6);call write~init~real(0.33333334327, ~#aT_atan~0.base, ~#aT_atan~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.20000000298), ~#aT_atan~0.base, 4 + ~#aT_atan~0.offset, 4);call write~init~real(0.14285714924, ~#aT_atan~0.base, 8 + ~#aT_atan~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.11111110449), ~#aT_atan~0.base, 12 + ~#aT_atan~0.offset, 4);call write~init~real(0.090908870101, ~#aT_atan~0.base, 16 + ~#aT_atan~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.076918758452), ~#aT_atan~0.base, 20 + ~#aT_atan~0.offset, 4);call write~init~real(0.066610731184, ~#aT_atan~0.base, 24 + ~#aT_atan~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.058335702866), ~#aT_atan~0.base, 28 + ~#aT_atan~0.offset, 4);call write~init~real(0.049768779427, ~#aT_atan~0.base, 32 + ~#aT_atan~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.036531571299), ~#aT_atan~0.base, 36 + ~#aT_atan~0.offset, 4);call write~init~real(0.016285819933, ~#aT_atan~0.base, 40 + ~#aT_atan~0.offset, 4);~one_atan~0 := 1.0;~huge_atan~0 := 1.0E30;~pi_o_4~0 := 0.78539818525;~pi_o_2~0 := 1.5707963705;~pi~0 := 3.141592741;~tiny_atan2~0 := 1.0E-30;~zero_atan2~0 := 0.0;~pi_lo_atan2~0 := ~someUnaryDOUBLEoperation(8.7422776573E-8); {112#true} is VALID [2022-02-20 16:41:40,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {112#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0);main_~y~0#1 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_isfinite_float } true;isfinite_float_#in~x#1 := main_~y~0#1;havoc isfinite_float_#res#1;havoc isfinite_float_#t~mem43#1, isfinite_float_~#gf_u~5#1.base, isfinite_float_~#gf_u~5#1.offset, isfinite_float_~x#1, isfinite_float_~ix~3#1;isfinite_float_~x#1 := isfinite_float_#in~x#1;havoc isfinite_float_~ix~3#1; {112#true} is VALID [2022-02-20 16:41:40,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {112#true} assume !true; {113#false} is VALID [2022-02-20 16:41:40,546 INFO L290 TraceCheckUtils]: 3: Hoare triple {113#false} isfinite_float_~ix~3#1 := (if 0 == isfinite_float_~ix~3#1 then 0 else (if 1 == isfinite_float_~ix~3#1 then 1 else ~bitwiseAnd(isfinite_float_~ix~3#1, 2147483647)));isfinite_float_#res#1 := (if isfinite_float_~ix~3#1 < 2139095040 then 1 else 0); {113#false} is VALID [2022-02-20 16:41:40,546 INFO L290 TraceCheckUtils]: 4: Hoare triple {113#false} main_#t~ret45#1 := isfinite_float_#res#1;assume { :end_inline_isfinite_float } true;assume -2147483648 <= main_#t~ret45#1 && main_#t~ret45#1 <= 2147483647; {113#false} is VALID [2022-02-20 16:41:40,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {113#false} assume 0 != main_#t~ret45#1 && ~someBinaryFLOATComparisonOperation(main_~y~0#1, 0.0);havoc main_#t~ret45#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; {113#false} is VALID [2022-02-20 16:41:40,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {113#false} assume !true; {113#false} is VALID [2022-02-20 16:41:40,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {113#false} assume 0 == __ieee754_atan2f_~hx~1#1;__ieee754_atan2f_~ix~2#1 := 0; {113#false} is VALID [2022-02-20 16:41:40,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {113#false} assume !true; {113#false} is VALID [2022-02-20 16:41:40,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {113#false} assume 0 == __ieee754_atan2f_~hy~0#1;__ieee754_atan2f_~iy~0#1 := 0; {113#false} is VALID [2022-02-20 16:41:40,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {113#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); {113#false} is VALID [2022-02-20 16:41:40,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {113#false} main_#t~ret46#1 := __ieee754_atan2f_#res#1;assume { :end_inline___ieee754_atan2f } true;main_~res~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1; {113#false} is VALID [2022-02-20 16:41:40,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {113#false} assume ~someBinaryFLOATComparisonOperation(main_~res~0#1, ~someUnaryFLOAToperation(~pi~0)); {113#false} is VALID [2022-02-20 16:41:40,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {113#false} assume !false; {113#false} is VALID [2022-02-20 16:41:40,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:41:40,551 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:41:40,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543929649] [2022-02-20 16:41:40,552 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543929649] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:41:40,552 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:41:40,553 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:41:40,554 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54194260] [2022-02-20 16:41:40,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:41:40,560 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:41:40,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:41:40,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:41:40,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:41:40,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:41:40,585 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:41:40,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:41:40,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:41:40,613 INFO L87 Difference]: Start difference. First operand has 109 states, 101 states have (on average 1.7227722772277227) internal successors, (174), 102 states have internal predecessors, (174), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:41:40,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:41:40,774 INFO L93 Difference]: Finished difference Result 216 states and 366 transitions. [2022-02-20 16:41:40,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:41:40,775 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:41:40,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:41:40,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:41:40,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 366 transitions. [2022-02-20 16:41:40,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:41:40,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 366 transitions. [2022-02-20 16:41:40,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 366 transitions. [2022-02-20 16:41:41,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 366 edges. 366 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:41:41,100 INFO L225 Difference]: With dead ends: 216 [2022-02-20 16:41:41,100 INFO L226 Difference]: Without dead ends: 105 [2022-02-20 16:41:41,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:41:41,106 INFO L933 BasicCegarLoop]: 159 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, 159 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:41,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 159 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:41,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-02-20 16:41:41,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-02-20 16:41:41,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:41:41,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 105 states, 98 states have (on average 1.489795918367347) internal successors, (146), 98 states have internal predecessors, (146), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:41:41,140 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 105 states, 98 states have (on average 1.489795918367347) internal successors, (146), 98 states have internal predecessors, (146), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:41:41,141 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 105 states, 98 states have (on average 1.489795918367347) internal successors, (146), 98 states have internal predecessors, (146), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:41:41,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:41:41,156 INFO L93 Difference]: Finished difference Result 105 states and 154 transitions. [2022-02-20 16:41:41,156 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 154 transitions. [2022-02-20 16:41:41,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:41:41,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:41:41,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 98 states have (on average 1.489795918367347) internal successors, (146), 98 states have internal predecessors, (146), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 105 states. [2022-02-20 16:41:41,160 INFO L87 Difference]: Start difference. First operand has 105 states, 98 states have (on average 1.489795918367347) internal successors, (146), 98 states have internal predecessors, (146), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 105 states. [2022-02-20 16:41:41,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:41:41,178 INFO L93 Difference]: Finished difference Result 105 states and 154 transitions. [2022-02-20 16:41:41,178 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 154 transitions. [2022-02-20 16:41:41,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:41:41,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:41:41,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:41:41,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:41:41,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 98 states have (on average 1.489795918367347) internal successors, (146), 98 states have internal predecessors, (146), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:41:41,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 154 transitions. [2022-02-20 16:41:41,211 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 154 transitions. Word has length 14 [2022-02-20 16:41:41,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:41:41,211 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 154 transitions. [2022-02-20 16:41:41,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:41:41,212 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 154 transitions. [2022-02-20 16:41:41,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 16:41:41,213 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:41:41,213 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:41:41,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:41:41,213 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:41:41,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:41:41,214 INFO L85 PathProgramCache]: Analyzing trace with hash 647324465, now seen corresponding path program 1 times [2022-02-20 16:41:41,214 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:41:41,215 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062666094] [2022-02-20 16:41:41,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:41:41,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:41:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:41:41,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {688#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~#atanhi_atan~0.base, ~#atanhi_atan~0.offset := 4, 0;call #Ultimate.allocInit(16, 4);call write~init~real(0.46364760399, ~#atanhi_atan~0.base, ~#atanhi_atan~0.offset, 4);call write~init~real(0.78539812565, ~#atanhi_atan~0.base, 4 + ~#atanhi_atan~0.offset, 4);call write~init~real(0.98279368877, ~#atanhi_atan~0.base, 8 + ~#atanhi_atan~0.offset, 4);call write~init~real(1.5707962513, ~#atanhi_atan~0.base, 12 + ~#atanhi_atan~0.offset, 4);~#atanlo_atan~0.base, ~#atanlo_atan~0.offset := 5, 0;call #Ultimate.allocInit(16, 5);call write~init~real(5.012158244E-9, ~#atanlo_atan~0.base, ~#atanlo_atan~0.offset, 4);call write~init~real(3.7748947079E-8, ~#atanlo_atan~0.base, 4 + ~#atanlo_atan~0.offset, 4);call write~init~real(3.447321717E-8, ~#atanlo_atan~0.base, 8 + ~#atanlo_atan~0.offset, 4);call write~init~real(7.5497894159E-8, ~#atanlo_atan~0.base, 12 + ~#atanlo_atan~0.offset, 4);~#aT_atan~0.base, ~#aT_atan~0.offset := 6, 0;call #Ultimate.allocInit(44, 6);call write~init~real(0.33333334327, ~#aT_atan~0.base, ~#aT_atan~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.20000000298), ~#aT_atan~0.base, 4 + ~#aT_atan~0.offset, 4);call write~init~real(0.14285714924, ~#aT_atan~0.base, 8 + ~#aT_atan~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.11111110449), ~#aT_atan~0.base, 12 + ~#aT_atan~0.offset, 4);call write~init~real(0.090908870101, ~#aT_atan~0.base, 16 + ~#aT_atan~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.076918758452), ~#aT_atan~0.base, 20 + ~#aT_atan~0.offset, 4);call write~init~real(0.066610731184, ~#aT_atan~0.base, 24 + ~#aT_atan~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.058335702866), ~#aT_atan~0.base, 28 + ~#aT_atan~0.offset, 4);call write~init~real(0.049768779427, ~#aT_atan~0.base, 32 + ~#aT_atan~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.036531571299), ~#aT_atan~0.base, 36 + ~#aT_atan~0.offset, 4);call write~init~real(0.016285819933, ~#aT_atan~0.base, 40 + ~#aT_atan~0.offset, 4);~one_atan~0 := 1.0;~huge_atan~0 := 1.0E30;~pi_o_4~0 := 0.78539818525;~pi_o_2~0 := 1.5707963705;~pi~0 := 3.141592741;~tiny_atan2~0 := 1.0E-30;~zero_atan2~0 := 0.0;~pi_lo_atan2~0 := ~someUnaryDOUBLEoperation(8.7422776573E-8); {688#true} is VALID [2022-02-20 16:41:41,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {688#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0);main_~y~0#1 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_isfinite_float } true;isfinite_float_#in~x#1 := main_~y~0#1;havoc isfinite_float_#res#1;havoc isfinite_float_#t~mem43#1, isfinite_float_~#gf_u~5#1.base, isfinite_float_~#gf_u~5#1.offset, isfinite_float_~x#1, isfinite_float_~ix~3#1;isfinite_float_~x#1 := isfinite_float_#in~x#1;havoc isfinite_float_~ix~3#1; {688#true} is VALID [2022-02-20 16:41:41,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {688#true} call isfinite_float_~#gf_u~5#1.base, isfinite_float_~#gf_u~5#1.offset := #Ultimate.allocOnStack(4);call write~real(isfinite_float_~x#1, isfinite_float_~#gf_u~5#1.base, isfinite_float_~#gf_u~5#1.offset, 4);call isfinite_float_#t~mem43#1 := read~int(isfinite_float_~#gf_u~5#1.base, isfinite_float_~#gf_u~5#1.offset, 4);isfinite_float_~ix~3#1 := (if isfinite_float_#t~mem43#1 % 4294967296 % 4294967296 <= 2147483647 then isfinite_float_#t~mem43#1 % 4294967296 % 4294967296 else isfinite_float_#t~mem43#1 % 4294967296 % 4294967296 - 4294967296);havoc isfinite_float_#t~mem43#1;call ULTIMATE.dealloc(isfinite_float_~#gf_u~5#1.base, isfinite_float_~#gf_u~5#1.offset);havoc isfinite_float_~#gf_u~5#1.base, isfinite_float_~#gf_u~5#1.offset; {688#true} is VALID [2022-02-20 16:41:41,345 INFO L290 TraceCheckUtils]: 3: Hoare triple {688#true} goto; {688#true} is VALID [2022-02-20 16:41:41,345 INFO L290 TraceCheckUtils]: 4: Hoare triple {688#true} isfinite_float_~ix~3#1 := (if 0 == isfinite_float_~ix~3#1 then 0 else (if 1 == isfinite_float_~ix~3#1 then 1 else ~bitwiseAnd(isfinite_float_~ix~3#1, 2147483647)));isfinite_float_#res#1 := (if isfinite_float_~ix~3#1 < 2139095040 then 1 else 0); {688#true} is VALID [2022-02-20 16:41:41,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {688#true} main_#t~ret45#1 := isfinite_float_#res#1;assume { :end_inline_isfinite_float } true;assume -2147483648 <= main_#t~ret45#1 && main_#t~ret45#1 <= 2147483647; {688#true} is VALID [2022-02-20 16:41:41,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {688#true} assume 0 != main_#t~ret45#1 && ~someBinaryFLOATComparisonOperation(main_~y~0#1, 0.0);havoc main_#t~ret45#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; {688#true} is VALID [2022-02-20 16:41:41,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {688#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; {688#true} is VALID [2022-02-20 16:41:41,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {688#true} goto; {688#true} is VALID [2022-02-20 16:41:41,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {688#true} assume 0 == __ieee754_atan2f_~hx~1#1;__ieee754_atan2f_~ix~2#1 := 0; {690#(= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0)} is VALID [2022-02-20 16:41:41,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {690#(= |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; {690#(= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0)} is VALID [2022-02-20 16:41:41,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {690#(= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0)} goto; {690#(= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0)} is VALID [2022-02-20 16:41:41,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {690#(= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0)} assume 0 == __ieee754_atan2f_~hy~0#1;__ieee754_atan2f_~iy~0#1 := 0; {691#(and (= |ULTIMATE.start___ieee754_atan2f_~iy~0#1| 0) (= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0))} is VALID [2022-02-20 16:41:41,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {691#(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); {689#false} is VALID [2022-02-20 16:41:41,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {689#false} main_#t~ret46#1 := __ieee754_atan2f_#res#1;assume { :end_inline___ieee754_atan2f } true;main_~res~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1; {689#false} is VALID [2022-02-20 16:41:41,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {689#false} assume ~someBinaryFLOATComparisonOperation(main_~res~0#1, ~someUnaryFLOAToperation(~pi~0)); {689#false} is VALID [2022-02-20 16:41:41,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {689#false} assume !false; {689#false} is VALID [2022-02-20 16:41:41,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:41:41,350 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:41:41,350 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062666094] [2022-02-20 16:41:41,351 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062666094] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:41:41,351 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:41:41,351 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:41:41,351 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404999907] [2022-02-20 16:41:41,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:41:41,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 16:41:41,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:41:41,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:41:41,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:41:41,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:41:41,370 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:41:41,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:41:41,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:41:41,371 INFO L87 Difference]: Start difference. First operand 105 states and 154 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:41:41,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:41:41,742 INFO L93 Difference]: Finished difference Result 218 states and 323 transitions. [2022-02-20 16:41:41,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:41:41,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 16:41:41,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:41:41,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:41:41,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 323 transitions. [2022-02-20 16:41:41,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:41:41,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 323 transitions. [2022-02-20 16:41:41,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 323 transitions. [2022-02-20 16:41:42,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 323 edges. 323 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:41:42,043 INFO L225 Difference]: With dead ends: 218 [2022-02-20 16:41:42,045 INFO L226 Difference]: Without dead ends: 147 [2022-02-20 16:41:42,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:41:42,048 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 57 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:41:42,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 434 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:41:42,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-02-20 16:41:42,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 132. [2022-02-20 16:41:42,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:41:42,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 132 states, 125 states have (on average 1.528) internal successors, (191), 125 states have internal predecessors, (191), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:41:42,067 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 132 states, 125 states have (on average 1.528) internal successors, (191), 125 states have internal predecessors, (191), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:41:42,068 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 132 states, 125 states have (on average 1.528) internal successors, (191), 125 states have internal predecessors, (191), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:41:42,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:41:42,075 INFO L93 Difference]: Finished difference Result 147 states and 215 transitions. [2022-02-20 16:41:42,075 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 215 transitions. [2022-02-20 16:41:42,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:41:42,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:41:42,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 125 states have (on average 1.528) internal successors, (191), 125 states have internal predecessors, (191), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 147 states. [2022-02-20 16:41:42,079 INFO L87 Difference]: Start difference. First operand has 132 states, 125 states have (on average 1.528) internal successors, (191), 125 states have internal predecessors, (191), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 147 states. [2022-02-20 16:41:42,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:41:42,086 INFO L93 Difference]: Finished difference Result 147 states and 215 transitions. [2022-02-20 16:41:42,086 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 215 transitions. [2022-02-20 16:41:42,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:41:42,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:41:42,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:41:42,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:41:42,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 125 states have (on average 1.528) internal successors, (191), 125 states have internal predecessors, (191), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:41:42,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 199 transitions. [2022-02-20 16:41:42,094 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 199 transitions. Word has length 17 [2022-02-20 16:41:42,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:41:42,095 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 199 transitions. [2022-02-20 16:41:42,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:41:42,095 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 199 transitions. [2022-02-20 16:41:42,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 16:41:42,096 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:41:42,096 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:41:42,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:41:42,097 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:41:42,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:41:42,097 INFO L85 PathProgramCache]: Analyzing trace with hash 2009397772, now seen corresponding path program 1 times [2022-02-20 16:41:42,098 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:41:42,098 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089794087] [2022-02-20 16:41:42,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:41:42,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:41:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:41:42,177 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:41:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:41:42,255 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:41:42,255 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:41:42,256 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:41:42,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:41:42,261 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:41:42,263 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:41:42,309 WARN L170 areAnnotationChecker]: fabs_floatENTRY has no Hoare annotation [2022-02-20 16:41:42,312 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:41:42,312 WARN L170 areAnnotationChecker]: atan_floatENTRY has no Hoare annotation [2022-02-20 16:41:42,312 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-02-20 16:41:42,312 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-02-20 16:41:42,312 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:41:42,313 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2022-02-20 16:41:42,313 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2022-02-20 16:41:42,313 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 16:41:42,313 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 16:41:42,313 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:41:42,313 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:41:42,314 WARN L170 areAnnotationChecker]: L220-2 has no Hoare annotation [2022-02-20 16:41:42,315 WARN L170 areAnnotationChecker]: L220-2 has no Hoare annotation [2022-02-20 16:41:42,317 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2022-02-20 16:41:42,317 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2022-02-20 16:41:42,317 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2022-02-20 16:41:42,317 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2022-02-20 16:41:42,318 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-20 16:41:42,318 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-20 16:41:42,318 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-02-20 16:41:42,318 WARN L170 areAnnotationChecker]: L220-1 has no Hoare annotation [2022-02-20 16:41:42,319 WARN L170 areAnnotationChecker]: L220-1 has no Hoare annotation [2022-02-20 16:41:42,324 WARN L170 areAnnotationChecker]: L220-3 has no Hoare annotation [2022-02-20 16:41:42,324 WARN L170 areAnnotationChecker]: L62-7 has no Hoare annotation [2022-02-20 16:41:42,324 WARN L170 areAnnotationChecker]: L62-7 has no Hoare annotation [2022-02-20 16:41:42,325 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-02-20 16:41:42,325 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-02-20 16:41:42,325 WARN L170 areAnnotationChecker]: fabs_floatFINAL has no Hoare annotation [2022-02-20 16:41:42,325 WARN L170 areAnnotationChecker]: L226 has no Hoare annotation [2022-02-20 16:41:42,325 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-02-20 16:41:42,325 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-02-20 16:41:42,325 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-02-20 16:41:42,325 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-02-20 16:41:42,326 WARN L170 areAnnotationChecker]: L62-3 has no Hoare annotation [2022-02-20 16:41:42,326 WARN L170 areAnnotationChecker]: L62-3 has no Hoare annotation [2022-02-20 16:41:42,326 WARN L170 areAnnotationChecker]: fabs_floatEXIT has no Hoare annotation [2022-02-20 16:41:42,326 WARN L170 areAnnotationChecker]: fabs_floatEXIT has no Hoare annotation [2022-02-20 16:41:42,326 WARN L170 areAnnotationChecker]: L239 has no Hoare annotation [2022-02-20 16:41:42,326 WARN L170 areAnnotationChecker]: L239 has no Hoare annotation [2022-02-20 16:41:42,326 WARN L170 areAnnotationChecker]: atan_floatFINAL has no Hoare annotation [2022-02-20 16:41:42,326 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:41:42,327 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:41:42,327 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:41:42,327 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:41:42,327 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:41:42,327 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:41:42,327 WARN L170 areAnnotationChecker]: L62-5 has no Hoare annotation [2022-02-20 16:41:42,327 WARN L170 areAnnotationChecker]: L62-5 has no Hoare annotation [2022-02-20 16:41:42,327 WARN L170 areAnnotationChecker]: L192-1 has no Hoare annotation [2022-02-20 16:41:42,328 WARN L170 areAnnotationChecker]: L192-1 has no Hoare annotation [2022-02-20 16:41:42,328 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:41:42,328 WARN L170 areAnnotationChecker]: L124-2 has no Hoare annotation [2022-02-20 16:41:42,328 WARN L170 areAnnotationChecker]: L124-2 has no Hoare annotation [2022-02-20 16:41:42,328 WARN L170 areAnnotationChecker]: L239-2 has no Hoare annotation [2022-02-20 16:41:42,328 WARN L170 areAnnotationChecker]: atan_floatEXIT has no Hoare annotation [2022-02-20 16:41:42,328 WARN L170 areAnnotationChecker]: atan_floatEXIT has no Hoare annotation [2022-02-20 16:41:42,328 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:41:42,329 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:41:42,329 WARN L170 areAnnotationChecker]: L72-2 has no Hoare annotation [2022-02-20 16:41:42,329 WARN L170 areAnnotationChecker]: L192-2 has no Hoare annotation [2022-02-20 16:41:42,329 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-02-20 16:41:42,329 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-02-20 16:41:42,329 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2022-02-20 16:41:42,329 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2022-02-20 16:41:42,329 WARN L170 areAnnotationChecker]: L124-3 has no Hoare annotation [2022-02-20 16:41:42,330 WARN L170 areAnnotationChecker]: L124-3 has no Hoare annotation [2022-02-20 16:41:42,330 WARN L170 areAnnotationChecker]: L249 has no Hoare annotation [2022-02-20 16:41:42,330 WARN L170 areAnnotationChecker]: L139-1 has no Hoare annotation [2022-02-20 16:41:42,330 WARN L170 areAnnotationChecker]: L88-2 has no Hoare annotation [2022-02-20 16:41:42,330 WARN L170 areAnnotationChecker]: L189-2 has no Hoare annotation [2022-02-20 16:41:42,330 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:41:42,330 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:41:42,330 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:41:42,331 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:41:42,331 WARN L170 areAnnotationChecker]: L130-1 has no Hoare annotation [2022-02-20 16:41:42,331 WARN L170 areAnnotationChecker]: L130-1 has no Hoare annotation [2022-02-20 16:41:42,331 WARN L170 areAnnotationChecker]: L129-1 has no Hoare annotation [2022-02-20 16:41:42,331 WARN L170 areAnnotationChecker]: L129-1 has no Hoare annotation [2022-02-20 16:41:42,331 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:41:42,331 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2022-02-20 16:41:42,331 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:41:42,332 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:41:42,332 WARN L170 areAnnotationChecker]: L194 has no Hoare annotation [2022-02-20 16:41:42,333 WARN L170 areAnnotationChecker]: L194 has no Hoare annotation [2022-02-20 16:41:42,333 WARN L170 areAnnotationChecker]: L130 has no Hoare annotation [2022-02-20 16:41:42,333 WARN L170 areAnnotationChecker]: L130 has no Hoare annotation [2022-02-20 16:41:42,334 WARN L170 areAnnotationChecker]: L130-2 has no Hoare annotation [2022-02-20 16:41:42,334 WARN L170 areAnnotationChecker]: L130-2 has no Hoare annotation [2022-02-20 16:41:42,335 WARN L170 areAnnotationChecker]: L129-3 has no Hoare annotation [2022-02-20 16:41:42,335 WARN L170 areAnnotationChecker]: L129-3 has no Hoare annotation [2022-02-20 16:41:42,335 WARN L170 areAnnotationChecker]: L243 has no Hoare annotation [2022-02-20 16:41:42,335 WARN L170 areAnnotationChecker]: L243 has no Hoare annotation [2022-02-20 16:41:42,335 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-02-20 16:41:42,335 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-02-20 16:41:42,335 WARN L170 areAnnotationChecker]: L196 has no Hoare annotation [2022-02-20 16:41:42,336 WARN L170 areAnnotationChecker]: L196 has no Hoare annotation [2022-02-20 16:41:42,336 WARN L170 areAnnotationChecker]: L135-7 has no Hoare annotation [2022-02-20 16:41:42,336 WARN L170 areAnnotationChecker]: L135-7 has no Hoare annotation [2022-02-20 16:41:42,336 WARN L170 areAnnotationChecker]: L135-1 has no Hoare annotation [2022-02-20 16:41:42,336 WARN L170 areAnnotationChecker]: L135-1 has no Hoare annotation [2022-02-20 16:41:42,336 WARN L170 areAnnotationChecker]: L129-5 has no Hoare annotation [2022-02-20 16:41:42,336 WARN L170 areAnnotationChecker]: L129-5 has no Hoare annotation [2022-02-20 16:41:42,336 WARN L170 areAnnotationChecker]: L244 has no Hoare annotation [2022-02-20 16:41:42,337 WARN L170 areAnnotationChecker]: L244 has no Hoare annotation [2022-02-20 16:41:42,337 WARN L170 areAnnotationChecker]: L113-2 has no Hoare annotation [2022-02-20 16:41:42,337 WARN L170 areAnnotationChecker]: L198-2 has no Hoare annotation [2022-02-20 16:41:42,337 WARN L170 areAnnotationChecker]: L198-2 has no Hoare annotation [2022-02-20 16:41:42,337 WARN L170 areAnnotationChecker]: L210 has no Hoare annotation [2022-02-20 16:41:42,337 WARN L170 areAnnotationChecker]: L210 has no Hoare annotation [2022-02-20 16:41:42,337 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2022-02-20 16:41:42,337 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2022-02-20 16:41:42,337 WARN L170 areAnnotationChecker]: L135-3 has no Hoare annotation [2022-02-20 16:41:42,338 WARN L170 areAnnotationChecker]: L135-3 has no Hoare annotation [2022-02-20 16:41:42,338 WARN L170 areAnnotationChecker]: L198-1 has no Hoare annotation [2022-02-20 16:41:42,338 WARN L170 areAnnotationChecker]: L198-1 has no Hoare annotation [2022-02-20 16:41:42,338 WARN L170 areAnnotationChecker]: L203-1 has no Hoare annotation [2022-02-20 16:41:42,338 WARN L170 areAnnotationChecker]: L203-1 has no Hoare annotation [2022-02-20 16:41:42,338 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2022-02-20 16:41:42,338 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2022-02-20 16:41:42,339 WARN L170 areAnnotationChecker]: L139 has no Hoare annotation [2022-02-20 16:41:42,339 WARN L170 areAnnotationChecker]: L139 has no Hoare annotation [2022-02-20 16:41:42,339 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2022-02-20 16:41:42,339 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2022-02-20 16:41:42,339 WARN L170 areAnnotationChecker]: L135-5 has no Hoare annotation [2022-02-20 16:41:42,339 WARN L170 areAnnotationChecker]: L135-5 has no Hoare annotation [2022-02-20 16:41:42,339 WARN L170 areAnnotationChecker]: L203 has no Hoare annotation [2022-02-20 16:41:42,339 WARN L170 areAnnotationChecker]: L203 has no Hoare annotation [2022-02-20 16:41:42,339 WARN L170 areAnnotationChecker]: L203-2 has no Hoare annotation [2022-02-20 16:41:42,340 WARN L170 areAnnotationChecker]: L193 has no Hoare annotation [2022-02-20 16:41:42,340 WARN L170 areAnnotationChecker]: L140-8 has no Hoare annotation [2022-02-20 16:41:42,340 WARN L170 areAnnotationChecker]: L140-8 has no Hoare annotation [2022-02-20 16:41:42,340 WARN L170 areAnnotationChecker]: L140-2 has no Hoare annotation [2022-02-20 16:41:42,340 WARN L170 areAnnotationChecker]: L140-2 has no Hoare annotation [2022-02-20 16:41:42,340 WARN L170 areAnnotationChecker]: L144 has no Hoare annotation [2022-02-20 16:41:42,340 WARN L170 areAnnotationChecker]: L144 has no Hoare annotation [2022-02-20 16:41:42,340 WARN L170 areAnnotationChecker]: L142-1 has no Hoare annotation [2022-02-20 16:41:42,341 WARN L170 areAnnotationChecker]: L142-1 has no Hoare annotation [2022-02-20 16:41:42,341 WARN L170 areAnnotationChecker]: L140-4 has no Hoare annotation [2022-02-20 16:41:42,341 WARN L170 areAnnotationChecker]: L140-4 has no Hoare annotation [2022-02-20 16:41:42,342 WARN L170 areAnnotationChecker]: L144-2 has no Hoare annotation [2022-02-20 16:41:42,343 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2022-02-20 16:41:42,343 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2022-02-20 16:41:42,343 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2022-02-20 16:41:42,343 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2022-02-20 16:41:42,343 WARN L170 areAnnotationChecker]: L140-6 has no Hoare annotation [2022-02-20 16:41:42,343 WARN L170 areAnnotationChecker]: L140-6 has no Hoare annotation [2022-02-20 16:41:42,344 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2022-02-20 16:41:42,344 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2022-02-20 16:41:42,344 WARN L170 areAnnotationChecker]: L155-2 has no Hoare annotation [2022-02-20 16:41:42,344 WARN L170 areAnnotationChecker]: L158 has no Hoare annotation [2022-02-20 16:41:42,344 WARN L170 areAnnotationChecker]: L158 has no Hoare annotation [2022-02-20 16:41:42,344 WARN L170 areAnnotationChecker]: L157-1 has no Hoare annotation [2022-02-20 16:41:42,344 WARN L170 areAnnotationChecker]: L157-1 has no Hoare annotation [2022-02-20 16:41:42,344 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-02-20 16:41:42,345 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-02-20 16:41:42,345 WARN L170 areAnnotationChecker]: L160 has no Hoare annotation [2022-02-20 16:41:42,345 WARN L170 areAnnotationChecker]: L160 has no Hoare annotation [2022-02-20 16:41:42,345 WARN L170 areAnnotationChecker]: L171 has no Hoare annotation [2022-02-20 16:41:42,345 WARN L170 areAnnotationChecker]: L171 has no Hoare annotation [2022-02-20 16:41:42,345 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2022-02-20 16:41:42,345 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2022-02-20 16:41:42,345 WARN L170 areAnnotationChecker]: L187 has no Hoare annotation [2022-02-20 16:41:42,345 WARN L170 areAnnotationChecker]: L187 has no Hoare annotation [2022-02-20 16:41:42,346 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2022-02-20 16:41:42,346 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2022-02-20 16:41:42,346 WARN L170 areAnnotationChecker]: L162 has no Hoare annotation [2022-02-20 16:41:42,346 WARN L170 areAnnotationChecker]: L162 has no Hoare annotation [2022-02-20 16:41:42,346 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2022-02-20 16:41:42,346 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2022-02-20 16:41:42,346 WARN L170 areAnnotationChecker]: L184-2 has no Hoare annotation [2022-02-20 16:41:42,346 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2022-02-20 16:41:42,347 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2022-02-20 16:41:42,347 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-02-20 16:41:42,347 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2022-02-20 16:41:42,347 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2022-02-20 16:41:42,347 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2022-02-20 16:41:42,347 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2022-02-20 16:41:42,347 WARN L170 areAnnotationChecker]: L192 has no Hoare annotation [2022-02-20 16:41:42,347 WARN L170 areAnnotationChecker]: L192 has no Hoare annotation [2022-02-20 16:41:42,348 WARN L170 areAnnotationChecker]: L166 has no Hoare annotation [2022-02-20 16:41:42,348 WARN L170 areAnnotationChecker]: L166 has no Hoare annotation [2022-02-20 16:41:42,348 WARN L170 areAnnotationChecker]: L177 has no Hoare annotation [2022-02-20 16:41:42,348 WARN L170 areAnnotationChecker]: L177 has no Hoare annotation [2022-02-20 16:41:42,348 WARN L170 areAnnotationChecker]: L159 has no Hoare annotation [2022-02-20 16:41:42,348 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2022-02-20 16:41:42,348 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:41:42,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:41:42 BoogieIcfgContainer [2022-02-20 16:41:42,349 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:41:42,350 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:41:42,350 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:41:42,350 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:41:42,351 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:41:40" (3/4) ... [2022-02-20 16:41:42,354 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:41:42,354 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:41:42,355 INFO L158 Benchmark]: Toolchain (without parser) took 3456.02ms. Allocated memory was 94.4MB in the beginning and 119.5MB in the end (delta: 25.2MB). Free memory was 57.9MB in the beginning and 55.1MB in the end (delta: 2.7MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. [2022-02-20 16:41:42,355 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 94.4MB. Free memory was 74.9MB in the beginning and 74.8MB in the end (delta: 84.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:41:42,356 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.33ms. Allocated memory is still 94.4MB. Free memory was 57.7MB in the beginning and 65.0MB in the end (delta: -7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:41:42,356 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.41ms. Allocated memory is still 94.4MB. Free memory was 65.0MB in the beginning and 61.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:41:42,357 INFO L158 Benchmark]: Boogie Preprocessor took 45.76ms. Allocated memory is still 94.4MB. Free memory was 61.5MB in the beginning and 58.4MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:41:42,357 INFO L158 Benchmark]: RCFGBuilder took 840.75ms. Allocated memory is still 94.4MB. Free memory was 58.4MB in the beginning and 57.4MB in the end (delta: 958.1kB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-02-20 16:41:42,358 INFO L158 Benchmark]: TraceAbstraction took 2084.43ms. Allocated memory was 94.4MB in the beginning and 119.5MB in the end (delta: 25.2MB). Free memory was 57.0MB in the beginning and 56.0MB in the end (delta: 996.8kB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2022-02-20 16:41:42,358 INFO L158 Benchmark]: Witness Printer took 3.71ms. Allocated memory is still 119.5MB. Free memory was 56.0MB in the beginning and 55.1MB in the end (delta: 852.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:41:42,361 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 94.4MB. Free memory was 74.9MB in the beginning and 74.8MB in the end (delta: 84.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 401.33ms. Allocated memory is still 94.4MB. Free memory was 57.7MB in the beginning and 65.0MB in the end (delta: -7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.41ms. Allocated memory is still 94.4MB. Free memory was 65.0MB in the beginning and 61.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.76ms. Allocated memory is still 94.4MB. Free memory was 61.5MB in the beginning and 58.4MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 840.75ms. Allocated memory is still 94.4MB. Free memory was 58.4MB in the beginning and 57.4MB in the end (delta: 958.1kB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2084.43ms. Allocated memory was 94.4MB in the beginning and 119.5MB in the end (delta: 25.2MB). Free memory was 57.0MB in the beginning and 56.0MB in the end (delta: 996.8kB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. * Witness Printer took 3.71ms. Allocated memory is still 119.5MB. Free memory was 56.0MB in the beginning and 55.1MB in the end (delta: 852.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 244]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 243, overapproximation of someUnaryDOUBLEoperation at line 44, overapproximation of bitwiseAnd at line 225, overapproximation of someBinaryArithmeticFLOAToperation at line 137. Possible FailurePath: [L29-L34] static const float atanhi_atan[] = { 4.6364760399e-01, 7.8539812565e-01, 9.8279368877e-01, 1.5707962513e+00, }; [L36-L41] static const float atanlo_atan[] = { 5.0121582440e-09, 3.7748947079e-08, 3.4473217170e-08, 7.5497894159e-08, }; [L43-L47] static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L49-L51] static const float one_atan = 1.0, huge_atan = 1.0e30, pi_o_4 = 7.8539818525e-01, pi_o_2 = 1.5707963705e+00, pi = 3.1415927410e+00; [L117-L118] static const float tiny_atan2 = 1.0e-30, zero_atan2 = 0.0, pi_lo_atan2 = -8.7422776573e-08; VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, zero_atan2=0] [L236] float x = -1.0f / 0.0f; [L237] float y = __VERIFIER_nondet_float(); [L239] CALL, EXPR isfinite_float(y) [L219] __int32_t ix; VAL [\old(x)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000001, zero_atan2=0] [L221] ieee_float_shape_type gf_u; [L222] gf_u.value = (x) [L223] EXPR gf_u.word [L223] (ix) = gf_u.word [L225] ix &= 0x7fffffff [L226] return (((ix) < 0x7f800000L)); VAL [\old(x)=1000000000000000000000000000001, \result=1, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, ix=2139095039, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000001, zero_atan2=0] [L239] RET, EXPR isfinite_float(y) [L239] COND TRUE isfinite_float(y) && y < 0.0f [L240] CALL, EXPR __ieee754_atan2f(y, x) [L121] float z; [L122] __int32_t k, m, hx, hy, ix, iy; VAL [\old(x)=1000000000000000000000000000003, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000003, y=1000000000000000000000000000001, zero_atan2=0] [L125] ieee_float_shape_type gf_u; [L126] gf_u.value = (x) [L127] EXPR gf_u.word [L127] (hx) = gf_u.word [L129] ix = hx & 0x7fffffff VAL [\old(x)=1000000000000000000000000000003, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000003, y=1000000000000000000000000000001, zero_atan2=0] [L131] ieee_float_shape_type gf_u; [L132] gf_u.value = (y) [L133] EXPR gf_u.word [L133] (hy) = gf_u.word [L135] iy = hy & 0x7fffffff VAL [\old(x)=1000000000000000000000000000003, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=0, hy=2147483647, ix=0, iy=2147483646, iy = hy & 0x7fffffff=2147483647, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000003, y=1000000000000000000000000000001, zero_atan2=0] [L136] COND TRUE ((ix) > 0x7f800000L) || ((iy) > 0x7f800000L) [L137] return x + y; VAL [\old(x)=1000000000000000000000000000003, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=0, hy=2147483647, ix=0, iy=2147483646, iy = hy & 0x7fffffff=2147483647, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000003, y=1000000000000000000000000000001, zero_atan2=0] [L240] RET, EXPR __ieee754_atan2f(y, x) [L240] float res = __ieee754_atan2f(y, x); [L243] COND TRUE res != -pi VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, iy = hy & 0x7fffffff=2147483647, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=1000000000000000000000000000002, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000003, y=1000000000000000000000000000001, zero_atan2=0] [L244] reach_error() VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, iy = hy & 0x7fffffff=2147483647, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=1000000000000000000000000000002, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000003, y=1000000000000000000000000000001, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 593 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 276 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34 IncrementalHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 317 mSDtfsCounter, 34 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 15 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 51 NumberOfCodeBlocks, 51 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 29 ConstructedInterpolants, 0 QuantifiedInterpolants, 41 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 16:41:42,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_0682a.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 2a0b335900eb7ac8340f6fa1728e72682341270c88357da83af9b58560bc536f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:41:44,445 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:41:44,448 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:41:44,489 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:41:44,489 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:41:44,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:41:44,494 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:41:44,500 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:41:44,503 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:41:44,507 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:41:44,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:41:44,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:41:44,511 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:41:44,513 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:41:44,515 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:41:44,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:41:44,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:41:44,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:41:44,525 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:41:44,531 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:41:44,533 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:41:44,534 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:41:44,536 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:41:44,537 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:41:44,543 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:41:44,551 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:41:44,551 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:41:44,553 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:41:44,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:41:44,554 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:41:44,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:41:44,555 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:41:44,557 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:41:44,558 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:41:44,559 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:41:44,559 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:41:44,560 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:41:44,560 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:41:44,560 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:41:44,562 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:41:44,562 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:41:44,566 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:41:44,602 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:41:44,602 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:41:44,602 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:41:44,603 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:41:44,604 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:41:44,604 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:41:44,605 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:41:44,605 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:41:44,605 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:41:44,606 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:41:44,606 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:41:44,606 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:41:44,607 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:41:44,607 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:41:44,607 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:41:44,607 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:41:44,608 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:41:44,608 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:41:44,608 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:41:44,608 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:41:44,608 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:41:44,608 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:41:44,609 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:41:44,609 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:41:44,609 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:41:44,609 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:41:44,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:41:44,610 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:41:44,610 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:41:44,610 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:41:44,610 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:41:44,611 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:41:44,611 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:41:44,611 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:41:44,611 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:41:44,611 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:41:44,612 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 -> 2a0b335900eb7ac8340f6fa1728e72682341270c88357da83af9b58560bc536f [2022-02-20 16:41:44,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:41:44,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:41:44,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:41:44,994 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:41:44,995 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:41:44,996 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0682a.c [2022-02-20 16:41:45,044 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/525e22347/f70a5ba7e473436385fa1597a27a006f/FLAGa7281434c [2022-02-20 16:41:45,425 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:41:45,426 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0682a.c [2022-02-20 16:41:45,433 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/525e22347/f70a5ba7e473436385fa1597a27a006f/FLAGa7281434c [2022-02-20 16:41:45,835 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/525e22347/f70a5ba7e473436385fa1597a27a006f [2022-02-20 16:41:45,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:41:45,839 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:41:45,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:41:45,843 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:41:45,850 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:41:45,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:41:45" (1/1) ... [2022-02-20 16:41:45,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16db5b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:45, skipping insertion in model container [2022-02-20 16:41:45,853 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:41:45" (1/1) ... [2022-02-20 16:41:45,860 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:41:45,886 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:41:46,136 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_0682a.c[5568,5581] [2022-02-20 16:41:46,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:41:46,168 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:41:46,248 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_0682a.c[5568,5581] [2022-02-20 16:41:46,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:41:46,279 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:41:46,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:46 WrapperNode [2022-02-20 16:41:46,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:41:46,280 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:41:46,281 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:41:46,281 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:41:46,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:46" (1/1) ... [2022-02-20 16:41:46,319 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:46" (1/1) ... [2022-02-20 16:41:46,359 INFO L137 Inliner]: procedures = 23, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 238 [2022-02-20 16:41:46,360 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:41:46,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:41:46,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:41:46,361 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:41:46,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:46" (1/1) ... [2022-02-20 16:41:46,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:46" (1/1) ... [2022-02-20 16:41:46,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:46" (1/1) ... [2022-02-20 16:41:46,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:46" (1/1) ... [2022-02-20 16:41:46,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:46" (1/1) ... [2022-02-20 16:41:46,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:46" (1/1) ... [2022-02-20 16:41:46,436 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:46" (1/1) ... [2022-02-20 16:41:46,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:41:46,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:41:46,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:41:46,448 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:41:46,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:46" (1/1) ... [2022-02-20 16:41:46,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:41:46,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:41:46,478 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:41:46,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:41:46,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:41:46,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-02-20 16:41:46,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:41:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:41:46,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:41:46,518 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2022-02-20 16:41:46,518 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2022-02-20 16:41:46,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:41:46,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:41:46,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:41:46,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:41:46,520 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2022-02-20 16:41:46,520 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2022-02-20 16:41:46,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:41:46,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:41:46,646 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:41:46,647 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:41:55,739 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:41:55,746 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:41:55,746 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-02-20 16:41:55,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:41:55 BoogieIcfgContainer [2022-02-20 16:41:55,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:41:55,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:41:55,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:41:55,753 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:41:55,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:41:45" (1/3) ... [2022-02-20 16:41:55,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@538a0efd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:41:55, skipping insertion in model container [2022-02-20 16:41:55,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:46" (2/3) ... [2022-02-20 16:41:55,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@538a0efd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:41:55, skipping insertion in model container [2022-02-20 16:41:55,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:41:55" (3/3) ... [2022-02-20 16:41:55,756 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0682a.c [2022-02-20 16:41:55,760 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:41:55,761 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:41:55,800 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:41:55,806 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:41:55,807 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:41:55,824 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 88 states have (on average 1.6477272727272727) internal successors, (145), 89 states have internal predecessors, (145), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:41:55,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:41:55,827 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:41:55,828 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:41:55,828 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:41:55,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:41:55,833 INFO L85 PathProgramCache]: Analyzing trace with hash -540288573, now seen corresponding path program 1 times [2022-02-20 16:41:55,843 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:41:55,843 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485272495] [2022-02-20 16:41:55,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:41:55,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:41:55,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:41:55,845 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:41:55,850 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:41:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:41:56,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:41:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:41:56,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:41:56,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {99#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~#atanhi_atan~0.base, ~#atanhi_atan~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(16bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.46364760399)), ~#atanhi_atan~0.base, ~#atanhi_atan~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.78539812565)), ~#atanhi_atan~0.base, ~bvadd32(4bv32, ~#atanhi_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.98279368877)), ~#atanhi_atan~0.base, ~bvadd32(8bv32, ~#atanhi_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.5707962513)), ~#atanhi_atan~0.base, ~bvadd32(12bv32, ~#atanhi_atan~0.offset), 4bv32);~#atanlo_atan~0.base, ~#atanlo_atan~0.offset := 5bv32, 0bv32;call #Ultimate.allocInit(16bv32, 5bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 5.012158244E-9)), ~#atanlo_atan~0.base, ~#atanlo_atan~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.7748947079E-8)), ~#atanlo_atan~0.base, ~bvadd32(4bv32, ~#atanlo_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.447321717E-8)), ~#atanlo_atan~0.base, ~bvadd32(8bv32, ~#atanlo_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.5497894159E-8)), ~#atanlo_atan~0.base, ~bvadd32(12bv32, ~#atanlo_atan~0.offset), 4bv32);~#aT_atan~0.base, ~#aT_atan~0.offset := 6bv32, 0bv32;call #Ultimate.allocInit(44bv32, 6bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.33333334327)), ~#aT_atan~0.base, ~#aT_atan~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.20000000298))), ~#aT_atan~0.base, ~bvadd32(4bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.14285714924)), ~#aT_atan~0.base, ~bvadd32(8bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.11111110449))), ~#aT_atan~0.base, ~bvadd32(12bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.090908870101)), ~#aT_atan~0.base, ~bvadd32(16bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.076918758452))), ~#aT_atan~0.base, ~bvadd32(20bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.066610731184)), ~#aT_atan~0.base, ~bvadd32(24bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.058335702866))), ~#aT_atan~0.base, ~bvadd32(28bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.049768779427)), ~#aT_atan~0.base, ~bvadd32(32bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.036531571299))), ~#aT_atan~0.base, ~bvadd32(36bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.016285819933)), ~#aT_atan~0.base, ~bvadd32(40bv32, ~#aT_atan~0.offset), 4bv32);~one_atan~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~huge_atan~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30));~pi_o_4~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.78539818525));~pi_o_2~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.5707963705));~pi~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.141592741));~tiny_atan2~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E-30));~zero_atan2~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE());~pi_lo_atan2~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 8.7422776573E-8))); {99#true} is VALID [2022-02-20 16:41:56,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());main_~y~0#1 := main_#t~nondet40#1;havoc main_#t~nondet40#1;assume { :begin_inline_isfinite_float } true;isfinite_float_#in~x#1 := main_~y~0#1;havoc isfinite_float_#res#1;havoc isfinite_float_#t~mem39#1, isfinite_float_~#gf_u~5#1.base, isfinite_float_~#gf_u~5#1.offset, isfinite_float_~x#1, isfinite_float_~ix~3#1;isfinite_float_~x#1 := isfinite_float_#in~x#1;havoc isfinite_float_~ix~3#1; {99#true} is VALID [2022-02-20 16:41:56,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {99#true} assume !true; {100#false} is VALID [2022-02-20 16:41:56,831 INFO L290 TraceCheckUtils]: 3: Hoare triple {100#false} isfinite_float_~ix~3#1 := ~bvand32(2147483647bv32, isfinite_float_~ix~3#1);isfinite_float_#res#1 := (if ~bvslt32(isfinite_float_~ix~3#1, 2139095040bv32) then 1bv32 else 0bv32); {100#false} is VALID [2022-02-20 16:41:56,831 INFO L290 TraceCheckUtils]: 4: Hoare triple {100#false} main_#t~ret41#1 := isfinite_float_#res#1;assume { :end_inline_isfinite_float } true; {100#false} is VALID [2022-02-20 16:41:56,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {100#false} assume 0bv32 != main_#t~ret41#1 && ~fp.lt~FLOAT(main_~y~0#1, ~Pluszero~FLOAT());havoc main_#t~ret41#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; {100#false} is VALID [2022-02-20 16:41:56,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {100#false} assume !true; {100#false} is VALID [2022-02-20 16:41:56,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {100#false} __ieee754_atan2f_~ix~2#1 := ~bvand32(2147483647bv32, __ieee754_atan2f_~hx~1#1); {100#false} is VALID [2022-02-20 16:41:56,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {100#false} assume !true; {100#false} is VALID [2022-02-20 16:41:56,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {100#false} __ieee754_atan2f_~iy~0#1 := ~bvand32(2147483647bv32, __ieee754_atan2f_~hy~0#1); {100#false} is VALID [2022-02-20 16:41:56,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {100#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); {100#false} is VALID [2022-02-20 16:41:56,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {100#false} main_#t~ret42#1 := __ieee754_atan2f_#res#1;assume { :end_inline___ieee754_atan2f } true;main_~res~0#1 := main_#t~ret42#1;havoc main_#t~ret42#1; {100#false} is VALID [2022-02-20 16:41:56,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {100#false} assume !~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~pi~0)); {100#false} is VALID [2022-02-20 16:41:56,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {100#false} assume !false; {100#false} is VALID [2022-02-20 16:41:56,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:41:56,836 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:41:56,836 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:41:56,837 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485272495] [2022-02-20 16:41:56,837 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485272495] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:41:56,837 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:41:56,837 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:41:56,840 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480085461] [2022-02-20 16:41:56,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:41:56,846 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:41:56,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:41:56,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:41:56,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:41:56,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:41:56,894 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:41:56,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:41:56,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:41:56,913 INFO L87 Difference]: Start difference. First operand has 96 states, 88 states have (on average 1.6477272727272727) internal successors, (145), 89 states have internal predecessors, (145), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:11,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:11,280 INFO L93 Difference]: Finished difference Result 190 states and 308 transitions. [2022-02-20 16:42:11,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:42:11,280 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:42:11,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:11,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:11,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 308 transitions. [2022-02-20 16:42:11,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:11,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 308 transitions. [2022-02-20 16:42:11,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 308 transitions. [2022-02-20 16:42:15,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 308 edges. 308 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:15,298 INFO L225 Difference]: With dead ends: 190 [2022-02-20 16:42:15,299 INFO L226 Difference]: Without dead ends: 92 [2022-02-20 16:42:15,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:42:15,305 INFO L933 BasicCegarLoop]: 136 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, 136 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:42:15,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:42:15,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-02-20 16:42:15,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-02-20 16:42:15,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:15,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 92 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:42:15,338 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 92 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:42:15,345 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 92 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:42:15,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:15,354 INFO L93 Difference]: Finished difference Result 92 states and 131 transitions. [2022-02-20 16:42:15,354 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2022-02-20 16:42:15,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:15,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:15,357 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 92 states. [2022-02-20 16:42:15,358 INFO L87 Difference]: Start difference. First operand has 92 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 92 states. [2022-02-20 16:42:15,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:15,370 INFO L93 Difference]: Finished difference Result 92 states and 131 transitions. [2022-02-20 16:42:15,371 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2022-02-20 16:42:15,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:15,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:15,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:15,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:15,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:42:15,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions. [2022-02-20 16:42:15,391 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 131 transitions. Word has length 14 [2022-02-20 16:42:15,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:15,392 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 131 transitions. [2022-02-20 16:42:15,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:15,393 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2022-02-20 16:42:15,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 16:42:15,393 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:15,394 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:15,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 16:42:15,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:42:15,616 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:15,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:15,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1209401097, now seen corresponding path program 1 times [2022-02-20 16:42:15,617 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:42:15,617 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1159762310] [2022-02-20 16:42:15,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:15,618 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:42:15,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:42:15,619 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:42:15,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:42:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:16,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 16:42:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:16,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:42:17,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 16:42:17,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2022-02-20 16:42:18,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {652#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~#atanhi_atan~0.base, ~#atanhi_atan~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(16bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.46364760399)), ~#atanhi_atan~0.base, ~#atanhi_atan~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.78539812565)), ~#atanhi_atan~0.base, ~bvadd32(4bv32, ~#atanhi_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.98279368877)), ~#atanhi_atan~0.base, ~bvadd32(8bv32, ~#atanhi_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.5707962513)), ~#atanhi_atan~0.base, ~bvadd32(12bv32, ~#atanhi_atan~0.offset), 4bv32);~#atanlo_atan~0.base, ~#atanlo_atan~0.offset := 5bv32, 0bv32;call #Ultimate.allocInit(16bv32, 5bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 5.012158244E-9)), ~#atanlo_atan~0.base, ~#atanlo_atan~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.7748947079E-8)), ~#atanlo_atan~0.base, ~bvadd32(4bv32, ~#atanlo_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.447321717E-8)), ~#atanlo_atan~0.base, ~bvadd32(8bv32, ~#atanlo_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.5497894159E-8)), ~#atanlo_atan~0.base, ~bvadd32(12bv32, ~#atanlo_atan~0.offset), 4bv32);~#aT_atan~0.base, ~#aT_atan~0.offset := 6bv32, 0bv32;call #Ultimate.allocInit(44bv32, 6bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.33333334327)), ~#aT_atan~0.base, ~#aT_atan~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.20000000298))), ~#aT_atan~0.base, ~bvadd32(4bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.14285714924)), ~#aT_atan~0.base, ~bvadd32(8bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.11111110449))), ~#aT_atan~0.base, ~bvadd32(12bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.090908870101)), ~#aT_atan~0.base, ~bvadd32(16bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.076918758452))), ~#aT_atan~0.base, ~bvadd32(20bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.066610731184)), ~#aT_atan~0.base, ~bvadd32(24bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.058335702866))), ~#aT_atan~0.base, ~bvadd32(28bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.049768779427)), ~#aT_atan~0.base, ~bvadd32(32bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.036531571299))), ~#aT_atan~0.base, ~bvadd32(36bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.016285819933)), ~#aT_atan~0.base, ~bvadd32(40bv32, ~#aT_atan~0.offset), 4bv32);~one_atan~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~huge_atan~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30));~pi_o_4~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.78539818525));~pi_o_2~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.5707963705));~pi~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.141592741));~tiny_atan2~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E-30));~zero_atan2~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE());~pi_lo_atan2~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 8.7422776573E-8))); {652#true} is VALID [2022-02-20 16:42:18,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {652#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());main_~y~0#1 := main_#t~nondet40#1;havoc main_#t~nondet40#1;assume { :begin_inline_isfinite_float } true;isfinite_float_#in~x#1 := main_~y~0#1;havoc isfinite_float_#res#1;havoc isfinite_float_#t~mem39#1, isfinite_float_~#gf_u~5#1.base, isfinite_float_~#gf_u~5#1.offset, isfinite_float_~x#1, isfinite_float_~ix~3#1;isfinite_float_~x#1 := isfinite_float_#in~x#1;havoc isfinite_float_~ix~3#1; {660#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 16:42:18,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {660#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|))} call isfinite_float_~#gf_u~5#1.base, isfinite_float_~#gf_u~5#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isfinite_float_~x#1, isfinite_float_~#gf_u~5#1.base, isfinite_float_~#gf_u~5#1.offset, 4bv32);call isfinite_float_#t~mem39#1 := read~intINTTYPE4(isfinite_float_~#gf_u~5#1.base, isfinite_float_~#gf_u~5#1.offset, 4bv32);isfinite_float_~ix~3#1 := isfinite_float_#t~mem39#1;havoc isfinite_float_#t~mem39#1;call ULTIMATE.dealloc(isfinite_float_~#gf_u~5#1.base, isfinite_float_~#gf_u~5#1.offset);havoc isfinite_float_~#gf_u~5#1.base, isfinite_float_~#gf_u~5#1.offset; {660#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 16:42:18,557 INFO L290 TraceCheckUtils]: 3: Hoare triple {660#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|))} goto; {660#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 16:42:18,557 INFO L290 TraceCheckUtils]: 4: Hoare triple {660#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|))} isfinite_float_~ix~3#1 := ~bvand32(2147483647bv32, isfinite_float_~ix~3#1);isfinite_float_#res#1 := (if ~bvslt32(isfinite_float_~ix~3#1, 2139095040bv32) then 1bv32 else 0bv32); {660#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 16:42:18,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {660#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|))} main_#t~ret41#1 := isfinite_float_#res#1;assume { :end_inline_isfinite_float } true; {660#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 16:42:18,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {660#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~x~0#1|))} assume 0bv32 != main_#t~ret41#1 && ~fp.lt~FLOAT(main_~y~0#1, ~Pluszero~FLOAT());havoc main_#t~ret41#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; {676#(and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~x#1|)) (fp.lt |ULTIMATE.start___ieee754_atan2f_~y#1| (_ +zero 8 24)))} is VALID [2022-02-20 16:42:18,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {676#(and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~x#1|)) (fp.lt |ULTIMATE.start___ieee754_atan2f_~y#1| (_ +zero 8 24)))} 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; {680#(and (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32)) |ULTIMATE.start___ieee754_atan2f_~hx~1#1|) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))))))) (fp.lt |ULTIMATE.start___ieee754_atan2f_~y#1| (_ +zero 8 24)))} is VALID [2022-02-20 16:42:18,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {680#(and (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32)) |ULTIMATE.start___ieee754_atan2f_~hx~1#1|) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))))))) (fp.lt |ULTIMATE.start___ieee754_atan2f_~y#1| (_ +zero 8 24)))} goto; {680#(and (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32)) |ULTIMATE.start___ieee754_atan2f_~hx~1#1|) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))))))) (fp.lt |ULTIMATE.start___ieee754_atan2f_~y#1| (_ +zero 8 24)))} is VALID [2022-02-20 16:42:18,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {680#(and (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32)) |ULTIMATE.start___ieee754_atan2f_~hx~1#1|) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))))))) (fp.lt |ULTIMATE.start___ieee754_atan2f_~y#1| (_ +zero 8 24)))} __ieee754_atan2f_~ix~2#1 := ~bvand32(2147483647bv32, __ieee754_atan2f_~hx~1#1); {687#(and (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))))))) (fp.lt |ULTIMATE.start___ieee754_atan2f_~y#1| (_ +zero 8 24)))} is VALID [2022-02-20 16:42:18,576 INFO L290 TraceCheckUtils]: 10: Hoare triple {687#(and (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))))))) (fp.lt |ULTIMATE.start___ieee754_atan2f_~y#1| (_ +zero 8 24)))} 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; {691#(and (fp.lt (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|)) (_ +zero 8 24)) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_1) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))))} is VALID [2022-02-20 16:42:18,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {691#(and (fp.lt (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|)) (_ +zero 8 24)) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_1) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))))} goto; {691#(and (fp.lt (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|)) (_ +zero 8 24)) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_1) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))))} is VALID [2022-02-20 16:42:18,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {691#(and (fp.lt (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|)) (_ +zero 8 24)) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_1) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))))} __ieee754_atan2f_~iy~0#1 := ~bvand32(2147483647bv32, __ieee754_atan2f_~hy~0#1); {698#(and (exists ((|ULTIMATE.start___ieee754_atan2f_~hy~0#1| (_ BitVec 32))) (and (fp.lt (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|)) (_ +zero 8 24)) (= |ULTIMATE.start___ieee754_atan2f_~iy~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|)))) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_1) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))))} is VALID [2022-02-20 16:42:18,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {698#(and (exists ((|ULTIMATE.start___ieee754_atan2f_~hy~0#1| (_ BitVec 32))) (and (fp.lt (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|)) (_ +zero 8 24)) (= |ULTIMATE.start___ieee754_atan2f_~iy~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|)))) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_1) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))))} 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); {653#false} is VALID [2022-02-20 16:42:18,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {653#false} main_#t~ret42#1 := __ieee754_atan2f_#res#1;assume { :end_inline___ieee754_atan2f } true;main_~res~0#1 := main_#t~ret42#1;havoc main_#t~ret42#1; {653#false} is VALID [2022-02-20 16:42:18,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {653#false} assume !~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~pi~0)); {653#false} is VALID [2022-02-20 16:42:18,601 INFO L290 TraceCheckUtils]: 16: Hoare triple {653#false} assume !false; {653#false} is VALID [2022-02-20 16:42:18,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:42:18,602 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:42:18,602 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:42:18,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1159762310] [2022-02-20 16:42:18,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1159762310] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:18,602 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:18,603 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 16:42:18,603 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686199627] [2022-02-20 16:42:18,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:18,604 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 16:42:18,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:18,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:18,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:18,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 16:42:18,688 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:42:18,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 16:42:18,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:42:18,689 INFO L87 Difference]: Start difference. First operand 92 states and 131 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)