./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_0621b.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_0621b.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 f3f9ad21dd7d67bbc4f66ae64c1354ed5030da1a5ccfb05f9849101ef77cea32 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:40:16,554 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:40:16,559 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:40:16,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:40:16,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:40:16,609 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:40:16,610 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:40:16,613 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:40:16,614 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:40:16,620 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:40:16,620 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:40:16,622 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:40:16,622 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:40:16,624 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:40:16,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:40:16,629 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:40:16,630 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:40:16,631 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:40:16,632 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:40:16,635 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:40:16,638 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:40:16,639 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:40:16,641 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:40:16,641 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:40:16,646 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:40:16,646 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:40:16,647 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:40:16,648 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:40:16,649 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:40:16,650 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:40:16,650 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:40:16,651 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:40:16,652 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:40:16,653 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:40:16,654 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:40:16,654 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:40:16,655 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:40:16,655 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:40:16,655 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:40:16,656 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:40:16,656 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:40:16,657 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:16,688 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:40:16,688 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:40:16,688 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:40:16,689 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:40:16,689 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:40:16,690 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:40:16,690 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:40:16,690 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:40:16,690 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:40:16,691 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:40:16,691 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:40:16,692 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:40:16,692 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:40:16,692 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:40:16,692 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:40:16,692 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:40:16,692 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:40:16,693 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:40:16,693 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:40:16,693 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:40:16,693 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:40:16,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:40:16,693 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:40:16,694 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:40:16,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:40:16,694 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:40:16,694 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:40:16,694 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:40:16,695 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:40:16,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:40:16,695 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:40:16,695 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:40:16,695 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:40:16,696 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 -> f3f9ad21dd7d67bbc4f66ae64c1354ed5030da1a5ccfb05f9849101ef77cea32 [2022-02-20 16:40:16,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:40:16,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:40:16,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:40:16,947 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:40:16,948 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:40:16,949 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0621b.c [2022-02-20 16:40:17,012 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0458c051/c4f77e5553924582882537e05bbc73cf/FLAGf5615e15d [2022-02-20 16:40:17,419 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:40:17,419 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0621b.c [2022-02-20 16:40:17,432 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0458c051/c4f77e5553924582882537e05bbc73cf/FLAGf5615e15d [2022-02-20 16:40:17,826 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0458c051/c4f77e5553924582882537e05bbc73cf [2022-02-20 16:40:17,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:40:17,829 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:40:17,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:40:17,833 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:40:17,836 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:40:17,838 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:40:17" (1/1) ... [2022-02-20 16:40:17,840 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@326dc426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:17, skipping insertion in model container [2022-02-20 16:40:17,840 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:40:17" (1/1) ... [2022-02-20 16:40:17,846 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:40:17,877 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:40:18,053 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_0621b.c[3193,3206] [2022-02-20 16:40:18,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:40:18,069 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:40:18,097 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_0621b.c[3193,3206] [2022-02-20 16:40:18,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:40:18,114 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:40:18,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:18 WrapperNode [2022-02-20 16:40:18,115 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:40:18,116 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:40:18,116 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:40:18,116 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:40:18,122 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:18" (1/1) ... [2022-02-20 16:40:18,131 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:18" (1/1) ... [2022-02-20 16:40:18,171 INFO L137 Inliner]: procedures = 19, calls = 60, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 186 [2022-02-20 16:40:18,171 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:40:18,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:40:18,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:40:18,173 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:40:18,180 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:18" (1/1) ... [2022-02-20 16:40:18,181 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:18" (1/1) ... [2022-02-20 16:40:18,184 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:18" (1/1) ... [2022-02-20 16:40:18,184 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:18" (1/1) ... [2022-02-20 16:40:18,195 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:18" (1/1) ... [2022-02-20 16:40:18,199 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:18" (1/1) ... [2022-02-20 16:40:18,200 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:18" (1/1) ... [2022-02-20 16:40:18,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:40:18,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:40:18,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:40:18,204 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:40:18,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:18" (1/1) ... [2022-02-20 16:40:18,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:40:18,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:40:18,252 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:18,258 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:18,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:40:18,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:40:18,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:40:18,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:40:18,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:40:18,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:40:18,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:40:18,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:40:18,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:40:18,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-02-20 16:40:18,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:40:18,359 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:40:18,361 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:40:18,585 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:40:18,591 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:40:18,592 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 16:40:18,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:40:18 BoogieIcfgContainer [2022-02-20 16:40:18,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:40:18,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:40:18,595 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:40:18,598 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:40:18,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:40:17" (1/3) ... [2022-02-20 16:40:18,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350accfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:40:18, skipping insertion in model container [2022-02-20 16:40:18,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:18" (2/3) ... [2022-02-20 16:40:18,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350accfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:40:18, skipping insertion in model container [2022-02-20 16:40:18,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:40:18" (3/3) ... [2022-02-20 16:40:18,601 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0621b.c [2022-02-20 16:40:18,604 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:40:18,605 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:40:18,655 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:40:18,663 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:18,664 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:40:18,690 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 33 states have (on average 1.696969696969697) internal successors, (56), 34 states have internal predecessors, (56), 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:18,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:40:18,694 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:40:18,695 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:40:18,695 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:40:18,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:40:18,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1830079148, now seen corresponding path program 1 times [2022-02-20 16:40:18,715 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:40:18,717 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362204521] [2022-02-20 16:40:18,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:40:18,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:40:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:40:18,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#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);~huge_floor~0 := 1.0E30;~#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; {38#true} is VALID [2022-02-20 16:40:18,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret27#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0);assume { :begin_inline_atan_float } true;atan_float_#in~x#1 := main_~x~0#1;havoc atan_float_#res#1;havoc atan_float_#t~mem6#1, atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset, atan_float_#t~mem8#1, atan_float_#t~mem9#1, atan_float_#t~mem10#1, atan_float_#t~mem11#1, atan_float_#t~ret12#1, atan_float_#t~mem18#1, atan_float_#t~mem17#1, atan_float_#t~mem16#1, atan_float_#t~mem15#1, atan_float_#t~mem14#1, atan_float_#t~mem13#1, atan_float_#t~mem23#1, atan_float_#t~mem22#1, atan_float_#t~mem21#1, atan_float_#t~mem20#1, atan_float_#t~mem19#1, atan_float_#t~mem25#1, atan_float_#t~mem24#1, atan_float_#t~ite26#1, atan_float_~x#1, atan_float_~w~0#1, atan_float_~s1~0#1, atan_float_~s2~0#1, atan_float_~z~0#1, atan_float_~ix~1#1, atan_float_~hx~0#1, atan_float_~id~0#1, atan_float_#t~nondet7#1;atan_float_~x#1 := atan_float_#in~x#1;havoc atan_float_~w~0#1;havoc atan_float_~s1~0#1;havoc atan_float_~s2~0#1;havoc atan_float_~z~0#1;havoc atan_float_~ix~1#1;havoc atan_float_~hx~0#1;havoc atan_float_~id~0#1; {38#true} is VALID [2022-02-20 16:40:18,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} assume !true; {39#false} is VALID [2022-02-20 16:40:18,860 INFO L290 TraceCheckUtils]: 3: Hoare triple {39#false} assume 0 == atan_float_~hx~0#1;atan_float_~ix~1#1 := 0; {39#false} is VALID [2022-02-20 16:40:18,860 INFO L290 TraceCheckUtils]: 4: Hoare triple {39#false} assume atan_float_~ix~1#1 >= 1350565888; {39#false} is VALID [2022-02-20 16:40:18,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#false} assume atan_float_~ix~1#1 > 2139095040;atan_float_#res#1 := ~someBinaryArithmeticFLOAToperation(atan_float_~x#1, atan_float_~x#1); {39#false} is VALID [2022-02-20 16:40:18,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {39#false} main_#t~ret27#1 := atan_float_#res#1;assume { :end_inline_atan_float } true;main_~res~0#1 := main_#t~ret27#1;havoc main_#t~ret27#1; {39#false} is VALID [2022-02-20 16:40:18,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#false} assume ~someBinaryFLOATComparisonOperation(main_~res~0#1, ~someUnaryFLOAToperation(~pi_o_2~0)); {39#false} is VALID [2022-02-20 16:40:18,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-02-20 16:40:18,863 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:18,863 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:40:18,865 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362204521] [2022-02-20 16:40:18,865 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362204521] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:40:18,865 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:40:18,866 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:40:18,869 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223673307] [2022-02-20 16:40:18,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:40:18,874 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-02-20 16:40:18,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:40:18,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:18,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:40:18,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:40:18,906 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:40:18,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:40:18,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:40:18,953 INFO L87 Difference]: Start difference. First operand has 35 states, 33 states have (on average 1.696969696969697) internal successors, (56), 34 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:19,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:19,029 INFO L93 Difference]: Finished difference Result 68 states and 110 transitions. [2022-02-20 16:40:19,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:40:19,030 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-02-20 16:40:19,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:40:19,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:19,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 110 transitions. [2022-02-20 16:40:19,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:19,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 110 transitions. [2022-02-20 16:40:19,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 110 transitions. [2022-02-20 16:40:19,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:40:19,199 INFO L225 Difference]: With dead ends: 68 [2022-02-20 16:40:19,199 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 16:40:19,202 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:19,205 INFO L933 BasicCegarLoop]: 47 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, 47 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:19,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 47 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:19,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 16:40:19,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-02-20 16:40:19,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:40:19,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 31 states have internal predecessors, (44), 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:19,238 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 31 states have internal predecessors, (44), 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:19,239 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 31 states have internal predecessors, (44), 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:19,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:19,242 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2022-02-20 16:40:19,242 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2022-02-20 16:40:19,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:40:19,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:40:19,243 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 31 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 32 states. [2022-02-20 16:40:19,244 INFO L87 Difference]: Start difference. First operand has 32 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 31 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 32 states. [2022-02-20 16:40:19,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:19,246 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2022-02-20 16:40:19,247 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2022-02-20 16:40:19,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:40:19,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:40:19,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:40:19,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:40:19,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 31 states have internal predecessors, (44), 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:19,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2022-02-20 16:40:19,251 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 9 [2022-02-20 16:40:19,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:40:19,251 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. [2022-02-20 16:40:19,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:19,252 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2022-02-20 16:40:19,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:40:19,252 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:40:19,253 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:40:19,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:40:19,253 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:40:19,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:40:19,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1558271665, now seen corresponding path program 1 times [2022-02-20 16:40:19,254 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:40:19,254 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933482099] [2022-02-20 16:40:19,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:40:19,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:40:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:40:19,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {220#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);~huge_floor~0 := 1.0E30;~#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; {220#true} is VALID [2022-02-20 16:40:19,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {220#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret27#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0);assume { :begin_inline_atan_float } true;atan_float_#in~x#1 := main_~x~0#1;havoc atan_float_#res#1;havoc atan_float_#t~mem6#1, atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset, atan_float_#t~mem8#1, atan_float_#t~mem9#1, atan_float_#t~mem10#1, atan_float_#t~mem11#1, atan_float_#t~ret12#1, atan_float_#t~mem18#1, atan_float_#t~mem17#1, atan_float_#t~mem16#1, atan_float_#t~mem15#1, atan_float_#t~mem14#1, atan_float_#t~mem13#1, atan_float_#t~mem23#1, atan_float_#t~mem22#1, atan_float_#t~mem21#1, atan_float_#t~mem20#1, atan_float_#t~mem19#1, atan_float_#t~mem25#1, atan_float_#t~mem24#1, atan_float_#t~ite26#1, atan_float_~x#1, atan_float_~w~0#1, atan_float_~s1~0#1, atan_float_~s2~0#1, atan_float_~z~0#1, atan_float_~ix~1#1, atan_float_~hx~0#1, atan_float_~id~0#1, atan_float_#t~nondet7#1;atan_float_~x#1 := atan_float_#in~x#1;havoc atan_float_~w~0#1;havoc atan_float_~s1~0#1;havoc atan_float_~s2~0#1;havoc atan_float_~z~0#1;havoc atan_float_~ix~1#1;havoc atan_float_~hx~0#1;havoc atan_float_~id~0#1; {220#true} is VALID [2022-02-20 16:40:19,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {220#true} call atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4);call write~real(atan_float_~x#1, atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset, 4);call atan_float_#t~mem6#1 := read~int(atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset, 4);atan_float_~hx~0#1 := (if atan_float_#t~mem6#1 % 4294967296 % 4294967296 <= 2147483647 then atan_float_#t~mem6#1 % 4294967296 % 4294967296 else atan_float_#t~mem6#1 % 4294967296 % 4294967296 - 4294967296);havoc atan_float_#t~mem6#1;call ULTIMATE.dealloc(atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset);havoc atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset; {220#true} is VALID [2022-02-20 16:40:19,352 INFO L290 TraceCheckUtils]: 3: Hoare triple {220#true} goto; {220#true} is VALID [2022-02-20 16:40:19,353 INFO L290 TraceCheckUtils]: 4: Hoare triple {220#true} assume 0 == atan_float_~hx~0#1;atan_float_~ix~1#1 := 0; {222#(= |ULTIMATE.start_atan_float_~ix~1#1| 0)} is VALID [2022-02-20 16:40:19,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {222#(= |ULTIMATE.start_atan_float_~ix~1#1| 0)} assume atan_float_~ix~1#1 >= 1350565888; {221#false} is VALID [2022-02-20 16:40:19,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {221#false} assume atan_float_~ix~1#1 > 2139095040;atan_float_#res#1 := ~someBinaryArithmeticFLOAToperation(atan_float_~x#1, atan_float_~x#1); {221#false} is VALID [2022-02-20 16:40:19,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {221#false} main_#t~ret27#1 := atan_float_#res#1;assume { :end_inline_atan_float } true;main_~res~0#1 := main_#t~ret27#1;havoc main_#t~ret27#1; {221#false} is VALID [2022-02-20 16:40:19,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {221#false} assume ~someBinaryFLOATComparisonOperation(main_~res~0#1, ~someUnaryFLOAToperation(~pi_o_2~0)); {221#false} is VALID [2022-02-20 16:40:19,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {221#false} assume !false; {221#false} is VALID [2022-02-20 16:40:19,354 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:19,354 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:40:19,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933482099] [2022-02-20 16:40:19,355 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933482099] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:40:19,355 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:40:19,355 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:40:19,355 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474788790] [2022-02-20 16:40:19,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:40:19,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2022-02-20 16:40:19,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:40:19,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:19,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:40:19,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:40:19,368 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:40:19,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:40:19,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:40:19,369 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:19,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:19,464 INFO L93 Difference]: Finished difference Result 65 states and 88 transitions. [2022-02-20 16:40:19,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:40:19,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2022-02-20 16:40:19,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:40:19,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:19,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-02-20 16:40:19,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:19,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-02-20 16:40:19,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2022-02-20 16:40:19,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:40:19,543 INFO L225 Difference]: With dead ends: 65 [2022-02-20 16:40:19,543 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 16:40:19,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:40:19,551 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 15 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:40:19,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 67 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:40:19,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 16:40:19,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2022-02-20 16:40:19,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:40:19,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 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:19,561 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 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:19,562 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 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:19,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:19,564 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2022-02-20 16:40:19,564 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2022-02-20 16:40:19,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:40:19,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:40:19,565 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 45 states. [2022-02-20 16:40:19,565 INFO L87 Difference]: Start difference. First operand has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 45 states. [2022-02-20 16:40:19,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:19,568 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2022-02-20 16:40:19,568 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2022-02-20 16:40:19,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:40:19,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:40:19,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:40:19,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:40:19,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 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:19,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2022-02-20 16:40:19,571 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 47 transitions. Word has length 10 [2022-02-20 16:40:19,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:40:19,571 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 47 transitions. [2022-02-20 16:40:19,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:19,572 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-02-20 16:40:19,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:40:19,572 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:40:19,573 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:40:19,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:40:19,573 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:40:19,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:40:19,574 INFO L85 PathProgramCache]: Analyzing trace with hash 893364878, now seen corresponding path program 1 times [2022-02-20 16:40:19,574 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:40:19,574 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269185522] [2022-02-20 16:40:19,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:40:19,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:40:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:40:19,627 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:40:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:40:19,674 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:40:19,675 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:40:19,676 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:40:19,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:40:19,681 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:40:19,683 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:40:19,739 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:40:19,739 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:40:19,739 WARN L170 areAnnotationChecker]: L62-2 has no Hoare annotation [2022-02-20 16:40:19,739 WARN L170 areAnnotationChecker]: L62-2 has no Hoare annotation [2022-02-20 16:40:19,739 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-02-20 16:40:19,740 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-02-20 16:40:19,740 WARN L170 areAnnotationChecker]: L62-3 has no Hoare annotation [2022-02-20 16:40:19,741 WARN L170 areAnnotationChecker]: L62-3 has no Hoare annotation [2022-02-20 16:40:19,741 WARN L170 areAnnotationChecker]: L67-7 has no Hoare annotation [2022-02-20 16:40:19,741 WARN L170 areAnnotationChecker]: L67-7 has no Hoare annotation [2022-02-20 16:40:19,741 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:40:19,741 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:40:19,741 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:40:19,741 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:40:19,742 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2022-02-20 16:40:19,742 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2022-02-20 16:40:19,742 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2022-02-20 16:40:19,742 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2022-02-20 16:40:19,742 WARN L170 areAnnotationChecker]: L118-3 has no Hoare annotation [2022-02-20 16:40:19,742 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-02-20 16:40:19,743 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-02-20 16:40:19,743 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2022-02-20 16:40:19,743 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2022-02-20 16:40:19,743 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-02-20 16:40:19,743 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-02-20 16:40:19,743 WARN L170 areAnnotationChecker]: L67-5 has no Hoare annotation [2022-02-20 16:40:19,744 WARN L170 areAnnotationChecker]: L67-5 has no Hoare annotation [2022-02-20 16:40:19,744 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-02-20 16:40:19,744 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-02-20 16:40:19,745 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:40:19,747 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:40:19,748 WARN L170 areAnnotationChecker]: L77-2 has no Hoare annotation [2022-02-20 16:40:19,748 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:40:19,748 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:40:19,748 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-20 16:40:19,748 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-20 16:40:19,748 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2022-02-20 16:40:19,748 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2022-02-20 16:40:19,748 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-02-20 16:40:19,748 WARN L170 areAnnotationChecker]: L93-2 has no Hoare annotation [2022-02-20 16:40:19,748 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:40:19,748 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:40:19,748 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2022-02-20 16:40:19,748 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:40:19,748 WARN L170 areAnnotationChecker]: L114 has no Hoare annotation [2022-02-20 16:40:19,748 WARN L170 areAnnotationChecker]: L114 has no Hoare annotation [2022-02-20 16:40:19,749 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 16:40:19,749 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2022-02-20 16:40:19,749 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2022-02-20 16:40:19,749 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-02-20 16:40:19,749 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-02-20 16:40:19,749 WARN L170 areAnnotationChecker]: L118-2 has no Hoare annotation [2022-02-20 16:40:19,749 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2022-02-20 16:40:19,749 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2022-02-20 16:40:19,749 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2022-02-20 16:40:19,749 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2022-02-20 16:40:19,749 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:19,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:40:19 BoogieIcfgContainer [2022-02-20 16:40:19,750 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:40:19,750 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:40:19,750 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:40:19,750 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:40:19,751 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:18" (3/4) ... [2022-02-20 16:40:19,753 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:40:19,754 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:40:19,755 INFO L158 Benchmark]: Toolchain (without parser) took 1925.10ms. Allocated memory was 90.2MB in the beginning and 115.3MB in the end (delta: 25.2MB). Free memory was 56.0MB in the beginning and 49.3MB in the end (delta: 6.6MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. [2022-02-20 16:40:19,755 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 90.2MB. Free memory was 60.0MB in the beginning and 59.9MB in the end (delta: 21.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:40:19,755 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.88ms. Allocated memory was 90.2MB in the beginning and 115.3MB in the end (delta: 25.2MB). Free memory was 56.0MB in the beginning and 87.7MB in the end (delta: -31.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:40:19,756 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.93ms. Allocated memory is still 115.3MB. Free memory was 87.7MB in the beginning and 84.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:40:19,756 INFO L158 Benchmark]: Boogie Preprocessor took 30.98ms. Allocated memory is still 115.3MB. Free memory was 84.9MB in the beginning and 82.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:40:19,756 INFO L158 Benchmark]: RCFGBuilder took 389.71ms. Allocated memory is still 115.3MB. Free memory was 82.8MB in the beginning and 66.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-20 16:40:19,757 INFO L158 Benchmark]: TraceAbstraction took 1154.62ms. Allocated memory is still 115.3MB. Free memory was 65.3MB in the beginning and 50.0MB in the end (delta: 15.2MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2022-02-20 16:40:19,757 INFO L158 Benchmark]: Witness Printer took 3.43ms. Allocated memory is still 115.3MB. Free memory was 50.0MB in the beginning and 49.3MB in the end (delta: 716.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:40:19,759 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.16ms. Allocated memory is still 90.2MB. Free memory was 60.0MB in the beginning and 59.9MB in the end (delta: 21.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.88ms. Allocated memory was 90.2MB in the beginning and 115.3MB in the end (delta: 25.2MB). Free memory was 56.0MB in the beginning and 87.7MB in the end (delta: -31.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.93ms. Allocated memory is still 115.3MB. Free memory was 87.7MB in the beginning and 84.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.98ms. Allocated memory is still 115.3MB. Free memory was 84.9MB in the beginning and 82.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 389.71ms. Allocated memory is still 115.3MB. Free memory was 82.8MB in the beginning and 66.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1154.62ms. Allocated memory is still 115.3MB. Free memory was 65.3MB in the beginning and 50.0MB in the end (delta: 15.2MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * Witness Printer took 3.43ms. Allocated memory is still 115.3MB. Free memory was 50.0MB in the beginning and 49.3MB in the end (delta: 716.0kB). Peak memory consumption was 2.1MB. 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: 132]: 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 131, overapproximation of someUnaryDOUBLEoperation at line 49, overapproximation of someBinaryArithmeticFLOAToperation at line 128. Possible FailurePath: [L14] static const float huge_floor = 1.0e30; [L34-L39] static const float atanhi_atan[] = { 4.6364760399e-01, 7.8539812565e-01, 9.8279368877e-01, 1.5707962513e+00, }; [L41-L46] static const float atanlo_atan[] = { 5.0121582440e-09, 3.7748947079e-08, 3.4473217170e-08, 7.5497894159e-08, }; [L48-L52] 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, }; [L54-L56] 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; VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000] [L128] float x = -1.0f / 0.0f; [L129] CALL, EXPR atan_float(x) [L59] float w, s1, s2, z; [L60] __int32_t ix, hx, id; VAL [\old(x)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, x=1000000000000000000000000000001] [L63] ieee_float_shape_type gf_u; [L64] gf_u.value = (x) [L65] EXPR gf_u.word [L65] (hx) = gf_u.word [L67] ix = hx & 0x7fffffff VAL [\old(x)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, x=1000000000000000000000000000001] [L68] COND FALSE !(ix >= 0x50800000) VAL [\old(x)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, x=1000000000000000000000000000001] [L76] COND TRUE ix < 0x3ee00000 VAL [\old(x)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, x=1000000000000000000000000000001] [L77] COND TRUE ix < 0x31000000 VAL [\old(x)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, x=1000000000000000000000000000001] [L78] COND TRUE huge_atan + x > one_atan [L79] return x; VAL [\old(x)=1000000000000000000000000000001, \result=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, x=1000000000000000000000000000001] [L129] RET, EXPR atan_float(x) [L129] float res = atan_float(x); [L131] COND TRUE res != -pi_o_2 VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=1000000000000000000000000000001, x=1000000000000000000000000000001] [L132] reach_error() VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=1000000000000000000000000000001, x=1000000000000000000000000000001] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 114 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 88 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 19 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:19,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_0621b.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 f3f9ad21dd7d67bbc4f66ae64c1354ed5030da1a5ccfb05f9849101ef77cea32 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:40:21,691 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:40:21,694 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:40:21,739 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:40:21,740 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:40:21,743 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:40:21,744 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:40:21,749 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:40:21,751 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:40:21,755 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:40:21,756 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:40:21,760 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:40:21,760 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:40:21,762 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:40:21,763 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:40:21,766 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:40:21,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:40:21,767 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:40:21,769 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:40:21,774 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:40:21,776 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:40:21,777 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:40:21,777 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:40:21,779 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:40:21,785 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:40:21,785 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:40:21,785 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:40:21,787 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:40:21,787 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:40:21,788 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:40:21,788 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:40:21,789 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:40:21,790 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:40:21,791 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:40:21,792 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:40:21,792 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:40:21,793 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:40:21,793 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:40:21,793 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:40:21,795 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:40:21,795 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:40:21,799 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:21,833 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:40:21,834 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:40:21,834 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:40:21,835 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:40:21,836 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:40:21,836 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:40:21,837 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:40:21,837 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:40:21,838 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:40:21,838 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:40:21,839 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:40:21,839 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:40:21,839 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:40:21,839 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:40:21,839 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:40:21,840 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:40:21,840 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:40:21,840 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:40:21,840 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:40:21,840 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:40:21,841 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:40:21,841 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:40:21,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:40:21,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:40:21,842 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:40:21,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:40:21,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:40:21,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:40:21,842 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:40:21,843 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:40:21,843 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:40:21,843 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:40:21,843 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:40:21,844 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:40:21,844 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:40:21,844 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:40:21,844 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 -> f3f9ad21dd7d67bbc4f66ae64c1354ed5030da1a5ccfb05f9849101ef77cea32 [2022-02-20 16:40:22,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:40:22,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:40:22,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:40:22,206 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:40:22,206 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:40:22,207 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0621b.c [2022-02-20 16:40:22,269 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/469828d04/a6b94725ff304d99ba4af323d731e8f9/FLAG141b76ea1 [2022-02-20 16:40:22,701 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:40:22,701 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0621b.c [2022-02-20 16:40:22,707 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/469828d04/a6b94725ff304d99ba4af323d731e8f9/FLAG141b76ea1 [2022-02-20 16:40:23,110 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/469828d04/a6b94725ff304d99ba4af323d731e8f9 [2022-02-20 16:40:23,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:40:23,113 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:40:23,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:40:23,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:40:23,119 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:40:23,120 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:40:23" (1/1) ... [2022-02-20 16:40:23,121 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e61a1ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:23, skipping insertion in model container [2022-02-20 16:40:23,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:40:23" (1/1) ... [2022-02-20 16:40:23,128 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:40:23,155 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:40:23,293 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_0621b.c[3193,3206] [2022-02-20 16:40:23,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:40:23,309 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:40:23,343 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_0621b.c[3193,3206] [2022-02-20 16:40:23,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:40:23,363 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:40:23,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:23 WrapperNode [2022-02-20 16:40:23,364 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:40:23,365 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:40:23,365 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:40:23,366 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:40:23,372 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:23" (1/1) ... [2022-02-20 16:40:23,383 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:23" (1/1) ... [2022-02-20 16:40:23,421 INFO L137 Inliner]: procedures = 22, calls = 60, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 175 [2022-02-20 16:40:23,421 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:40:23,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:40:23,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:40:23,423 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:40:23,430 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:23" (1/1) ... [2022-02-20 16:40:23,430 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:23" (1/1) ... [2022-02-20 16:40:23,436 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:23" (1/1) ... [2022-02-20 16:40:23,436 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:23" (1/1) ... [2022-02-20 16:40:23,449 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:23" (1/1) ... [2022-02-20 16:40:23,453 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:23" (1/1) ... [2022-02-20 16:40:23,456 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:23" (1/1) ... [2022-02-20 16:40:23,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:40:23,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:40:23,475 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:40:23,475 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:40:23,476 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:23" (1/1) ... [2022-02-20 16:40:23,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:40:23,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:40:23,506 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:23,509 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:23,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:40:23,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-02-20 16:40:23,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:40:23,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:40:23,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:40:23,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:40:23,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:40:23,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:40:23,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:40:23,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:40:23,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:40:23,636 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:40:23,637 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:40:35,219 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:40:35,224 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:40:35,225 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 16:40:35,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:40:35 BoogieIcfgContainer [2022-02-20 16:40:35,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:40:35,228 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:40:35,228 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:40:35,230 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:40:35,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:40:23" (1/3) ... [2022-02-20 16:40:35,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@120e929e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:40:35, skipping insertion in model container [2022-02-20 16:40:35,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:23" (2/3) ... [2022-02-20 16:40:35,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@120e929e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:40:35, skipping insertion in model container [2022-02-20 16:40:35,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:40:35" (3/3) ... [2022-02-20 16:40:35,232 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0621b.c [2022-02-20 16:40:35,237 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:40:35,237 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:40:35,282 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:40:35,289 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:35,290 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:40:35,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 31 states have internal predecessors, (49), 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:35,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:40:35,308 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:40:35,308 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:40:35,309 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:40:35,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:40:35,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1906423550, now seen corresponding path program 1 times [2022-02-20 16:40:35,331 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:40:35,333 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096961092] [2022-02-20 16:40:35,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:40:35,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:40:35,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:40:35,339 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:35,382 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:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:40:36,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:40:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:40:36,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:40:36,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#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);~huge_floor~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30));~#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)); {35#true} is VALID [2022-02-20 16:40:36,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret26#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());assume { :begin_inline_atan_float } true;atan_float_#in~x#1 := main_~x~0#1;havoc atan_float_#res#1;havoc atan_float_#t~mem6#1, atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset, atan_float_#t~mem7#1, atan_float_#t~mem8#1, atan_float_#t~mem9#1, atan_float_#t~mem10#1, atan_float_#t~ret11#1, atan_float_#t~mem17#1, atan_float_#t~mem16#1, atan_float_#t~mem15#1, atan_float_#t~mem14#1, atan_float_#t~mem13#1, atan_float_#t~mem12#1, atan_float_#t~mem22#1, atan_float_#t~mem21#1, atan_float_#t~mem20#1, atan_float_#t~mem19#1, atan_float_#t~mem18#1, atan_float_#t~mem24#1, atan_float_#t~mem23#1, atan_float_#t~ite25#1, atan_float_~x#1, atan_float_~w~0#1, atan_float_~s1~0#1, atan_float_~s2~0#1, atan_float_~z~0#1, atan_float_~ix~1#1, atan_float_~hx~0#1, atan_float_~id~0#1;atan_float_~x#1 := atan_float_#in~x#1;havoc atan_float_~w~0#1;havoc atan_float_~s1~0#1;havoc atan_float_~s2~0#1;havoc atan_float_~z~0#1;havoc atan_float_~ix~1#1;havoc atan_float_~hx~0#1;havoc atan_float_~id~0#1; {35#true} is VALID [2022-02-20 16:40:36,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume !true; {36#false} is VALID [2022-02-20 16:40:36,314 INFO L290 TraceCheckUtils]: 3: Hoare triple {36#false} atan_float_~ix~1#1 := ~bvand32(2147483647bv32, atan_float_~hx~0#1); {36#false} is VALID [2022-02-20 16:40:36,314 INFO L290 TraceCheckUtils]: 4: Hoare triple {36#false} assume ~bvsge32(atan_float_~ix~1#1, 1350565888bv32); {36#false} is VALID [2022-02-20 16:40:36,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#false} assume ~bvsgt32(atan_float_~ix~1#1, 2139095040bv32);atan_float_#res#1 := ~fp.add~FLOAT(currentRoundingMode, atan_float_~x#1, atan_float_~x#1); {36#false} is VALID [2022-02-20 16:40:36,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {36#false} main_#t~ret26#1 := atan_float_#res#1;assume { :end_inline_atan_float } true;main_~res~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; {36#false} is VALID [2022-02-20 16:40:36,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#false} assume !~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~pi_o_2~0)); {36#false} is VALID [2022-02-20 16:40:36,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-02-20 16:40:36,317 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:36,317 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:40:36,318 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:40:36,318 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1096961092] [2022-02-20 16:40:36,318 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1096961092] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:40:36,319 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:40:36,319 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:40:36,321 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698632319] [2022-02-20 16:40:36,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:40:36,325 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-02-20 16:40:36,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:40:36,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:36,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:40:36,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:40:36,364 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:40:36,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:40:36,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:40:36,389 INFO L87 Difference]: Start difference. First operand has 32 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 31 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:48,041 INFO L93 Difference]: Finished difference Result 62 states and 96 transitions. [2022-02-20 16:40:48,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:40:48,041 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-02-20 16:40:48,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:40:48,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 96 transitions. [2022-02-20 16:40:48,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 96 transitions. [2022-02-20 16:40:48,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 96 transitions. [2022-02-20 16:40:50,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:40:50,768 INFO L225 Difference]: With dead ends: 62 [2022-02-20 16:40:50,768 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 16:40:50,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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:50,774 INFO L933 BasicCegarLoop]: 42 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, 42 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:50,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 42 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:50,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 16:40:50,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-20 16:40:50,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:40:50,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 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:50,795 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 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:50,795 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 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:50,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:50,798 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2022-02-20 16:40:50,798 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2022-02-20 16:40:50,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:40:50,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:40:50,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 29 states. [2022-02-20 16:40:50,800 INFO L87 Difference]: Start difference. First operand has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 29 states. [2022-02-20 16:40:50,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:50,803 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2022-02-20 16:40:50,803 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2022-02-20 16:40:50,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:40:50,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:40:50,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:40:50,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:40:50,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 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:50,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2022-02-20 16:40:50,807 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 9 [2022-02-20 16:40:50,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:40:50,808 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2022-02-20 16:40:50,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:50,808 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2022-02-20 16:40:50,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:40:50,809 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:40:50,809 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:40:50,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 16:40:51,023 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:40:51,024 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:40:51,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:40:51,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1481927263, now seen corresponding path program 1 times [2022-02-20 16:40:51,025 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:40:51,025 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552142041] [2022-02-20 16:40:51,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:40:51,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:40:51,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:40:51,029 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:40:51,030 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:40:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:40:51,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:40:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:40:51,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:40:52,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {226#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);~huge_floor~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30));~#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)); {226#true} is VALID [2022-02-20 16:40:52,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {226#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret26#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());assume { :begin_inline_atan_float } true;atan_float_#in~x#1 := main_~x~0#1;havoc atan_float_#res#1;havoc atan_float_#t~mem6#1, atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset, atan_float_#t~mem7#1, atan_float_#t~mem8#1, atan_float_#t~mem9#1, atan_float_#t~mem10#1, atan_float_#t~ret11#1, atan_float_#t~mem17#1, atan_float_#t~mem16#1, atan_float_#t~mem15#1, atan_float_#t~mem14#1, atan_float_#t~mem13#1, atan_float_#t~mem12#1, atan_float_#t~mem22#1, atan_float_#t~mem21#1, atan_float_#t~mem20#1, atan_float_#t~mem19#1, atan_float_#t~mem18#1, atan_float_#t~mem24#1, atan_float_#t~mem23#1, atan_float_#t~ite25#1, atan_float_~x#1, atan_float_~w~0#1, atan_float_~s1~0#1, atan_float_~s2~0#1, atan_float_~z~0#1, atan_float_~ix~1#1, atan_float_~hx~0#1, atan_float_~id~0#1;atan_float_~x#1 := atan_float_#in~x#1;havoc atan_float_~w~0#1;havoc atan_float_~s1~0#1;havoc atan_float_~s2~0#1;havoc atan_float_~z~0#1;havoc atan_float_~ix~1#1;havoc atan_float_~hx~0#1;havoc atan_float_~id~0#1; {234#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_atan_float_~x#1|))} is VALID [2022-02-20 16:40:52,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_atan_float_~x#1|))} call atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(atan_float_~x#1, atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset, 4bv32);call atan_float_#t~mem6#1 := read~intINTTYPE4(atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset, 4bv32);atan_float_~hx~0#1 := atan_float_#t~mem6#1;havoc atan_float_#t~mem6#1;call ULTIMATE.dealloc(atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset);havoc atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset; {238#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_atan_float_~hx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} is VALID [2022-02-20 16:40:52,346 INFO L290 TraceCheckUtils]: 3: Hoare triple {238#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_atan_float_~hx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} goto; {238#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_atan_float_~hx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} is VALID [2022-02-20 16:40:52,348 INFO L290 TraceCheckUtils]: 4: Hoare triple {238#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_atan_float_~hx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} atan_float_~ix~1#1 := ~bvand32(2147483647bv32, atan_float_~hx~0#1); {245#(exists ((|ULTIMATE.start_atan_float_~hx~0#1| (_ BitVec 32))) (and (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_atan_float_~hx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))) (= |ULTIMATE.start_atan_float_~ix~1#1| (bvand (_ bv2147483647 32) |ULTIMATE.start_atan_float_~hx~0#1|))))} is VALID [2022-02-20 16:40:52,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {245#(exists ((|ULTIMATE.start_atan_float_~hx~0#1| (_ BitVec 32))) (and (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_atan_float_~hx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))) (= |ULTIMATE.start_atan_float_~ix~1#1| (bvand (_ bv2147483647 32) |ULTIMATE.start_atan_float_~hx~0#1|))))} assume ~bvsge32(atan_float_~ix~1#1, 1350565888bv32); {245#(exists ((|ULTIMATE.start_atan_float_~hx~0#1| (_ BitVec 32))) (and (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_atan_float_~hx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))) (= |ULTIMATE.start_atan_float_~ix~1#1| (bvand (_ bv2147483647 32) |ULTIMATE.start_atan_float_~hx~0#1|))))} is VALID [2022-02-20 16:40:52,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {245#(exists ((|ULTIMATE.start_atan_float_~hx~0#1| (_ BitVec 32))) (and (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_atan_float_~hx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))) (= |ULTIMATE.start_atan_float_~ix~1#1| (bvand (_ bv2147483647 32) |ULTIMATE.start_atan_float_~hx~0#1|))))} assume ~bvsgt32(atan_float_~ix~1#1, 2139095040bv32);atan_float_#res#1 := ~fp.add~FLOAT(currentRoundingMode, atan_float_~x#1, atan_float_~x#1); {227#false} is VALID [2022-02-20 16:40:52,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {227#false} main_#t~ret26#1 := atan_float_#res#1;assume { :end_inline_atan_float } true;main_~res~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; {227#false} is VALID [2022-02-20 16:40:52,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {227#false} assume !~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~pi_o_2~0)); {227#false} is VALID [2022-02-20 16:40:52,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {227#false} assume !false; {227#false} is VALID [2022-02-20 16:40:52,368 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:52,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:40:52,369 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:40:52,369 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552142041] [2022-02-20 16:40:52,369 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1552142041] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:40:52,369 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:40:52,369 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:40:52,369 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886414679] [2022-02-20 16:40:52,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:40:52,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2022-02-20 16:40:52,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:40:52,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:52,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:40:52,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:40:52,414 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:40:52,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:40:52,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:40:52,415 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:21,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:41:21,769 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-02-20 16:41:21,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:41:21,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2022-02-20 16:41:21,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:41:21,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:21,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-02-20 16:41:21,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:21,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-02-20 16:41:21,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2022-02-20 16:41:23,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:41:23,227 INFO L225 Difference]: With dead ends: 33 [2022-02-20 16:41:23,227 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 16:41:23,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:41:23,235 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:41:23,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 32 Unchecked, 0.0s Time] [2022-02-20 16:41:23,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 16:41:23,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-20 16:41:23,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:41:23,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 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:23,241 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 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:23,241 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 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:23,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:41:23,243 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-02-20 16:41:23,243 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-02-20 16:41:23,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:41:23,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:41:23,244 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 29 states. [2022-02-20 16:41:23,244 INFO L87 Difference]: Start difference. First operand has 29 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 29 states. [2022-02-20 16:41:23,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:41:23,246 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-02-20 16:41:23,247 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-02-20 16:41:23,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:41:23,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:41:23,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:41:23,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:41:23,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 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:23,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2022-02-20 16:41:23,250 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 10 [2022-02-20 16:41:23,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:41:23,250 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2022-02-20 16:41:23,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:23,250 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-02-20 16:41:23,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:41:23,251 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:41:23,251 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:41:23,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:41:23,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:41:23,456 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:41:23,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:41:23,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1305404355, now seen corresponding path program 1 times [2022-02-20 16:41:23,457 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:41:23,457 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582126731] [2022-02-20 16:41:23,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:41:23,458 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:41:23,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:41:23,459 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:41:23,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:41:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:41:24,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 16:41:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:41:24,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:41:24,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {389#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);~huge_floor~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30));~#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)); {389#true} is VALID [2022-02-20 16:41:24,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {389#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret26#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());assume { :begin_inline_atan_float } true;atan_float_#in~x#1 := main_~x~0#1;havoc atan_float_#res#1;havoc atan_float_#t~mem6#1, atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset, atan_float_#t~mem7#1, atan_float_#t~mem8#1, atan_float_#t~mem9#1, atan_float_#t~mem10#1, atan_float_#t~ret11#1, atan_float_#t~mem17#1, atan_float_#t~mem16#1, atan_float_#t~mem15#1, atan_float_#t~mem14#1, atan_float_#t~mem13#1, atan_float_#t~mem12#1, atan_float_#t~mem22#1, atan_float_#t~mem21#1, atan_float_#t~mem20#1, atan_float_#t~mem19#1, atan_float_#t~mem18#1, atan_float_#t~mem24#1, atan_float_#t~mem23#1, atan_float_#t~ite25#1, atan_float_~x#1, atan_float_~w~0#1, atan_float_~s1~0#1, atan_float_~s2~0#1, atan_float_~z~0#1, atan_float_~ix~1#1, atan_float_~hx~0#1, atan_float_~id~0#1;atan_float_~x#1 := atan_float_#in~x#1;havoc atan_float_~w~0#1;havoc atan_float_~s1~0#1;havoc atan_float_~s2~0#1;havoc atan_float_~z~0#1;havoc atan_float_~ix~1#1;havoc atan_float_~hx~0#1;havoc atan_float_~id~0#1; {397#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_atan_float_~x#1|))} is VALID [2022-02-20 16:41:24,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {397#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_atan_float_~x#1|))} call atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(atan_float_~x#1, atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset, 4bv32);call atan_float_#t~mem6#1 := read~intINTTYPE4(atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset, 4bv32);atan_float_~hx~0#1 := atan_float_#t~mem6#1;havoc atan_float_#t~mem6#1;call ULTIMATE.dealloc(atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset);havoc atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset; {401#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_atan_float_~hx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} is VALID [2022-02-20 16:41:24,551 INFO L290 TraceCheckUtils]: 3: Hoare triple {401#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_atan_float_~hx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} goto; {401#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_atan_float_~hx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} is VALID [2022-02-20 16:41:24,553 INFO L290 TraceCheckUtils]: 4: Hoare triple {401#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_atan_float_~hx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} atan_float_~ix~1#1 := ~bvand32(2147483647bv32, atan_float_~hx~0#1); {401#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_atan_float_~hx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} is VALID [2022-02-20 16:41:24,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {401#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_atan_float_~hx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} assume ~bvsge32(atan_float_~ix~1#1, 1350565888bv32); {401#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_atan_float_~hx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} is VALID [2022-02-20 16:41:24,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {401#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_atan_float_~hx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} assume !~bvsgt32(atan_float_~ix~1#1, 2139095040bv32); {401#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_atan_float_~hx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} is VALID [2022-02-20 16:41:24,574 INFO L290 TraceCheckUtils]: 7: Hoare triple {401#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_atan_float_~hx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} assume ~bvsgt32(atan_float_~hx~0#1, 0bv32);call atan_float_#t~mem7#1 := read~intFLOATTYPE4(~#atanhi_atan~0.base, ~bvadd32(12bv32, ~#atanhi_atan~0.offset), 4bv32);call atan_float_#t~mem8#1 := read~intFLOATTYPE4(~#atanlo_atan~0.base, ~bvadd32(12bv32, ~#atanlo_atan~0.offset), 4bv32);atan_float_#res#1 := ~fp.add~FLOAT(currentRoundingMode, atan_float_#t~mem7#1, atan_float_#t~mem8#1);havoc atan_float_#t~mem7#1;havoc atan_float_#t~mem8#1; {390#false} is VALID [2022-02-20 16:41:24,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {390#false} main_#t~ret26#1 := atan_float_#res#1;assume { :end_inline_atan_float } true;main_~res~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; {390#false} is VALID [2022-02-20 16:41:24,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {390#false} assume !~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~pi_o_2~0)); {390#false} is VALID [2022-02-20 16:41:24,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {390#false} assume !false; {390#false} is VALID [2022-02-20 16:41:24,575 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:24,575 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:41:24,575 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:41:24,576 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582126731] [2022-02-20 16:41:24,576 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582126731] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:41:24,576 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:41:24,576 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:41:24,576 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428867608] [2022-02-20 16:41:24,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:41:24,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:24,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:41:24,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:24,626 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:41:24,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:41:24,627 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:41:24,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:41:24,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:41:24,628 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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)