./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_0661a.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_0661a.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 435d2cdf341382667c7bd6209addbdb4d7d5465501d562ccc5200a5ca5b72f0f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:40:27,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:40:27,445 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:40:27,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:40:27,480 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:40:27,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:40:27,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:40:27,490 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:40:27,491 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:40:27,492 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:40:27,493 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:40:27,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:40:27,494 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:40:27,498 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:40:27,500 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:40:27,501 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:40:27,502 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:40:27,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:40:27,505 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:40:27,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:40:27,510 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:40:27,511 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:40:27,512 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:40:27,513 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:40:27,515 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:40:27,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:40:27,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:40:27,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:40:27,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:40:27,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:40:27,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:40:27,522 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:40:27,523 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:40:27,524 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:40:27,525 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:40:27,525 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:40:27,525 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:40:27,526 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:40:27,526 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:40:27,526 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:40:27,527 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:40:27,528 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:40:27,551 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:40:27,554 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:40:27,555 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:40:27,555 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:40:27,556 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:40:27,556 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:40:27,556 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:40:27,556 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:40:27,556 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:40:27,557 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:40:27,557 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:40:27,558 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:40:27,558 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:40:27,558 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:40:27,558 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:40:27,558 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:40:27,558 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:40:27,559 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:40:27,559 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:40:27,559 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:40:27,559 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:40:27,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:40:27,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:40:27,560 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:40:27,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:40:27,560 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:40:27,560 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:40:27,562 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:40:27,562 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:40:27,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:40:27,562 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:40:27,562 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:40:27,562 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:40:27,563 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 -> 435d2cdf341382667c7bd6209addbdb4d7d5465501d562ccc5200a5ca5b72f0f [2022-02-20 16:40:27,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:40:27,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:40:27,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:40:27,795 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:40:27,795 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:40:27,796 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0661a.c [2022-02-20 16:40:27,846 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f0661e04/7aef6fc31294497095010161d0847f0b/FLAG6d72b6b1d [2022-02-20 16:40:28,199 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:40:28,200 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0661a.c [2022-02-20 16:40:28,206 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f0661e04/7aef6fc31294497095010161d0847f0b/FLAG6d72b6b1d [2022-02-20 16:40:28,220 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f0661e04/7aef6fc31294497095010161d0847f0b [2022-02-20 16:40:28,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:40:28,223 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:40:28,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:40:28,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:40:28,226 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:40:28,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:40:28" (1/1) ... [2022-02-20 16:40:28,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46b9fbcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:28, skipping insertion in model container [2022-02-20 16:40:28,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:40:28" (1/1) ... [2022-02-20 16:40:28,232 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:40:28,245 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:40:28,442 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_0661a.c[5271,5284] [2022-02-20 16:40:28,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:40:28,451 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:40:28,482 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_0661a.c[5271,5284] [2022-02-20 16:40:28,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:40:28,495 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:40:28,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:28 WrapperNode [2022-02-20 16:40:28,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:40:28,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:40:28,500 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:40:28,500 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:40:28,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:28" (1/1) ... [2022-02-20 16:40:28,523 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:28" (1/1) ... [2022-02-20 16:40:28,552 INFO L137 Inliner]: procedures = 19, calls = 79, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 254 [2022-02-20 16:40:28,553 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:40:28,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:40:28,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:40:28,554 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:40:28,559 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:28" (1/1) ... [2022-02-20 16:40:28,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:28" (1/1) ... [2022-02-20 16:40:28,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:28" (1/1) ... [2022-02-20 16:40:28,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:28" (1/1) ... [2022-02-20 16:40:28,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:28" (1/1) ... [2022-02-20 16:40:28,577 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:28" (1/1) ... [2022-02-20 16:40:28,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:28" (1/1) ... [2022-02-20 16:40:28,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:40:28,582 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:40:28,582 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:40:28,582 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:40:28,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:28" (1/1) ... [2022-02-20 16:40:28,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:40:28,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:40:28,619 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:40:28,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:40:28,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:40:28,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:40:28,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:40:28,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:40:28,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:40:28,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:40:28,652 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2022-02-20 16:40:28,653 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2022-02-20 16:40:28,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:40:28,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:40:28,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:40:28,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-02-20 16:40:28,654 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2022-02-20 16:40:28,655 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2022-02-20 16:40:28,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:40:28,751 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:40:28,768 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:40:29,196 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:40:29,202 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:40:29,202 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-02-20 16:40:29,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:40:29 BoogieIcfgContainer [2022-02-20 16:40:29,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:40:29,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:40:29,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:40:29,208 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:40:29,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:40:28" (1/3) ... [2022-02-20 16:40:29,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d448da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:40:29, skipping insertion in model container [2022-02-20 16:40:29,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:28" (2/3) ... [2022-02-20 16:40:29,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d448da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:40:29, skipping insertion in model container [2022-02-20 16:40:29,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:40:29" (3/3) ... [2022-02-20 16:40:29,210 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0661a.c [2022-02-20 16:40:29,213 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:40:29,213 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:40:29,243 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:40:29,248 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:40:29,248 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:40:29,263 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 97 states have (on average 1.731958762886598) internal successors, (168), 98 states have internal predecessors, (168), 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:40:29,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:40:29,267 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:40:29,267 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:40:29,267 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:40:29,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:40:29,271 INFO L85 PathProgramCache]: Analyzing trace with hash -498009200, now seen corresponding path program 1 times [2022-02-20 16:40:29,278 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:40:29,278 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991666480] [2022-02-20 16:40:29,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:40:29,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:40:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:40:29,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {108#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); {108#true} is VALID [2022-02-20 16:40:29,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {108#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := main_#t~nondet43#1;havoc main_#t~nondet43#1;main_~y~0#1 := ~someUnaryFLOAToperation(0.0); {108#true} is VALID [2022-02-20 16:40:29,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {108#true} assume ~someBinaryFLOATComparisonOperation(main_~x~0#1, 0.0);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; {108#true} is VALID [2022-02-20 16:40:29,467 INFO L290 TraceCheckUtils]: 3: Hoare triple {108#true} assume !true; {109#false} is VALID [2022-02-20 16:40:29,467 INFO L290 TraceCheckUtils]: 4: Hoare triple {109#false} assume 0 == __ieee754_atan2f_~hx~1#1;__ieee754_atan2f_~ix~2#1 := 0; {109#false} is VALID [2022-02-20 16:40:29,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {109#false} assume !true; {109#false} is VALID [2022-02-20 16:40:29,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {109#false} assume 0 == __ieee754_atan2f_~hy~0#1;__ieee754_atan2f_~iy~0#1 := 0; {109#false} is VALID [2022-02-20 16:40:29,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {109#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); {109#false} is VALID [2022-02-20 16:40:29,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {109#false} main_#t~ret44#1 := __ieee754_atan2f_#res#1;assume { :end_inline___ieee754_atan2f } true;main_~res~0#1 := main_#t~ret44#1;havoc main_#t~ret44#1; {109#false} is VALID [2022-02-20 16:40:29,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {109#false} assume ~someBinaryFLOATComparisonOperation(main_~res~0#1, ~someUnaryFLOAToperation(0.0)); {109#false} is VALID [2022-02-20 16:40:29,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {109#false} assume !false; {109#false} is VALID [2022-02-20 16:40:29,469 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:40:29,470 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:40:29,470 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991666480] [2022-02-20 16:40:29,470 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991666480] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:40:29,471 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:40:29,471 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:40:29,472 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611934273] [2022-02-20 16:40:29,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:40:29,476 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:40:29,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:40:29,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:29,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:40:29,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:40:29,490 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:40:29,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:40:29,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:40:29,506 INFO L87 Difference]: Start difference. First operand has 105 states, 97 states have (on average 1.731958762886598) internal successors, (168), 98 states have internal predecessors, (168), 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 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:29,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:29,622 INFO L93 Difference]: Finished difference Result 207 states and 352 transitions. [2022-02-20 16:40:29,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:40:29,623 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:40:29,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:40:29,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:29,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 352 transitions. [2022-02-20 16:40:29,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:29,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 352 transitions. [2022-02-20 16:40:29,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 352 transitions. [2022-02-20 16:40:29,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 352 edges. 352 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:40:29,968 INFO L225 Difference]: With dead ends: 207 [2022-02-20 16:40:29,969 INFO L226 Difference]: Without dead ends: 101 [2022-02-20 16:40:29,972 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:40:29,975 INFO L933 BasicCegarLoop]: 155 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, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:40:29,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:40:29,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-02-20 16:40:29,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-02-20 16:40:29,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:40:29,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 101 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 94 states have internal predecessors, (142), 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:40:29,999 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 101 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 94 states have internal predecessors, (142), 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:40:30,000 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 101 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 94 states have internal predecessors, (142), 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:40:30,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:30,007 INFO L93 Difference]: Finished difference Result 101 states and 150 transitions. [2022-02-20 16:40:30,007 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2022-02-20 16:40:30,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:40:30,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:40:30,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 94 states have internal predecessors, (142), 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 101 states. [2022-02-20 16:40:30,009 INFO L87 Difference]: Start difference. First operand has 101 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 94 states have internal predecessors, (142), 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 101 states. [2022-02-20 16:40:30,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:30,014 INFO L93 Difference]: Finished difference Result 101 states and 150 transitions. [2022-02-20 16:40:30,015 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2022-02-20 16:40:30,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:40:30,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:40:30,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:40:30,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:40:30,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 94 states have internal predecessors, (142), 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:40:30,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 150 transitions. [2022-02-20 16:40:30,021 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 150 transitions. Word has length 11 [2022-02-20 16:40:30,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:40:30,026 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 150 transitions. [2022-02-20 16:40:30,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:30,027 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2022-02-20 16:40:30,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:40:30,027 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:40:30,028 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:40:30,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:40:30,028 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:40:30,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:40:30,029 INFO L85 PathProgramCache]: Analyzing trace with hash -148901144, now seen corresponding path program 1 times [2022-02-20 16:40:30,029 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:40:30,029 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292291248] [2022-02-20 16:40:30,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:40:30,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:40:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:40:30,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {657#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); {657#true} is VALID [2022-02-20 16:40:30,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {657#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := main_#t~nondet43#1;havoc main_#t~nondet43#1;main_~y~0#1 := ~someUnaryFLOAToperation(0.0); {657#true} is VALID [2022-02-20 16:40:30,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {657#true} assume ~someBinaryFLOATComparisonOperation(main_~x~0#1, 0.0);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; {657#true} is VALID [2022-02-20 16:40:30,135 INFO L290 TraceCheckUtils]: 3: Hoare triple {657#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; {657#true} is VALID [2022-02-20 16:40:30,135 INFO L290 TraceCheckUtils]: 4: Hoare triple {657#true} goto; {657#true} is VALID [2022-02-20 16:40:30,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {657#true} assume 0 == __ieee754_atan2f_~hx~1#1;__ieee754_atan2f_~ix~2#1 := 0; {659#(= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0)} is VALID [2022-02-20 16:40:30,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {659#(= |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; {659#(= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0)} is VALID [2022-02-20 16:40:30,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {659#(= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0)} goto; {659#(= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0)} is VALID [2022-02-20 16:40:30,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#(= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0)} assume 0 == __ieee754_atan2f_~hy~0#1;__ieee754_atan2f_~iy~0#1 := 0; {660#(and (= |ULTIMATE.start___ieee754_atan2f_~iy~0#1| 0) (= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0))} is VALID [2022-02-20 16:40:30,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {660#(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); {658#false} is VALID [2022-02-20 16:40:30,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {658#false} main_#t~ret44#1 := __ieee754_atan2f_#res#1;assume { :end_inline___ieee754_atan2f } true;main_~res~0#1 := main_#t~ret44#1;havoc main_#t~ret44#1; {658#false} is VALID [2022-02-20 16:40:30,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {658#false} assume ~someBinaryFLOATComparisonOperation(main_~res~0#1, ~someUnaryFLOAToperation(0.0)); {658#false} is VALID [2022-02-20 16:40:30,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {658#false} assume !false; {658#false} is VALID [2022-02-20 16:40:30,142 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:40:30,142 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:40:30,143 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292291248] [2022-02-20 16:40:30,143 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292291248] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:40:30,143 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:40:30,143 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:40:30,144 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298621177] [2022-02-20 16:40:30,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:40:30,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-02-20 16:40:30,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:40:30,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:40:30,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:40:30,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:40:30,155 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:40:30,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:40:30,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:40:30,158 INFO L87 Difference]: Start difference. First operand 101 states and 150 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:40:30,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:30,375 INFO L93 Difference]: Finished difference Result 214 states and 319 transitions. [2022-02-20 16:40:30,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:40:30,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-02-20 16:40:30,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:40:30,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:40:30,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 319 transitions. [2022-02-20 16:40:30,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:40:30,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 319 transitions. [2022-02-20 16:40:30,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 319 transitions. [2022-02-20 16:40:30,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 319 edges. 319 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:40:30,609 INFO L225 Difference]: With dead ends: 214 [2022-02-20 16:40:30,609 INFO L226 Difference]: Without dead ends: 143 [2022-02-20 16:40:30,610 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:40:30,611 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 80 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:40:30,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 318 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:40:30,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-02-20 16:40:30,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 128. [2022-02-20 16:40:30,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:40:30,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 128 states, 121 states have (on average 1.5454545454545454) internal successors, (187), 121 states have internal predecessors, (187), 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:40:30,634 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 128 states, 121 states have (on average 1.5454545454545454) internal successors, (187), 121 states have internal predecessors, (187), 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:40:30,634 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 128 states, 121 states have (on average 1.5454545454545454) internal successors, (187), 121 states have internal predecessors, (187), 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:40:30,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:30,639 INFO L93 Difference]: Finished difference Result 143 states and 211 transitions. [2022-02-20 16:40:30,639 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 211 transitions. [2022-02-20 16:40:30,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:40:30,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:40:30,641 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 121 states have (on average 1.5454545454545454) internal successors, (187), 121 states have internal predecessors, (187), 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 143 states. [2022-02-20 16:40:30,641 INFO L87 Difference]: Start difference. First operand has 128 states, 121 states have (on average 1.5454545454545454) internal successors, (187), 121 states have internal predecessors, (187), 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 143 states. [2022-02-20 16:40:30,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:30,645 INFO L93 Difference]: Finished difference Result 143 states and 211 transitions. [2022-02-20 16:40:30,645 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 211 transitions. [2022-02-20 16:40:30,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:40:30,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:40:30,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:40:30,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:40:30,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 121 states have (on average 1.5454545454545454) internal successors, (187), 121 states have internal predecessors, (187), 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:40:30,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 195 transitions. [2022-02-20 16:40:30,651 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 195 transitions. Word has length 13 [2022-02-20 16:40:30,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:40:30,651 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 195 transitions. [2022-02-20 16:40:30,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:40:30,651 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 195 transitions. [2022-02-20 16:40:30,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 16:40:30,652 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:40:30,652 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:40:30,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:40:30,652 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:40:30,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:40:30,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1534369806, now seen corresponding path program 1 times [2022-02-20 16:40:30,653 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:40:30,653 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865064546] [2022-02-20 16:40:30,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:40:30,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:40:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:40:30,687 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:40:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:40:30,730 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:40:30,730 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:40:30,731 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:40:30,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:40:30,735 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:40:30,737 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:40:30,767 WARN L170 areAnnotationChecker]: fabs_floatENTRY has no Hoare annotation [2022-02-20 16:40:30,768 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:40:30,768 WARN L170 areAnnotationChecker]: atan_floatENTRY has no Hoare annotation [2022-02-20 16:40:30,768 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-02-20 16:40:30,768 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-02-20 16:40:30,768 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:40:30,768 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2022-02-20 16:40:30,768 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2022-02-20 16:40:30,769 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 16:40:30,769 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 16:40:30,769 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:40:30,769 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:40:30,769 WARN L170 areAnnotationChecker]: L226 has no Hoare annotation [2022-02-20 16:40:30,769 WARN L170 areAnnotationChecker]: L226 has no Hoare annotation [2022-02-20 16:40:30,769 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2022-02-20 16:40:30,769 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2022-02-20 16:40:30,769 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2022-02-20 16:40:30,770 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2022-02-20 16:40:30,770 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-20 16:40:30,770 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-20 16:40:30,770 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-02-20 16:40:30,770 WARN L170 areAnnotationChecker]: L124-2 has no Hoare annotation [2022-02-20 16:40:30,770 WARN L170 areAnnotationChecker]: L124-2 has no Hoare annotation [2022-02-20 16:40:30,770 WARN L170 areAnnotationChecker]: L226-2 has no Hoare annotation [2022-02-20 16:40:30,770 WARN L170 areAnnotationChecker]: L62-7 has no Hoare annotation [2022-02-20 16:40:30,771 WARN L170 areAnnotationChecker]: L62-7 has no Hoare annotation [2022-02-20 16:40:30,771 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-02-20 16:40:30,771 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-02-20 16:40:30,771 WARN L170 areAnnotationChecker]: fabs_floatFINAL has no Hoare annotation [2022-02-20 16:40:30,771 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2022-02-20 16:40:30,771 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2022-02-20 16:40:30,771 WARN L170 areAnnotationChecker]: L124-3 has no Hoare annotation [2022-02-20 16:40:30,771 WARN L170 areAnnotationChecker]: L124-3 has no Hoare annotation [2022-02-20 16:40:30,771 WARN L170 areAnnotationChecker]: L235 has no Hoare annotation [2022-02-20 16:40:30,771 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-02-20 16:40:30,772 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-02-20 16:40:30,772 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-02-20 16:40:30,772 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-02-20 16:40:30,772 WARN L170 areAnnotationChecker]: L62-3 has no Hoare annotation [2022-02-20 16:40:30,772 WARN L170 areAnnotationChecker]: L62-3 has no Hoare annotation [2022-02-20 16:40:30,772 WARN L170 areAnnotationChecker]: fabs_floatEXIT has no Hoare annotation [2022-02-20 16:40:30,772 WARN L170 areAnnotationChecker]: fabs_floatEXIT has no Hoare annotation [2022-02-20 16:40:30,772 WARN L170 areAnnotationChecker]: L130-1 has no Hoare annotation [2022-02-20 16:40:30,772 WARN L170 areAnnotationChecker]: L130-1 has no Hoare annotation [2022-02-20 16:40:30,773 WARN L170 areAnnotationChecker]: L129-1 has no Hoare annotation [2022-02-20 16:40:30,773 WARN L170 areAnnotationChecker]: L129-1 has no Hoare annotation [2022-02-20 16:40:30,773 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:40:30,773 WARN L170 areAnnotationChecker]: atan_floatFINAL has no Hoare annotation [2022-02-20 16:40:30,773 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:40:30,773 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:40:30,773 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:40:30,773 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:40:30,773 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:40:30,774 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:40:30,774 WARN L170 areAnnotationChecker]: L62-5 has no Hoare annotation [2022-02-20 16:40:30,774 WARN L170 areAnnotationChecker]: L62-5 has no Hoare annotation [2022-02-20 16:40:30,774 WARN L170 areAnnotationChecker]: L192-1 has no Hoare annotation [2022-02-20 16:40:30,774 WARN L170 areAnnotationChecker]: L192-1 has no Hoare annotation [2022-02-20 16:40:30,774 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:40:30,774 WARN L170 areAnnotationChecker]: L130 has no Hoare annotation [2022-02-20 16:40:30,774 WARN L170 areAnnotationChecker]: L130 has no Hoare annotation [2022-02-20 16:40:30,774 WARN L170 areAnnotationChecker]: L130-2 has no Hoare annotation [2022-02-20 16:40:30,774 WARN L170 areAnnotationChecker]: L130-2 has no Hoare annotation [2022-02-20 16:40:30,775 WARN L170 areAnnotationChecker]: L129-3 has no Hoare annotation [2022-02-20 16:40:30,775 WARN L170 areAnnotationChecker]: L129-3 has no Hoare annotation [2022-02-20 16:40:30,775 WARN L170 areAnnotationChecker]: atan_floatEXIT has no Hoare annotation [2022-02-20 16:40:30,775 WARN L170 areAnnotationChecker]: atan_floatEXIT has no Hoare annotation [2022-02-20 16:40:30,775 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:40:30,775 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:40:30,775 WARN L170 areAnnotationChecker]: L72-2 has no Hoare annotation [2022-02-20 16:40:30,775 WARN L170 areAnnotationChecker]: L192-2 has no Hoare annotation [2022-02-20 16:40:30,775 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-02-20 16:40:30,775 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-02-20 16:40:30,776 WARN L170 areAnnotationChecker]: L135-7 has no Hoare annotation [2022-02-20 16:40:30,776 WARN L170 areAnnotationChecker]: L135-7 has no Hoare annotation [2022-02-20 16:40:30,776 WARN L170 areAnnotationChecker]: L135-1 has no Hoare annotation [2022-02-20 16:40:30,776 WARN L170 areAnnotationChecker]: L135-1 has no Hoare annotation [2022-02-20 16:40:30,776 WARN L170 areAnnotationChecker]: L129-5 has no Hoare annotation [2022-02-20 16:40:30,776 WARN L170 areAnnotationChecker]: L129-5 has no Hoare annotation [2022-02-20 16:40:30,776 WARN L170 areAnnotationChecker]: L139-1 has no Hoare annotation [2022-02-20 16:40:30,776 WARN L170 areAnnotationChecker]: L88-2 has no Hoare annotation [2022-02-20 16:40:30,776 WARN L170 areAnnotationChecker]: L189-2 has no Hoare annotation [2022-02-20 16:40:30,776 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:40:30,777 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:40:30,777 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:40:30,777 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:40:30,777 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2022-02-20 16:40:30,777 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2022-02-20 16:40:30,777 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2022-02-20 16:40:30,777 WARN L170 areAnnotationChecker]: L135-3 has no Hoare annotation [2022-02-20 16:40:30,777 WARN L170 areAnnotationChecker]: L135-3 has no Hoare annotation [2022-02-20 16:40:30,777 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:40:30,778 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:40:30,778 WARN L170 areAnnotationChecker]: L194 has no Hoare annotation [2022-02-20 16:40:30,778 WARN L170 areAnnotationChecker]: L194 has no Hoare annotation [2022-02-20 16:40:30,778 WARN L170 areAnnotationChecker]: L229 has no Hoare annotation [2022-02-20 16:40:30,778 WARN L170 areAnnotationChecker]: L229 has no Hoare annotation [2022-02-20 16:40:30,778 WARN L170 areAnnotationChecker]: L139 has no Hoare annotation [2022-02-20 16:40:30,778 WARN L170 areAnnotationChecker]: L139 has no Hoare annotation [2022-02-20 16:40:30,778 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2022-02-20 16:40:30,778 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2022-02-20 16:40:30,778 WARN L170 areAnnotationChecker]: L135-5 has no Hoare annotation [2022-02-20 16:40:30,779 WARN L170 areAnnotationChecker]: L135-5 has no Hoare annotation [2022-02-20 16:40:30,779 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-02-20 16:40:30,779 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-02-20 16:40:30,779 WARN L170 areAnnotationChecker]: L196 has no Hoare annotation [2022-02-20 16:40:30,779 WARN L170 areAnnotationChecker]: L196 has no Hoare annotation [2022-02-20 16:40:30,779 WARN L170 areAnnotationChecker]: L230 has no Hoare annotation [2022-02-20 16:40:30,779 WARN L170 areAnnotationChecker]: L230 has no Hoare annotation [2022-02-20 16:40:30,779 WARN L170 areAnnotationChecker]: L140-8 has no Hoare annotation [2022-02-20 16:40:30,779 WARN L170 areAnnotationChecker]: L140-8 has no Hoare annotation [2022-02-20 16:40:30,779 WARN L170 areAnnotationChecker]: L140-2 has no Hoare annotation [2022-02-20 16:40:30,780 WARN L170 areAnnotationChecker]: L140-2 has no Hoare annotation [2022-02-20 16:40:30,780 WARN L170 areAnnotationChecker]: L113-2 has no Hoare annotation [2022-02-20 16:40:30,780 WARN L170 areAnnotationChecker]: L198-2 has no Hoare annotation [2022-02-20 16:40:30,780 WARN L170 areAnnotationChecker]: L198-2 has no Hoare annotation [2022-02-20 16:40:30,780 WARN L170 areAnnotationChecker]: L210 has no Hoare annotation [2022-02-20 16:40:30,780 WARN L170 areAnnotationChecker]: L210 has no Hoare annotation [2022-02-20 16:40:30,780 WARN L170 areAnnotationChecker]: L144 has no Hoare annotation [2022-02-20 16:40:30,780 WARN L170 areAnnotationChecker]: L144 has no Hoare annotation [2022-02-20 16:40:30,780 WARN L170 areAnnotationChecker]: L142-1 has no Hoare annotation [2022-02-20 16:40:30,781 WARN L170 areAnnotationChecker]: L142-1 has no Hoare annotation [2022-02-20 16:40:30,781 WARN L170 areAnnotationChecker]: L140-4 has no Hoare annotation [2022-02-20 16:40:30,781 WARN L170 areAnnotationChecker]: L140-4 has no Hoare annotation [2022-02-20 16:40:30,781 WARN L170 areAnnotationChecker]: L198-1 has no Hoare annotation [2022-02-20 16:40:30,781 WARN L170 areAnnotationChecker]: L198-1 has no Hoare annotation [2022-02-20 16:40:30,781 WARN L170 areAnnotationChecker]: L203-1 has no Hoare annotation [2022-02-20 16:40:30,781 WARN L170 areAnnotationChecker]: L203-1 has no Hoare annotation [2022-02-20 16:40:30,781 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2022-02-20 16:40:30,781 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2022-02-20 16:40:30,781 WARN L170 areAnnotationChecker]: L144-2 has no Hoare annotation [2022-02-20 16:40:30,782 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2022-02-20 16:40:30,782 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2022-02-20 16:40:30,782 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2022-02-20 16:40:30,782 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2022-02-20 16:40:30,782 WARN L170 areAnnotationChecker]: L140-6 has no Hoare annotation [2022-02-20 16:40:30,782 WARN L170 areAnnotationChecker]: L140-6 has no Hoare annotation [2022-02-20 16:40:30,782 WARN L170 areAnnotationChecker]: L203 has no Hoare annotation [2022-02-20 16:40:30,782 WARN L170 areAnnotationChecker]: L203 has no Hoare annotation [2022-02-20 16:40:30,782 WARN L170 areAnnotationChecker]: L203-2 has no Hoare annotation [2022-02-20 16:40:30,782 WARN L170 areAnnotationChecker]: L193 has no Hoare annotation [2022-02-20 16:40:30,783 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2022-02-20 16:40:30,783 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2022-02-20 16:40:30,783 WARN L170 areAnnotationChecker]: L155-2 has no Hoare annotation [2022-02-20 16:40:30,783 WARN L170 areAnnotationChecker]: L158 has no Hoare annotation [2022-02-20 16:40:30,783 WARN L170 areAnnotationChecker]: L158 has no Hoare annotation [2022-02-20 16:40:30,783 WARN L170 areAnnotationChecker]: L157-1 has no Hoare annotation [2022-02-20 16:40:30,783 WARN L170 areAnnotationChecker]: L157-1 has no Hoare annotation [2022-02-20 16:40:30,783 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-02-20 16:40:30,783 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-02-20 16:40:30,784 WARN L170 areAnnotationChecker]: L160 has no Hoare annotation [2022-02-20 16:40:30,784 WARN L170 areAnnotationChecker]: L160 has no Hoare annotation [2022-02-20 16:40:30,784 WARN L170 areAnnotationChecker]: L171 has no Hoare annotation [2022-02-20 16:40:30,784 WARN L170 areAnnotationChecker]: L171 has no Hoare annotation [2022-02-20 16:40:30,784 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2022-02-20 16:40:30,784 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2022-02-20 16:40:30,784 WARN L170 areAnnotationChecker]: L187 has no Hoare annotation [2022-02-20 16:40:30,784 WARN L170 areAnnotationChecker]: L187 has no Hoare annotation [2022-02-20 16:40:30,784 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2022-02-20 16:40:30,785 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2022-02-20 16:40:30,785 WARN L170 areAnnotationChecker]: L162 has no Hoare annotation [2022-02-20 16:40:30,785 WARN L170 areAnnotationChecker]: L162 has no Hoare annotation [2022-02-20 16:40:30,785 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2022-02-20 16:40:30,785 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2022-02-20 16:40:30,785 WARN L170 areAnnotationChecker]: L184-2 has no Hoare annotation [2022-02-20 16:40:30,785 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2022-02-20 16:40:30,785 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2022-02-20 16:40:30,786 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-02-20 16:40:30,786 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2022-02-20 16:40:30,786 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2022-02-20 16:40:30,786 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2022-02-20 16:40:30,786 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2022-02-20 16:40:30,786 WARN L170 areAnnotationChecker]: L192 has no Hoare annotation [2022-02-20 16:40:30,786 WARN L170 areAnnotationChecker]: L192 has no Hoare annotation [2022-02-20 16:40:30,786 WARN L170 areAnnotationChecker]: L166 has no Hoare annotation [2022-02-20 16:40:30,786 WARN L170 areAnnotationChecker]: L166 has no Hoare annotation [2022-02-20 16:40:30,787 WARN L170 areAnnotationChecker]: L177 has no Hoare annotation [2022-02-20 16:40:30,787 WARN L170 areAnnotationChecker]: L177 has no Hoare annotation [2022-02-20 16:40:30,787 WARN L170 areAnnotationChecker]: L159 has no Hoare annotation [2022-02-20 16:40:30,787 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2022-02-20 16:40:30,787 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:40:30,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:40:30 BoogieIcfgContainer [2022-02-20 16:40:30,788 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:40:30,789 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:40:30,789 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:40:30,789 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:40:30,789 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:40:29" (3/4) ... [2022-02-20 16:40:30,792 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:40:30,792 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:40:30,793 INFO L158 Benchmark]: Toolchain (without parser) took 2569.71ms. Allocated memory was 100.7MB in the beginning and 132.1MB in the end (delta: 31.5MB). Free memory was 67.9MB in the beginning and 61.9MB in the end (delta: 6.0MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2022-02-20 16:40:30,793 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 100.7MB. Free memory was 57.3MB in the beginning and 57.3MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:40:30,794 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.56ms. Allocated memory is still 100.7MB. Free memory was 67.8MB in the beginning and 70.7MB in the end (delta: -2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:40:30,794 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.70ms. Allocated memory is still 100.7MB. Free memory was 70.7MB in the beginning and 67.5MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:40:30,794 INFO L158 Benchmark]: Boogie Preprocessor took 28.34ms. Allocated memory is still 100.7MB. Free memory was 67.5MB in the beginning and 64.1MB in the end (delta: 3.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 16:40:30,795 INFO L158 Benchmark]: RCFGBuilder took 621.65ms. Allocated memory was 100.7MB in the beginning and 132.1MB in the end (delta: 31.5MB). Free memory was 64.1MB in the beginning and 93.9MB in the end (delta: -29.8MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2022-02-20 16:40:30,795 INFO L158 Benchmark]: TraceAbstraction took 1583.20ms. Allocated memory is still 132.1MB. Free memory was 93.9MB in the beginning and 61.9MB in the end (delta: 32.0MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2022-02-20 16:40:30,795 INFO L158 Benchmark]: Witness Printer took 3.31ms. Allocated memory is still 132.1MB. Free memory is still 61.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:40:30,797 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 100.7MB. Free memory was 57.3MB in the beginning and 57.3MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.56ms. Allocated memory is still 100.7MB. Free memory was 67.8MB in the beginning and 70.7MB in the end (delta: -2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.70ms. Allocated memory is still 100.7MB. Free memory was 70.7MB in the beginning and 67.5MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.34ms. Allocated memory is still 100.7MB. Free memory was 67.5MB in the beginning and 64.1MB in the end (delta: 3.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 621.65ms. Allocated memory was 100.7MB in the beginning and 132.1MB in the end (delta: 31.5MB). Free memory was 64.1MB in the beginning and 93.9MB in the end (delta: -29.8MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1583.20ms. Allocated memory is still 132.1MB. Free memory was 93.9MB in the beginning and 61.9MB in the end (delta: 32.0MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. * Witness Printer took 3.31ms. Allocated memory is still 132.1MB. Free memory is still 61.9MB. 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: 230]: 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 229, overapproximation of someUnaryDOUBLEoperation at line 44, overapproximation of someUnaryFLOAToperation at line 219, 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] [L218] float x = __VERIFIER_nondet_float(); [L219] float y = -0.0f; 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] [L226] COND TRUE x > 0.0f [L227] CALL, EXPR __ieee754_atan2f(y, x) [L121] float z; [L122] __int32_t k, m, hx, hy, ix, iy; VAL [\old(x)=1000000000000000000000000000003, \old(y)=1000000000000000000000000000002, 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=1000000000000000000000000000002, 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)=1000000000000000000000000000002, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=2147483647, ix=2147483646, ix = hx & 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=1000000000000000000000000000002, 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)=1000000000000000000000000000002, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=2147483647, hy=0, ix=2147483646, ix = hx & 0x7fffffff=2147483647, iy=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000003, y=1000000000000000000000000000002, zero_atan2=0] [L136] COND TRUE ((ix) > 0x7f800000L) || ((iy) > 0x7f800000L) [L137] return x + y; VAL [\old(x)=1000000000000000000000000000003, \old(y)=1000000000000000000000000000002, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=2147483647, hy=0, ix=2147483646, ix = hx & 0x7fffffff=2147483647, iy=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000003, y=1000000000000000000000000000002, zero_atan2=0] [L227] RET, EXPR __ieee754_atan2f(y, x) [L227] float res = __ieee754_atan2f(y, x); [L229] COND TRUE res != -0.0f VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, ix = hx & 0x7fffffff=2147483647, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=1000000000000000000000000000001, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000003, y=1000000000000000000000000000002, zero_atan2=0] [L230] reach_error() VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, ix = hx & 0x7fffffff=2147483647, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=1000000000000000000000000000001, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000003, y=1000000000000000000000000000002, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 82 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 473 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 158 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23 IncrementalHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 315 mSDtfsCounter, 23 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=128occurred 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.2s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 34 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:40:30,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_0661a.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 435d2cdf341382667c7bd6209addbdb4d7d5465501d562ccc5200a5ca5b72f0f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:40:32,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:40:32,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:40:32,887 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:40:32,887 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:40:32,888 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:40:32,889 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:40:32,890 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:40:32,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:40:32,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:40:32,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:40:32,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:40:32,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:40:32,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:40:32,895 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:40:32,896 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:40:32,897 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:40:32,897 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:40:32,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:40:32,899 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:40:32,903 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:40:32,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:40:32,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:40:32,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:40:32,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:40:32,913 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:40:32,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:40:32,913 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:40:32,914 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:40:32,914 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:40:32,915 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:40:32,915 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:40:32,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:40:32,916 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:40:32,917 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:40:32,917 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:40:32,918 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:40:32,918 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:40:32,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:40:32,919 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:40:32,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:40:32,923 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:40:32,964 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:40:32,965 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:40:32,965 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:40:32,965 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:40:32,965 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:40:32,965 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:40:32,966 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:40:32,967 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:40:32,967 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:40:32,967 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:40:32,967 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:40:32,967 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:40:32,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:40:32,968 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:40:32,968 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:40:32,968 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:40:32,968 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:40:32,968 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:40:32,968 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:40:32,968 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:40:32,968 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:40:32,969 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:40:32,969 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:40:32,970 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:40:32,970 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:40:32,970 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:40:32,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:40:32,970 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:40:32,970 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:40:32,970 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:40:32,971 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:40:32,971 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:40:32,971 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:40:32,971 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:40:32,971 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:40:32,971 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:40:32,972 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 -> 435d2cdf341382667c7bd6209addbdb4d7d5465501d562ccc5200a5ca5b72f0f [2022-02-20 16:40:33,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:40:33,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:40:33,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:40:33,339 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:40:33,339 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:40:33,340 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0661a.c [2022-02-20 16:40:33,381 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0e295dfe/e4a07406b2fe472d9d86a047f7261327/FLAG4c1935373 [2022-02-20 16:40:33,746 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:40:33,747 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0661a.c [2022-02-20 16:40:33,752 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0e295dfe/e4a07406b2fe472d9d86a047f7261327/FLAG4c1935373 [2022-02-20 16:40:33,761 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0e295dfe/e4a07406b2fe472d9d86a047f7261327 [2022-02-20 16:40:33,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:40:33,764 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:40:33,764 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:40:33,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:40:33,767 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:40:33,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:40:33" (1/1) ... [2022-02-20 16:40:33,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@592c0950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:33, skipping insertion in model container [2022-02-20 16:40:33,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:40:33" (1/1) ... [2022-02-20 16:40:33,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:40:33,789 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:40:33,987 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_0661a.c[5271,5284] [2022-02-20 16:40:33,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:40:34,011 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:40:34,076 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_0661a.c[5271,5284] [2022-02-20 16:40:34,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:40:34,092 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:40:34,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:34 WrapperNode [2022-02-20 16:40:34,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:40:34,094 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:40:34,094 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:40:34,094 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:40:34,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:34" (1/1) ... [2022-02-20 16:40:34,122 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:34" (1/1) ... [2022-02-20 16:40:34,158 INFO L137 Inliner]: procedures = 22, calls = 79, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 219 [2022-02-20 16:40:34,158 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:40:34,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:40:34,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:40:34,159 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:40:34,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:34" (1/1) ... [2022-02-20 16:40:34,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:34" (1/1) ... [2022-02-20 16:40:34,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:34" (1/1) ... [2022-02-20 16:40:34,179 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:34" (1/1) ... [2022-02-20 16:40:34,203 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:34" (1/1) ... [2022-02-20 16:40:34,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:34" (1/1) ... [2022-02-20 16:40:34,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:34" (1/1) ... [2022-02-20 16:40:34,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:40:34,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:40:34,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:40:34,223 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:40:34,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:34" (1/1) ... [2022-02-20 16:40:34,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:40:34,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:40:34,273 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:40:34,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:40:34,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:40:34,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-02-20 16:40:34,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:40:34,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:40:34,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:40:34,308 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2022-02-20 16:40:34,308 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2022-02-20 16:40:34,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:40:34,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:40:34,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:40:34,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:40:34,308 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2022-02-20 16:40:34,309 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2022-02-20 16:40:34,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:40:34,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:40:34,375 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:40:34,376 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:40:47,585 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:40:47,591 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:40:47,591 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-02-20 16:40:47,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:40:47 BoogieIcfgContainer [2022-02-20 16:40:47,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:40:47,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:40:47,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:40:47,596 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:40:47,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:40:33" (1/3) ... [2022-02-20 16:40:47,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5591d07a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:40:47, skipping insertion in model container [2022-02-20 16:40:47,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:34" (2/3) ... [2022-02-20 16:40:47,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5591d07a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:40:47, skipping insertion in model container [2022-02-20 16:40:47,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:40:47" (3/3) ... [2022-02-20 16:40:47,598 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0661a.c [2022-02-20 16:40:47,613 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:40:47,613 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:40:47,649 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:40:47,653 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:40:47,654 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:40:47,671 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 84 states have (on average 1.6547619047619047) internal successors, (139), 85 states have internal predecessors, (139), 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:40:47,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:40:47,674 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:40:47,675 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:40:47,675 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:40:47,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:40:47,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1457381495, now seen corresponding path program 1 times [2022-02-20 16:40:47,704 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:40:47,706 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1955854231] [2022-02-20 16:40:47,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:40:47,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:40:47,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:40:47,708 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:40:47,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:40:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:40:48,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:40:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:40:48,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:40:48,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {95#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))); {95#true} is VALID [2022-02-20 16:40:48,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {95#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet39#1, main_#t~ret40#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := main_#t~nondet39#1;havoc main_#t~nondet39#1;main_~y~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT()); {95#true} is VALID [2022-02-20 16:40:48,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {95#true} assume ~fp.gt~FLOAT(main_~x~0#1, ~Pluszero~FLOAT());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; {95#true} is VALID [2022-02-20 16:40:48,618 INFO L290 TraceCheckUtils]: 3: Hoare triple {95#true} assume !true; {96#false} is VALID [2022-02-20 16:40:48,618 INFO L290 TraceCheckUtils]: 4: Hoare triple {96#false} __ieee754_atan2f_~ix~2#1 := ~bvand32(2147483647bv32, __ieee754_atan2f_~hx~1#1); {96#false} is VALID [2022-02-20 16:40:48,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {96#false} assume !true; {96#false} is VALID [2022-02-20 16:40:48,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {96#false} __ieee754_atan2f_~iy~0#1 := ~bvand32(2147483647bv32, __ieee754_atan2f_~hy~0#1); {96#false} is VALID [2022-02-20 16:40:48,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {96#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); {96#false} is VALID [2022-02-20 16:40:48,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {96#false} main_#t~ret40#1 := __ieee754_atan2f_#res#1;assume { :end_inline___ieee754_atan2f } true;main_~res~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1; {96#false} is VALID [2022-02-20 16:40:48,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {96#false} assume !~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {96#false} is VALID [2022-02-20 16:40:48,619 INFO L290 TraceCheckUtils]: 10: Hoare triple {96#false} assume !false; {96#false} is VALID [2022-02-20 16:40:48,620 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:40:48,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:40:48,621 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:40:48,621 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1955854231] [2022-02-20 16:40:48,622 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1955854231] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:40:48,622 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:40:48,622 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:40:48,623 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369640341] [2022-02-20 16:40:48,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:40:48,627 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:40:48,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:40:48,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:48,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:40:48,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:40:48,659 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:40:48,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:40:48,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:40:48,675 INFO L87 Difference]: Start difference. First operand has 92 states, 84 states have (on average 1.6547619047619047) internal successors, (139), 85 states have internal predecessors, (139), 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 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:41:02,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:41:02,443 INFO L93 Difference]: Finished difference Result 181 states and 294 transitions. [2022-02-20 16:41:02,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:41:02,444 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:41:02,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:41:02,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:41:02,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 294 transitions. [2022-02-20 16:41:02,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:41:02,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 294 transitions. [2022-02-20 16:41:02,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 294 transitions. [2022-02-20 16:41:06,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 294 edges. 294 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:41:06,051 INFO L225 Difference]: With dead ends: 181 [2022-02-20 16:41:06,051 INFO L226 Difference]: Without dead ends: 88 [2022-02-20 16:41:06,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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:06,056 INFO L933 BasicCegarLoop]: 132 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, 132 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:06,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 132 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:06,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-02-20 16:41:06,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-02-20 16:41:06,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:41:06,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 88 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 81 states have internal predecessors, (119), 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:06,085 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 88 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 81 states have internal predecessors, (119), 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:06,085 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 88 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 81 states have internal predecessors, (119), 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:06,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:41:06,091 INFO L93 Difference]: Finished difference Result 88 states and 127 transitions. [2022-02-20 16:41:06,091 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 127 transitions. [2022-02-20 16:41:06,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:41:06,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:41:06,093 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 81 states have internal predecessors, (119), 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 88 states. [2022-02-20 16:41:06,093 INFO L87 Difference]: Start difference. First operand has 88 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 81 states have internal predecessors, (119), 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 88 states. [2022-02-20 16:41:06,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:41:06,098 INFO L93 Difference]: Finished difference Result 88 states and 127 transitions. [2022-02-20 16:41:06,098 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 127 transitions. [2022-02-20 16:41:06,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:41:06,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:41:06,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:41:06,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:41:06,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 81 states have internal predecessors, (119), 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:06,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 127 transitions. [2022-02-20 16:41:06,105 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 127 transitions. Word has length 11 [2022-02-20 16:41:06,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:41:06,105 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 127 transitions. [2022-02-20 16:41:06,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:41:06,106 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 127 transitions. [2022-02-20 16:41:06,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:41:06,106 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:41:06,106 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:41:06,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:41:06,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:41:06,316 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:41:06,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:41:06,317 INFO L85 PathProgramCache]: Analyzing trace with hash 413175488, now seen corresponding path program 1 times [2022-02-20 16:41:06,317 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:41:06,317 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014992286] [2022-02-20 16:41:06,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:41:06,317 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:41:06,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:41:06,323 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:41:06,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:41:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:41:07,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 16:41:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:41:07,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:41:07,425 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:41:08,028 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 31 treesize of output 15 [2022-02-20 16:41:08,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {612#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))); {612#true} is VALID [2022-02-20 16:41:08,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {612#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet39#1, main_#t~ret40#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := main_#t~nondet39#1;havoc main_#t~nondet39#1;main_~y~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT()); {620#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 16:41:08,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {620#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)} assume ~fp.gt~FLOAT(main_~x~0#1, ~Pluszero~FLOAT());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; {624#(and (fp.gt |ULTIMATE.start___ieee754_atan2f_~x#1| (_ +zero 8 24)) (= (fp.neg (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~y#1|))} is VALID [2022-02-20 16:41:08,628 INFO L290 TraceCheckUtils]: 3: Hoare triple {624#(and (fp.gt |ULTIMATE.start___ieee754_atan2f_~x#1| (_ +zero 8 24)) (= (fp.neg (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~y#1|))} call __ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_atan2f_~x#1, __ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset, 4bv32);call __ieee754_atan2f_#t~mem26#1 := read~intINTTYPE4(__ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset, 4bv32);__ieee754_atan2f_~hx~1#1 := __ieee754_atan2f_#t~mem26#1;havoc __ieee754_atan2f_#t~mem26#1;call ULTIMATE.dealloc(__ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset);havoc __ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset; {628#(and (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32))) (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.gt (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)))) (_ +zero 8 24)))) (= (fp.neg (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~y#1|))} is VALID [2022-02-20 16:41:08,629 INFO L290 TraceCheckUtils]: 4: Hoare triple {628#(and (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32))) (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.gt (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)))) (_ +zero 8 24)))) (= (fp.neg (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~y#1|))} goto; {628#(and (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32))) (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.gt (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)))) (_ +zero 8 24)))) (= (fp.neg (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~y#1|))} is VALID [2022-02-20 16:41:08,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {628#(and (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32))) (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.gt (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)))) (_ +zero 8 24)))) (= (fp.neg (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~y#1|))} __ieee754_atan2f_~ix~2#1 := ~bvand32(2147483647bv32, __ieee754_atan2f_~hx~1#1); {635#(and (= (fp.neg (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~y#1|) (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32))) (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.gt (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)))) (_ +zero 8 24)))))} is VALID [2022-02-20 16:41:08,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {635#(and (= (fp.neg (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~y#1|) (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32))) (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.gt (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)))) (_ +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; {639#(and (= (fp.neg (_ +zero 8 24)) (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|))) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_1) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|) (fp.gt (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (_ +zero 8 24)))))} is VALID [2022-02-20 16:41:08,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {639#(and (= (fp.neg (_ +zero 8 24)) (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|))) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_1) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|) (fp.gt (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (_ +zero 8 24)))))} goto; {639#(and (= (fp.neg (_ +zero 8 24)) (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|))) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_1) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|) (fp.gt (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (_ +zero 8 24)))))} is VALID [2022-02-20 16:41:08,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {639#(and (= (fp.neg (_ +zero 8 24)) (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|))) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_1) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|) (fp.gt (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (_ +zero 8 24)))))} __ieee754_atan2f_~iy~0#1 := ~bvand32(2147483647bv32, __ieee754_atan2f_~hy~0#1); {646#(and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_1) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|) (fp.gt (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (_ +zero 8 24)))) (exists ((|ULTIMATE.start___ieee754_atan2f_~hy~0#1| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|))) (= |ULTIMATE.start___ieee754_atan2f_~iy~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|)))))} is VALID [2022-02-20 16:41:08,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {646#(and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_1) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|) (fp.gt (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (_ +zero 8 24)))) (exists ((|ULTIMATE.start___ieee754_atan2f_~hy~0#1| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|))) (= |ULTIMATE.start___ieee754_atan2f_~iy~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|)))))} 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); {613#false} is VALID [2022-02-20 16:41:08,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {613#false} main_#t~ret40#1 := __ieee754_atan2f_#res#1;assume { :end_inline___ieee754_atan2f } true;main_~res~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1; {613#false} is VALID [2022-02-20 16:41:08,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {613#false} assume !~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {613#false} is VALID [2022-02-20 16:41:08,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {613#false} assume !false; {613#false} is VALID [2022-02-20 16:41:08,655 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:08,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:41:08,655 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:41:08,656 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1014992286] [2022-02-20 16:41:08,656 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1014992286] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:41:08,656 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:41:08,656 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 16:41:08,656 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021145355] [2022-02-20 16:41:08,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:41:08,657 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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 13 [2022-02-20 16:41:08,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:41:08,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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:08,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:41:08,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 16:41:08,691 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:41:08,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 16:41:08,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:41:08,692 INFO L87 Difference]: Start difference. First operand 88 states and 127 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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)